Cited by 145Vehicle Routing Optimization MethodsQuantum Computing Algorithms and ArchitectureComplexity and Algorithms in Graphs

Formulating and Solving Routing Problems on Quantum Computers

Open access
Harwood, Stuart, Gambella, Claudio, Trenev, Dimitar, Simonetto, Andrea, Bernal Neira, David, Greenberg, Donny·2021·IEEE Transactions on Quantum Engineering

Abstract

The determination of vehicle routes fulfilling connectivity, time, and operational constraints is a well-studied combinatorial optimization problem. The NP-hard complexity of vehicle routing problems has fostered the adoption of tailored exact approaches, matheuristics, and metaheuristics on classical computing devices. The ongoing evolution of quantum computing hardware and the recent advances of quantum algorithms (i.e., VQE, QAOA, and ADMM) for mathematical programming make decision-making for routing problems an avenue of research worthwhile to be explored on quantum devices. In this article, we propose several mathematical formulations for inventory routing cast as vehicle routing with time windows and comment on their strengths and weaknesses. The optimization models are compared from a quantum computing perspective, specifically with metrics to evaluate the difficulty in solving the underlying quadratic unconstrained binary optimization problems. Finally, the solutions obtained on simulated quantum devices demonstrate the relative benefits of different algorithms and their robustness when put into practice.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1109/tqe.2021.3049230

Cites

43 of 43 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • A certain amount of noise in the quantum solver can be beneficial for the final solution quality.

    “In this context, a certain amount of noise in the quantum solver has turned out to be even beneficial for the final solution quality [50, 61].”

    From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [61]

    In “Sequence-Based Formulation With Continuous Time,” the paper says that some inexactness in ADMM is beneficial for overall solution quality and notes that quantum computations are affected by errors and noise. It does not establish that adding noise to the quantum solver itself improves the final solution. (LLM, conf=0.82)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 1

  1. United Nations, "Review of maritime transport," United Nations, New York, NY, USA, Tech. Rep. UNCTAD/RMT/2018, 2018.

Cited by

Sorted by citations

Authors
Harwood, S., Gambella, C., Trenev, D., Simonetto, A., Bernal Neira, D., & Greenberg, D.
Affiliations
  • ExxonMobil (United States) (US)
  • IBM (Ireland) (IE)
  • Quantum Computing Group, Carnegie Mellon University, Pittsburgh, PA, USA
  • IBM (United States) (US)
Venue
IEEE Transactions on Quantum Engineering
Published
2021
Volume
2
Pages
1-17
ISSN
2689-1808 (ISSN-L)
OpenAlex
W3124206520
Cited by
145
References
42
Citations by year
2026: 17 · 2025: 34 · 2024: 37 · 2023: 31 · 2022: 21 · 2021: 5
FWCI
12.15
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Quantum Engineering (publishedVersion, cc-by)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Funders
International Business Machines Corporation
Topics
  • Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Vehicle Routing Optimization Methods
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
Keywords
vehicle routing, inventory routing problem, vehicle routing problem with time windows, quantum computing, QUBO, variational quantum eigensolver, alternating direction method of multipliers, combinatorial optimization, mathematical programming formulation

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