{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T18:44:15Z","timestamp":1775328255321,"version":"3.50.1"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T00:00:00Z","timestamp":1774224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T00:00:00Z","timestamp":1774224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"J. B. Hunt Transport Services"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Mach. Intell."],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s42484-026-00375-8","type":"journal-article","created":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T14:33:05Z","timestamp":1774276385000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An advanced hybrid quantum tabu search approach to vehicle routing problems"],"prefix":"10.1007","volume":"8","author":[{"given":"James B.","family":"Holliday","sequence":"first","affiliation":[]},{"given":"Eneko","family":"Osaba","sequence":"additional","affiliation":[]},{"given":"Khoa","family":"Luu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,23]]},"reference":[{"key":"375_CR1","doi-asserted-by":"crossref","unstructured":"Abbas A, Ambainis A, Augustino B, B\u00e4rtschi A, Buhrman H, Coffrin C, Cortiana G, Dunjko V, Egger DJ, Elmegreen BG et al (2023) Quantum optimization: Potential, challenges, and the path forward. arXiv preprint arXiv:2312.02279","DOI":"10.2172\/2229681"},{"key":"375_CR2","doi-asserted-by":"publisher","first-page":"1294564","DOI":"10.3389\/fcomp.2023.1294564","volume":"5","author":"JF Ari\u00f1o Sales","year":"2023","unstructured":"Ari\u00f1o Sales JF, Palacios Araos RA (2023) Adiabatic quantum computing impact on transport optimization in the last-mile scenario. Front Comput Sci 5:1294564","journal-title":"Front Comput Sci"},{"issue":"1","key":"375_CR3","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s42484-021-00039-9","volume":"3","author":"G Bass","year":"2021","unstructured":"Bass G, Henderson M, Heath J, Dulny J III (2021) Optimizing the optimizer: decomposition techniques for quantum annealing. Quantum Mach Intell 3(1):10","journal-title":"Quantum Mach Intell"},{"key":"375_CR4","unstructured":"Boost M, Reinhardt S, Roy A (2017) Partitioning optimization problems for hybrid classical\/quantum execution. D-Wave Syst., D-Wave Technical Report Series, Burnaby, CO, Canada, Tech. Rep"},{"key":"375_CR5","unstructured":"Boothby K, Bunyk P, Raymond J, Roy A (2020) Next-generation topology of d-wave quantum processors. arXiv preprint arXiv:2003.00133"},{"key":"375_CR6","doi-asserted-by":"crossref","unstructured":"Borowski M, Gora P, Karnas K, B\u0142ajda M, Kr\u00f3l K, Matyjasek A, Burczyk D, Szewczyk M, Kutwin M (2020) New hybrid quantum annealing algorithms for solving vehicle routing problem. In: International conference on computational science. Springer, pp 546\u2013561","DOI":"10.1007\/978-3-030-50433-5_42"},{"key":"375_CR7","unstructured":"Campelo F, Aranha C (2025) Evolutionary computation bestiary. https:\/\/fcampelo.github.io\/EC-Bestiary\/. Accessed on 1 Nov 2025"},{"key":"375_CR8","volume-title":"Combinatorial Optimization","author":"N Christofides","year":"1979","unstructured":"Christofides N, Mingozzi A, Toth P (1979) Combinatorial Optimization. Wiley, Chichester, West Sussex"},{"key":"375_CR9","doi-asserted-by":"crossref","unstructured":"Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568\u2013581","DOI":"10.1287\/opre.12.4.568"},{"key":"375_CR10","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1057\/palgrave.jors.2601319","volume":"53","author":"J-F Cordeau","year":"2002","unstructured":"Cordeau J-F, Gendreau M, Laporte G, Potvin J-Y, Semet F (2002) A guide to vehicle routing heuristics. J Oper Res Soc 53:512\u2013522","journal-title":"J Oper Res Soc"},{"key":"375_CR11","unstructured":"Farhi E, Goldstone J, Gutmann S (2014) A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028"},{"key":"375_CR12","doi-asserted-by":"publisher","first-page":"13","DOI":"10.3389\/fict.2019.00013","volume":"6","author":"S Feld","year":"2019","unstructured":"Feld S, Roch C, Gabor T, Seidel C, Neukart F, Galter I, Mauerer W, Linnhoff-Popien C (2019) A hybrid solution method for the capacitated vehicle routing problem using a quantum annealer. Frontiers in ICT 6:13","journal-title":"Frontiers in ICT"},{"key":"375_CR13","unstructured":"Ferreiro-V\u00e9lez J, Iriarte-Zendoia I, Ban Y, Chen X (2024) Shortcuts for adiabatic and variational algorithms in molecular simulation. https:\/\/arxiv.org\/abs\/2407.20957"},{"issue":"2","key":"375_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/net.3230110205","volume":"11","author":"ML Fisher","year":"1981","unstructured":"Fisher ML, Jaikumar A (1981) A generalized assignment heuristic for vehicle routing. Networks 11(2):109\u2013124","journal-title":"Networks"},{"issue":"10","key":"375_CR15","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M Gendreau","year":"1994","unstructured":"Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Manage Sci 40(10):1276\u20131290","journal-title":"Manage Sci"},{"issue":"2","key":"375_CR16","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1287\/opre.22.2.340","volume":"22","author":"BE Gillett","year":"1974","unstructured":"Gillett BE, Miller LR (1974) A heuristic algorithm for the vehicle-dispatch problem. Oper Res 22(2):340\u2013349","journal-title":"Oper Res"},{"key":"375_CR17","unstructured":"GitHub I (2024) GitHub codespaces. https:\/\/github.com\/features\/codespaces. Accessed on 02 Oct 2024"},{"key":"375_CR18","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10479-009-0597-1","volume":"183","author":"F Glover","year":"2011","unstructured":"Glover F, Hao J-K (2011) The case for strategic oscillation. Ann Oper Res 183:163\u2013173","journal-title":"Ann Oper Res"},{"key":"375_CR19","volume-title":"Tabu Search","author":"F Glover","year":"1998","unstructured":"Glover F, Laguna M (1998) Tabu Search. Springer, New York"},{"key":"375_CR20","doi-asserted-by":"crossref","unstructured":"Golden BL, Raghavan S, Wasil EA (2008) The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, vol 43","DOI":"10.1007\/978-0-387-77778-8"},{"key":"375_CR21","doi-asserted-by":"crossref","unstructured":"Holliday J.B., Morgan B, Churchill H, Luu K (2024) Hybrid quantum tabu search for solving the vehicle routing problem. In: 2024 IEEE international conference on quantum computing and engineering (QCE). IEEE, pp 353\u2013358","DOI":"10.1109\/QCE60285.2024.10305"},{"key":"375_CR22","doi-asserted-by":"publisher","first-page":"2191","DOI":"10.1007\/s10462-017-9605-z","volume":"52","author":"K Hussain","year":"2019","unstructured":"Hussain K, Mohd Salleh MN, Cheng S, Shi Y (2019) Metaheuristic research: a comprehensive survey. Artif Intell Rev 52:2191\u20132233","journal-title":"Artif Intell Rev"},{"key":"375_CR23","unstructured":"Inc D-WS (2024) D-Wave Leap Log In | D-Wave Leap\u2122. Accessed on September 25 2024. https:\/\/cloud.dwavesys.com\/leap\/login\/?next=\/leap\/"},{"issue":"1","key":"375_CR24","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1038\/s41534-025-01020-1","volume":"11","author":"S Kim","year":"2025","unstructured":"Kim S, Ahn S-W, Suh I-S, Dowling AW, Lee E, Luo T (2025) Quantum annealing for combinatorial optimization: a benchmarking study. NPJ Quantum Inf 11(1):77","journal-title":"NPJ Quantum Inf"},{"key":"375_CR25","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1111\/j.1475-3995.2000.tb00200.x","volume":"7","author":"G Laporte","year":"2000","unstructured":"Laporte G, Gendreau M, Potvin J-Y, Semet F (2000) Classical heuristics for the vehicle routing problem. Int Trans Oper Res 7:285\u2013300. https:\/\/doi.org\/10.1111\/j.1475-3995.2000.tb00200.x","journal-title":"Int Trans Oper Res"},{"key":"375_CR26","doi-asserted-by":"crossref","unstructured":"Le TV, Nguyen MV, Khandavilli S, Dinh TN, Nguyen TN (2023) Quantum annealing approach for selective traveling salesman problem. In: ICC 2023-IEEE international conference on communications. IEEE, pp 2686\u20132691","DOI":"10.1109\/ICC45041.2023.10279785"},{"key":"375_CR27","doi-asserted-by":"crossref","unstructured":"Leonidas I.D., Dukakis A, Tan B, Angelakis DG (2023) Qubit efficient quantum algorithms for the vehicle routing problem on quantum computers of the nisq era. arXiv preprint arXiv:2306.08507","DOI":"10.1002\/qute.202300309"},{"issue":"2","key":"375_CR28","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 BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21(2):498\u2013516","journal-title":"Oper Res"},{"key":"375_CR29","doi-asserted-by":"publisher","first-page":"74887","DOI":"10.3389\/fphy.2014.00005","volume":"2","author":"A Lucas","year":"2014","unstructured":"Lucas A (2014) Ising formulations of many np problems. Front Phys 2:74887","journal-title":"Front Phys"},{"issue":"1","key":"375_CR30","first-page":"1","volume":"1","author":"R Matai","year":"2010","unstructured":"Matai R, Singh SP, Mittal ML (2010) Traveling salesman problem: an overview of applications, formulations, and solution approaches. Travel Salesman Probl Theory Appl 1(1):1\u201325","journal-title":"Travel Salesman Probl Theory Appl"},{"issue":"4","key":"375_CR31","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J ACM (JACM) 7(4):326\u2013329","journal-title":"J ACM (JACM)"},{"key":"375_CR32","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.99.070502","volume":"99","author":"A Mizel","year":"2007","unstructured":"Mizel A, Lidar DA, Mitchell M (2007) Simple proof of equivalence between adiabatic quantum computation and the circuit model. Phys Rev Lett 99:070502. https:\/\/doi.org\/10.1103\/PhysRevLett.99.070502","journal-title":"Phys Rev Lett"},{"key":"375_CR33","doi-asserted-by":"crossref","unstructured":"Mohanty N, Behera B.K., Ferrie C (2023) Analysis of the vehicle routing problem solved via hybrid quantum algorithms in the presence of noisy channels. IEEE Trans Quantum Eng","DOI":"10.1109\/TQE.2023.3303989"},{"key":"375_CR34","doi-asserted-by":"crossref","unstructured":"Morita S, Nishimori H (2008) Mathematical foundation of quantum annealing. J Math Phys 49(12)","DOI":"10.1063\/1.2995837"},{"key":"375_CR35","volume-title":"Description: Third generation digital annealer technology","author":"H Nakayama","year":"2021","unstructured":"Nakayama H, Koyama J, Yoneoka N, Miyazawa T (2021) Description: Third generation digital annealer technology. Tokyo, Japan, Fujitsu Limited"},{"issue":"1","key":"375_CR36","doi-asserted-by":"publisher","first-page":"24791","DOI":"10.1038\/s41598-024-75572-1","volume":"14","author":"E Osaba","year":"2024","unstructured":"Osaba E, Villar-Rodriguez E, Asla A (2024) Solving a real-world package delivery routing problem using quantum annealers. Sci Rep 14(1):24791","journal-title":"Sci Rep"},{"key":"375_CR37","doi-asserted-by":"publisher","first-page":"55805","DOI":"10.1109\/ACCESS.2022.3177790","volume":"10","author":"E Osaba","year":"2022","unstructured":"Osaba E, Villar-Rodriguez E, Oregi I (2022) A systematic literature review of quantum computing for routing problems. IEEE Access 10:55805\u201355817","journal-title":"IEEE Access"},{"key":"375_CR38","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"IH Osman","year":"1993","unstructured":"Osman IH (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 41:421\u2013451","journal-title":"Ann Oper Res"},{"key":"375_CR39","doi-asserted-by":"crossref","unstructured":"Palackal L, Poggel B, Wulff M, Ehm H, Lorenz JM, Mendl CB (2023) Quantum-assisted solution paths for the capacitated vehicle routing problem. In: 2023 IEEE international conference on quantum computing and engineering (QCE). IEEE, vol 1, pp 648\u2013658","DOI":"10.1109\/QCE57702.2023.00080"},{"issue":"1","key":"375_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10601-020-09315-0","volume":"26","author":"Y Pang","year":"2021","unstructured":"Pang Y, Coffrin C, Lokhov AY, Vuffray M (2021) The potential of quantum annealing for rapid solution structure identification. Constraints 26(1):1\u201325","journal-title":"Constraints"},{"key":"375_CR41","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill J (2018) Quantum computing in the nisq era and beyond. Quantum 2:79","journal-title":"Quantum"},{"issue":"8","key":"375_CR42","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.3390\/e25081238","volume":"25","author":"W Qian","year":"2023","unstructured":"Qian W, Basili RA, Eshaghian-Wilner MM, Khokhar A, Luecke G, Vary JP (2023) Comparative study of variations in quantum approximate optimization algorithms for the traveling salesman problem. Entropy 25(8):1238","journal-title":"Entropy"},{"key":"375_CR43","unstructured":"Sales JFA, Araos RAP (2023) Adiabatic quantum computing for logistic transport optimization. arXiv preprint arXiv:2301.07691"},{"key":"375_CR44","doi-asserted-by":"crossref","unstructured":"Salhi S, Thompson J (2022) An overview of heuristics and metaheuristics. Palgrave Handbook Oper Res 353\u2013403","DOI":"10.1007\/978-3-030-96935-6_11"},{"issue":"2","key":"375_CR45","doi-asserted-by":"publisher","first-page":"024005","DOI":"10.1088\/2058-9565\/acb6ae","volume":"8","author":"ZC Seskir","year":"2023","unstructured":"Seskir ZC, Umbrello S, Coenen C, Vermaas PE (2023) Democratization of quantum technologies. Quantum Sci Technol 8(2):024005","journal-title":"Quantum Sci Technol"},{"key":"375_CR46","unstructured":"Sinno S, Gro\u00df T, Mott A, Sahoo A, Honnalli D, Thuravakkath S, Bhalgamiya B (2023) Performance of commercial quantum annealing solvers for the capacitated vehicle routing problem. arXiv preprint arXiv:2309.05564"},{"key":"375_CR47","doi-asserted-by":"crossref","unstructured":"Spyridis Y, Gkelias A, Argyriou V (2023) Variational quantum approach for the multiple traveling salesman problem optimisation. In: 2023 19th International conference on distributed computing in smart systems and the internet of things (DCOSS-IoT). IEEE, pp 354\u2013358","DOI":"10.1109\/DCOSS-IoT58021.2023.00064"},{"key":"375_CR48","doi-asserted-by":"crossref","unstructured":"Suen WY, Parizy M, Lau HC (2022) Enhancing a qubo solver via data driven multi-start and its application to vehicle routing problem. In: Proceedings of the genetic and evolutionary computation conference companion, pp 2251\u20132257","DOI":"10.1145\/3520304.3533988"},{"issue":"8","key":"375_CR49","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"\u00c9 Taillard","year":"1993","unstructured":"Taillard \u00c9 (1993) Parallel iterative search methods for vehicle routing problems. Networks 23(8):661\u2013673","journal-title":"Networks"},{"key":"375_CR50","doi-asserted-by":"publisher","unstructured":"Takahashi K (2017) Shortcuts to adiabaticity for quantum annealing. Phys Rev A 95(1). https:\/\/doi.org\/10.1103\/physreva.95.012309","DOI":"10.1103\/physreva.95.012309"},{"key":"375_CR51","doi-asserted-by":"crossref","unstructured":"Tambunan TD, Suksmono AB, Edward IJM, Mulyawan R (2023) Quantum annealing for vehicle routing problem with weighted segment. In: AIP conference proceedings, vol 2906. AIP Publishing","DOI":"10.1063\/5.0178362"},{"issue":"1","key":"375_CR52","doi-asserted-by":"publisher","first-page":"4770","DOI":"10.1038\/s41598-023-31765-8","volume":"13","author":"SJ Weinberg","year":"2023","unstructured":"Weinberg SJ, Sanches F, Ide T, Kamiya K, Correll R (2023) Supply chain logistics with quantum and classical annealing algorithms. Sci Rep 13(1):4770","journal-title":"Sci Rep"},{"issue":"8","key":"375_CR53","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s11128-024-04497-5","volume":"23","author":"N Xie","year":"2024","unstructured":"Xie N, Lee X, Cai D, Saito Y, Asai N, Lau HC (2024) A feasibility-preserved quantum approximate solver for the capacitated vehicle routing problem. Quantum Inf Process 23(8):291","journal-title":"Quantum Inf Process"},{"issue":"2","key":"375_CR54","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1109\/COMST.2023.3254481","volume":"25","author":"Z Yang","year":"2023","unstructured":"Yang Z, Zolanvari M, Jain R (2023) A survey of important issues in quantum computing and communications. IEEE Commun Surv Tutor 25(2):1059\u20131094","journal-title":"IEEE Commun Surv Tutor"},{"issue":"1","key":"375_CR55","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1038\/s41598-017-01096-6","volume":"7","author":"BH Zhang","year":"2017","unstructured":"Zhang BH, Wagenbreth G, Martin-Mayor V, Hen I (2017) Advantages of unfair quantum ground-state sampling. Sci Rep 7(1):1044","journal-title":"Sci Rep"}],"container-title":["Quantum Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-026-00375-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42484-026-00375-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-026-00375-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T14:33:09Z","timestamp":1774276389000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42484-026-00375-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,23]]},"references-count":55,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["375"],"URL":"https:\/\/doi.org\/10.1007\/s42484-026-00375-8","relation":{},"ISSN":["2524-4906","2524-4914"],"issn-type":[{"value":"2524-4906","type":"print"},{"value":"2524-4914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,23]]},"assertion":[{"value":"20 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"37"}}