CoChat

A Hybrid Solution Method for the Capacitated Vehicle Routing Problem Using a Quantum Annealer

Open access
Feld, Sebastian, Roch, Christoph, Gabor, Thomas, Seidel, Christian, Neukart, Florian, Galter, Isabella, Mauerer, Wolfgang, Linnhoff-Popien, Claudia · 2019 · Frontiers in ICT
Cited by 188

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.3389/fict.2019.00013

Cites

3 of 3 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Research works printed but not linked: 32

  1. Ausiello, 1999, Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties., 10.1007/978-3-642-58412-1 · DOI · Paper page
  2. 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
  3. 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
  4. Black, 1992, Global portfolio optimization, Finan. Anal. J., 48, 28, 10.2469/faj.v48.n5.28 · DOI · Paper page
  5. Boros, 2007, Local search heuristics for quadratic unconstrained binary optimization (qubo), J. Heurist., 13, 99, 10.1007/s10732-007-9009-3 · DOI
  6. Bovet, 1994, Introduction to the Theory of Complexity
  7. Bramel, 1995, A location based heuristic for general routing problems, Operat. Res., 43, 649, 10.1287/opre.43.4.649 · DOI
  8. Cabrera, 2011, Optimization of healthcare emergency departments by agent-based simulation, Proc. Comput. Sci., 4, 1880, 10.1016/j.procs.2011.04.204 · DOI
  9. Cai, 2014, A practical heuristic for finding graph minors
  10. 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
  11. Chancellor, 2017, Modernizing quantum annealing using local searches, N. J. Phys., 19, 023024, 10.1088/1367-2630/aa59c4 · DOI · Paper page
  12. 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
  13. Crispin, 2013, Quantum annealing algorithm for vehicle scheduling, 3523, 10.1109/SMC.2013.601 · DOI
  14. Dantzig, 1959, The truck dispatching problem, Manag. Sci., 6, 80, 10.1287/mnsc.6.1.80 · DOI · Paper page
  15. Fisher, 1981, A generalized assignment heuristic for vehicle routing, Networks, 11, 109, 10.1002/net.3230110205 · DOI · Paper page
  16. Gillett, 1974, A heuristic algorithm for the vehicle-dispatch problem, Operat. Res., 22, 340, 10.1287/opre.22.2.340 · DOI · Paper page
  17. Glauber, 1963, Time-dependent statistics of the ising model, J. Math. Phys., 4, 294, 10.1063/1.1703954 · DOI · Paper page
  18. 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
  19. 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
  20. Karp, 1972, Reducibility among combinatorial problems, 85, 10.1007/978-1-4684-2001-2_9 · DOI · Paper page
  21. Koenig, 1995, Heuristiken zur Ein-Depot-Tourenplanung
  22. 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
  23. Laporte, 2002, Classical heuristics for the capacitated VRP, 109, 10.1137/1.9780898718515.ch5 · doi:10.1137/1.9780898718515.ch5
  24. 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
  25. Marshall, 2017, Thermalization, freeze-out, and noise: deciphering experimental quantum annealers, Phys. Rev. Appl., 8, 064025, 10.1103/PhysRevApplied.8.064025 · DOI
  26. McGeoch, 2014, Adiabatic quantum computation and quantum annealing: theory and practice, Synt. Lect. Quant. Comput., 5, 1, 10.2200/S00585ED1V01Y201407QMC008 · DOI
  27. Michael Booth, 2017, Partitioning Optimization Problems for Hybrid Classical/Quantum Execution
  28. Neukart, 2017, Traffic flow optimization using a quantum annealer, Front. ICT, 4, 29, 10.3389/fict.2017.00029 · DOI · Paper page
  29. Papadimitriou, 1998, Combinatorial Optimization: Algorithms and Complexity
  30. 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
  31. Shin, 2011, A centroid-based heuristic algorithm for the capacitated vehicle routing problem, Comput. Inform., 30, 721
  32. Tran, 2016, A hybrid quantum-classical approach to solving scheduling problems

Cited by

See all 188

Metadata

Authors
Feld, S., Roch, C., Gabor, T., Seidel, C., Neukart, F., Galter, I., Mauerer, W., & Linnhoff-Popien, C.
Venue
Frontiers in ICT
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.