{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T23:01:48Z","timestamp":1779922908124,"version":"3.53.1"},"publisher-location":"Cham","reference-count":30,"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_13","type":"book-chapter","created":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T22:02:55Z","timestamp":1779919375000},"page":"185-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Search Space Reduction Through Machine Learning for\u00a0the\u00a0Electric Autonomous Dial-A-Ride Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-8291-6765","authenticated-orcid":false,"given":"Maria","family":"Bresich","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3293-177X","authenticated-orcid":false,"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-7605-8010","authenticated-orcid":false,"given":"Caspian","family":"Coleman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2123-3781","authenticated-orcid":false,"given":"Pascal","family":"Welke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2385-7886","authenticated-orcid":false,"given":"Steffen","family":"Limmer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,1]]},"reference":[{"issue":"9","key":"13_CR1","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10462-025-11267-x","volume":"58","author":"E Alanzi","year":"2025","unstructured":"Alanzi, E., Menai, M.E.B.: Solving the traveling salesman problem with machine learning: a review of recent advances and challenges. Artif. Intell. Rev. 58(9), 267 (2025)","journal-title":"Artif. Intell. Rev."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.cor.2019.03.006","volume":"107","author":"F Arnold","year":"2019","unstructured":"Arnold, F., Gendreau, M., S\u00f6rensen, K.: Efficiently solving very large-scale routing problems. Comput. Oper. Res. 107, 32\u201342 (2019)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/opre.16.3.538","volume":"16","author":"M Bellmore","year":"1968","unstructured":"Bellmore, M., Nemhauser, G.L.: The traveling salesman problem: a survey. Oper. Res. 16(3), 538\u2013558 (1968)","journal-title":"Oper. Res."},{"issue":"1","key":"13_CR4","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.: Online vehicle routing: the edge of optimization in large-scale applications. Oper. Res. 67(1), 143\u2013162 (2019)","journal-title":"Oper. Res."},{"key":"13_CR5","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":"13_CR6","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 Logist. Transp. Rev. 165, 102835 (2022)","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"13_CR7","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 Methodol. 122, 436\u2013456 (2019)","journal-title":"Transp. Res. Part B Methodol."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Bresich, M., Raidl, G., 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. Association for Computing Machinery (2024)","DOI":"10.1145\/3638529.3654057"},{"issue":"3","key":"13_CR9","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":"3","key":"13_CR10","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1023\/A:1022627411411","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes, C., Vapnik, V.: Support-vector networks. Mach. Learn. 20(3), 273\u2013297 (1995)","journal-title":"Mach. Learn."},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0377-2217(91)90319-Q","volume":"54","author":"Y Dumas","year":"1991","unstructured":"Dumas, Y., Desrosiers, J., Soumis, F.: The pickup and delivery problem with time windows. Eur. J. Oper. Res. 54(1), 7\u201322 (1991)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"13_CR12","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/PL00009293","volume":"17","author":"D Eppstein","year":"1997","unstructured":"Eppstein, D., Paterson, M.S., Yao, F.F.: On nearest-neighbor graphs. Discret. Comput. Geom. 17(3), 263\u2013282 (1997)","journal-title":"Discret. Comput. Geom."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Fitzpatrick, J., Ajwani, D., Carroll, P.: Learning to sparsify travelling salesman problem instances. In: Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 410\u2013426. Springer (2021)","DOI":"10.1007\/978-3-030-78230-6_26"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Fitzpatrick, J., Ajwani, D., Carroll, P.: Learning to prune electric vehicle routing problems. In: Sellmann, M., Tierney, K. (eds.) International Conference on Learning and Intelligent Optimization, pp. 378\u2013392. Springer (2023)","DOI":"10.1007\/978-3-031-44505-7_26"},{"issue":"5","key":"13_CR15","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1214\/aos\/1013203451","volume":"29","author":"JH Friedman","year":"2001","unstructured":"Friedman, J.H.: Greedy function approximation: a gradient boosting machine. Ann. Stat. 29(5), 1189\u20131232 (2001)","journal-title":"Ann. Stat."},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Grinsztajn, L., Oyallon, E., Varoquaux, G.: Why do tree-based models still outperform deep learning on typical tabular data? In: Proceedings of the 36th International Conference on Neural Information Processing Systems. Curran Associates Inc. (2022)","DOI":"10.52202\/068431-0037"},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the lin\u2013kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Kool, W., van Hoof, H., Gromicho, J., Welling, M.: Deep policy dynamic programming for vehicle routing problems. In: Schaus, P. (ed.) Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 190\u2013213. Springer (2022)","DOI":"10.1007\/978-3-031-08011-1_14"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Lauri, J., Dutta, S.: Fine-grained search space classification for hard enumeration variants of subset problems. In: AAAI Conference on Artificial Intelligence, pp. 2314\u20132321. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33012314"},{"issue":"2","key":"13_CR20","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10732-023-09512-z","volume":"29","author":"J Lauri","year":"2023","unstructured":"Lauri, J., Dutta, S., Grassia, M., Ajwani, D.: Learning fine-grained search space pruning and heuristics for combinatorial optimization. J. Heuristics 29(2), 313\u2013347 (2023)","journal-title":"J. Heuristics"},{"key":"13_CR21","volume":"21","author":"S Limmer","year":"2023","unstructured":"Limmer, S.: Bilevel large neighborhood search for the electric autonomous dial-a-ride problem. Transp. Res. Interdisc. Perspect. 21, 100876 (2023)","journal-title":"Transp. Res. Interdisc. Perspect."},{"issue":"2","key":"13_CR22","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"13_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2024.103011","volume":"186","author":"Y Su","year":"2024","unstructured":"Su, Y., Dupin, N., Parragh, S.N., Puchinger, J.: A branch-and-price algorithm for the electric autonomous dial-a-ride problem. Transp. Res. Part B Methodol. 186, 103011 (2024)","journal-title":"Transp. Res. Part B Methodol."},{"issue":"3","key":"13_CR24","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."},{"issue":"3","key":"13_CR25","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s00291-020-00604-x","volume":"43","author":"Y Sun","year":"2020","unstructured":"Sun, Y., Ernst, A., Li, X., Weiner, J.: Generalization of machine learning for problem reduction: a case study on travelling salesman problems. OR Spectrum 43(3), 607\u2013633 (2020)","journal-title":"OR Spectrum"},{"issue":"5","key":"13_CR26","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1109\/TPAMI.2019.2954827","volume":"43","author":"Y Sun","year":"2021","unstructured":"Sun, Y., Li, X., Ernst, A.: Using statistical measures and machine learning for graph reduction to solve maximum weight clique problems. IEEE Trans. Pattern Anal. Mach. Intell. 43(5), 1746\u20131760 (2021)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Sun, Z., Yang, Y.: Difusco: graph-based diffusion solvers for combinatorial optimization. In: Proceedings of the 37th International Conference on Neural Information Processing Systems. Curran Associates Inc. (2023)","DOI":"10.52202\/075280-0164"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Tian, H., Medya, S., Ye, W.: COMBHELPER: a neural approach to reduce search space for graph combinatorial problems. In: AAAI Conference on Artificial Intelligence, pp. 20812\u201320820. AAAI Press (2024)","DOI":"10.1609\/aaai.v38i18.30070"},{"key":"13_CR29","unstructured":"Williams, C., Seeger, M.: Using the nystr\u00f6m method to speed up kernel machines. In: Proceedings of the 13th International Conference on Neural Information Processing Systems, pp. 661\u2013667. MIT Press (2000)"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Zhang, S., Yang, Y., Tong, H., Yao, X.: Learning-based problem reduction for large-scale uncapacitated facility location problems. In: IEEE Congress on Evolutionary Computation, pp. 1\u20138. IEEE (2024)","DOI":"10.1109\/CEC60901.2024.10611785"}],"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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T22:02:57Z","timestamp":1779919377000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-21480-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032214799","9783032214805"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-21480-5_13","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"}}]}}