GPS: Improvement in the Formulation of the TSP for Its Generalizations Type QUBO
Saúl González-Bermejo, Guillermo Alonso-Linaje, Parfait Atchade-Adelomou · Preprints.org · 2021
We propose a new binary 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. Furthermore, we present a detailed study of the constraints used and compare our model (GPS) with other frequent formulations (MTZ and native formulation). Finally, we have carried out a coherence and efficiency check of the proposed formulation by running it on a quantum annealing computer, D-Wave\_2000Q6.