A Hybrid Solution Method for the Capacitated Vehicle Routing Problem Using a Quantum Annealer
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
The Capacitated Vehicle Routing Problem (CVRP) is an NP-optimization problem (NPO) that has been of great interest for decades for both, science and industry. The CVRP is a variant of the vehicle routing problem characterized by capacity constrained vehicles. The aim is to plan tours for vehicles to supply a given number of customers as efficiently as possible. The problem is the combinatorial explosion of possible solutions, which increases superexponentially with the number of customers. Classical solutions provide good approximations to the globally optimal solution. D-Wave's quantum annealer is a machine designed to solve optimization problems. This machine uses quantum effects to speed up computation time compared to classic computers. The problem on solving the CVRP on the quantum annealer is the particular formulation of the optimization problem. For this, it has to be mapped onto a quadratic unconstrained binary optimization (QUBO) problem. Complex optimization problems such as the CVRP can be translated to smaller subproblems and thus enable a sequential solution of the partitioned problem. This work presents a quantum-classic hybrid solution method for the CVRP. It clarifies whether the implemenation of such a method pays off in comparison to existing classical solution methods regarding computation time and solution quality. Several approaches to solving the CVRP are elaborated, the arising problems are discussed, and the results are evaluated in terms of solution quality and computation time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
Quantum annealing in the transverse Ising model
Kadowaki, T., & Nishimori, H. (1998) · Physical Review E · doi:10.1103/physreve.58.5355 · Cited by 2,339 · cited 1×
“Quantum annealing in general is a metaheuristic for solving complex optimization problems [21].”
BackgroundAlbash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
Research works printed but not linked: 32
- Ausiello, 1999, Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties., 10.1007/978-3-642-58412-1 · DOI · Paper page
- Biggs, 1986, The traveling salesman problem a guided tour of combinatorial optimization, Bullet. Lond. Math. Soc., 18, 514, 10.1112/blms/18.5.514 · doi:10.1112/blms/18.5.514
- Biswas, 2017, A nasa perspective on quantum computing: opportunities and challenges, Parall. Comput., 64, 81, 10.1016/j.parco.2016.11.002 · DOI · Paper page
- Black, 1992, Global portfolio optimization, Finan. Anal. J., 48, 28, 10.2469/faj.v48.n5.28 · DOI · Paper page
- Boros, 2007, Local search heuristics for quadratic unconstrained binary optimization (qubo), J. Heurist., 13, 99, 10.1007/s10732-007-9009-3 · DOI
- Bovet, 1994, Introduction to the Theory of Complexity
- Bramel, 1995, A location based heuristic for general routing problems, Operat. Res., 43, 649, 10.1287/opre.43.4.649 · DOI
- Cabrera, 2011, Optimization of healthcare emergency departments by agent-based simulation, Proc. Comput. Sci., 4, 1880, 10.1016/j.procs.2011.04.204 · DOI
- Cai, 2014, A practical heuristic for finding graph minors
- Caunhye, 2012, Optimization models in emergency logistics: a literature review, Socioecon. Plan. Sci., 46, 4, 10.1016/j.seps.2011.04.004 · DOI · Paper page
- Chancellor, 2017, Modernizing quantum annealing using local searches, N. J. Phys., 19, 023024, 10.1088/1367-2630/aa59c4 · DOI · Paper page
- Clarke, 1964, Scheduling of vehicles from a central depot to a number of delivery points, Operat. Res., 12, 568, 10.1287/opre.12.4.568 · DOI · Paper page
- Crispin, 2013, Quantum annealing algorithm for vehicle scheduling, 3523, 10.1109/SMC.2013.601 · DOI
- Dantzig, 1959, The truck dispatching problem, Manag. Sci., 6, 80, 10.1287/mnsc.6.1.80 · DOI · Paper page
- Fisher, 1981, A generalized assignment heuristic for vehicle routing, Networks, 11, 109, 10.1002/net.3230110205 · DOI · Paper page
- Gillett, 1974, A heuristic algorithm for the vehicle-dispatch problem, Operat. Res., 22, 340, 10.1287/opre.22.2.340 · DOI · Paper page
- Glauber, 1963, Time-dependent statistics of the ising model, J. Math. Phys., 4, 294, 10.1063/1.1703954 · DOI · Paper page
- Groër, 2010, A library of local search heuristics for the vehicle routing problem, Math. Prog. Comput., 2, 79, 10.1007/s12532-010-0013-5 · doi:10.1007/s12532-010-0013-5
- Haddar, 2016, A hybrid quantum particle swarm optimization for the multidimensional knapsack problem, Eng. Appl. Artif. Intell., 55, 1, 10.1016/j.engappai.2016.05.006 · DOI
- Karp, 1972, Reducibility among combinatorial problems, 85, 10.1007/978-1-4684-2001-2_9 · DOI · Paper page
- Koenig, 1995, Heuristiken zur Ein-Depot-Tourenplanung
- Laporte, 1992, The vehicle routing problem: an overview of exact and approximate algorithms, Eur. J. Operat. Res., 59, 345, 10.1016/0377-2217(92)90192-C · DOI · Paper page
- Laporte, 2002, Classical heuristics for the capacitated VRP, 109, 10.1137/1.9780898718515.ch5 · doi:10.1137/1.9780898718515.ch5
- Lin, 1965, Computer solution of the traveling salesman problem, Bell Syst. Tech. J., 44, 2245, 10.1002/j.1538-7305.1965.tb04146.x · DOI · Paper page
- Marshall, 2017, Thermalization, freeze-out, and noise: deciphering experimental quantum annealers, Phys. Rev. Appl., 8, 064025, 10.1103/PhysRevApplied.8.064025 · DOI
- McGeoch, 2014, Adiabatic quantum computation and quantum annealing: theory and practice, Synt. Lect. Quant. Comput., 5, 1, 10.2200/S00585ED1V01Y201407QMC008 · DOI
- Michael Booth, 2017, Partitioning Optimization Problems for Hybrid Classical/Quantum Execution
- Neukart, 2017, Traffic flow optimization using a quantum annealer, Front. ICT, 4, 29, 10.3389/fict.2017.00029 · DOI · Paper page
- Papadimitriou, 1998, Combinatorial Optimization: Algorithms and Complexity
- Rieffel, 2015, A case study in programming a quantum annealer for hard operational planning problems, Quant. Inform. Process., 14, 1, 10.1007/s11128-014-0892-x · DOI · Paper page
- Shin, 2011, A centroid-based heuristic algorithm for the capacitated vehicle routing problem, Comput. Inform., 30, 721
- Tran, 2016, A hybrid quantum-classical approach to solving scheduling problems
Cited by
Quantum annealing for industry applications: introduction and review
Yarkoni, S., Raponi, E., Bäck, T., & Schmitt, S. (2022) · Reports on Progress in Physics · doi:10.1088/1361-6633/ac8c54 · Cited by 341
Quantum bridge analytics I: a tutorial on formulating and using QUBO models
Glover, F., Kochenberger, G., Hennig, R., & Du, Y. (2022) · Annals of Operations Research · doi:10.1007/s10479-022-04634-2 · Cited by 297
Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models
Glover, F., Kochenberger, G., & Du, Y. (2019) · 4OR · doi:10.1007/s10288-019-00424-y · Cited by 298
Ajagekar, A., Humble, T., & You, F. (2020) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2019.106630 · Cited by 191
“Heuristic and metaheuristic algorithms can be directly applied to several variants of the vehicle routing problem [41, 72], but such techniques are context dependent and require careful parameter tuning to obtain good-quality solutions [73, 74].”
MethodSolving Vehicle Routing Problem Using Quantum Approximate Optimization Algorithm
Azad, U., Behera, B. K., Ahmed, E. A., Panigrahi, P. K., & Farouk, A. (2023) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2022.3172241 · Cited by 149
“One of the first few techniques that were used for solving capacitated vehicle routing problems was based on quantum annealing [28], and quantum walks [29].”
Method
Metadata
- Authors
- Feld, S., Roch, C., Gabor, T., Seidel, C., Neukart, F., Galter, I., Mauerer, W., & Linnhoff-Popien, C.
- Venue
- Frontiers in ICT
- Publisher
- Frontiers Media SA
- Published
- 2019-06-25
- Volume
- 6
- ISSN
- 2297-198X (ISSN-L)
- OpenAlex
- W2901067438
- Cited by
- 188
- References
- 3
- FWCI
- 12.08
- Type
- journal article
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.