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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Quantum information processing 2024-07, Vol.23 (8), Article 291
Hauptverfasser:	Xie, Ningyi, Lee, Xinwei, Cai, Dongsheng, Saito, Yoshiyuki, Asai, Nobuyoshi, Lau, Hoong Chuin
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Carrying capacity Coding Combinatorial analysis Constraints Customers Data Structures and Information Theory Feasibility Mathematical Physics Optimization Physics Physics and Astronomy Quantum Computing Quantum Information Technology Quantum Physics Shortest-path problems Spintronics Vehicle routing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!