A contextual framework for learning routing experiences in last-mile delivery
Author
Abstract
Suggested Citation
DOI: 10.1016/j.trb.2025.103172
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Tiniç, Gizem Ozbaygin & Karasan, Oya E. & Kara, Bahar Y. & Campbell, James F. & Ozel, Aysu, 2023. "Exact solution approaches for the minimum total cost traveling salesman problem with multiple drones," Transportation Research Part B: Methodological, Elsevier, vol. 168(C), pages 81-123.
- Avraham, Edison & Raviv, Tal, 2020. "The data-driven time-dependent traveling salesperson problem," Transportation Research Part B: Methodological, Elsevier, vol. 134(C), pages 25-40.
- Francesco Carrabs & Jean-François Cordeau & Gilbert Laporte, 2007. "Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 618-632, November.
- Basso, Rafael & Kulcsár, Balázs & Sanchez-Diaz, Ivan, 2021. "Electric vehicle routing problem with machine learning for energy prediction," Transportation Research Part B: Methodological, Elsevier, vol. 145(C), pages 24-55.
- Oruc, Buse Eylul & Kara, Bahar Yetis, 2018. "Post-disaster assessment routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 76-102.
- Axel Parmentier, 2022. "Learning to Approximate Industrial Problems by Operations Research Classic Problems," Operations Research, INFORMS, vol. 70(1), pages 606-623, January.
- Mo, Baichuan & Wang, Qingyi & Guo, Xiaotong & Winkenbach, Matthias & Zhao, Jinhua, 2023. "Predicting drivers’ route trajectories in last-mile delivery using a pair-wise attention-based pointer neural network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 175(C).
- Lei, Zengxiang & Ukkusuri, Satish V., 2023. "Scalable reinforcement learning approaches for dynamic pricing in ride-hailing systems," Transportation Research Part B: Methodological, Elsevier, vol. 178(C).
- Alvarez, Aldair & Cordeau, Jean-François & Jans, Raf, 2024. "The consistent vehicle routing problem with stochastic customers and demands," Transportation Research Part B: Methodological, Elsevier, vol. 186(C).
- Laporte, Gilbert, 1992. "The traveling salesman problem: An overview of exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 59(2), pages 231-247, June.
- Rodríguez-Martín, Inmaculada & Yaman, Hande, 2022. "Periodic Vehicle Routing Problem with Driver Consistency and service time optimization," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 468-484.
- Yuichi Nagata & Shigenobu Kobayashi, 2013. "A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 346-363, May.
- S. Lin & B. W. Kernighan, 1973. "An Effective Heuristic Algorithm for the Traveling-Salesman Problem," Operations Research, INFORMS, vol. 21(2), pages 498-516, April.
- Cheng, Chun & Adulyasak, Yossiri & Rousseau, Louis-Martin, 2020. "Drone routing with energy function: Formulation and exact algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 364-387.
- Demir, Emrah & Burgholzer, Wolfgang & Hrušovský, Martin & Arıkan, Emel & Jammernegg, Werner & Woensel, Tom Van, 2016. "A green intermodal service network design problem with travel time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 93(PB), pages 789-807.
- Sadana, Utsav & Chenreddy, Abhilash & Delage, Erick & Forel, Alexandre & Frejinger, Emma & Vidal, Thibaut, 2025. "A survey of contextual optimization methods for decision-making under uncertainty," European Journal of Operational Research, Elsevier, vol. 320(2), pages 271-289.
- Shiri, Davood & Akbari, Vahid & Hassanzadeh, Ali, 2024. "The Capacitated Team Orienteering Problem: An online optimization framework with predictions of unknown accuracy," Transportation Research Part B: Methodological, Elsevier, vol. 185(C).
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Ramadhan, Fadillah & Irawan, Chandra Ade & Salhi, Said & Cai, Zhao, 2025. "The truck traveling salesman problem with drone and boat for humanitarian relief distribution in flood disaster: Mathematical model and solution methods," European Journal of Operational Research, Elsevier, vol. 322(1), pages 270-291.
- N. A. Arellano-Arriaga & J. Molina & S. E. Schaeffer & A. M. Álvarez-Socarrás & I. A. Martínez-Salazar, 2019. "A bi-objective study of the minimum latency problem," Journal of Heuristics, Springer, vol. 25(3), pages 431-454, June.
- Duygu Pamukcu & Burcu Balcik, 2020. "A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(1), pages 1-42, March.
- Shaowen Lan & Yongliang Lu & Wenjuan Fan, 2025. "An adaptive variable neighborhood search for the traveling salesman problem with job-times," Journal of Heuristics, Springer, vol. 31(2), pages 1-65, June.
- Cai, Lei & Li, Jiliu & Wang, Kai & Luo, Zhixing & Qin, Hu, 2025. "Optimal allocation and route design for station-based drone inspection of large-scale facilities," Omega, Elsevier, vol. 130(C).
- Voudouris, Christos & Tsang, Edward, 1999. "Guided local search and its application to the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 113(2), pages 469-499, March.
- Burger, M. & Su, Z. & De Schutter, B., 2018. "A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 265(2), pages 463-477.
- Bassetto, Tatiana & Mason, Francesco, 2011. "Heuristic algorithms for the 2-period balanced Travelling Salesman Problem in Euclidean graphs," European Journal of Operational Research, Elsevier, vol. 208(3), pages 253-262, February.
- G Laporte, 2010. "A concise guide to the Traveling Salesman Problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(1), pages 35-40, January.
- Yannis Marinakis & Athanasios Migdalas & Panos M. Pardalos, 2009. "Multiple phase neighborhood Search—GRASP based on Lagrangean relaxation, random backtracking Lin–Kernighan and path relinking for the TSP," Journal of Combinatorial Optimization, Springer, vol. 17(2), pages 134-156, February.
- He, Mu & Wu, Qinghua & Benlic, Una & Lu, Yongliang & Chen, Yuning, 2024. "An effective multi-level memetic search with neighborhood reduction for the clustered team orienteering problem," European Journal of Operational Research, Elsevier, vol. 318(3), pages 778-801.
- Constantin Wildt & Felix Weidinger & Nils Boysen, 2025. "Picker routing in scattered storage warehouses: an evaluation of solution methods based on TSP transformations," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 47(1), pages 35-66, March.
- He, Pengfei & Hao, Jin-Kao, 2023. "Memetic search for the minmax multiple traveling salesman problem with single and multiple depots," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1055-1070.
- Yichen Lu & Chao Yang & Jun Yang, 2022. "A multi-objective humanitarian pickup and delivery vehicle routing problem with drones," Annals of Operations Research, Springer, vol. 319(1), pages 291-353, December.
- Mutsunori Yagiura & Toshihide Ibaraki & Fred Glover, 2004. "An Ejection Chain Approach for the Generalized Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 133-151, May.
- Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
- Zi-bin Jiang & Qiong Yang, 2016. "A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem," PLOS ONE, Public Library of Science, vol. 11(11), pages 1-15, November.
- Stefan Poikonen & Bruce Golden, 2020. "The Mothership and Drone Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 249-262, April.
- Alexandra TUDORICA & Cristian Silviu BANACU, 2018. "A Review Of Public Measures For Supporting The Development Of Rail-Road Intermodal Freight Transport In Romania," Proceedings of the INTERNATIONAL MANAGEMENT CONFERENCE, Faculty of Management, Academy of Economic Studies, Bucharest, Romania, vol. 12(1), pages 165-173, November.
- Connor Little & Salimur Choudhury & Ting Hu & Kai Salomaa, 2022. "Comparison of Genetic Operators for the Multiobjective Pickup and Delivery Problem," Mathematics, MDPI, vol. 10(22), pages 1-21, November.
More about this item
Keywords
Traveling salesman problem; Learning; Derivative-free optimization; Last-mile delivery;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:194:y:2025:i:c:s0191261525000219. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.