Quantum Vehicle Routing Problem: a smart initialization strategy for ill-conditioned optimization landscapes

Abstract

With the expansion of complex transport infrastructure, new paths for linking different destinations have emerged, allowing the definition of multiple routes. The introduction of new roads may also lead to disruptions in traffic flow. This problem can be generalized into a special case of VRP, which aims to find the optimal route for a fleet of vehicles within a network of destinations. Finding solutions to this problem requires an exponential number of operations, hindering the ability of exact solvers to deal with large instances, which must therefore be tackled using heuristics, often leading to suboptimal results. Quantum-based algorithms may allow us to find exact solutions in polynomial time with high probability, offering a potential future alternative to classical solvers and in this work, we focus on the QAOA. Our novel contributions are a parameter-initialization strategy that improves the convergence probability and the integration of the subtour constraints directly into the optimization without using additional qubits by employing an approximation of exponential equality constraints. We believe that our results pave the way for effectively solving instances of VRP using quantum-based solutions, leveraging the space-efficient problem encoding and our initialization strategy, which limits the effect of barren-plateau under random parameter initialization.

Optimal Initialization Scale for Neural Networks with Locally Quadratic Loss Landscapes: An SGD Dynamics Perspective
Hiroshi Horii, Sothea Has
IEEE Transactions on Neural Networks and Learning Systems17 Aug 2026Peer-reviewedPublisher termsFull textStatisticsHAL
The Price of Feasibility: Greedy Approximation Bounds for String Supermodular Optimization over Oracle-Conditioned Greedoids
Joan Vendrell Gallart, Russell Bent, Solmaz Kia
arXiv7 Sep 2026PreprintarXiv licenceFull textCombinatorics & discrete mathematics Optimisation & controlarXiv
Benign population landscapes do not transfer to empirical risk minimization in nonsmooth optimization
Penghao Wang, Mateo Díaz, Liwei Jiang
arXiv1 Nov 2026PreprintCC BY 4.0Full textOptimisation & controlarXiv
From Variational Optimization to Flow-Based Transport: Posterior-Geometry Regularization for Ill-Conditioned Data Assimilation
Siming Liang, Feng Bao, Hristo G. Chipilski +2
arXiv23 Sep 2026PreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
Microstructure-Conditioned Surrogate Models for Graded Multiscale Optimization of Mycelium Composites
J. Storm, I. B. C. M. Rocha, S. Schyck +2
arXiv18 Oct 2026PreprintCC BY 4.0Full textNumerical analysis & scientific computing Computational physicsarXiv

Cite

BibTeX RIS

BibTeX

@misc{casciaro2026quantum,
  title = {{Quantum Vehicle Routing Problem: a smart initialization strategy for ill-conditioned optimization landscapes}},
  author = {Emanuele Casciaro and Mario De Simone and Stefano Martina and Fabio Mascherpa and Alfonso Amendola and Filippo Caruso},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.41120},
  eprint = {2610.41120},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.41120},
  note = {CC BY 4.0},
}

RIS

TY  - UNPB
TI  - Quantum Vehicle Routing Problem: a smart initialization strategy for ill-conditioned optimization landscapes
AU  - Emanuele Casciaro
AU  - Mario De Simone
AU  - Stefano Martina
AU  - Fabio Mascherpa
AU  - Alfonso Amendola
AU  - Filippo Caruso
PY  - 2026
DA  - 2026/10/30
PB  - arXiv
DO  - 10.48550/arxiv.2610.41120
UR  - https://arxiv.org/abs/2610.41120
AB  - With the expansion of complex transport infrastructure, new paths for linking different destinations have emerged, allowing the definition of multiple routes. The introduction of new roads may also lead to disruptions in traffic flow. This problem can be generalized into a special case of VRP, which aims to find the optimal route for a fleet of vehicles within a network of destinations. Finding solutions to this problem requires an exponential number of operations, hindering the ability of exact solvers to deal with large instances, which must therefore be tackled using heuristics, often leading to suboptimal results. Quantum-based algorithms may allow us to find exact solutions in polynomial time with high probability, offering a potential future alternative to classical solvers and in this work, we focus on the QAOA. Our novel contributions are a parameter-initialization strategy that improves the convergence probability and the integration of the subtour constraints directly into the optimization without using additional qubits by employing an approximation of exponential equality constraints. We believe that our results pave the way for effectively solving instances of VRP using quantum-based solutions, leveraging the space-efficient problem encoding and our initialization strategy, which limits the effect of barren-plateau under random parameter initialization.
ER  -

Abstract

Related

Cite