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

Uloženo v:
Podrobná bibliografie
Vydáno v:Mathematics (Basel) Ročník 10; číslo 3; s. 416
Hlavní autoři: Gonzalez-Bermejo, Saul, Alonso-Linaje, Guillermo, Atchade-Adelomou, Parfait
Médium: Journal Article
Jazyk:angličtina
Vydáno: Basel MDPI AG 01.02.2022
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 the constraints subject to the new TSP model and benchmark it with MTZ and native formulations. Finally, we will test whether the correctness of the formulation by entering it into a QUBO problem solver. The solver chosen is a D-Wave_2000Q6 quantum computer simulator due to the connection between Quantum Annealing and QUBO formulations.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2227-7390
2227-7390
DOI:10.3390/math10030416