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

Full description

Saved in:
Bibliographic Details
Published in:Mathematics (Basel) 2022-02, Vol.10 (3), p.416
Main Authors: Gonzalez-Bermejo, Saul, Alonso-Linaje, Guillermo, Atchade-Adelomou, Parfait
Format: Article
Language:English
Subjects:
combinatorial optimization
Constraint modelling
Food science
Neural networks
Optimization
quantum annealing
Quantum computers
Quantum computing
QUBO
Route planning
Solvers
Traveling salesman problem
TSP
Vehicle routing
Vehicles
VRP
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2227-7390
2227-7390
DOI:10.3390/math10030416