{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T00:07:22Z","timestamp":1779926842351,"version":"3.53.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032214799","type":"print"},{"value":"9783032214805","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-21480-5_28","type":"book-chapter","created":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T23:42:14Z","timestamp":1779925334000},"page":"425-439","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Reinforcement Learning Guided Large Neighborhood Search for\u00a0the\u00a0Dynamic Electric Autonomous Dial-a-Ride Problem"],"prefix":"10.1007","author":[{"given":"Laurenz","family":"Tomandl","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maria","family":"Bresich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yi","family":"Mei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Steffen","family":"Limmer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tobias","family":"Rodemann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,1]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106588","volume":"165","author":"C Bongiovanni","year":"2024","unstructured":"Bongiovanni, C., Geroliminis, N., Kaspi, M.: A ride time-oriented scheduling algorithm for dial-a-ride problems. Comput. Oper. Res. 165, 106588 (2024)","journal-title":"Comput. Oper. Res."},{"key":"28_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2022.102835","volume":"165","author":"C Bongiovanni","year":"2022","unstructured":"Bongiovanni, C., Kaspi, M., Cordeau, J.F., Geroliminis, N.: A machine learning-driven two-phase metaheuristic for autonomous ridesharing operations. Transp. Res. Part E 165, 102835 (2022)","journal-title":"Transp. Res. Part E"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Bongiovanni, C., Kaspi, M., Geroliminis, N.: A two phase heuristic approach for the dynamic electric autonomous dial-a-ride problem. In: 7th Symposium of the European Association for Research in Transportation (2018)","DOI":"10.1016\/j.trb.2019.03.004"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1016\/j.trb.2019.03.004","volume":"122","author":"C Bongiovanni","year":"2019","unstructured":"Bongiovanni, C., Kaspi, M., Geroliminis, N.: The electric autonomous dial-a-ride problem. Transp. Res. Part B 122, 436\u2013456 (2019)","journal-title":"Transp. Res. Part B"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Bresich, M., Raidl, G.R., Limmer, S.: Letting a large neighborhood search for an electric dial-a-ride problem fly: on-the-fly charging station insertion. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 142\u2013150. GECCO \u201924, ACM (2024)","DOI":"10.1145\/3638529.3654057"},{"issue":"1","key":"28_CR6","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","volume":"153","author":"JF Cordeau","year":"2007","unstructured":"Cordeau, J.F., Laporte, G.: The dial-a-ride problem: models and algorithms. Ann. Oper. Res. 153(1), 29\u201346 (2007)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"28_CR7","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1287\/opre.1060.0283","volume":"54","author":"JF Cordeau","year":"2006","unstructured":"Cordeau, J.F.: A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54(3), 573\u2013586 (2006)","journal-title":"Oper. Res."},{"issue":"6","key":"28_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, J.F., Laporte, G.: A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp. Res. Part B 37(6), 579\u2013594 (2003)","journal-title":"Transp. Res. Part B"},{"issue":"3","key":"28_CR9","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.: A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem. Eur. J. Oper. Res. 175(3), 1605\u20131615 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Cubillos, C., Urra, E., Rodr\u00ed\u00adguez, N.: Application of genetic algorithms for the DARPTW problem. Int. J. Comput. Commun. Control 4(2) (2009)","DOI":"10.15837\/ijccc.2009.2.2420"},{"issue":"10","key":"28_CR11","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1016\/j.cor.2010.12.014","volume":"38","author":"T Garaix","year":"2011","unstructured":"Garaix, T., Artigues, C., Feillet, D., Josselin, D.: Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation. Comput. Oper. Res. 38(10), 1435\u20131442 (2011)","journal-title":"Comput. Oper. Res."},{"key":"28_CR12","unstructured":"Gaul, D., Klamroth, K., Stiglmayr, M.: Solving the dynamic dial-a-ride problem using a rolling-horizon event-based graph. In: 21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021), pp. 8:1\u20138:16. Schloss Dagstuhl, Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"28_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106639","volume":"167","author":"RJO Heitmann","year":"2024","unstructured":"Heitmann, R.J.O., Soeffker, N., Klawonn, F., Ulmer, M.W., Mattfeld, D.C.: Accelerating value function approximations for dynamic dial-a-ride problems via dimensionality reductions. Comput. Oper. Res. 167, 106639 (2024)","journal-title":"Comput. Oper. Res."},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Ho, S.C., Szeto, W., Kuo, Y.H., Leung, J.M., Petering, M., Tou, T.W.: A survey of dial-a-ride problems: Literature review and recent developments. Trans. Res. Part\u00a0B 111(C), 395\u2013421 (2018)","DOI":"10.1016\/j.trb.2018.02.001"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Huang, W., et al.: Genetic programming hyper-heuristic for the dynamic electric dial-a-ride problem. In: IEEE Congress on Evolutionary Computation. IEEE (2025)","DOI":"10.1109\/CEC65147.2025.11042942"},{"issue":"3","key":"28_CR16","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1287\/trsc.2021.1042","volume":"56","author":"ND Kullman","year":"2022","unstructured":"Kullman, N.D., Cousineau, M., Goodson, J.C., Mendoza, J.E.: Dynamic ride-hailing with electric vehicles. Transp. Sci. 56(3), 775\u2013794 (2022)","journal-title":"Transp. Sci."},{"key":"28_CR17","volume":"21","author":"S Limmer","year":"2023","unstructured":"Limmer, S.: Bilevel large neighborhood search for the electric autonomous dial-a-ride problem. Trans. Res. Interdisc. Perspectives 21, 100876 (2023)","journal-title":"Trans. Res. Interdisc. Perspectives"},{"key":"28_CR18","unstructured":"Liu, C., Quilliot, A., Toussaint, H., Feillet, D.: A guided insertion mechanism for solving the dynamic large-scale dial-a-ride problem. In: Proceedings of the 11th International Network Optimization Conference (INOC), pp. 70\u201375 (2024)"},{"key":"28_CR19","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","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., St\u00fctzle, T., Birattari, M.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspectives 3, 43\u201358 (2016)","journal-title":"Oper. Res. Perspectives"},{"issue":"1","key":"28_CR20","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10479-017-2525-0","volume":"259","author":"Y Molenbruch","year":"2017","unstructured":"Molenbruch, Y., Braekers, K., Caris, A.: Typology and literature review for dial-a-ride problems. Ann. Oper. Res. 259(1), 295\u2013325 (2017)","journal-title":"Ann. Oper. Res."},{"key":"28_CR21","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., Vanden Berghe, G.: Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation. Comput. Oper. Res. 77, 58\u201371 (2017)","journal-title":"Comput. Oper. Res."},{"key":"28_CR22","unstructured":"NYC-Government: New York City taxi dataset (2024). https:\/\/www.nyc.gov\/site\/tlc\/about\/tlc-trip-record-data.page"},{"issue":"1","key":"28_CR23","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, A.L.: A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225(1), 1\u201311 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"28_CR24","doi-asserted-by":"crossref","unstructured":"Pisinger, D., Ropke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics, pp. 399\u2013419. Springer (2010)","DOI":"10.1007\/978-1-4419-1665-5_13"},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"Jorgensen, R.M., Bergvinsdottir, J.L., K.B.: Solving the dial-a-ride problem using genetic algorithms. J. OR Soc. 58(10), 1321\u20131331 (2007)","DOI":"10.1057\/palgrave.jors.2602287"},{"issue":"5","key":"28_CR26","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1287\/trsc.2021.1044","volume":"55","author":"Y Rist","year":"2021","unstructured":"Rist, Y., Forbes, M.A.: A new formulation for the dial-a-ride problem. Transp. Sci. 55(5), 1113\u20131135 (2021)","journal-title":"Transp. Sci."},{"issue":"2","key":"28_CR27","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, R.F.: Dynamic programming based metaheuristics for the dial-a-ride problem. Ann. Oper. Res. 236(2), 341\u2013358 (2016)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"28_CR28","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1002\/net.20177","volume":"49","author":"S Ropke","year":"2007","unstructured":"Ropke, S., Cordeau, J.F., Laporte, G.: Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 49(4), 258\u2013272 (2007)","journal-title":"Networks"},{"key":"28_CR29","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.trc.2018.04.007","volume":"91","author":"HR Sayarshad","year":"2018","unstructured":"Sayarshad, H.R., Gao, H.: A scalable non-myopic dynamic dial-a-ride and pricing problem for competitive on-demand mobility systems. Transp. Res. Part C 91, 192\u2013208 (2018)","journal-title":"Transp. Res. Part C"},{"key":"28_CR30","unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A., Klimov, O.: Proximal policy optimization algorithms (arXiv:1707.06347) (2017)"},{"issue":"3","key":"28_CR31","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1016\/j.ejor.2023.02.012","volume":"309","author":"Y Su","year":"2023","unstructured":"Su, Y., Dupin, N., Puchinger, J.: A deterministic annealing local search for the electric autonomous dial-a-ride problem. Eur. J. Oper. Res. 309(3), 1091\u20131111 (2023)","journal-title":"Eur. J. Oper. Res."},{"key":"28_CR32","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.: Proactive shuttle dispatching in large-scale dynamic dial-a-ride systems. Transp. Res. Part B 150, 227\u2013259 (2021)","journal-title":"Transp. Res. Part B"},{"key":"28_CR33","doi-asserted-by":"crossref","unstructured":"Tomandl, L., Jatschka, T., Raidl, G., Rodemann, T.: A learning two level optimization approach for the demand maximizing battery swapping station location problem. In: International Conference on Computer Aided Systems Theory, pp. 251\u2013262 (2024)","DOI":"10.1007\/978-3-031-82949-9_23"},{"key":"28_CR34","doi-asserted-by":"crossref","unstructured":"van Lon, R.R., Holvoet, T., Vanden\u00a0Berghe, G., Wenseleers, T., Branke, J.: Evolutionary synthesis of multi-agent systems for dynamic dial-a-ride problems. In: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation (GECCO \u201912), pp. 331\u2013336. ACM (2012)","DOI":"10.1145\/2330784.2330832"}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-21480-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T23:42:17Z","timestamp":1779925337000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-21480-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032214799","9783032214805"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-21480-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Artificial Intelligence Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Castiglione della Pescaia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mod2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lod2025.icas.events","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}