{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T10:30:04Z","timestamp":1781519404264,"version":"3.54.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030504328","type":"print"},{"value":"9783030504335","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-50433-5_42","type":"book-chapter","created":{"date-parts":[[2020,6,19]],"date-time":"2020-06-19T19:03:44Z","timestamp":1592593424000},"page":"546-561","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":45,"title":["New Hybrid Quantum Annealing Algorithms for Solving Vehicle Routing Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8304-5698","authenticated-orcid":false,"given":"Micha\u0142","family":"Borowski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8037-5704","authenticated-orcid":false,"given":"Pawe\u0142","family":"Gora","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7153-8700","authenticated-orcid":false,"given":"Katarzyna","family":"Karnas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5672-2107","authenticated-orcid":false,"given":"Mateusz","family":"B\u0142ajda","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4192-2485","authenticated-orcid":false,"given":"Krystian","family":"Kr\u00f3l","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5327-138X","authenticated-orcid":false,"given":"Artur","family":"Matyjasek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6784-4476","authenticated-orcid":false,"given":"Damian","family":"Burczyk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7140-7874","authenticated-orcid":false,"given":"Miron","family":"Szewczyk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2031-9329","authenticated-orcid":false,"given":"Micha\u0142","family":"Kutwin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,6,15]]},"reference":[{"issue":"1","key":"42_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manage. Sci."},{"key":"42_CR2","first-page":"413","volume":"146","author":"T Kirkman","year":"1856","unstructured":"Kirkman, T.: XVIII. On the representation of polyedra. Philos. Trans. R. Soc. Lond. 146, 413\u2013418 (1856)","journal-title":"Philos. Trans. R. Soc. Lond."},{"key":"42_CR3","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. IRSS, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"key":"42_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13676-013-0020-6","volume":"2","author":"G Laporte","year":"2013","unstructured":"Laporte, G., Toth, P., Vigo, D.: Vehicle routing: historical perspective and recent contributions. EURO J. Transp. Logist. 2, 1\u20134 (2013). https:\/\/doi.org\/10.1007\/s13676-013-0020-6","journal-title":"EURO J. Transp. Logist."},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Gora, P., et al.: On a road to optimal fleet routing algorithms: a gentle introduction to the state-of-the-art. In: Smart Delivery Systems, Solving Complex Vehicle Routing Problems, Intelligent Data-Centric Systems, pp. 37\u201392 (2020)","DOI":"10.1016\/B978-0-12-815715-2.00014-2"},{"key":"42_CR6","unstructured":"Zahedinejad, E., Zaribafiyan, A.: Combinatorial optimization on gate model quantum computers: a survey (2017). https:\/\/arxiv.org\/abs\/1708.05294"},{"key":"42_CR7","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1007\/978-1-4020-3953-9_55","volume-title":"Computational Methods","author":"X Feng","year":"2006","unstructured":"Feng, X., Wang, Y., Ge, H., Zhou, C., Liang, Y.: Quantum-inspired evolutionary algorithm for travelling salesman problem. In: Liu, G., Tan, V., Han, X. (eds.) Computational Methods, pp. 1363\u20131367. Springer, Dordrecht (2006). https:\/\/doi.org\/10.1007\/978-1-4020-3953-9_55"},{"key":"42_CR8","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1016\/j.ins.2014.11.037","volume":"316","author":"AK Beheshti","year":"2015","unstructured":"Beheshti, A.K., Hejazi, S.R.: A novel hybrid column generation-metaheuristic approach for the vehicle routing problem with general soft time window. Inf. Sci. 316, 598\u2013615 (2015)","journal-title":"Inf. Sci."},{"issue":"4","key":"42_CR9","first-page":"287","volume":"25","author":"AK Beheshti","year":"2014","unstructured":"Beheshti, A.K., Hejazi, S.R.: A quantum evolutionary algorithm for the vehicle routing problem with delivery time cost. Int. J. Ind. Eng. Prod. Res. 25(4), 287\u2013295 (2014)","journal-title":"Int. J. Ind. Eng. Prod. Res."},{"key":"42_CR10","unstructured":"Greenwood, G.W.: Finding solutions to NP problems: philosophical differences between quantum and evolutionary search algorithms. In: Proceedings of the 2001 Congress on Evolutionary Computation (2001)"},{"key":"42_CR11","series-title":"Lecture Notes in Electrical Engineering","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-94-007-5699-1_3","volume-title":"Computer Science and its Applications","author":"K Zeng","year":"2012","unstructured":"Zeng, K., Peng, G., Cai, Z., Huang, Z., Yang, X.: A hybrid natural computing approach for the VRP problem based on PSO, GA and quantum computation. In: Yeo, S.S., Pan, Y., Lee, Y., Chang, H. (eds.) Computer Science and its Applications. LNEE, vol. 203, pp. 23\u201328. Springer, Dordrecht (2012). https:\/\/doi.org\/10.1007\/978-94-007-5699-1_3"},{"key":"42_CR12","unstructured":"Srinivasan, K., Satyajit, S., Behera, B.K., Panigrahi, P.K.: Efficient quantum algorithm for solving travelling salesman problem: an IBM quantum experience (2018). https:\/\/arxiv.org\/abs\/1805.10928"},{"key":"42_CR13","doi-asserted-by":"publisher","unstructured":"Cui, L., Wang, L., Deng, J., Zhang, J.: A new improved quantum evolution algorithm with local search procedure for capacitated vehicle routing problem. Math. Probl. Eng. (2013). https:\/\/doi.org\/10.1155\/2013\/159495. Article ID 159495","DOI":"10.1155\/2013\/159495"},{"key":"42_CR14","doi-asserted-by":"publisher","unstructured":"Zhang, J., Wang, W., Zhao, Y., Cattani, C.: Multiobjective quantum evolutionary algorithm for the vehicle routing problem with customer satisfaction. Math. Probl. Eng. (2012). https:\/\/doi.org\/10.1155\/2012\/879614. https:\/\/www.hindawi.com\/journals\/mpe\/2012\/879614, Article ID 879614","DOI":"10.1155\/2012\/879614"},{"issue":"16","key":"42_CR15","doi-asserted-by":"publisher","first-page":"7248","DOI":"10.1016\/j.eswa.2014.05.053","volume":"41","author":"H Dai","year":"2014","unstructured":"Dai, H., Yang, Y., Li, H., Li, C.: Bi-direction quantum crossover-based clonal selection algorithm and its applications. Expert Syst. Appl. 41(16), 7248\u20137258 (2014)","journal-title":"Expert Syst. Appl."},{"key":"42_CR16","doi-asserted-by":"publisher","unstructured":"You, X., Miao, X., Liu S.: Quantum computing-based Ant Colony Optimization algorithm for TSP. In: 2nd International Conference on Power Electronics and Intelligent Transportation System (PEITS), Shenzhen, 2009, pp. 359\u2013362 (2009). https:\/\/doi.org\/10.1109\/PEITS.2009.5406879","DOI":"10.1109\/PEITS.2009.5406879"},{"key":"42_CR17","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/j.neucom.2006.10.001","volume":"70","author":"Y Wang","year":"2007","unstructured":"Wang, Y., et al.: A novel quantum swarm evolutionary algorithm and its applications. Neurocomputing 70, 633\u2013640 (2007)","journal-title":"Neurocomputing"},{"key":"42_CR18","doi-asserted-by":"publisher","first-page":"057701","DOI":"10.1103\/PhysRevE.70.057701","volume":"70","author":"R Marton\u00e1k","year":"2004","unstructured":"Marton\u00e1k, R., Santoro, G.E., Tosatti, E.: Quantum annealing of the traveling-salesman problem. Phys. Rev. E 70, 057701 (2004)","journal-title":"Phys. Rev. E"},{"issue":"36","key":"42_CR19","doi-asserted-by":"publisher","first-page":"R393","DOI":"10.1088\/0305-4470\/39\/36\/R01","volume":"39","author":"GE Santoro","year":"2006","unstructured":"Santoro, G.E., Tosatti, E.: Optimization using quantum mechanics: quantum annealing through adiabatic evolution. J. Phys. A Math. Gen. 39(36), R393 (2006)","journal-title":"J. Phys. A Math. Gen."},{"key":"42_CR20","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3389\/fphy.2014.00005","volume":"2","author":"A Lucas","year":"2014","unstructured":"Lucas, A.: Ising formulations of many NP problems. Front. Phys. 2, 5 (2014)","journal-title":"Front. Phys."},{"key":"42_CR21","unstructured":"Smelyanskiy, V.N., et al.: A Near-Term Quantum Computing Approach for Hard Computational Problems in Space Exploration (2012)"},{"key":"42_CR22","unstructured":"Kieu, T.D.: Quantum adiabatic computation and the travelling salesman problem (2006). https:\/\/arxiv.org\/abs\/quant-ph\/0601151"},{"key":"42_CR23","doi-asserted-by":"crossref","unstructured":"Feld, S., et al.: A hybrid solution method for the capacitated vehicle routing problem using a quantum annealer. In: Frontiers in ICT, vol. 6 (2019). https:\/\/www.frontiersin.org\/articles\/10.3389\/fict.2019.00013\/full","DOI":"10.3389\/fict.2019.00013"},{"key":"42_CR24","doi-asserted-by":"crossref","unstructured":"Feld, S., et al.: A Hybrid Solution Method for the Capacitated Vehicle Routing Problem Using a Quantum Annealer (2019)","DOI":"10.3389\/fict.2019.00013"},{"key":"42_CR25","unstructured":"D-Wave\u2019s Leap project. https:\/\/www.dwavesys.com\/take-leap. Accessed 7 Feb 2020"},{"key":"42_CR26","unstructured":"https:\/\/docs.ocean.dwavesys.com\/projects\/qbsolv\/en\/latest. Accessed 7 Feb 2020"},{"key":"42_CR27","unstructured":"https:\/\/docs.ocean.dwavesys.com\/projects\/hybrid\/en\/latest. Accessed 7 Feb 2020"},{"issue":"5","key":"42_CR28","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/j.jfranklin.2005.12.002","volume":"344","author":"R Tavakkoli-Moghaddam","year":"2007","unstructured":"Tavakkoli-Moghaddam, R., Safae, N., Kah, M.M.O., Rabbani, M.: A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing. J. Franklin Inst. 344(5), 406\u2013425 (2007)","journal-title":"J. Franklin Inst."},{"issue":"1","key":"42_CR29","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ejor.2011.06.006","volume":"215","author":"WY Szeto","year":"2011","unstructured":"Szeto, W.Y., Yongzhong, W.Y., Ho, S.C.: An artificial bee colony algorithm for the capacitated vehicle routing problem. Eur. J. Oper. Res. 215(1), 126\u2013135 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"42_CR30","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1016\/j.cie.2013.01.007","volume":"65","author":"R Ba\u00f1osa","year":"2013","unstructured":"Ba\u00f1osa, R., Ortega, J., Gil, C., M\u00e1rquez, A.L., Toroc, F.: A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows. Comput. Ind. Eng. 65(2), 286\u2013296 (2013)","journal-title":"Comput. Ind. Eng."},{"key":"42_CR31","unstructured":"Bujel, K., Lai, F., Szczecinski, M., So, W., Fernandez, M.: Solving high volume capacitated vehicle routing problem with time windows using recursive-DBSCAN clustering algorithm. arXiv:1812.02300v2"},{"key":"42_CR32","unstructured":"http:\/\/www.vrp-rep.org\/datasets\/item\/2014-0002.html. Accessed 7 Feb 2020"},{"key":"42_CR33","first-page":"315","volume-title":"Combinatorial Optimization","author":"N Christofides","year":"1979","unstructured":"Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.) Combinatorial Optimization, pp. 315\u2013338. Wiley, Chichester (1979)"},{"key":"42_CR34","unstructured":"Code used in our experiments. https:\/\/github.com\/xBorox1\/D-Wave-Leap---CVRP\/tree\/master\/vrp. Accessed 7 Feb 2020"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50433-5_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T23:10:45Z","timestamp":1718752245000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-50433-5_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030504328","9783030504335"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50433-5_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"15 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"230","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"98","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"248 workshop papers were selected from 489 submissions to the thematic tracks. The conference was canceled due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}