GPS: A New TSP Formulation for Its Generalizations Type QUBO

We propose a new Quadratic Unconstrained Binary Optimization (QUBO) formulation of the Travelling Salesman Problem (TSP), with which we overcame the best formulation of the Vehicle Routing Problem (VRP) in terms of the minimum number of necessary variables. After, we will present a detailed study of...

Celý popis

Podrobná bibliografia

Vydané v:	Mathematics (Basel) Ročník 10; číslo 3; s. 416
Hlavní autori:	Gonzalez-Bermejo, Saul, Alonso-Linaje, Guillermo, Atchade-Adelomou, Parfait
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Basel MDPI AG 01.02.2022
Predmet:	combinatorial optimization Food science Neural networks Optimization quantum annealing Quantum computers Quantum computing QUBO Route planning Solvers Traveling salesman problem TSP Vehicle routing Vehicles VRP
ISSN:	2227-7390, 2227-7390
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!