A feasibility-preserved quantum approximate solver for the Capacitated Vehicle Routing Problem
The Capacitated Vehicle Routing Problem (CVRP) is an NP-optimization problem (NPO) that arises in various fields including transportation and logistics. The CVRP extends from the Vehicle Routing Problem (VRP), aiming to determine the most efficient plan for a fleet of vehicles to deliver goods to a...
Saved in:
| Published in: | Quantum information processing Vol. 23; no. 8 |
|---|---|
| Main Authors: | , , , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Springer US
29.07.2024
|
| Subjects: | |
| ISSN: | 1573-1332, 1573-1332 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!