{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T15:08:03Z","timestamp":1761491283052,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030876715"},{"type":"electronic","value":"9783030876722"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87672-2_33","type":"book-chapter","created":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T21:02:46Z","timestamp":1632258166000},"page":"502-517","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Solving the Shipment Rerouting Problem with Quantum Optimization Techniques"],"prefix":"10.1007","author":[{"given":"Sheir","family":"Yarkoni","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Huck","sequence":"additional","affiliation":[]},{"given":"Hanno","family":"Sch\u00fclldorf","sequence":"additional","affiliation":[]},{"given":"Benjamin","family":"Speitkamp","sequence":"additional","affiliation":[]},{"given":"Marc Shakory","family":"Tabrizi","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Leib","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"B\u00e4ck","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Neukart","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,22]]},"reference":[{"unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134 (1994)","key":"33_CR1"},{"issue":"1907","key":"33_CR2","first-page":"553","volume":"439","author":"D Deutsch","year":"1992","unstructured":"Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. Proc. Roy. Soc. Lond. Ser. A Math. Phys. Sci. 439(1907), 553\u2013558 (1992)","journal-title":"Proc. Roy. Soc. Lond. Ser. A Math. Phys. Sci."},{"doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC \u201996, pp. 212\u2013219. Association for Computing Machinery, New York (1996)","key":"33_CR3","DOI":"10.1145\/237814.237866"},{"issue":"2","key":"33_CR4","first-page":"021050","volume":"8","author":"MH Amin","year":"2018","unstructured":"Amin, M.H., Andriyash, E., Rolfe, J., Kulchytskyy, B., Melko, R.: Quantum Boltzmann machine. Phys. Rev. X 8(2), 021050 (2018)","journal-title":"Phys. Rev. X"},{"unstructured":"Alexander, C., Shi, L., Akhmametyeva, S.: Using quantum mechanics to cluster time series. arXiv:1805.01711 (2018)","key":"33_CR5"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"29","DOI":"10.3389\/fict.2017.00029","volume":"4","author":"F Neukart","year":"2017","unstructured":"Neukart, F., Compostella, G., Seidel, C., von Dollen, D., Yarkoni, S., Parney, B.: Traffic flow optimization using a quantum annealer. Front. ICT 4, 29 (2017)","journal-title":"Front. ICT"},{"unstructured":"Venturelli, D., JJ Marchand, D., Rojo, G.: Quantum annealing implementation of job-shop scheduling. arXiv:1506.08479 (2015)","key":"33_CR7"},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-030-14082-3_10","volume-title":"Quantum Technology and Optimization Problems","author":"M Streif","year":"2019","unstructured":"Streif, M., Neukart, F., Leib, M.: Solving quantum chemistry problems with a D-wave quantum annealer. In: Feld, S., Linnhoff-Popien, C. (eds.) QTOP 2019. LNCS, vol. 11413, pp. 111\u2013122. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-14082-3_10"},{"issue":"6507","key":"33_CR9","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1126\/science.abb9811","volume":"369","author":"GAI Quantum","year":"2020","unstructured":"Quantum, G.A.I.: Hartree-fock on a superconducting qubit quantum computer. Science 369(6507), 1084\u20131089 (2020)","journal-title":"Science"},{"issue":"1","key":"33_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s42484-019-00001-w","volume":"1","author":"D Venturelli","year":"2019","unstructured":"Venturelli, D., Kondratyev, A.: Reverse quantum annealing approach to portfolio optimization problems. Quant. Mach. Intell 1(1), 17\u201330 (2019). https:\/\/doi.org\/10.1007\/s42484-019-00001-w","journal-title":"Quant. Mach. Intell"},{"issue":"7346","key":"33_CR11","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1038\/nature10012","volume":"473","author":"MW Johnson","year":"2011","unstructured":"Johnson, M.W., et al.: Quantum annealing with manufactured spins. Nature 473(7346), 194\u2013198 (2011)","journal-title":"Nature"},{"unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm. arXiv:1411.4028 (2014)","key":"33_CR12"},{"issue":"4","key":"33_CR13","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1137\/080734479","volume":"50","author":"D Aharonov","year":"2008","unstructured":"Aharonov, D., Van Dam, W., Kempe, J., Landau, Z., Lloyd, S., Regev, O.: Adiabatic quantum computation is equivalent to standard quantum computation. SIAM Rev. 50(4), 755\u2013787 (2008)","journal-title":"SIAM Rev."},{"issue":"10","key":"33_CR14","doi-asserted-by":"publisher","first-page":"3241","DOI":"10.1088\/0305-4470\/15\/10\/028","volume":"15","author":"F Barahona","year":"1982","unstructured":"Barahona, F.: On the computational complexity of ising spin glass models. J. Phys. A Math. Gener. 15(10), 3241 (1982)","journal-title":"J. Phys. A Math. Gener."},{"key":"33_CR15","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."},{"issue":"2","key":"33_CR16","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/s42979-021-00466-2","volume":"2","author":"Y Ding","year":"2021","unstructured":"Ding, Y., Chen, X., Lamata, L., Solano, E., Sanz, M.: Implementation of a hybrid classical-quantum annealing algorithm for logistic network design. SN Comput. Sci. 2(2), 68 (2021)","journal-title":"SN Comput. Sci."},{"issue":"1","key":"33_CR17","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1109\/TITS.2019.2891235","volume":"21","author":"T Stollenwerk","year":"2020","unstructured":"Stollenwerk, T., et al.: Quantum annealing applied to de-conflicting optimal trajectories for air traffic management. IEEE Trans. Intell. Transp. Syst. 21(1), 285\u2013297 (2020)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"unstructured":"Domino, K., Koniorczyk, M., Krawiec, K.,Ja\u0142owiecki, K., Gardas, B.: Quantum computing approach to railway dispatching and conflict management optimization on single-track railway lines. arXiv:2010.08227 (2021)","key":"33_CR18"},{"issue":"6","key":"33_CR19","doi-asserted-by":"publisher","first-page":"1429","DOI":"10.1016\/j.cor.2003.11.012","volume":"32","author":"AM Costa","year":"2005","unstructured":"Costa, A.M.: A survey on benders decomposition applied to fixed-charge network design problems. Comput. Oper. Res. 32(6), 1429\u20131450 (2005)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"33_CR20","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.ejor.2015.12.051","volume":"253","author":"DC Paraskevopoulos","year":"2016","unstructured":"Paraskevopoulos, D.C., Bekta\u015f, T., Crainic, T.G., Potts, C.N.: A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem. Eur. J. Oper. Res. 253(2), 265\u2013279 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"9","key":"33_CR21","doi-asserted-by":"publisher","first-page":"2997","DOI":"10.1016\/j.asoc.2012.04.022","volume":"12","author":"M Yaghini","year":"2012","unstructured":"Yaghini, M., Momeni, M., Sarmadi, M.: A simplex-based simulated annealing algorithm for node-arc capacitated multicommodity network design. Appl. Soft Comput. 12(9), 2997\u20133003 (2012)","journal-title":"Appl. Soft Comput."},{"issue":"4598","key":"33_CR22","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"6195","key":"33_CR23","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1126\/science.1252319","volume":"345","author":"TF R\u00f8nnow","year":"2014","unstructured":"R\u00f8nnow, T.F., Wang, Z., Job, J., Boixo, S., Isakov, S.V., Wecker, D., Martinis, J.M., Lidar, D.A., Troyer, M.: Defining and detecting quantum speedup. Science 345(6195), 420\u2013424 (2014)","journal-title":"Science"},{"issue":"6","key":"33_CR24","doi-asserted-by":"publisher","first-page":"061007","DOI":"10.7566\/JPSJ.88.061007","volume":"88","author":"J King","year":"2019","unstructured":"King, J., et al.: Quantum annealing amid local ruggedness and global frustration. J. Phys. Soc. Jpn. 88(6), 061007 (2019)","journal-title":"J. Phys. Soc. Jpn."},{"unstructured":"D-Wave Systems has produced an open-source library in Python (dimod) for solvers that optimize QUBOs and Ising Hamiltonians. More information can be found here. https:\/\/docs.ocean.dwavesys.com\/en\/stable\/docs_dimod\/","key":"33_CR25"},{"issue":"3","key":"33_CR26","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search\u2013part I. ORSA J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Yarkoni, S., et al.: Quantum shuttle: traffic navigation with quantum computing, pp. 22\u201330. Association for Computing Machinery, New York (2020)","key":"33_CR27","DOI":"10.1145\/3412451.3428500"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87672-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T21:11:38Z","timestamp":1632258698000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87672-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030876715","9783030876722"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87672-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccl22021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccl2021.nl\/","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":"111","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":"42","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":"0","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":"38% - 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":"2","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)"}}]}}