REVIEW 1 cited by
Advanced Quantum Annealing Approach to Vehicle Routing Problems with Time Windows
Not yet reviewed by Pith; the record is open.
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
read the original abstract
In this paper, we explore the potential for quantum annealing to solve realistic routing problems. We focus on two NP-Hard problems, including the Traveling Salesman Problem with Time Windows and the Capacitated Vehicle Routing Problem with Time Windows. We utilize D-Wave's Quantum Annealer and Constrained Quadratic Model (CQM) solver within a hybrid framework to solve these problems. We demonstrate that while the CQM solver effectively minimizes route costs, it struggles to maintain time window feasibility as the problem size increases. To address this limitation, we implement a heuristic method that fixes infeasible solutions through a series of swapping operations. Testing on benchmark instances shows our method achieves promising results with an average optimality gap of 3.86%.
Forward citations
Cited by 1 Pith paper
-
School network reorganization under educational and spatial constraints using classical and quantum optimization
An ILP for school consolidation is solved to optimality for Calabria's full public school network and is also cast as a constrained quadratic model for D-Wave's hybrid solver, which matched every classical optimum.
Discussion (0). Continue with ORCID to comment.