{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T12:08:44Z","timestamp":1779538124756,"version":"3.53.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T00:00:00Z","timestamp":1771459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T00:00:00Z","timestamp":1771459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100010903","name":"Key Programme","doi-asserted-by":"publisher","award":["52175475"],"award-info":[{"award-number":["52175475"]}],"id":[{"id":"10.13039\/501100010903","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s12351-026-01026-3","type":"journal-article","created":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T11:36:00Z","timestamp":1771500960000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A branch-and-price algorithm for the last-mile delivery problem considering drivers\u2019 experience"],"prefix":"10.1007","volume":"26","author":[{"given":"Zhe","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7163-7031","authenticated-orcid":false,"given":"Lu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoni","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,2,19]]},"reference":[{"key":"1026_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2024.102968","volume":"186","author":"A Alvarez","year":"2024","unstructured":"Alvarez A, Cordeau J-F, Jans R (2024) The consistent vehicle routing problem with stochastic customers and demands. Transport Res Part B Methodol 186:102968","journal-title":"Transportation Research Part B Methodological"},{"issue":"5","key":"1026_CR2","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1287\/opre.1110.0975","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper Res 59(5):1269\u20131283","journal-title":"Oper Res"},{"key":"1026_CR3","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.trc.2012.03.007","volume":"24","author":"LC Coelho","year":"2012","unstructured":"Coelho LC, Cordeau J-F, Laporte G (2012) Consistency in multi-vehicle inventory-routing. Transport Res Part C Emerg Technol 24:270\u2013287","journal-title":"Transportation Research Part C Emerging Technologies"},{"issue":"3","key":"1026_CR4","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1016\/j.ejor.2021.03.031","volume":"295","author":"L Chen","year":"2021","unstructured":"Chen L, Chen Y, Langevin A (2021) An inverse optimization approach for a capacitated vehicle routing problem. Eur J Oper Res 295(3):1087\u20131098","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1026_CR5","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1016\/j.cor.2012.08.012","volume":"40","author":"LC Coelho","year":"2013","unstructured":"Coelho LC, Laporte G (2013) The exact solution of several classes of inventory-routing problems. Comput Operat Res 40(2):558\u2013565","journal-title":"Computers & Operations Research"},{"issue":"1","key":"1026_CR6","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.ejor.2023.04.043","volume":"311","author":"P Dieter","year":"2023","unstructured":"Dieter P, Caron M, Schryen G (2023) Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework. Eur J Oper Res 311(1):283\u2013300","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1026_CR7","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M Desrochers","year":"1992","unstructured":"Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper Res 40(2):342\u2013354","journal-title":"Oper Res"},{"issue":"6","key":"1026_CR8","doi-asserted-by":"publisher","first-page":"1388","DOI":"10.1287\/opre.2016.1535","volume":"64","author":"G Desaulniers","year":"2016","unstructured":"Desaulniers G, Errico F, Irnich S, Schneider M (2016) Exact algorithms for electric vehicle-routing problems with time windows. Oper Res 64(6):1388\u20131405","journal-title":"Oper Res"},{"issue":"1","key":"1026_CR9","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manage Sci 6(1):80\u201391","journal-title":"Manage Sci"},{"issue":"3","key":"1026_CR10","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D Feillet","year":"2004","unstructured":"Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Netw Int J 44(3):216\u2013229","journal-title":"Networks An International Journal"},{"issue":"1","key":"1026_CR11","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.ejor.2019.04.008","volume":"278","author":"T Gschwind","year":"2019","unstructured":"Gschwind T, Bianchessi N, Irnich S (2019) Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem. Eur J Oper Res 278(1):91\u2013104","journal-title":"Eur J Oper Res"},{"key":"1026_CR12","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.cor.2014.03.028","volume":"50","author":"C Gauvin","year":"2014","unstructured":"Gauvin C, Desaulniers G, Gendreau M (2014) A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands. Comput Operat Res 50:141\u2013153","journal-title":"Computers & Operations Research"},{"issue":"4","key":"1026_CR13","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1287\/msom.1080.0243","volume":"11","author":"C Gro\u00ebr","year":"2009","unstructured":"Gro\u00ebr C, Golden B, Wasil E (2009) The consistent vehicle routing problem. Manuf Serv Oper Manag 11(4):630\u2013643","journal-title":"Manuf Serv Oper Manag"},{"key":"1026_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges","author":"BL Golden","year":"2008","unstructured":"Golden BL, Raghavan S, Wasil EA (2008) The vehicle routing problem: latest advances and new challenges, vol 43. Springer, Berlin"},{"issue":"24","key":"1026_CR15","doi-asserted-by":"publisher","first-page":"13015","DOI":"10.3390\/app132413015","volume":"13","author":"R Jazemi","year":"2023","unstructured":"Jazemi R, Alidadiani E, Ahn K, Jang J (2023) A review of literature on vehicle routing problems of last-mile delivery in urban areas. Appl Sci 13(24):13015","journal-title":"Appl Sci"},{"issue":"3","key":"1026_CR16","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1002\/net.21565","volume":"64","author":"AA Kovacs","year":"2015","unstructured":"Kovacs AA, Golden BL, Hartl RF, Parragh SN (2015) Vehicle routing problems in which consistency considerations are important: a survey. Networks 64(3):192\u2013213","journal-title":"Networks"},{"key":"1026_CR17","doi-asserted-by":"crossref","unstructured":"Kunkel M, Schwind M (2012) Vehicle routing with driver learning for real world cep problems. In: 2012 45th Hawaii International Conference on System Sciences, pp. 1315\u20131322. IEEE","DOI":"10.1109\/HICSS.2012.633"},{"key":"1026_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109093","volume":"177","author":"H Luo","year":"2023","unstructured":"Luo H, Dridi M, Grunder O (2023) A branch-price-and-cut algorithm for a time-dependent green vehicle routing problem with the consideration of traffic congestion. Comput Indust Eng 177:109093","journal-title":"Computers & Industrial Engineering"},{"key":"1026_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105870","volume":"145","author":"E Lam","year":"2022","unstructured":"Lam E, Desaulniers G, Stuckey PJ (2022) Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations. Comput Operat Res 145:105870","journal-title":"Computers & Operations Research"},{"key":"1026_CR20","volume-title":"Service Consistency in Vehicle Routing","author":"K Lian","year":"2017","unstructured":"Lian K (2017) Service Consistency in Vehicle Routing. University of Arkansas, Fayetteville"},{"key":"1026_CR21","unstructured":"Li Y, Phillips W (2018) Learning from route plan deviation in last-mile delivery. In: Master\u2019s thesis, Massachusetts Institute of Technology"},{"key":"1026_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2020.101955","volume":"140","author":"J Li","year":"2020","unstructured":"Li J, Qin H, Baldacci R, Zhu W (2020) Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows. Transport Res Part E Logistics Transport Rev 140:101955","journal-title":"Transportation Research Part E Logistics and Transportation Review"},{"issue":"3","key":"1026_CR23","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1016\/j.ejor.2014.12.019","volume":"243","author":"Z Luo","year":"2015","unstructured":"Luo Z, Qin H, Che C, Lim A (2015) On service consistency in multi-period vehicle routing. Eur J Oper Res 243(3):731\u2013744","journal-title":"Eur J Oper Res"},{"key":"1026_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104833","volume":"114","author":"G Marques","year":"2020","unstructured":"Marques G, Sadykov R, Deschamps J-C, Dupas R (2020) An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem. Comput Operat Res 114:104833","journal-title":"Computers & Operations Research"},{"key":"1026_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2023.103168","volume":"175","author":"B Mo","year":"2023","unstructured":"Mo B, Wang Q, Guo X, Winkenbach M, Zhao J (2023) Predicting drivers\u2019 route trajectories in last-mile delivery using a pair-wise attention-based pointer neural network. Transport Res Part E Logistics Transport Rev 175:103168","journal-title":"Transportation Research Part E Logistics and Transportation Review"},{"issue":"2","key":"1026_CR26","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1016\/j.ejor.2022.01.024","volume":"302","author":"PC Nolz","year":"2022","unstructured":"Nolz PC, Absi N, Feillet D, Seragiotto C (2022) The consistent electric-vehicle routing problem with backhauls and charging management. Eur J Oper Res 302(2):700\u2013716","journal-title":"Eur J Oper Res"},{"key":"1026_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2020.102340","volume":"102","author":"O Quirion-Blais","year":"2021","unstructured":"Quirion-Blais O, Chen L (2021) A case-based reasoning approach to solve the vehicle routing problem with time windows and drivers\u2019 experience. Omega 102:102340","journal-title":"Omega"},{"issue":"2","key":"1026_CR28","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/j.ejor.2018.06.049","volume":"272","author":"M Reihaneh","year":"2019","unstructured":"Reihaneh M, Ghoniem A (2019) A branch-and-price algorithm for a vehicle routing with demand allocation problem. Eur J Oper Res 272(2):523\u2013538","journal-title":"Eur J Oper Res"},{"key":"1026_CR29","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1016\/j.trb.2022.11.004","volume":"166","author":"I Rodr\u00edguez-Mart\u00edn","year":"2022","unstructured":"Rodr\u00edguez-Mart\u00edn I, Yaman H (2022) Periodic vehicle routing problem with driver consistency and service time optimization. Transport Res Part B Methodol 166:468\u2013484","journal-title":"Transportation Research Part B Methodological"},{"key":"1026_CR30","doi-asserted-by":"crossref","unstructured":"Samson BPV, Sumi Y (2019) Exploring factors that influence connected drivers to (not) use or follow recommended optimal routes. In: Proceedings of the 2019 CHI Conference on Human Factors in Computing Systems, pp. 1\u201314","DOI":"10.1145\/3290605.3300601"},{"issue":"5","key":"1026_CR31","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1080\/01441647.2016.1273276","volume":"37","author":"S Srivatsa Srinivas","year":"2017","unstructured":"Srivatsa Srinivas S, Gajanand M (2017) Vehicle routing problem and driver behaviour: a review and framework for analysis. Transp Rev 37(5):590\u2013611","journal-title":"Transp Rev"},{"key":"1026_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105644","volume":"140","author":"F Stavropoulou","year":"2022","unstructured":"Stavropoulou F (2022) The consistent vehicle routing problem with heterogeneous fleet. Comput Operat Res 140:105644","journal-title":"Computers & Operations Research"},{"key":"1026_CR33","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718515","volume-title":"The Vehicle Routing Problem","author":"P Toth","year":"2002","unstructured":"Toth P, Vigo D (2002) The vehicle routing problem. SIAM, Philadelphia"},{"issue":"2","key":"1026_CR34","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/j.ejor.2020.03.037","volume":"286","author":"M Ulmer","year":"2020","unstructured":"Ulmer M, Nowak M, Mattfeld D, Kaminski B (2020) Binary driver-customer familiarity in service routing. Eur J Oper Res 286(2):477\u2013493","journal-title":"Eur J Oper Res"},{"key":"1026_CR35","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.trb.2023.03.003","volume":"171","author":"Y Xia","year":"2023","unstructured":"Xia Y, Zeng W, Zhang C, Yang H (2023) A branch-and-price-and-cut algorithm for the vehicle routing problem with load-dependent drones. Transport Res Part B Methodol 171:80\u2013110","journal-title":"Transportation Research Part B Methodological"},{"key":"1026_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109803","volume":"187","author":"X Yu","year":"2024","unstructured":"Yu X, Hu Y, Wu P (2024) The consistent vehicle routing problem considering driver equity and flexible route consistency. Comput Indust Eng 187:109803","journal-title":"Computers & Industrial Engineering"},{"key":"1026_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2020.102167","volume":"145","author":"W Yang","year":"2021","unstructured":"Yang W, Ke L, Wang DZ, Lam JSL (2021) A branch-price-and-cut algorithm for the vehicle routing problem with release and due dates. Transport Res Part E Logistics Transport Rev 145:102167","journal-title":"Transportation Research Part E Logistics and Transportation Review"},{"key":"1026_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2022.102785","volume":"164","author":"M Yang","year":"2022","unstructured":"Yang M, Ni Y, Song Q (2022) Optimizing driver consistency in the vehicle routing problem under uncertain environment. Transport Res part E Logistics Transport Rev 164:102785","journal-title":"Transportation research part E logistics and transportation review"},{"key":"1026_CR39","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.trb.2021.09.005","volume":"153","author":"Y Yao","year":"2021","unstructured":"Yao Y, Van Woensel T, Veelenturf LP, Mo P (2021) The consistent vehicle routing problem considering path consistency in a road network. Transport Res Part B Methodol 153:21\u201344","journal-title":"Transportation Research Part B Methodological"},{"issue":"3","key":"1026_CR40","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1287\/ijoc.2021.1110","volume":"34","author":"X Zhang","year":"2022","unstructured":"Zhang X, Chen L, Gendreau M, Langevin A (2022) Learning-based branch-and-price algorithms for the vehicle routing problem with time windows and two-dimensional loading constraints. Informs J Comput 34(3):1419\u20131436","journal-title":"INFORMS J Comput"},{"key":"1026_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2024.103485","volume":"185","author":"P Zhang","year":"2024","unstructured":"Zhang P, Lei D, Liu S, Jiang H (2024) Recursive logit-based meta-inverse reinforcement learning for driver-preferred route planning. Transport Res part E Logistics Transport Rev 185:103485","journal-title":"Transportation research part E logistics and transportation review"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-026-01026-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-026-01026-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-026-01026-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T11:50:20Z","timestamp":1779537020000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-026-01026-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,19]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["1026"],"URL":"https:\/\/doi.org\/10.1007\/s12351-026-01026-3","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,19]]},"assertion":[{"value":"29 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"35"}}