Results suggest that near-term quantum sampling is most useful as a selective local repair mechanism rather than as a replacement for classical routing heuristics.
Abstract
This study develops a hybrid quantum-classical framework for constrained vehicle routing problems, focusing on the pickup-and-delivery problem with time windows. Instead of casting the full routing problem as a stand-alone quantum optimization task, we embed shallow quantum samplers inside the repair phase of an Adaptive Large Neighbourhood Search (ALNS) heuristic. A Deep Q-Network controller decides whether each reduced repair subproblem should be handled by a classical repair heuristic or by a quantum sampler, using features that describe the local repair structure and predicted hardware reliability. IBM Heron experiments are used to calibrate an empirical noise-aware model for local quantum repair circuits. Across the tested instances, quantum repair is admissible in only about 16% of reduced repair states and is not superior on average. However, under selected matched repair budgets, quantum-enabled repair reduces the final gap relative to standard ALNS in 29 of 36 tested settings. These results suggest that near-term quantum sampling is most useful as a selective local repair mechanism rather than as a replacement for classical routing heuristics.
The results suggest that quantum kernels may serve as complementary routing-aware decomposition modules within classical optimization pipelines, particularly for offline structural preprocessing.
This work introduces a warm-start method based on local correlators obtained from the Quantum Approximate Optimization Algorithm (QAOA), and uses this information to initialize the Burer-Monteiro (BM) rank-two relaxation.
Bao Gia Bach, Ilya Safro, Filip B. Maciejewski· 0 citations
MosaiQC demonstrates a superior trade-off for run speed and solution quality, while adding fundamental features excluded by most competitors, and demonstrates that scalable heuristic optimization can substantially reduce the computational overhead of circuit-cut placement for increasingly large quantum circuits.
Koen J. Mesman, Yinglu Tang, Matthias Moller et al.· 0 citations
The Maximal Covering Location Problem (MCLP) is an NP-hard Combinatorial Optimization Problem (COP) that aims to determine the optimal facility placements that maximize total coverage. It is characterized by both equality and inequality constraints, which ensure correct coverage but significantly increase the complexit...
Jorge Saavedra-Benavides, J. A. Montañez-Barrera, Alberto Maldonado-Romo et al.· 0 citations
This paper presents a comprehensive investigation of quantum annealing and hybrid quantum-classical algorithms applied to unit load device (ULD) configuration and disruption management in air cargo and multimodal logistics networks, and provides a practical roadmap for near-term adoption of quantum technologies in high...
V. Sharma· International Journal of Cre...· 0 citations
Investigation and compare the performance of two quantum optimization approaches, the Quantum Approximate Optimization Algorithm (QAOA) and quantum annealing, applied to the Minimum Vertex Cover (MVC) problem suggest that while both paradigms hold potential for combinatorial optimization, further advances in hardware c...
Simone Faro, G. Messina, Damiano Muzzicato et al.· IEEE International Symposium...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.