Metraipolis › archive › dc_34dc8bb63cd3

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

Source: arXiv (en)
Original: https://arxiv.org/abs/2610.41120
License (as archived): CC0-1.0
Archived: 2026-11-03T08:16:28.146Z
SHA-256 of the archived text: 44a6075c4362ca219eabee29072ecac0187ad90e768df9a4a375fc63446bd586
Stable URL of this page: https://metraipolis.com/documento/dc_34dc8bb63cd3

How to cite

Quantum Vehicle Routing Problem: a smart initialization strategy for ill-conditioned optimization landscapes — arXiv:2610.41120 — arXiv (en), https://arxiv.org/abs/2610.41120 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_34dc8bb63cd3 (Metraipolis archive dc_34dc8bb63cd3, sha256 44a6075c4362ca219eabee29072ecac0187ad90e768df9a4a375fc63446bd586)

BibTeX

@misc{dc34dc8bb63cd3,
  title = {Quantum Vehicle Routing Problem: a smart initialization strategy for ill-conditioned optimization landscapes — arXiv:2610.41120},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41120},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_34dc8bb63cd3; sha256 44a6075c4362ca219eabee29072ecac0187ad90e768df9a4a375fc63446bd586},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41120. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph) ; Emerging Technologies (cs.ET); Combinatorics (math.CO); Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.41120 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T08:04:23.909Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).