{"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":1786979962340,"version":"3.56.0"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,11,5]],"date-time":"2021-11-05T00:00:00Z","timestamp":1636070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,11,5]],"date-time":"2021-11-05T00:00:00Z","timestamp":1636070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Hamburger Behorde fur Wissenschaft, Forschung, Gleichstellung und Bezirke"},{"DOI":"10.13039\/501100005711","name":"Universit\u00e4t Hamburg","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005711","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2022,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The paper investigates the static dial-a-ride problem with ride and waiting time minimization. This is a new problem setting of significant practical relevance because several ride-sharing providers launched in recent years in large European cities. In contrast to the standard dial-a-ride problem, these providers focus on the general public. Therefore, they are amongst others in competition with taxis and private cars, which makes a more customer-oriented objective necessary. We present an adaptive large neighbourhood search (ALNS) as well as a dynamic programming algorithm (DP), which are tested in comprehensive computational studies. Although the DP can only be used for a single tour and, due to the computational effort, as a restricted version or for small instances, the ALNS also works efficiently for larger instances. The results indicate that ride-sharing proposals may help to solve the trade-off between individual transport, profitability of the provider, and reduction of traffic and pollution.<\/jats:p>","DOI":"10.1007\/s00291-021-00656-7","type":"journal-article","created":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T21:02:30Z","timestamp":1636059750000},"page":"87-119","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7294-6984","authenticated-orcid":false,"given":"Christian","family":"Pfeiffer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3088-2820","authenticated-orcid":false,"given":"Arne","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,11,5]]},"reference":[{"key":"656_CR1","doi-asserted-by":"crossref","unstructured":"Atahran A, Lent\u00e9 C, T\u2019kindt V, (2014) A multicriteria dial-a-ride problem with an ecological measure and heterogeneous vehicles. J Multi-Criteria Decis Anal 21(5-6):279\u2013298","DOI":"10.1002\/mcda.1518"},{"issue":"2","key":"656_CR2","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/opre.1100.0881","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci R, Bartolini E, Mingozzi A (2011) An exact algorithm for the pickup and delivery problem with time windows. Oper Res 59(2):414\u2013426","journal-title":"Oper Res"},{"issue":"2","key":"656_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1080\/03052159808941240","volume":"30","author":"JW Baugh","year":"1998","unstructured":"Baugh JW, Kakivaya GKR, Stone JR (1998) Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing. Eng Optim 30(2):91\u2013123","journal-title":"Eng Optim"},{"issue":"1","key":"656_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R Bellman","year":"1962","unstructured":"Bellman R (1962) Dynamic programming treatment of the travelling salesman problem. J ACM 9(1):61\u201363","journal-title":"J ACM"},{"key":"656_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.procs.2016.04.121","volume":"83","author":"J Bischoff","year":"2016","unstructured":"Bischoff J, Maciejewski M (2016) Simulation of city-wide replacement of private cars with autonomous taxis in Berlin. Procedia Comput Sci 83:237\u2013244","journal-title":"Procedia Comput Sci"},{"issue":"4","key":"656_CR6","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1016\/j.asoc.2011.12.014","volume":"12","author":"R Chevrier","year":"2012","unstructured":"Chevrier R, Liefooghe A, Jourdan L, Dhaenens C (2012) Solving a dial-a-ride problem with a hybrid multi-objective evolutionary approach: application to demand responsive transport. Appl Soft Comput 12(4):1247\u20131258","journal-title":"Appl Soft Comput"},{"issue":"3","key":"656_CR7","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1287\/opre.1060.0283","volume":"54","author":"JF Cordeau","year":"2006","unstructured":"Cordeau JF (2006) A branch-and-cut algorithm for the dial-a-ride problem. Oper Res 54(3):573\u2013586","journal-title":"Oper Res"},{"issue":"6","key":"656_CR8","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/S0191-2615(02)00045-0","volume":"37","author":"JF Cordeau","year":"2003","unstructured":"Cordeau JF, Laporte G (2003) A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp Res Part B Methodol 37(6):579\u2013594","journal-title":"Transp Res Part B Methodol"},{"issue":"1","key":"656_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","volume":"153","author":"JF Cordeau","year":"2007","unstructured":"Cordeau JF, Laporte G (2007) The dial-a-ride problem: models and algorithms. Ann Oper Res 153(1):29\u201346","journal-title":"Ann Oper Res"},{"issue":"2","key":"656_CR10","doi-asserted-by":"publisher","first-page":"127","DOI":"10.15837\/ijccc.2009.2.2420","volume":"4","author":"C Cubillos","year":"2014","unstructured":"Cubillos C, Urra E, Rodr\u00edguez N (2014) Application of genetic algorithms for the darptw problem. Int J Comput Commun Control 4(2):127","journal-title":"Int J Comput Commun Control"},{"key":"656_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.omega.2016.08.008","volume":"70","author":"P Detti","year":"2017","unstructured":"Detti P, Papalini F, de Lara GZM (2017) A multi-depot dial-a-ride problem with heterogeneous vehicles and compatibility constraints in healthcare. Omega 70:1\u201314","journal-title":"Omega"},{"issue":"6","key":"656_CR12","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/j.trb.2003.07.001","volume":"38","author":"M Diana","year":"2004","unstructured":"Diana M, Dessouky MM (2004) A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transp Res Part B: Methodol 38(6):539\u2013557","journal-title":"Transp Res Part B: Methodol"},{"issue":"2","key":"656_CR13","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.ejor.2016.04.065","volume":"255","author":"V Fran\u00e7ois","year":"2016","unstructured":"Fran\u00e7ois V, Arda Y, Crama Y, Laporte G (2016) Large neighborhood search for multi-trip vehicle routing. Eur J Oper Res 255(2):422\u2013441","journal-title":"Eur J Oper Res"},{"issue":"2","key":"656_CR14","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"},{"issue":"2","key":"656_CR15","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1287\/trsc.2014.0531","volume":"49","author":"T Gschwind","year":"2015","unstructured":"Gschwind T, Irnich S (2015) Effective handling of dynamic time windows and its applications to solving the dial-a-ride problem. Transp Sci 49(2):335\u2013354","journal-title":"Transp Sci"},{"issue":"9","key":"656_CR16","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1016\/j.dam.2011.01.021","volume":"159","author":"G Heilporn","year":"2011","unstructured":"Heilporn G, Cordeau JF, Laporte G (2011) An integer l-shaped algorithm for the dial-a-ride problem with stochastic customer delays. Discret Appl Math 159(9):883\u2013895","journal-title":"Discret Appl Math"},{"issue":"1","key":"656_CR17","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M Held","year":"1962","unstructured":"Held M, Karp RM (1962) A dynamic programming approach to sequencing problems. J Soc Ind Appl Math 10(1):196\u2013210","journal-title":"J Soc Ind Appl Math"},{"key":"656_CR18","doi-asserted-by":"publisher","first-page":"3215","DOI":"10.1016\/j.cor.2012.04.007","volume":"39","author":"VC Hemmelmayr","year":"2012","unstructured":"Hemmelmayr VC, Cordeau JF, Crainic TG (2012) An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Comput Oper Res 39:3215\u20133228","journal-title":"Comput Oper Res"},{"key":"656_CR19","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 JMY, Petering M, Tou TWH (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"},{"issue":"3","key":"656_CR20","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0167-6377(02)00120-7","volume":"30","author":"B Hunsaker","year":"2002","unstructured":"Hunsaker B, Savelsbergh M (2002) Efficient feasibility testing for dial-a-ride problems. Oper Res Lett 30(3):169\u2013173","journal-title":"Oper Res Lett"},{"key":"656_CR21","unstructured":"ioki GmbH (2020) ioki \u2013 inspiring smart mobility. https:\/\/ioki.com\/en\/home\/. Accessed Sep 27, 2021"},{"issue":"3","key":"656_CR22","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. Transp Res Part B Methodol 20(3):243\u2013257","journal-title":"Transp Res Part B Methodol"},{"issue":"10","key":"656_CR23","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1057\/palgrave.jors.2602287","volume":"58","author":"RM Jorgensen","year":"2007","unstructured":"Jorgensen RM, Larsen J, Bergvinsdottir KB (2007) Solving the dial-a-ride problem using genetic algorithms. J Oper Res Soc 58(10):1321\u20131331","journal-title":"J Oper Res Soc"},{"issue":"4598","key":"656_CR24","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"issue":"1","key":"656_CR25","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal JB (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. Proc Am Math Soc 7(1):48\u201350","journal-title":"Proc Am Math Soc"},{"issue":"1","key":"656_CR26","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1080\/03081060.2012.635414","volume":"35","author":"JD Lees-Miller","year":"2012","unstructured":"Lees-Miller JD, Wilson RE (2012) Proactive empty vehicle redistribution for personal rapid transit and taxis. Transp Plan Technol 35(1):17\u201330","journal-title":"Transp Plan Technol"},{"issue":"7","key":"656_CR27","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1057\/jors.2013.17","volume":"65","author":"F Lehu\u00e9d\u00e9","year":"2014","unstructured":"Lehu\u00e9d\u00e9 F, Masson R, Parragh SN, P\u00e9ton O, Tricoire F (2014) A multi-criteria large neighbourhood search for the transportation of disabled people. J Oper Res Soc 65(7):983\u20131000","journal-title":"J Oper Res Soc"},{"key":"656_CR28","first-page":"43","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez M, Dubois-Lacoste J, P\u00e9rez C\u00e1ceres L, Birattari M, St\u00fctzle T (2016) The irace package: iterated racing for automatic algorithm configuration. Oper Res Perspect 3:43\u201358","journal-title":"Oper Res Perspect"},{"issue":"1","key":"656_CR29","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0377-2217(94)00299-1","volume":"90","author":"C Malandraki","year":"1996","unstructured":"Malandraki C, Dial RB (1996) A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem. Eur J Oper Res 90(1):45\u201355","journal-title":"Eur J Oper Res"},{"key":"656_CR30","unstructured":"GmbH MOIA (2020) Our reunion begins here. https:\/\/www.moia.io\/en. Accessed Sep 27, 2021"},{"key":"656_CR31","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tre.2017.09.001","volume":"107","author":"Y Molenbruch","year":"2017","unstructured":"Molenbruch Y, Braekers K, Caris A (2017a) Benefits of horizontal cooperation in dial-a-ride services. Transp Res Part E 107:97\u2013119","journal-title":"Transp Res Part E"},{"key":"656_CR32","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.cor.2016.07.020","volume":"77","author":"Y Molenbruch","year":"2017","unstructured":"Molenbruch Y, Braekers K, Caris A, den Berghe GV (2017b) Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation. Comput Oper Res 77:58\u201371","journal-title":"Comput Oper Res"},{"key":"656_CR33","doi-asserted-by":"publisher","first-page":"5516","DOI":"10.1016\/j.eswa.2013.04.015","volume":"40","author":"S Muelas","year":"2013","unstructured":"Muelas S, LaTorre A, Pe\u00f1a JM (2013) A variable neighborhood search algorithm for the optimization of a dial-a-ride problem in a large city. Expert Syst Appl 40:5516\u20135531","journal-title":"Expert Syst Appl"},{"issue":"6","key":"656_CR34","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1016\/S0305-0483(00)00019-0","volume":"28","author":"W Nie","year":"2000","unstructured":"Nie W (2000) Waiting: integrating social and psychological perspectives in operations management. Omega 28(6):611\u2013629","journal-title":"Omega"},{"key":"656_CR35","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1080\/03081068008717184","volume":"6","author":"P Oxley","year":"1980","unstructured":"Oxley P (1980) Dial\/a\/ride: a review. Transp Plan Technol 6:141\u2013148","journal-title":"Transp Plan Technol"},{"issue":"2","key":"656_CR36","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","volume":"58","author":"SN Parragh","year":"2008","unstructured":"Parragh SN, Doerner KF, Hartl RF (2008) A survey on pickup and delivery models: Part II: transportation between pickup and delivery locations. J Betriebswirtschaft 58(2):81\u2013117","journal-title":"J Betriebswirtschaft"},{"issue":"4","key":"656_CR37","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1002\/net.20335","volume":"54","author":"SN Parragh","year":"2009","unstructured":"Parragh SN, Doerner KF, Hartl RF, Gandibleux X (2009) A heuristic two-phase solution approach for the multi-objective dial-a-ride problem. Networks 54(4):227\u2013242","journal-title":"Networks"},{"issue":"6","key":"656_CR38","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1016\/j.cor.2009.10.003","volume":"37","author":"SN Parragh","year":"2010","unstructured":"Parragh SN, Doerner KF, Hartl RF (2010) Variable neighborhood search for the dial-a-ride problem. Comput Oper Res 37(6):1129\u20131138","journal-title":"Comput Oper Res"},{"issue":"2","key":"656_CR39","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1287\/trsc.2014.0520","volume":"49","author":"SN Parragh","year":"2015","unstructured":"Parragh SN, Pinho de Sousa J, Almada-Lobo B (2015) The dial-a-ride problem with split requests and profits. Transp Sci 49(2):311\u2013334","journal-title":"Transp Sci"},{"key":"656_CR40","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34:2403\u20132435","journal-title":"Comput Oper Res"},{"issue":"2","key":"656_CR41","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/trsc.14.2.130","volume":"14","author":"HN Psaraftis","year":"1980","unstructured":"Psaraftis HN (1980) A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transp Sci 14(2):130\u2013154","journal-title":"Transp Sci"},{"issue":"3","key":"656_CR42","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1287\/trsc.17.3.351","volume":"17","author":"HN Psaraftis","year":"1983","unstructured":"Psaraftis HN (1983) An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transp Sci 17(3):351\u2013357","journal-title":"Transp Sci"},{"issue":"1","key":"656_CR43","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.ejor.2012.09.008","volume":"225","author":"LB Reinhardt","year":"2013","unstructured":"Reinhardt LB, Clausen T, Pisinger D (2013) Synchronized dial-a-ride transportation of disabled passengers at airports. Eur J Oper Res 225(1):106\u2013117","journal-title":"Eur J Oper Res"},{"issue":"2","key":"656_CR44","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10479-014-1605-7","volume":"236","author":"U Ritzinger","year":"2016","unstructured":"Ritzinger U, Puchinger J, Hartl RF (2016) Dynamic programming based metaheuristics for the dial-a-ride problem. Ann Oper Res 236(2):341\u2013358","journal-title":"Ann Oper Res"},{"issue":"4","key":"656_CR45","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke S, Pisinger D (2006a) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40(4):455\u2013472","journal-title":"Transp Sci"},{"key":"656_CR46","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/j.ejor.2004.09.004","volume":"171","author":"S Ropke","year":"2006","unstructured":"Ropke S, Pisinger D (2006b) A unified heuristic for a large class of vehicle routing problems with backhauls. Eur J Oper Res 171:750\u2013775","journal-title":"Eur J Oper Res"},{"issue":"4","key":"656_CR47","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1002\/net.20177","volume":"49","author":"S Ropke","year":"2007","unstructured":"Ropke S, Cordeau JF, Laporte G (2007) Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 49(4):258\u2013272","journal-title":"Networks"},{"issue":"12","key":"656_CR48","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. Comput Oper Res 38(12):1719\u20131730","journal-title":"Comput Oper Res"},{"issue":"1","key":"656_CR49","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.ejor.2021.01.029","volume":"294","author":"A Schulz","year":"2021","unstructured":"Schulz A (2021) The balanced maximally diverse grouping problem with block constraints. Eur J Oper Res 294(1):42\u201353","journal-title":"Eur J Oper Res"},{"issue":"4","key":"656_CR50","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/trsc.19.4.378","volume":"19","author":"TR Sexton","year":"1985","unstructured":"Sexton TR, Bodin LD (1985) Optimizing single vehicle many-to-many operations with desired delivery times: I. Scheduling. Transp Sci 19(4):378\u2013410","journal-title":"Transp Sci"},{"key":"656_CR51","unstructured":"Shaw P (1997) A new local search algorithm providing high quality solutions to vehicle routing problems. Department of Computer Science, University of Strathclyde, Scotland, Tech. rep"},{"key":"656_CR52","doi-asserted-by":"crossref","unstructured":"Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. In: Maher M, Puget J-F (1998) Principles and practice of constraint programming - CP98, LNCS 1520. Springer, pp 417\u2013431","DOI":"10.1007\/3-540-49481-2_30"},{"issue":"5","key":"656_CR53","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.orl.2010.05.002","volume":"38","author":"J Tang","year":"2010","unstructured":"Tang J, Kong Y, Lau H, Ip AW (2010) A note on efficient feasibility testing for dial-a-ride problems. Oper Res Lett 38(5):405\u2013407","journal-title":"Oper Res Lett"},{"key":"656_CR54","unstructured":"Technologies Uber, Inc (2020) The history of Uber. https:\/\/www.uber.com\/en-DE\/newsroom\/history\/. Accessed Sep 27, 2021"},{"key":"656_CR55","volume-title":"Telebus Berlin: vehicle scheduling in a dial-a-ride system: computer-aided transit scheduling","year":"1999","unstructured":"Wilson NH, Bornd\u00f6rfer R, Gr\u00f6tschel M, Klostermeier F, K\u00fcttner C (eds) (1999) Telebus Berlin: vehicle scheduling in a dial-a-ride system: computer-aided transit scheduling. Springer, Berlin"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-021-00656-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-021-00656-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-021-00656-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T12:13:04Z","timestamp":1675858384000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-021-00656-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,5]]},"references-count":55,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["656"],"URL":"https:\/\/doi.org\/10.1007\/s00291-021-00656-7","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,5]]},"assertion":[{"value":"19 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 2021","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"}}]}}