{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T05:21:05Z","timestamp":1782278465261,"version":"3.54.5"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T00:00:00Z","timestamp":1725926400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T00:00:00Z","timestamp":1725926400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["05M16WEC"],"award-info":[{"award-number":["05M16WEC"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010665","name":"H2020 Marie Sk\u0142odowska-Curie Actions","doi-asserted-by":"publisher","award":["764759"],"award-info":[{"award-number":["764759"]}],"id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fraunhofer-Institut f\u00fcr Integrierte Schaltungen IIS"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2025,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>We investigate a challenging task in ambulatory care, the minimizing of delays of patient transports. In practice, a limited number of vehicles is available for non-rescue transports. Furthermore, the dispatcher rarely has access to complete information when establishing a transport plan for dispatching the vehicles. If additional transport is requested on demand then schedules need to be updated, which can lead to long delays. We model the scheduling of patient transports as a vehicle routing problem with general time windows and solve it as a mixed-integer linear problem that is modified whenever additional transport information becomes available. We propose a modeling approach that is designed to determine fair and stable plans. Furthermore, we show that the model can easily be modified when transports need to satisfy additional requirements, e.g., during pandemics, exemplarily the Covid-19 pandemic. To show the applicability and efficiency of our modeling approach, we conduct a numerical study using historical data from the region of Middle Franconia. The results reveal and show that, by applying mathematical optimization\u2014or, to be more precise by solving mixed-integer linear problem formulations\u2014one can significantly decrease delays and have considerable potential for optimized patient transports.<\/jats:p>","DOI":"10.1007\/s00291-024-00788-6","type":"journal-article","created":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T06:02:32Z","timestamp":1725948152000},"page":"565-604","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Minimizing delays of patient transports with incomplete information: A modeling approach based on the vehicle routing problem"],"prefix":"10.1007","volume":"47","author":[{"given":"Dennis","family":"Adelh\u00fctte","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3457-1755","authenticated-orcid":false,"given":"Kristin","family":"Braun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frauke","family":"Liers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sebastian","family":"Tschuppik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,9,10]]},"reference":[{"issue":"1","key":"788_CR1","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T Achterberg","year":"2005","unstructured":"Achterberg T, Koch T, Martin A (2005) Branching rules revisited. Oper Res Lett 33(1):42\u201354","journal-title":"Oper Res Lett"},{"issue":"8","key":"788_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0237628","volume":"15","author":"M Allen","year":"2020","unstructured":"Allen M, Bhanji A, Willemsen J, Dudfield S, Logan S, Monks T (2020) A simulation modelling toolkit for organising outpatient dialysis services during the covid-19 pandemic. PLoS One 15(8):1\u201313","journal-title":"PLoS One"},{"issue":"1","key":"788_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s00291-008-0135-6","volume":"32","author":"A Beaudry","year":"2010","unstructured":"Beaudry A, Laporte G, Melo T, Nickel S, Jeppesen AB, Laporte G, Melo T, Nickel S (2010) Dynamic transportation of patients in hospitals. OR Spectrum 32(1):77\u2013107","journal-title":"OR Spectrum"},{"key":"788_CR4","doi-asserted-by":"crossref","unstructured":"Bektas T, Repoussis PP, Tarantilis, CD (2014) Chapter 11: dynamic vehicle routing problems, pp 299\u2013347","DOI":"10.1137\/1.9781611973594.ch11"},{"issue":"1","key":"788_CR5","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.ejor.2009.04.024","volume":"202","author":"G Berbeglia","year":"2010","unstructured":"Berbeglia G, Cordeau J-F, Laporte G (2010) Dynamic pickup and delivery problems. Eur J Oper Res 202(1):8\u201315","journal-title":"Eur J Oper Res"},{"key":"788_CR6","first-page":"10","volume":"13","author":"E Berhan","year":"2014","unstructured":"Berhan E, Beshah B, Kitaw D, Abraham A (2014) Stochastic vehicle routing problem: a literature survey. J Inf Knowl Manag 13:10","journal-title":"J Inf Knowl Manag"},{"issue":"1","key":"788_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1287\/opre.2018.1763","volume":"67","author":"D Bertsimas","year":"2019","unstructured":"Bertsimas D, Jaillet P, Martin S (2019) Online vehicle routing: the edge of optimization in large-scale applications. Oper Res 67(1):143\u2013162","journal-title":"Oper Res"},{"key":"788_CR8","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1287\/opre.39.4.601","volume":"39","author":"DJ Bertsimas","year":"1991","unstructured":"Bertsimas DJ, van Ryzin G (1991) A stochastic and dynamic vehicle routing problem in the Euclidean plane. Oper Res 39:601\u2013615","journal-title":"Oper Res"},{"key":"788_CR9","unstructured":"Bestuzheva K, Besan\u00e7on M, Chen WK, Chmiela A, Donkiewicz T, van Doornmalen J, Eifler L, Gaul O, Gamrath G, Gleixner A, Gottwald L, Graczyk C, Halbig K, Hoen A, Hojny C, van der Hulst R, Koch T, L\u00fcbbecke M, Maher SJ, Matter F, M\u00fchmer E, M\u00fcller B, Pfetsch ME, Rehfeldt D, Schlein S, Schl\u00f6sser F, Serrano F, Shinano Y, Sofranac B, Turner M, Vigerske S, Wegscheider F, Wellner P, Weninger D, Witzig J (2021) The SCIP Optimization Suite 8.0. ZIB-Report 21-41, Zuse Institute, Berlin"},{"key":"788_CR10","volume":"8","author":"D Chen","year":"2020","unstructured":"Chen D, Pan S, Chen Q, Liu J (2020) Vehicle routing problem of contactless joint distribution service during covid-19 pandemic. Transp Res Interdiscip Perspect 8:100233","journal-title":"Transp Res Interdiscip Perspect"},{"issue":"1","key":"788_CR11","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1287\/trsc.1050.0133","volume":"40","author":"Z-L Chen","year":"2006","unstructured":"Chen Z-L, Xu H (2006) Dynamic column generation for dynamic vehicle routing with time windows. Transp Sci 40(1):74\u201388","journal-title":"Transp Sci"},{"key":"788_CR12","doi-asserted-by":"crossref","unstructured":"Cordeau JF, Desaulniers G, Desrosiers J, Solomon MM, Soumis, F (2002) VRP with Time Windows","DOI":"10.1137\/1.9780898718515.ch7"},{"key":"788_CR13","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/S0927-0507(06)14007-4","volume":"14","author":"JF Cordeau","year":"2007","unstructured":"Cordeau JF, Laporte G, Potvin JY, Savelsbergh MW (2007) Transportation on demand. Handbooks Oper Res Manag Sci 14:429\u2013466","journal-title":"Handbooks Oper Res Manag Sci"},{"key":"788_CR14","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/S0927-0507(06)14006-2","volume":"14","author":"JF Cordeau","year":"2007","unstructured":"Cordeau JF, Laporte G, Savelsbergh MW, Vigo D (2007) Vehicle routing. Handbooks Oper Res Manag Sci 14:367\u2013428","journal-title":"Handbooks Oper Res Manag Sci"},{"issue":"1","key":"788_CR15","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"},{"key":"788_CR16","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-0-387-77778-8_24","volume-title":"The vehicle routing problem: latest advances and new challenges","author":"KF Doerner","year":"2008","unstructured":"Doerner KF, Hartl RF (2008) Health care logistics, emergency preparedness, and disaster relief: New challenges for routing problems with a focus on the austrian situation. In: Golden B, Raghavan S, Wasil E (eds) The vehicle routing problem: latest advances and new challenges. Springer, Boston, pp 527\u2013550"},{"key":"788_CR17","volume-title":"Multicriteria optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott M (2005) Multicriteria optimization. Springer-Verlag, Berlin, Heidelberg"},{"issue":"1","key":"788_CR18","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.ejor.2012.09.016","volume":"225","author":"F Ferrucci","year":"2013","unstructured":"Ferrucci F, Bock S, Gendreau M (2013) A pro-active real-time control approach for dynamic vehicle routing problems dealing with the delivery of urgent goods. Eur J Oper Res 225(1):130\u2013141","journal-title":"Eur J Oper Res"},{"key":"788_CR19","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1016\/j.jbi.2009.02.003","volume":"42","author":"C Fiegl","year":"2009","unstructured":"Fiegl C, Pontow C (2009) Online scheduling of pick-up and delivery tasks in hospitals. J Biomed Inform 42:624\u2013632","journal-title":"J Biomed Inform"},{"key":"788_CR20","first-page":"41","volume":"38","author":"T Flatberg","year":"2007","unstructured":"Flatberg T, Hasle G, Kloster O, Nilssen EJ, Riise A (2007) Dynamic and stochastic vehicle routing in practice. Oper Res\/Comput Sci Interfaces Series 38:41\u201363","journal-title":"Oper Res\/Comput Sci Interfaces Series"},{"key":"788_CR21","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s00291-020-00609-6","volume":"43","author":"NS Gamchi","year":"2021","unstructured":"Gamchi NS, Torabi SA, Jolai F (2021) A novel vehicle routing problem for vaccine distribution using sir epidemic model. OR Spectrum 43:155\u2013188","journal-title":"OR Spectrum"},{"issue":"4","key":"788_CR22","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1287\/trsc.33.4.381","volume":"33","author":"M Gendreau","year":"1999","unstructured":"Gendreau M, Guertin F, Potvin J-Y, Taillard E (1999) Parallel tabu search for real-time vehicle routing and dispatching. Transp Sci 33(4):381\u2013390","journal-title":"Transp Sci"},{"issue":"12","key":"788_CR23","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1016\/S0167-8191(01)00103-X","volume":"27","author":"M Gendreau","year":"2001","unstructured":"Gendreau M, Laporte G, Semet F (2001) A dynamic model and parallel tabu search heuristic for real-time ambulance relocation. Parallel Comput 27(12):1641\u20131653","journal-title":"Parallel Comput"},{"key":"788_CR24","unstructured":"Gurobi Optimization, LLC (2021) Gurobi Optimizer Reference Manual"},{"key":"788_CR25","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10489-006-0033-z","volume":"27","author":"FT Hanshar","year":"2007","unstructured":"Hanshar FT, Ombuki-Berman BM (2007) Dynamic vehicle routing using genetic algorithms. Appl Intell 27:89\u201399","journal-title":"Appl Intell"},{"key":"788_CR26","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.trb.2018.02.001","volume":"111","author":"SC Ho","year":"2018","unstructured":"Ho SC, Szeto WY, Kuo YH, Leung JM, Petering M, Tou TW (2018) A survey of dial-a-ride problems: literature review and recent developments. Transp Res Part B: Methodol 111:395\u2013421","journal-title":"Transp Res Part B: Methodol"},{"key":"788_CR27","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1057\/hs.2012.18","volume":"1","author":"PJ Hulshof","year":"2012","unstructured":"Hulshof PJ, Kortbeek N, Boucherie RJ, Hans EW, Bakker PJ (2012) Taxonomic classification of planning decisions in health care: a structured review of the state of the art in or\/ms. Health Syst 1:129\u2013175","journal-title":"Health Syst"},{"issue":"2","key":"788_CR28","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1287\/trsc.1030.0085","volume":"39","author":"T Ibaraki","year":"2005","unstructured":"Ibaraki T, Imahori S, Kubo M, Masuda T, Uno T, Yagiura M (2005) Effective local search algorithms for routing and scheduling problems with general time-window constraints. Transp Sci 39(2):206\u2013232","journal-title":"Transp Sci"},{"issue":"2","key":"788_CR29","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/j.ejor.2011.04.033","volume":"214","author":"Y Kergosien","year":"2011","unstructured":"Kergosien Y, Lent\u00e9 C, Piton D, Billaut J-C (2011) A tabu search heuristic for the dynamic transportation of patients between care units. Eur J Oper Res 214(2):442\u2013452","journal-title":"Eur J Oper Res"},{"key":"788_CR30","doi-asserted-by":"publisher","first-page":"2367","DOI":"10.1109\/TITS.2016.2521779","volume":"17","author":"G Kim","year":"2016","unstructured":"Kim G, Ong YS, Cheong T, Tan PS (2016) Solving the dynamic vehicle routing problem under traffic congestion. IEEE Trans Intell Transp Syst 17:2367\u20132380","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"788_CR31","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1109\/TITS.2005.848362","volume":"6","author":"S Kim","year":"2005","unstructured":"Kim S, Lewis ME, White CC (2005) Optimal vehicle routing with real-time traffic information. IEEE Trans Intell Transp Syst 6:178\u2013188","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"788_CR32","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1016\/j.cor.2011.05.027","volume":"39","author":"AL Kok","year":"2012","unstructured":"Kok AL, Hans EW, Schutten JM (2012) Vehicle routing under time-dependent travel times: the impact of congestion avoidance. Comput Oper Res 39:910\u2013918","journal-title":"Comput Oper Res"},{"key":"788_CR33","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-68279-0_5","volume-title":"50 Years of Integer Programming 1958\u20132008: From the Early Years to the State-of-the-Art","author":"AH Land","year":"2010","unstructured":"Land AH, Doig AG (2010) An automatic method for solving discrete programming problems. In: J\u00fcnger M, Liebling TM, Naddef D, Nemhauser GL, Pulleyblank WR, Reinelt G, Rinaldi G, Wolsey LA (eds) 50 Years of Integer Programming 1958\u20132008: From the Early Years to the State-of-the-Art. Springer, Berlin Heidelberg, pp 105\u2013132"},{"key":"788_CR34","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1186\/s12911-022-01866-x","volume":"22","author":"N Leith\u00e4user","year":"2022","unstructured":"Leith\u00e4user N, Adelh\u00fctte D, Braun K, B\u00fcsing C, Comis M, Gersing T, Johann S, Koster AMCA, Krumke SO, Liers F, Schmidt E, Schneider J, Streicher M, Tschuppik S, Wrede S (2022) Decision-support systems for ambulatory care, including pandemic requirements: using mathematically optimized solutions. BMC Med Inf Decis Making 22:132","journal-title":"BMC Med Inf Decis Making"},{"key":"788_CR35","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02031946","volume":"60","author":"OB Madsen","year":"1965","unstructured":"Madsen OB, Ravn HF, Rygaard JM (1965) A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Ann Oper Res 60:193\u2013208","journal-title":"Ann Oper Res"},{"key":"788_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105699","volume":"141","author":"JT Margolis","year":"2022","unstructured":"Margolis JT, Song Y, Mason SJ (2022) A Markov decision process model on dynamic routing for target surveillance. Comput Oper Res 141:105699","journal-title":"Comput Oper Res"},{"issue":"3","key":"788_CR37","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1016\/j.cor.2005.03.024","volume":"34","author":"E Melachrinoudis","year":"2007","unstructured":"Melachrinoudis E, Ilhan AB, Min H (2007) A dial-a-ride problem for client transportation in a health-care organization. Comput Oper Res 34(3):742\u2013759","journal-title":"Comput Oper Res"},{"key":"788_CR38","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.trb.2003.09.002","volume":"38","author":"S Mitrovi\u0107-Mini\u0107","year":"2004","unstructured":"Mitrovi\u0107-Mini\u0107 S, Laporte G (2004) Waiting strategies for the dynamic pickup and delivery problem with time windows. Transp Res Part B: Methodol 38:635\u2013655","journal-title":"Transp Res Part B: Methodol"},{"key":"788_CR39","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s13676-016-0099-7","volume":"6","author":"J Oyola","year":"2017","unstructured":"Oyola J, Arntzen H, Woodruff DL (2017) The stochastic vehicle routing problem, a literature review, part II: solution methods. EURO J Transp Logist 6:349\u2013388","journal-title":"EURO J Transp Logist"},{"key":"788_CR40","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s13676-016-0100-5","volume":"7","author":"J Oyola","year":"2018","unstructured":"Oyola J, Arntzen H, Woodruff DL (2018) The stochastic vehicle routing problem, a literature review, part I: models. EURO J Transp Logist 7:193\u2013221","journal-title":"EURO J Transp Logist"},{"issue":"5","key":"788_CR41","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/s10732-020-09456-8","volume":"26","author":"J Pacheco","year":"2020","unstructured":"Pacheco J, Laguna M (2020) Vehicle routing for the urgent delivery of face shields during the covid-19 pandemic. Journal of Heuristics 26(5):619\u2013635","journal-title":"Journal of Heuristics"},{"key":"788_CR42","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s00291-010-0229-9","volume":"34","author":"SN Parragh","year":"2010","unstructured":"Parragh SN, Cordeau J-F, Doerner KF, Hartl RF (2010) Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints. OR Spectrum 34:593\u2013633","journal-title":"OR Spectrum"},{"issue":"1","key":"788_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2012.08.015","volume":"225","author":"V Pillac","year":"2013","unstructured":"Pillac V, Gendreau M, Gu\u00e9ret C, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur J Oper Res 225(1):1\u201311","journal-title":"Eur J Oper Res"},{"issue":"1","key":"788_CR44","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/net.21628","volume":"67","author":"HN Psaraftis","year":"2016","unstructured":"Psaraftis HN, Wen M, Kontovas CA (2016) Dynamic vehicle routing problems: three decades and counting. Networks 67(1):3\u201331","journal-title":"Networks"},{"key":"788_CR45","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1080\/00207543.2015.1043403","volume":"54","author":"U Ritzinger","year":"2015","unstructured":"Ritzinger U, Puchinger J, Hartl RF (2015) A survey on dynamic and stochastic vehicle routing problems. Int J Prod Res 54:215\u2013231","journal-title":"Int J Prod Res"},{"key":"788_CR46","unstructured":"Robert Koch Institute (2020) Coronavirus disease 2019 (covid\u201319) \u2013 daily situation report of the Robert Koch Institute"},{"key":"788_CR47","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1007\/s00291-022-00670-3","volume":"44","author":"SK Sava\u015fer","year":"2022","unstructured":"Sava\u015fer SK, Kara BY (2022) Mobile healthcare services in rural areas: an application with periodic location routing problem. OR Spectrum 44:875\u2013910","journal-title":"OR Spectrum"},{"key":"788_CR48","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.ejor.2014.03.005","volume":"238","author":"M Schilde","year":"2014","unstructured":"Schilde M, Doerner KF, Hartl RF (2014) Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem. Eur J Oper Res 238:18\u201330","journal-title":"Eur J Oper Res"},{"key":"788_CR49","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1287\/opre.1080.0520","volume":"57","author":"N Secomandi","year":"2008","unstructured":"Secomandi N, Margot F (2008) Reoptimization approaches for the vehicle-routing problem with stochastic demands. Oper Res 57:214\u2013230","journal-title":"Oper Res"},{"key":"788_CR50","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/j.ejor.2021.07.014","volume":"298","author":"N Soeffker","year":"2022","unstructured":"Soeffker N, Ulmer MW, Mattfeld DC (2022) Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review. Eur J Oper Res 298:801\u2013820","journal-title":"Eur J Oper Res"},{"key":"788_CR51","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1287\/trsc.1060.0183","volume":"41","author":"BW Thomas","year":"2007","unstructured":"Thomas BW (2007) Waiting strategies for anticipating service requests from known customer locations. Transp Sci 41:319\u2013331","journal-title":"Transp Sci"},{"key":"788_CR52","unstructured":"Ulmer MW, Goodson JC, Mattfeld DC, Thomas BW (2017) Dynamic vehicle routing: Literature review and modeling framework"},{"key":"788_CR53","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejtl.2020.100008","volume":"9","author":"MW Ulmer","year":"2020","unstructured":"Ulmer MW, Goodson JC, Mattfeld DC, Thomas BW (2020) On modeling stochastic dynamic vehicle routing problems. EURO J Transp Logist 9:100008","journal-title":"EURO J Transp Logist"},{"issue":"2","key":"788_CR54","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1287\/trsc.2018.0823","volume":"53","author":"PL van den Berg","year":"2019","unstructured":"van den Berg PL, van Essen JT (2019) Scheduling non-urgent patient transportation while maximizing emergency coverage. Transp Sci 53(2):492\u2013509","journal-title":"Transp Sci"},{"key":"788_CR55","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ejor.2019.10.010","volume":"286","author":"T Vidal","year":"2020","unstructured":"Vidal T, Laporte G, Matl P (2020) A concise guide to existing and emerging vehicle routing problem variants. Eur J Oper Res 286:401\u2013416","journal-title":"Eur J Oper Res"},{"key":"788_CR56","doi-asserted-by":"crossref","unstructured":"Vigo D, Toth P (eds) (2014) Vehicle Routing. SIAM, Philadelphia, PA","DOI":"10.1137\/1.9781611973594"},{"key":"788_CR57","doi-asserted-by":"publisher","first-page":"1895","DOI":"10.1007\/s11081-021-09680-6","volume":"23","author":"A Wang","year":"2021","unstructured":"Wang A, Subramanyam A, Gounaris CE (2021) Robust vehicle routing under uncertainty via branch-price-and-cut. Optim Eng 23:1895\u20131948","journal-title":"Optim Eng"},{"key":"788_CR58","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/9781119606475","volume-title":"Mixed integer programming","author":"LA Wolsey","year":"2020","unstructured":"Wolsey LA (2020) Mixed integer programming. John Wiley & Sons, Ltd, Hoboken, pp 1\u201310"},{"key":"788_CR59","volume-title":"Integer and combinatorial optimization","author":"LA Wolsey","year":"1999","unstructured":"Wolsey LA, Nemhauser GL (1999) Integer and combinatorial optimization. John Wiley & Sons, Ltd, Hoboken"},{"key":"788_CR60","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.trb.2018.12.013","volume":"121","author":"X Yu","year":"2019","unstructured":"Yu X, Gao S, Hu X, Park H (2019) A Markov decision process approach to vacant taxi routing with e-hailing. Transp Res Part B: Methodol 121:114\u2013134","journal-title":"Transp Res Part B: Methodol"},{"issue":"3","key":"788_CR61","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1287\/serv.2021.0277","volume":"13","author":"X Yu","year":"2021","unstructured":"Yu X, Shen S, Wang H (2021) Integrated vehicle routing and service scheduling under time and cancellation uncertainties with application in nonemergency medical transportation. Serv Sci 13(3):172\u2013191","journal-title":"Serv Sci"},{"key":"788_CR62","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.tre.2019.01.013","volume":"123","author":"J Zhang","year":"2019","unstructured":"Zhang J, Liu F, Tang J, Li Y (2019) The online integrated order picking and delivery considering pickers\u2019 learning effects for an O2O community supermarket. Transp Res Part E: Logist Transp Rev 123:180\u2013199","journal-title":"Transp Res Part E: Logist Transp Rev"},{"key":"788_CR63","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.omega.2017.08.004","volume":"79","author":"J Zhang","year":"2017","unstructured":"Zhang J, Wang X, Huang K (2017) On-line scheduling of order picking and delivery with multiple zones and limited vehicle capacity. Omega 79:104\u2013115","journal-title":"Omega"},{"key":"788_CR64","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1287\/opre.2020.2043","volume":"69","author":"Y Zhang","year":"2021","unstructured":"Zhang Y, Zhang Z, Lim A, Sim M (2021) Robust data-driven vehicle routing with time windows. Oper Res 69:469\u2013485","journal-title":"Oper Res"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-024-00788-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-024-00788-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-024-00788-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,8]],"date-time":"2025-06-08T05:01:38Z","timestamp":1749358898000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-024-00788-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,10]]},"references-count":64,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["788"],"URL":"https:\/\/doi.org\/10.1007\/s00291-024-00788-6","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,10]]},"assertion":[{"value":"8 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There are no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}