{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T15:56:05Z","timestamp":1784217365558,"version":"3.55.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032091918","type":"print"},{"value":"9783032091925","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-09192-5_8","type":"book-chapter","created":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T23:31:45Z","timestamp":1767310305000},"page":"113-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Hybrid Quantum-Inspired and\u00a0Deep Learning Approach for\u00a0the\u00a0Capacitated Vehicle Routing Problem with\u00a0Time Windows"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3518-6039","authenticated-orcid":false,"given":"Jorin","family":"Dornemann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4520-0167","authenticated-orcid":false,"given":"Salwa","family":"Shaglel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8009-0549","authenticated-orcid":false,"given":"Martin","family":"Kliesch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3646-3683","authenticated-orcid":false,"given":"Anusch","family":"Taraz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-15396-9_11","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"R Bent","year":"2010","unstructured":"Bent, R., Van Hentenryck, P.: Spatial, Temporal, and Hybrid Decompositions for Large-Scale Vehicle Routing with Time Windows. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 99\u2013113. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15396-9_11"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Bertsimas, D., Dunn, J.: Optimal classification trees. Machine Learning 106(7), 1039\u20131082 (2017) https:\/\/doi.org\/10.1007\/s10994-017-5633-9","DOI":"10.1007\/s10994-017-5633-9"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Bresson, X., Laurent, T.: Residual gated graph convnets. Preprint arXiv:1711.07553 (2017) https:\/\/doi.org\/10.48550\/arXiv.1711.07553","DOI":"10.48550\/arXiv.1711.07553"},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Desaulniers, G., Madsen, O.B., Ropke, S.: The vehicle routing problem with time windows. In: Toth, P., Vigo, D. (eds.) Vehicle Routing: Problems, Methods, and Applications, vol.\u00a02, pp. 119\u2013159 (2014).https:\/\/doi.org\/10.1137\/1.9781611973594.ch5","DOI":"10.1137\/1.9781611973594.ch5"},{"issue":"3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.1016\/j.ejor.2004.07.077","volume":"176","author":"R Dondo","year":"2007","unstructured":"Dondo, R., Cerd\u00e1, J.: A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. Eur. J. Oper. Res. 176(3), 1478\u20131507 (2007). https:\/\/doi.org\/10.1016\/j.ejor.2004.07.077","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Dornemann, J.: Solving the capacitated vehicle routing problem with time windows via graph convolutional network assisted tree search and quantum-inspired computing. Frontiers in Applied Mathematics and Statistics volume 9 (2023). https:\/\/doi.org\/10.3389\/fams.2023.1155356","DOI":"10.3389\/fams.2023.1155356"},{"key":"8_CR7","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2023.0103","author":"N Errami","year":"2023","unstructured":"Errami, N., Queiroga, E., Sadykov, R., Uchoa, E.: VrpSolverEasy: A python library for the exact solution of a rich vehicle routing problem. INFORMS J. Comput. (2023). https:\/\/doi.org\/10.1287\/ijoc.2023.0103","journal-title":"INFORMS J. Comput."},{"key":"8_CR8","doi-asserted-by":"publisher","unstructured":"Feld, S., Roch, C., Gabor, T., Seidel, C., Neukart, F., Galter, I., Mauerer, W., Linnhoff-Popien, C.: A hybrid solution method for the capacitated vehicle routing problem using a quantum annealer. Frontiers in ICT volume 6 (2019) https:\/\/doi.org\/10.3389\/fict.2019.00013","DOI":"10.3389\/fict.2019.00013"},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1287\/opre.22.2.340","volume":"22","author":"BE Gillett","year":"1974","unstructured":"Gillett, B.E., Miller, L.R.: A heuristic algorithm for the vehicle-dispatch problem. Oper. Res. 22(2), 340\u2013349 (1974). https:\/\/doi.org\/10.1287\/opre.22.2.340","journal-title":"Oper. Res."},{"key":"8_CR10","unstructured":"Gurobi\u00a0Optimization, L.: Gurobi optimizer reference manual (2022), https:\/\/www.gurobi.com"},{"key":"8_CR11","unstructured":"Helsgaun, K.: An extension of the lin-kernighan-helsgaun tsp solver for constrained traveling salesman and vehicle routing problems: Technical report. Roskilde Universitet (2017), http:\/\/www.akira.ruc.dk\/~keld\/research\/LKH-3\/LKH-3_REPORT.pdf"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-030-14082-3_13","volume-title":"Quantum Technology and Optimization Problems","author":"H Irie","year":"2019","unstructured":"Irie, H., Wongpaisarnsin, G., Terabe, M., Miki, A., Taguchi, S.: Quantum Annealing of Vehicle Routing Problem with Time, State and Capacity. In: Feld, S., Linnhoff-Popien, C. (eds.) QTOP 2019. LNCS, vol. 11413, pp. 145\u2013156. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-14082-3_13"},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Joshi, C.K., Laurent, T., Bresson, X.: An efficient graph convolutional network technique for the travelling salesman problem. Preprint arXiv:1906.01227 (2019) https:\/\/doi.org\/10.48550\/arXiv.1906.01227","DOI":"10.48550\/arXiv.1906.01227"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. Preprint arXiv:1412.6980v9 (2014) https:\/\/doi.org\/10.48550\/arXiv.1412.6980","DOI":"10.48550\/arXiv.1412.6980"},{"issue":"2","key":"8_CR15","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ac4d1b","volume":"7","author":"M Kowalsky","year":"2022","unstructured":"Kowalsky, M., Albash, T., Hen, I., Lidar, D.A.: 3-regular three-XORSAT planted solutions benchmark of classical and quantum heuristic optimizers. Quantum Sci. Technol. 7(2), 025008 (2022). https:\/\/doi.org\/10.1088\/2058-9565\/ac4d1b","journal-title":"Quantum Sci. Technol."},{"key":"8_CR16","doi-asserted-by":"publisher","unstructured":"Laporte, G., Semet, F.: Classical heuristics for the capacitated vrp. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem, pp. 109\u2013128 (2002).https:\/\/doi.org\/10.1137\/1.9780898718515.ch5","DOI":"10.1137\/1.9780898718515.ch5"},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Lucas, A.: Ising formulations of many np problems. Frontiers in Physics 2 (2014) https:\/\/doi.org\/10.3389\/fphy.2014.00005","DOI":"10.3389\/fphy.2014.00005"},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"Matsubara, S., Takatsu, M., Miyazawa, T., Shibasaki, T., Watanabe, Y., Takemoto, K., Tamura, H.: Digital annealer for high-speed solving of combinatorial optimization problems and its applications. In: Yang, H., Cheng, K.T.T. (eds.) Proceedings of the 25th Asia and South Pacific Design Automation Conference. ASPDAC 2020. p. 667\u2013672 (2020).https:\/\/doi.org\/10.1109\/ASP-DAC47756.2020.9045100","DOI":"10.1109\/ASP-DAC47756.2020.9045100"},{"issue":"10","key":"8_CR19","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1016\/j.trb.2007.04.010","volume":"41","author":"Y Ouyang","year":"2007","unstructured":"Ouyang, Y.: Design of vehicle routing zones for large-scale distribution systems. Transportation Research Part B: Methodological 41(10), 1079\u20131093 (2007). https:\/\/doi.org\/10.1016\/j.trb.2007.04.010","journal-title":"Transportation Research Part B: Methodological"},{"key":"8_CR20","unstructured":"Perron, L., Furnon, V.: Or-tools routing library (2022), https:\/\/developers.google.com\/optimization\/"},{"key":"8_CR21","unstructured":"Poullet, J.: Leveraging machine learning to solve the vehicle routing problem with time windows. Master Thesis, Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center (2020), https:\/\/hdl.handle.net\/1721.1\/127285"},{"issue":"1","key":"8_CR22","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.tre.2011.07.001","volume":"48","author":"M Qi","year":"2012","unstructured":"Qi, M., Lin, W.H., Li, N., Miao, L.: A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows. Transportation Research Part E: Logistics and Transportation Review 48(1), 248\u2013257 (2012). https:\/\/doi.org\/10.1016\/j.tre.2011.07.001","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"1","key":"8_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-014-0892-x","volume":"14","author":"EG Rieffel","year":"2014","unstructured":"Rieffel, E.G., Venturelli, D., O\u2019Gorman, B., Do, M.B., Prystay, E.M., Smelyanskiy, V.N.: A case study in programming a quantum annealer for hard operational planning problems. Quantum Inf. Process. 14(1), 1\u201336 (2014). https:\/\/doi.org\/10.1007\/s11128-014-0892-x","journal-title":"Quantum Inf. Process."},{"issue":"1","key":"8_CR24","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/trsc.2020.0985","volume":"55","author":"R Sadykov","year":"2021","unstructured":"Sadykov, R., Uchoa, E., Pessoa, A.: A bucket graph\u2013based labeling algorithm with application to vehicle routing. Transp. Sci. 55(1), 4\u201328 (2021). https:\/\/doi.org\/10.1287\/trsc.2020.0985","journal-title":"Transp. Sci."},{"issue":"2","key":"8_CR25","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987). https:\/\/doi.org\/10.1287\/opre.35.2.254","journal-title":"Oper. Res."},{"key":"8_CR26","doi-asserted-by":"publisher","unstructured":"Tran, T., Do, M., Rieffel, E., Frank, J., Wang, Z., O\u2019Gorman, B., Venturelli, D., Beck, J.: A hybrid quantum-classical approach to solving scheduling problems. In: Baier, J.A., Botea, A. (eds.) Proceedings of the 9th International Symposium on Combinatorial Search. vol.\u00a07, pp. 98\u2013106 (2021).https:\/\/doi.org\/10.1609\/socs.v7i1.18390","DOI":"10.1609\/socs.v7i1.18390"},{"key":"8_CR27","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. In: Cortes, C., Lawrence, N., Lee, D., Sugiyama, M., Garnett, R. (eds.) Advances in Neural Information Processing Systems. vol.\u00a028, pp. 2692\u20132700 (2015), https:\/\/proceedings.neurips.cc\/paper\/2015\/file\/29921001f2f04bd3baee84a12e98098f-Paper.pdf"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09192-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T09:24:53Z","timestamp":1780651493000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09192-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032091918","9783032091925"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09192-5_8","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":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Shaglel and Kliesch are co-financed by the ERDF of the European Union and by Fonds of the Hamburg Ministry of Science, Research, Equalities and Districts (BWFGB). Kliesch is also funded by the Fujitsu Germany GmbH as part of the endowed professorship \u201cQuantum Inspired and Quantum Optimization.\u201d","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","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":"15 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lion19.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}