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

Bibliographische Detailangaben

Veröffentlicht in:	Quantum information processing Jg. 23; H. 8
Hauptverfasser:	Xie, Ningyi, Lee, Xinwei, Cai, Dongsheng, Saito, Yoshiyuki, Asai, Nobuyoshi, Lau, Hoong Chuin
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 29.07.2024
Schlagworte:	Data Structures and Information Theory Mathematical Physics Physics Physics and Astronomy Quantum Computing Quantum Information Technology Quantum Physics Spintronics Problem encoding Feasibility AOA CVRP QAOA
ISSN:	1573-1332, 1573-1332
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!