{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T14:11:21Z","timestamp":1786025481668,"version":"3.56.0"},"reference-count":51,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T00:00:00Z","timestamp":1781740800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003086","name":"Basque Government","doi-asserted-by":"publisher","award":["KK-2025\/00074"],"award-info":[{"award-number":["KK-2025\/00074"]}],"id":[{"id":"10.13039\/501100003086","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.cor.2026.107589","type":"journal-article","created":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T15:10:36Z","timestamp":1782573036000},"page":"107589","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Steiner Traveling Salesman Problem with Time Windows and Pickup\u2013Delivery: Integrating classical and quantum optimization"],"prefix":"10.1016","volume":"194","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-4840-3135","authenticated-orcid":false,"given":"Alessia","family":"Ciacco","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francesca","family":"Guerriero","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7863-9910","authenticated-orcid":false,"given":"Eneko","family":"Osaba","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"12","key":"10.1016\/j.cor.2026.107589_b1","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1038\/s42254-024-00770-9","article-title":"Challenges and opportunities in quantum optimization","volume":"6","author":"Abbas","year":"2024","journal-title":"Nat. Rev. Phys."},{"issue":"4","key":"10.1016\/j.cor.2026.107589_b2","doi-asserted-by":"crossref","first-page":"1396","DOI":"10.1111\/itor.12592","article-title":"A note on computational aspects of the Steiner traveling salesman problem","volume":"26","author":"\u00c1lvarez-Miranda","year":"2019","journal-title":"Int. Trans. Oper. Res."},{"key":"10.1016\/j.cor.2026.107589_b3","doi-asserted-by":"crossref","unstructured":"Bertuzzi, A., Ferrari, D., Manzalini, A., Amoretti, M., 2024. Evaluation of quantum and hybrid solvers for combinatorial optimization. In: Proceedings of the 21st ACM International Conference on Computing Frontiers. pp. 232\u2013239.","DOI":"10.1145\/3649153.3649205"},{"key":"10.1016\/j.cor.2026.107589_b4","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","article-title":"The vehicle routing problem: State of the art classification and review","volume":"99","author":"Braekers","year":"2016","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107589_b5","series-title":"Operations Research Proceedings 2001: Selected Papers of the International Conference on Operations Research (OR 2001) Duisburg, September 3\u20135, 2001","first-page":"3","article-title":"Routing a fleet of vehicles for dynamic combined pick-up and deliveries services","author":"Caramia","year":"2002"},{"issue":"30","key":"10.1016\/j.cor.2026.107589_b6","first-page":"2273","article-title":"Real-time vehicle routing problem with time windows and simultaneous delivery\/pickup demands","volume":"5","author":"Chang","year":"2003","journal-title":"J. East. Asia Soc. Transp. Stud."},{"issue":"4","key":"10.1016\/j.cor.2026.107589_b7","doi-asserted-by":"crossref","first-page":"2129","DOI":"10.1007\/s00500-025-10540-z","article-title":"Review of quantum algorithms for medicine, finance and logistics","volume":"29","author":"Ciacco","year":"2025","journal-title":"Soft Comput."},{"key":"10.1016\/j.cor.2026.107589_b8","doi-asserted-by":"crossref","unstructured":"Ciacco, A., Guerriero, F., Osaba, E., 2025b. Steiner Traveling Salesman Problem with Quantum Annealing. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion. pp. 2412\u20132418.","DOI":"10.1145\/3712255.3734313"},{"key":"10.1016\/j.cor.2026.107589_b9","series-title":"Benchmark dataset for the Steiner traveling salesman problem with time windows and pickup and delivery","author":"Ciacco","year":"2026"},{"key":"10.1016\/j.cor.2026.107589_b10","series-title":"2026 International Conference on Quantum Communications, Networking, and Computing","first-page":"630","article-title":"Quantum annealing for staff scheduling in educational environments","author":"Ciacco","year":"2026"},{"key":"10.1016\/j.cor.2026.107589_b11","doi-asserted-by":"crossref","DOI":"10.1016\/j.future.2025.107961","article-title":"Quantum annealing for the two-level facility location problem","volume":"174","author":"Ciacco","year":"2026","journal-title":"Future Gener. Comput. Syst."},{"issue":"1","key":"10.1016\/j.cor.2026.107589_b12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01582008","article-title":"The traveling salesman problem on a graph and some related integer polyhedra","volume":"33","author":"Cornu\u00e9jols","year":"1985","journal-title":"Math. Program."},{"key":"10.1016\/j.cor.2026.107589_b13","series-title":"Measuring Performance of the Leap Constrained Quadratic Model Solver","year":"2022"},{"key":"10.1016\/j.cor.2026.107589_b14","series-title":"D-Wave Ocean SDK documentation \u2013 constrained quadratic models (CQM)","author":"D-Wave Systems Inc.","year":"2025"},{"key":"10.1016\/j.cor.2026.107589_b15","doi-asserted-by":"crossref","unstructured":"de Andoin, M.G., Osaba, E., Oregi, I., Villar-Rodriguez, E., Sanz, M., 2022. Hybrid quantum-classical heuristic for the bin packing problem. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion. pp. 2214\u20132222.","DOI":"10.1145\/3520304.3533986"},{"key":"10.1016\/j.cor.2026.107589_b16","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/1.9780898718515.ch9","article-title":"VRP with pickup and delivery","volume":"9","author":"Desaulniers","year":"2002","journal-title":"Veh. Routing Probl."},{"key":"10.1016\/j.cor.2026.107589_b17","series-title":"International Conference on Optimization and Decision Science","first-page":"557","article-title":"Last-mile deliveries by using drones and classical vehicles","author":"Di Puglia Pugliese","year":"2017"},{"key":"10.1016\/j.cor.2026.107589_b18","article-title":"Trucks and drones cooperation in the last-mile delivery process","author":"Di Puglia Pugliese","year":"2020","journal-title":"Networks"},{"issue":"1","key":"10.1016\/j.cor.2026.107589_b19","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0377-2217(91)90319-Q","article-title":"The pickup and delivery problem with time windows","volume":"54","author":"Dumas","year":"1991","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107589_b20","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/j.trb.2005.04.002","article-title":"On dynamic pickup and delivery vehicle routing with several time windows and waiting times","volume":"40","author":"Fabri","year":"2006","journal-title":"Transp. Res. B"},{"issue":"3","key":"10.1016\/j.cor.2026.107589_b21","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0377-2217(85)90151-1","article-title":"A cutting plane procedure for the travelling salesman problem on road networks","volume":"21","author":"Fleischmann","year":"1985","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107589_b22","series-title":"Comparative benchmark of a quantum algorithm for the bin packing problem","author":"Garcia-de-Andoin","year":"2022"},{"issue":"1","key":"10.1016\/j.cor.2026.107589_b23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(02)00915-3","article-title":"Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies","volume":"151","author":"Ghiani","year":"2003","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107589_b24","series-title":"A tutorial on formulating and using QUBO models","author":"Glover","year":"2018"},{"issue":"4","key":"10.1016\/j.cor.2026.107589_b25","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10288-020-00464-9","article-title":"Quantum bridge analytics II: QUBO-Plus, network optimization and combinatorial chaining for asset exchange","volume":"18","author":"Glover","year":"2020","journal-title":"4OR"},{"key":"10.1016\/j.cor.2026.107589_b26","doi-asserted-by":"crossref","unstructured":"Grover, L.K., 1996. A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing. pp. 212\u2013219.","DOI":"10.1145\/237814.237866"},{"key":"10.1016\/j.cor.2026.107589_b27","series-title":"Advanced quantum annealing approach to vehicle routing problems with time windows","author":"Holliday","year":"2025"},{"issue":"6","key":"10.1016\/j.cor.2026.107589_b28","doi-asserted-by":"crossref","first-page":"1307","DOI":"10.1111\/itor.12419","article-title":"A GRASP heuristic using path-relinking and restarts for the Steiner traveling salesman problem","volume":"24","author":"Interian","year":"2017","journal-title":"Int. Trans. Oper. Res."},{"key":"10.1016\/j.cor.2026.107589_b29","series-title":"ICC 2023-IEEE International Conference on Communications","first-page":"2686","article-title":"Quantum annealing approach for selective traveling salesman problem","author":"Le","year":"2023"},{"issue":"1","key":"10.1016\/j.cor.2026.107589_b30","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.ejor.2013.01.044","article-title":"Compact formulations of the Steiner traveling salesman problem and related problems","volume":"228","author":"Letchford","year":"2013","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107589_b31","series-title":"Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence","first-page":"160","article-title":"A metaheuristic for the pickup and delivery problem with time windows","author":"Li","year":"2001"},{"key":"10.1016\/j.cor.2026.107589_b32","series-title":"International Conference on Emerging Trends and Technologies on Intelligent Systems","first-page":"401","article-title":"Logistics network optimization using quantum annealing","author":"Malviya","year":"2023"},{"key":"10.1016\/j.cor.2026.107589_b33","series-title":"Quantum annealing based hybrid strategies for real time route optimization","author":"Mario","year":"2024"},{"key":"10.1016\/j.cor.2026.107589_b34","doi-asserted-by":"crossref","DOI":"10.3389\/fphy.2023.1129594","article-title":"Quantum annealing for the adjuster routing problem","volume":"11","author":"Mori","year":"2023","journal-title":"Front. Phys."},{"key":"10.1016\/j.cor.2026.107589_b35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/978-3-031-95296-8_17","article-title":"Quantum algorithms for optimization problems","volume":"vol. 15555","author":"Muhamediyeva","year":"2026"},{"key":"10.1016\/j.cor.2026.107589_b36","series-title":"2025 IEEE International Conference on Quantum Computing and Engineering","first-page":"388","article-title":"Quantum-assisted automatic path-planning for robotic quality inspection in Industry 4.0","volume":"Vol. 2","author":"Osaba","year":"2025"},{"key":"10.1016\/j.cor.2026.107589_b37","doi-asserted-by":"crossref","DOI":"10.1109\/ACCESS.2025.3525620","article-title":"D-wave\u2019s nonlinear-program hybrid solver: Description and performance analysis","author":"Osaba","year":"2025","journal-title":"IEEE Access"},{"issue":"1","key":"10.1016\/j.cor.2026.107589_b38","doi-asserted-by":"crossref","first-page":"24791","DOI":"10.1038\/s41598-024-75572-1","article-title":"Solving a real-world package delivery routing problem using quantum annealers","volume":"14","author":"Osaba","year":"2024","journal-title":"Sci. Rep."},{"key":"10.1016\/j.cor.2026.107589_b39","series-title":"Optimizing package delivery with quantum annealers: Addressing time-windows and simultaneous pickup and delivery","author":"Osaba","year":"2025"},{"key":"10.1016\/j.cor.2026.107589_b40","doi-asserted-by":"crossref","first-page":"55805","DOI":"10.1109\/ACCESS.2022.3177790","article-title":"A systematic literature review of quantum computing for routing problems","volume":"10","author":"Osaba","year":"2022","journal-title":"IEEE Access"},{"issue":"1","key":"10.1016\/j.cor.2026.107589_b41","doi-asserted-by":"crossref","first-page":"16784","DOI":"10.1038\/s41598-024-67168-6","article-title":"Solving the resource constrained project scheduling problem with quantum annealing","volume":"14","author":"P\u00e9rez Armas","year":"2024","journal-title":"Sci. Rep."},{"key":"10.1016\/j.cor.2026.107589_b42","doi-asserted-by":"crossref","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","article-title":"Quantum computing in the NISQ era and beyond","volume":"2","author":"Preskill","year":"2018","journal-title":"Quantum"},{"issue":"2","key":"10.1016\/j.cor.2026.107589_b43","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1016\/j.ejor.2019.04.047","article-title":"The Steiner traveling salesman problem and its extensions","volume":"278","author":"Rodr\u00edguez-Pereira","year":"2019","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107589_b44","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","article-title":"An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows","volume":"40","author":"Ropke","year":"2006","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2026.107589_b45","series-title":"Proceedings 35th Annual Symposium on Foundations of Computer Science","first-page":"124","article-title":"Algorithms for quantum computation: discrete logarithms and factoring","author":"Shor","year":"1994"},{"key":"10.1016\/j.cor.2026.107589_b46","series-title":"Performance of commercial quantum annealing solvers for the capacitated vehicle routing problem","author":"Sinno","year":"2023"},{"issue":"3","key":"10.1016\/j.cor.2026.107589_b47","doi-asserted-by":"crossref","DOI":"10.1088\/2058-9565\/add61d","article-title":"The travelling salesperson problem and the challenges of near-term quantum advantage","volume":"10","author":"Smith-Miles","year":"2025","journal-title":"Quantum Sci. Technol."},{"key":"10.1016\/j.cor.2026.107589_b48","series-title":"Quantum annealing for vehicle routing problem with weighted segment","author":"Tambunan","year":"2022"},{"key":"10.1016\/j.cor.2026.107589_b49","unstructured":"Venturelli, D., Marchand, D., Rojo, G., 2016. Job shop scheduling solver based on quantum annealing. In: Proc. of ICAPS-16 Workshop on Constraint Satisfaction Techniques for Planning and Scheduling. COPLAS, pp. 25\u201334."},{"issue":"4","key":"10.1016\/j.cor.2026.107589_b50","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s11128-022-03476-y","article-title":"Benchmarking advantage and D-Wave 2000Q quantum annealers with exact cover problems","volume":"21","author":"Willsch","year":"2022","journal-title":"Quantum Inf. Process."},{"key":"10.1016\/j.cor.2026.107589_b51","doi-asserted-by":"crossref","first-page":"73156","DOI":"10.1109\/ACCESS.2022.3188117","article-title":"Implementation of quantum annealing: A systematic review","volume":"10","author":"Yulianti","year":"2022","journal-title":"IEEE Access"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826002078?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826002078?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T13:06:17Z","timestamp":1786021577000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826002078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":51,"alternative-id":["S0305054826002078"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107589","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Steiner Traveling Salesman Problem with Time Windows and Pickup\u2013Delivery: Integrating classical and quantum optimization","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107589","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"107589"}}