A Greedy Quantum Route-Generation Algorithm
Jordan Makansi, David E. Bernal Neira

TL;DR
This paper introduces a greedy quantum routing algorithm that constructs feasible solutions by leveraging quantum sampling data, demonstrating improved results over classical and hybrid methods in vehicle routing problems with time windows.
Contribution
It presents a novel quantum-inspired greedy algorithm that adaptively constructs feasible routes, addressing inequality constraints and noise issues in quantum computing.
Findings
Achieves lower objective values than state-of-the-art annealing methods.
Demonstrates robustness to quantum noise on D-Wave Advantage2.
Proves convergence to feasible solutions.
Abstract
Routing and scheduling problems with time windows have long been important optimization problems for logistics and planning. Many classical heuristics and exact methods exist for such problems. However, there are no satisfactory methods for generating routes using quantum computing (QC), for mainly two reasons: inequality constraints, and the trade-off of feasibility and solution quality. Inequality constraints are typically handled using slack variables; and feasible solutions are found by filtering samples. These challenges are amplified in the presence of noise inherent in QC. Here, we propose a greedy algorithm that generates routes by using information from all samples obtained from the quantum computer. By noticing the relationship between qubits in our formulation as a directed acyclic graph (DAG), we designed an algorithm that adaptively constructs a feasible solution. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptical Network Technologies · Blind Source Separation Techniques · Quantum Computing Algorithms and Architecture
