Pith. sign in

REVIEW 2 cited by

Quantum Annealing of Vehicle Routing Problem with Time, State and Capacity

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1903.06322 v1 pith:P7RVSJYL submitted 2019-03-15 quant-ph cs.DMcs.ETmath.OC

Quantum Annealing of Vehicle Routing Problem with Time, State and Capacity

Hirotaka Irie , Goragot Wongpaisarnsin , Masayoshi Terabe , Akira Miki , Shinichirou Taguchi This is my paper
classification quant-ph cs.DMcs.ETmath.OC
keywords statevehicleannealingcapacitatedconstraintscvrpformulationproblem
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We propose a brand-new formulation of capacitated vehicle routing problem (CVRP) as quadratic unconstrained binary optimization (QUBO). The formulated CVRP is equipped with time-table which describes time-evolution of each vehicle. Therefore, various constraints associated with time are successfully realized. With a similar method, constraints of capacities are also introduced, where capacitated quantities are allowed to increase and decrease according to the cities which vehicles arrive. As a bonus of capacity-qubits, one also obtains a description of state, which allows us to set a variety of traveling rules, depending on each state of vehicles. As a consistency check, the proposed QUBO formulation is also evaluated by quantum annealing with D-Wave 2000Q.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantum walk-based optimisation for capacitated vehicle routing with homogeneous and heterogeneous fleets

    quant-ph 2026-06 unverdicted novelty 7.0

    Presents a continuous-time quantum walk over a product space for CVRP that cuts gate complexity to O(n² log n) and shows faster convergence in simulations up to 8 customers.

  2. Qubit-Scalable CVRP via Lagrangian Knapsack Decomposition and Noise-Aware Quantum Execution

    quant-ph 2026-04 unverdicted novelty 6.0

    A hybrid quantum framework decomposes CVRP into bounded-width knapsack subproblems, trains a reinforcement learning controller for Lagrangian multipliers, and uses a contextual bandit to adapt quantum hardware executi...