Graph Coarsening Approach to the Vehicle Routing Problem: An Approximation Strategy
In the Noisy Intermediate-Scale Quantum (NISQ) era of quantum computing, solving complex optimization problems such as the Vehicle Routing Problem (VRP) remains a formidable challenge. To overcome this obstacle, we introduce a novel method in this paper that focuses on reducing the number of edges i...
Saved in:
Main Authors: | Katarzyna Nalecz-Charkiewicz, Arnav Das, Turbasu Chatterjee, Joshua Keene, Pawel Gora, Carlos C. N. Kuhn |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2025-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10854442/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
ROUTE FIRST-CLUSTER SECOND METHOD FOR PERSONAL SERVICE ROUTING PROBLEM
by: MELİKE KÜBRA EKİZ, et al.
Published: (2019-06-01) -
The optimal route search in Bengaluru city transport using Hamilton circuit algorithm
by: Parkavi S, et al.
Published: (2025-02-01) -
Enhanced vehicle routing for medical waste management via hybrid deep reinforcement learning and optimization algorithms
by: Norhan Khallaf, et al.
Published: (2025-02-01) -
CONDITIONS FOR GRAPHS ON n VERTICES WITH THE SUM OF DEGREES OF ANY TWO NONADJACENT VERTICES EQUAL TO n-2 TO BE A HAMILTONIAN GRAPH
by: Nhu An Do, et al.
Published: (2024-02-01) -
Vehicle-routing problem for low-carbon cold chain logistics based on the idea of cost–benefit
by: Yan Liu, et al.
Published: (2025-01-01)