Quantum Annealing based Hybrid Strategies for Real Time Route Optimization

One of the most well-known problems in transportation and logistics is the Capacitated Vehicle Routing Problem (CVRP). It involves optimizing a set of truck routes to service a set of customers, subject to limits on truck capacity, to reduce travel costs. The biggest challenge faced whilst attemptin...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Sushil Mario, Pothamsetti, Pavan Teja, Louie Antony Thalakottor, Vishwanath, Trisha, Sanjay, H A, Ahmed, Anees, Sinno, Salvatore, Thuravakkath, Shruthi, Sinthuja, M
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 21.11.2024
Subjects
Algorithms
Clustering
Complexity
Customers
Problem solving
Quantum computers
Vehicle routing
Online AccessGet full text
ISSN2331-8422

Cover

More Information
Summary:One of the most well-known problems in transportation and logistics is the Capacitated Vehicle Routing Problem (CVRP). It involves optimizing a set of truck routes to service a set of customers, subject to limits on truck capacity, to reduce travel costs. The biggest challenge faced whilst attempting to solve the issue is that the time complexity of the issue grows exponentially with the number of customers and trucks, rendering it virtually intractable to traditional computers and algorithms. In this paper, we propose a method to circumvent this limitation, employing quantum computers to aid classical computers in solving problems faster while reducing complexity. To obtain our results, we employ two algorithms: Hybrid Two Step (H2S) and Hybrid Three Step (H3S). Both algorithms involve two phases: clustering and routing. It has been observed that both algorithms produce promising results, both in terms of solution time and solution cost.
Bibliography:content type line 50
SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
ISSN:2331-8422