Potential Energy Savings from Quantum Computing-Based Route Optimization
Ayush Nadiger, Adriana Caraeni, Katie Schouten

TL;DR
This paper demonstrates that quantum computing via QAOA can significantly improve route optimization efficiency and reduce energy consumption compared to classical algorithms, with promising implications for sustainable logistics.
Contribution
It introduces a quantum approach to route optimization, showing superior solution quality and energy savings over classical methods in benchmark tests.
Findings
QAOA achieves higher solution quality with approximation ratios above 0.9.
QAOA runs 2-3 times faster than simulated annealing.
Energy consumption is reduced by three orders of magnitude using QAOA.
Abstract
We investigate the potential of the Quantum Approximate Optimization Algorithm (QAOA) for reducing energy consumption in route planning, a key challenge in logistics due to the NP-hard nature of the Traveling Salesman and Vehicle Routing Problems. By encoding route optimization as a Quadratic Unconstrained Binary Optimization (QUBO) problem and implementing QAOA circuits at depth p = 3-5 alongside classical baselines of Simulated Annealing (SA) and Genetic Algorithms (GA), we perform systematic benchmarks on Euclidean graphs of sizes N = 5, 10, and 20. Our results demonstrate that QAOA attains higher solution quality with approximation ratios of 0.953 (N = 5), 0.921 (N = 10), and 0.903 (N = 20), outperforming SA and GA by 2.7-4.4%. Wall-clock runtimes for QAOA are 2-3x faster than SA across all tested sizes, and energy consumption measurements reveal a three-order-of-magnitude…
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.
