{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:19:22Z","timestamp":1786979962176,"version":"3.56.0"},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T00:00:00Z","timestamp":1769990400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T00:00:00Z","timestamp":1769990400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Helmut-Schmidt-Universit\u00e4t Universit\u00e4t der Bundeswehr Hamburg"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s00291-026-00847-0","type":"journal-article","created":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T03:18:12Z","timestamp":1770002292000},"page":"541-586","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient insertion and reoptimization algorithms for a customer-oriented dynamic dial-a-ride problem"],"prefix":"10.1007","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3088-2820","authenticated-orcid":false,"given":"Arne","family":"Schulz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Pfeiffer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,2,2]]},"reference":[{"key":"847_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejtl.2023.100109","volume":"12","author":"C Ackermann","year":"2023","unstructured":"Ackermann C, Rieck J (2023) A novel repositioning approach and analysis for dynamic ride-hailing problems. EURO Journal on Transportation and Logistics 12:100109. https:\/\/doi.org\/10.1016\/j.ejtl.2023.100109","journal-title":"EURO Journal on Transportation and Logistics"},{"issue":"1","key":"847_CR2","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1287\/trsc.2018.0840","volume":"53","author":"L Agussurja","year":"2019","unstructured":"Agussurja L, Cheng SF, Lau HC (2019) A state aggregation approach for stochastic multiperiod last-mile ride-sharing problems. Transp Sci 53(1):148\u2013166","journal-title":"Transp Sci"},{"issue":"3","key":"847_CR3","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1073\/pnas.1611675114","volume":"114","author":"J Alonso-Mora","year":"2017","unstructured":"Alonso-Mora J, Samaranayake S, Wallar A, Frazzoli E, Rus D (2017) On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment. Proc Natl Acad Sci 114(3):462\u2013467","journal-title":"Proc Natl Acad Sci"},{"key":"847_CR4","doi-asserted-by":"crossref","unstructured":"Alonso-Mora J, Wallar A, Rus D (2017b) Predictive routing for autonomous mobility-on-demand systems with ride-sharing. In: 2017 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), IEEE, pp 3583\u20133590","DOI":"10.1109\/IROS.2017.8206203"},{"key":"847_CR5","doi-asserted-by":"crossref","unstructured":"Anzenhofer F, Fleckenstein D, Klein R, Steinhardt C (2024) Sustainable dynamic pricing for rural shared mobility-on-demand systems. Available at SSRN 5077836","DOI":"10.2139\/ssrn.5077836"},{"key":"847_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.tra.2024.104360","volume":"192","author":"F Anzenhofer","year":"2025","unstructured":"Anzenhofer F, Schmidbaur S, Klein R, Steinhardt C (2025) The potential of governmental regulation on shared mobility-on-demand systems. Transportation Research Part A Policy and Practice 192:104360","journal-title":"Transportation Research Part A Policy and Practice"},{"issue":"3","key":"847_CR7","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.parco.2003.12.001","volume":"30","author":"A Attanasio","year":"2004","unstructured":"Attanasio A, Cordeau JF, Ghiani G, Laporte G (2004) Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput 30(3):377\u2013387","journal-title":"Parallel Comput"},{"key":"847_CR8","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.trb.2021.10.008","volume":"154","author":"E Avraham","year":"2021","unstructured":"Avraham E, Raviv T (2021) The steady-state mobile personnel booking problem. Transportation Research Part B Methodological 154:266\u2013288","journal-title":"Transportation Research Part B Methodological"},{"issue":"1","key":"847_CR9","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 JF, Laporte G (2010) Dynamic pickup and delivery problems. Eur J Oper Res 202(1):8\u201315. https:\/\/doi.org\/10.1016\/j.ejor.2009.04.024","journal-title":"Eur J Oper Res"},{"key":"847_CR10","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s00291-024-00784-w","volume":"47","author":"L Berthold","year":"2025","unstructured":"Berthold L, Fliedner M, Schulz A (2025) A shift scheduling model for ridepooling services. OR Spectrum 47:349\u2013373","journal-title":"OR Spectrum"},{"key":"847_CR11","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.cor.2018.06.004","volume":"106","author":"J Brinkmann","year":"2019","unstructured":"Brinkmann J, Ulmer MW, Mattfeld DC (2019) Dynamic lookahead policies for stochastic-dynamic inventory routing in bike sharing systems. Computers & Operations Research 106:260\u2013279","journal-title":"Computers & Operations Research"},{"issue":"3","key":"847_CR12","doi-asserted-by":"publisher","first-page":"1605","DOI":"10.1016\/j.ejor.2005.02.038","volume":"175","author":"L Coslovich","year":"2006","unstructured":"Coslovich L, Pesenti R, Ukovich W (2006) A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem. Eur J Oper Res 175(3):1605\u2013161. https:\/\/doi.org\/10.1016\/j.ejor.2005.02.038","journal-title":"Eur J Oper Res"},{"key":"847_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.trc.2013.12.001","volume":"40","author":"DJ Fagnant","year":"2014","unstructured":"Fagnant DJ, Kockelman KM (2014) The travel and environmental implications of shared autonomous vehicles, using agent-based model scenarios. Transportation Research Part C Emerging Technologies 40:1\u201313. https:\/\/doi.org\/10.1016\/j.trc.2013.12.001","journal-title":"Transportation Research Part C Emerging Technologies"},{"issue":"2","key":"847_CR14","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/j.ejor.2022.04.032","volume":"306","author":"D Fleckenstein","year":"2023","unstructured":"Fleckenstein D, Klein R, Steinhardt C (2023) Recent advances in integrating demand management and vehicle routing: A methodological review. Eur J Oper Res 306(2):499\u2013518","journal-title":"Eur J Oper Res"},{"key":"847_CR15","doi-asserted-by":"publisher","unstructured":"Gaul D, Klamroth K, Stiglmayr M (2021) Solving the Dynamic Dial-a-Ride Problem Using a Rolling-Horizon Event-Based Graph. In: M\u00fcller-Hannemann M, Perea F (eds) 21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021), Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, Open Access Series in Informatics (OASIcs), vol\u00a096, pp 8:1\u20138:1https:\/\/doi.org\/10.4230\/OASIcs.ATMOS.2021.8","DOI":"10.4230\/OASIcs.ATMOS.2021.8"},{"issue":"2","key":"847_CR16","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.ejor.2024.09.028","volume":"321","author":"D Gaul","year":"2025","unstructured":"Gaul D, Klamroth K, Pfeiffer C, Stiglmayr M, Schulz A (2025) A tight formulation for the dial-a-ride problem. Eur J Oper Res 321(2):363\u2013382","journal-title":"Eur J Oper Res"},{"key":"847_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.tbs.2023.100616","volume":"33","author":"N Ger\u017eini\u010d","year":"2023","unstructured":"Ger\u017eini\u010d N, Cats O, van Oort N, Hoogendoorn-Lanser S, Bierlaire M, Hoogendoorn S (2023) An instance-based learning approach for evaluating the perception of ride-hailing waiting time variability. Travel Behaviour and Society 33:100616","journal-title":"Travel Behaviour and Society"},{"issue":"1","key":"847_CR18","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1287\/opre.1120.1127","volume":"61","author":"JC Goodson","year":"2013","unstructured":"Goodson JC, Ohlmann JW, Thomas BW (2013) Rollout policies for dynamic solutions to the multivehicle routing problem with stochastic demand and duration limits. Oper Res 61(1):138\u2013154","journal-title":"Oper Res"},{"issue":"2","key":"847_CR19","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1287\/trsc.2018.0837","volume":"53","author":"T Gschwind","year":"2019","unstructured":"Gschwind T, Drexl M (2019) Adaptive large neighborhood search with a constant-time feasibility test for the dial-a-ride problem. Transp Sci 53(2):480\u2013491","journal-title":"Transp Sci"},{"key":"847_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejtl.2024.100134","volume":"13","author":"J Haferkamp","year":"2024","unstructured":"Haferkamp J (2024) Design of multi-optional pickup time offers in ride-sharing systems. EURO Journal on Transportation and Logistics 13:100134","journal-title":"EURO Journal on Transportation and Logistics"},{"issue":"2","key":"847_CR21","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s12469-015-0101-z","volume":"7","author":"CH H\u00e4ll","year":"2015","unstructured":"H\u00e4ll CH, Lundgren JT, Vo\u00df S (2015) Evaluating the performance of a dial-a-ride service using simulation. Public Transport 7(2):139\u2013157. https:\/\/doi.org\/10.1007\/s12469-015-0101-z","journal-title":"Public Transport"},{"issue":"3","key":"847_CR22","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1287\/inte.1080.0379","volume":"39","author":"T Hanne","year":"2009","unstructured":"Hanne T, Melo T, Nickel S (2009) Bringing robustness to patient flow management through optimized patient transports in hospitals. INFORMS Journal on Applied Analytics 39(3):241\u201325. https:\/\/doi.org\/10.1287\/inte.1080.0379","journal-title":"INFORMS Journal on Applied Analytics"},{"key":"847_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejtl.2023.100104","volume":"12","author":"RJO Heitmann","year":"2023","unstructured":"Heitmann RJO, Soeffker N, Ulmer MW, Mattfeld DC (2023) Combining value function approximation and multiple scenario approach for the effective management of ride-hailing services. EURO Journal on Transportation and Logistics 12:100104","journal-title":"EURO Journal on Transportation and Logistics"},{"key":"847_CR24","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. Transportation Research Part B Methodological 111:395\u2013421. https:\/\/doi.org\/10.1016\/j.trb.2018.02.001","journal-title":"Transportation Research Part B Methodological"},{"key":"847_CR25","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.trb.2014.09.011","volume":"70","author":"H Hosni","year":"2014","unstructured":"Hosni H, Naoum-Sawaya J, Artail H (2014) The shared-taxi problem: Formulation and solution methods. Transportation Research Part B Methodological 70:303\u2013318","journal-title":"Transportation Research Part B Methodological"},{"key":"847_CR26","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/j.trpro.2017.12.046","volume":"27","author":"P Hungerl\u00e4nder","year":"2017","unstructured":"Hungerl\u00e4nder P, Rendl A, Truden C (2017) On the slot optimization problem in on-line vehicle routing. Transportation Research Procedia 27:492\u2013499","journal-title":"Transportation Research Procedia"},{"issue":"2","key":"847_CR27","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1287\/trsc.1050.0114","volume":"40","author":"S Ichoua","year":"2006","unstructured":"Ichoua S, Gendreau M, Potvin JY (2006) Exploiting knowledge about future demands for real-time vehicle dispatching. Transp Sci 40(2):211\u201322. https:\/\/doi.org\/10.1287\/trsc.1050.0114","journal-title":"Transp Sci"},{"key":"847_CR28","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.trb.2018.12.006","volume":"120","author":"S Illgen","year":"2019","unstructured":"Illgen S, H\u00f6ck M (2019) Literature review of the vehicle relocation problem in one-way car sharing networks. Transportation Research Part B Methodological 120:193\u201320. https:\/\/doi.org\/10.1016\/j.trb.2018.12.006","journal-title":"Transportation Research Part B Methodological"},{"key":"847_CR29","unstructured":"ioki GmbH (2024) ioki \u2014 digital public transport. https:\/\/ioki.com\/en\/home\/ (accessed January 18, 2024)"},{"issue":"9","key":"847_CR30","doi-asserted-by":"publisher","first-page":"1066","DOI":"10.1080\/19427867.2022.2129209","volume":"15","author":"JCFYL Chu","year":"2023","unstructured":"Chu JCFYL, Lin HC, Yu YH (2023) Dynamic repositioning problem of dockless electric scooter sharing systems. Transportation Letters 15(9):1066\u2013108. https:\/\/doi.org\/10.1080\/19427867.2022.2129209","journal-title":"Transportation Letters"},{"issue":"3","key":"847_CR31","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0191-2615(86)90020-2","volume":"20","author":"JJ Jaw","year":"1986","unstructured":"Jaw JJ, Odoni AR, Psaraftis HN, Wilson NH (1986) A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transportation Research Part B Methodological 20(3):243\u2013257. https:\/\/doi.org\/10.1016\/0191-2615(86)90020-2","journal-title":"Transportation Research Part B Methodological"},{"key":"847_CR32","doi-asserted-by":"publisher","DOI":"10.1002\/SERIES1345","author":"L Kaufman","year":"1990","unstructured":"Kaufman L, Rousseeuw PJ (1990) Finding Groups in Data: An Introduction to Cluster Analysis. Wiley Series in Probability and Statistics Wiley. https:\/\/doi.org\/10.1002\/SERIES1345","journal-title":"Wiley Series in Probability and Statistics Wiley"},{"issue":"5","key":"847_CR33","doi-asserted-by":"publisher","first-page":"2280","DOI":"10.1109\/TKDE.2020.3006084","volume":"34","author":"J Ke","year":"2020","unstructured":"Ke J, Xiao F, Yang H, Ye J (2020) Learning to delay in ride-sourcing systems: A multi-agent deep reinforcement learning framework. IEEE Trans Knowl Data Eng 34(5):2280\u20132292","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"847_CR34","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1287\/trsc.2017.0738","volume":"53","author":"R Klein","year":"2019","unstructured":"Klein R, Neugebauer M, Ratkovitch D, Steinhardt C (2019) Differentiated time slot pricing under routing considerations in attended home delivery. Transp Sci 53(1):236\u2013255","journal-title":"Transp Sci"},{"issue":"2","key":"847_CR35","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1016\/j.ejor.2022.09.011","volume":"307","author":"V Klein","year":"2023","unstructured":"Klein V, Steinhardt C (2023) Dynamic demand management and online tour planning for same-day delivery. Eur J Oper Res 307(2):860\u2013886","journal-title":"Eur J Oper Res"},{"issue":"2","key":"847_CR36","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/j.ejor.2020.04.002","volume":"287","author":"S Koch","year":"2020","unstructured":"Koch S, Klein R (2020) Route-based approximate dynamic programming for dynamic pricing in attended home delivery. Eur J Oper Res 287(2):633\u2013652","journal-title":"Eur J Oper Res"},{"key":"847_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2020.102305","volume":"102","author":"MA Lang","year":"2021","unstructured":"Lang MA, Cleophas C, Ehmke JF (2021) Multi-criteria decision making in dynamic slotting for attended home deliveries. Omega 102:102305","journal-title":"Omega"},{"key":"847_CR38","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1016\/j.trc.2018.09.022","volume":"105","author":"Y Liu","year":"2019","unstructured":"Liu Y, Bansal P, Daziano R, Samaranayake S (2019) A framework to integrate mode choice in the design of mobility-on-demand systems. Transportation Research Part C Emerging Technologies 105:648\u2013665","journal-title":"Transportation Research Part C Emerging Technologies"},{"issue":"1","key":"847_CR39","doi-asserted-by":"publisher","first-page":"59","DOI":"10.3141\/2218-07","volume":"2218","author":"Y Luo","year":"2011","unstructured":"Luo Y, Schonfeld P (2011) Online rejected-reinsertion heuristics for dynamic multivehicle dial-a-ride problem. Transportation Research Record Journal of the Transportation Research Board 2218(1):59\u20136. https:\/\/doi.org\/10.3141\/2218-07","journal-title":"Transportation Research Record Journal of the Transportation Research Board"},{"issue":"2","key":"847_CR40","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1287\/opre.2021.2178","volume":"70","author":"H Ma","year":"2022","unstructured":"Ma H, Fang F, Parkes DC (2022) Spatio-temporal pricing for ridesharing platforms. Oper Res 70(2):1025\u20131041","journal-title":"Oper Res"},{"key":"847_CR41","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.cie.2019.01.048","volume":"129","author":"J Mackert","year":"2019","unstructured":"Mackert J (2019) Choice-based dynamic time slot management in attended home delivery. Computers & Industrial Engineering 129:333\u2013345","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"847_CR42","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02031946","volume":"60","author":"OBG Madsen","year":"1995","unstructured":"Madsen OBG, Ravn HF, Rygaard JM (1995) A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Ann Oper Res 60(1):193\u201320. https:\/\/doi.org\/10.1007\/BF02031946","journal-title":"Ann Oper Res"},{"key":"847_CR43","unstructured":"MOIA GmbH (2024) Ride the mobility of tomorrow. https:\/\/www.moia.io\/en (accessed January 18, 2024)"},{"key":"847_CR44","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.conengprac.2014.07.004","volume":"32","author":"A N\u00fa\u00f1ez","year":"2014","unstructured":"N\u00fa\u00f1ez A, Cort\u00e9s CE, S\u00e1ez D, de Schutter B, Gendreau M (2014) Multiobjective model predictive control for dynamic pickup and delivery problems. Control Eng Pract 32:73\u201386. https:\/\/doi.org\/10.1016\/j.conengprac.2014.07.004","journal-title":"Control Eng Pract"},{"key":"847_CR45","unstructured":"Padam Mobility (2024) Demand responsive transport \u2014 reinvented. https:\/\/padam-mobility.com\/en\/ (accessed January 18, 2024)"},{"key":"847_CR46","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s00291-021-00656-7","volume":"44","author":"C Pfeiffer","year":"2022","unstructured":"Pfeiffer C, Schulz A (2022) An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization. OR Spectrum 44:87\u2013119","journal-title":"OR Spectrum"},{"key":"847_CR47","doi-asserted-by":"crossref","unstructured":"Pfeiffer C, Schulz A (2022b) A new lower bound for the static dial-a-ride problem with ride and waiting time minimization. In: International Conference on Dynamics in Logistics, Springer, pp 231\u2013243","DOI":"10.1007\/978-3-031-05359-7_19"},{"key":"847_CR48","volume-title":"Reinforcement Learning and Stochastic Optimization \u2013 A unified framework for sequential decisions","author":"WB Powell","year":"2019","unstructured":"Powell WB (2019) Reinforcement Learning and Stochastic Optimization \u2013 A unified framework for sequential decisions. John Wiley & Sons, Hoboken, New Jersey"},{"key":"847_CR49","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1109\/OJITS.2022.3148574","volume":"3","author":"WB Powell","year":"2022","unstructured":"Powell WB (2022) Designing lookahead policies for sequential decision problems in transportation and logistics. IEEE Open Journal of Intelligent Transportation Systems 3:313\u2013327","journal-title":"IEEE Open Journal of Intelligent Transportation Systems"},{"issue":"4","key":"847_CR50","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.tra.2008.01.018","volume":"42","author":"L Quadrifoglio","year":"2008","unstructured":"Quadrifoglio L, Dessouky MM, Ord\u00f3\u00f1ez F (2008) A simulation study of demand responsive transit system design. Transportation Research Part A Policy and Practice 42(4):718\u201373. https:\/\/doi.org\/10.1016\/j.tra.2008.01.018","journal-title":"Transportation Research Part A Policy and Practice"},{"issue":"2","key":"847_CR51","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1287\/ijoc.4.2.146","volume":"4","author":"MW Savelsbergh","year":"1992","unstructured":"Savelsbergh MW (1992) The vehicle routing problem with time windows: Minimizing route duration. ORSA J Comput 4(2):146\u2013154","journal-title":"ORSA J Comput"},{"key":"847_CR52","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.trc.2018.04.007","volume":"91","author":"HR Sayarshad","year":"2018","unstructured":"Sayarshad HR, Gao HO (2018) A scalable non-myopic dynamic dial-a-ride and pricing problem for competitive on-demand mobility systems. Transportation Research Part C Emerging Technologies 91:192\u2013208","journal-title":"Transportation Research Part C Emerging Technologies"},{"issue":"12","key":"847_CR53","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1016\/j.cor.2011.02.006","volume":"38","author":"M Schilde","year":"2011","unstructured":"Schilde M, Doerner KF, Hartl RF (2011) Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports. Computers & Operations Research 38(12):1719\u2013173. https:\/\/doi.org\/10.1016\/j.cor.2011.02.006","journal-title":"Computers & Operations Research"},{"issue":"3","key":"847_CR54","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1016\/j.ejor.2011.10.043","volume":"219","author":"V Schmid","year":"2012","unstructured":"Schmid V (2012) Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming. Eur J Oper Res 219(3):611\u2013621","journal-title":"Eur J Oper Res"},{"key":"847_CR55","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2023.103394","volume":"181","author":"A Schulz","year":"2024","unstructured":"Schulz A, Pfeiffer C (2024) A branch-and-cut algorithm for the dial-a-ride problem with incompatible customer types. Transportation Research Part E Logistics and Transportation Review 181:103394","journal-title":"Transportation Research Part E Logistics and Transportation Review"},{"issue":"2","key":"847_CR56","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.ejor.2023.07.002","volume":"312","author":"A Schulz","year":"2024","unstructured":"Schulz A, Pfeiffer C (2024) Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems. Eur J Oper Res 312(2):456\u2013472","journal-title":"Eur J Oper Res"},{"key":"847_CR57","doi-asserted-by":"crossref","unstructured":"Shah S, Lowalekar M, Varakantham P (2020) Neural approximate dynamic programming for on-demand ride-pooling. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol 34(01), pp 507\u2013515","DOI":"10.1609\/aaai.v34i01.5388"},{"key":"847_CR58","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.tra.2013.01.032","volume":"49","author":"PK Sheridan","year":"2013","unstructured":"Sheridan PK, Gluck E, Guan Q, Pickles T, Balc\u0131og B, Benhabib B (2013) The dynamic nearest neighbor policy for the multi-vehicle pick-up and delivery problem. Transportation Research Part A Policy and Practice 49:178\u2013194","journal-title":"Transportation Research Part A Policy and Practice"},{"issue":"3","key":"847_CR59","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(3):801\u2013820","journal-title":"Eur J Oper Res"},{"issue":"1","key":"847_CR60","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s11590-020-01698-6","volume":"16","author":"ALS Souza","year":"2022","unstructured":"Souza ALS, Bernardo M, Penna PHV, Pannek J, Souza MJF (2022) Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects. Optimization Letters 16(1):355\u2013374. https:\/\/doi.org\/10.1007\/s11590-020-01698-6","journal-title":"Optimization Letters"},{"key":"847_CR61","doi-asserted-by":"publisher","unstructured":"Swihart MR, Papastavrou JD (1999) A stochastic and dynamic model for the single-vehicle pick-up and delivery problem. Eur J Oper Res 114(3):447\u201346, https:\/\/doi.org\/10.1016\/S0377-2217(98)00260-4, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221798002604","DOI":"10.1016\/S0377-2217(98)00260-4"},{"key":"847_CR62","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.trb.2021.06.002","volume":"150","author":"A Tafreshian","year":"2021","unstructured":"Tafreshian A, Abdolmaleki M, Masoud N, Wang H (2021) Proactive shuttle dispatching in large-scale dynamic dial-a-ride systems. Transportation Research Part B Methodological 150:227\u201325. https:\/\/doi.org\/10.1016\/j.trb.2021.06.002","journal-title":"Transportation Research Part B Methodological"},{"issue":"4","key":"847_CR63","doi-asserted-by":"publisher","first-page":"1016","DOI":"10.1287\/trsc.2019.0958","volume":"54","author":"MW Ulmer","year":"2020","unstructured":"Ulmer MW (2020) Dynamic pricing and routing for same-day delivery. Transp Sci 54(4):1016\u20131033","journal-title":"Transp Sci"},{"issue":"1","key":"847_CR64","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.ejor.2019.04.029","volume":"285","author":"MW Ulmer","year":"2020","unstructured":"Ulmer MW, Thomas BW (2020) Meso-parametric value function approximation for dynamic customer acceptances in delivery routing. Eur J Oper Res 285(1):183\u2013195","journal-title":"Eur J Oper Res"},{"issue":"1","key":"847_CR65","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1287\/trsc.2017.0767","volume":"53","author":"MW Ulmer","year":"2019","unstructured":"Ulmer MW, Goodson JC, Mattfeld DC, Hennig M (2019) Offline-online approximate dynamic programming for dynamic vehicle routing with stochastic requests. Transp Sci 53(1):185\u2013202","journal-title":"Transp Sci"},{"issue":"2","key":"847_CR66","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 Journal on Transportation and Logistics 9(2):100008","journal-title":"EURO Journal on Transportation and Logistics"},{"key":"847_CR67","doi-asserted-by":"crossref","unstructured":"Vall\u00e9e S, Oulamara A, Cherif-Khettaf WR (2017) Maximizing the number of served requests in an online shared transport system by solving a dynamic DARP. In: International Conference on Computational Logistics, Springer, pp 64\u201378","DOI":"10.1007\/978-3-319-68496-3_5"},{"key":"847_CR68","doi-asserted-by":"crossref","unstructured":"Vall\u00e9e S, Oulamara A, Cherif-Khettaf WR (2019) Reinsertion algorithm based on destroy and repair operators for dynamic dial a ride problems. In: International Conference on Computational Science, Springer, pp 81\u201395","DOI":"10.1007\/978-3-030-22734-0_7"},{"key":"847_CR69","doi-asserted-by":"publisher","first-page":"10119","DOI":"10.1016\/j.jocs.2020.101199","volume":"47","author":"S Vall\u00e9e","year":"2020","unstructured":"Vall\u00e9e S, Oulamara A, Cherif-Khettaf WR (2020) New online reinsertion approaches for a dynamic dial-a-ride problem. Journal of Computational Science 47:10119. https:\/\/doi.org\/10.1016\/j.jocs.2020.101199","journal-title":"Journal of Computational Science"},{"key":"847_CR70","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1016\/j.trpro.2019.05.044","volume":"38","author":"X Wang","year":"2019","unstructured":"Wang X, Liu W, Yang H, Wang D, Ye J (2019) Customer behavioural modelling of order cancellation in coupled ride-sourcing and taxi markets. Transportation Research Procedia 38:853\u2013873","journal-title":"Transportation Research Procedia"},{"issue":"3","key":"847_CR71","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/j.ejor.2023.01.056","volume":"311","author":"K Wa\u00dfmuth","year":"2023","unstructured":"Wa\u00dfmuth K, K\u00f6hler C, Agatz N, Fleischmann M (2023) Demand management for attended home delivery-a literature review. Eur J Oper Res 311(3):801\u2013815","journal-title":"Eur J Oper Res"},{"issue":"2","key":"847_CR72","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1016\/j.ejor.2007.01.007","volume":"185","author":"Z Xiang","year":"2008","unstructured":"Xiang Z, Chu C, Chen H (2008) The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments. Eur J Oper Res 185(2):534\u201355. https:\/\/doi.org\/10.1016\/j.ejor.2007.01.007","journal-title":"Eur J Oper Res"},{"issue":"2","key":"847_CR73","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1287\/trsc.2014.0549","volume":"50","author":"X Yang","year":"2016","unstructured":"Yang X, Strauss AK, Currie CS, Eglese R (2016) Choice-based demand management and vehicle routing in e-fulfillment. Transp Sci 50(2):473\u2013488","journal-title":"Transp Sci"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-026-00847-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-026-00847-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-026-00847-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T17:30:20Z","timestamp":1781631020000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-026-00847-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,2]]},"references-count":73,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["847"],"URL":"https:\/\/doi.org\/10.1007\/s00291-026-00847-0","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,2]]},"assertion":[{"value":"15 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}