GPS: Improvement in the formulation of the TSP for its generalizations type QUBO
The PhD candidate Parfait Atchadé together with the authors Saúl Gonzalez and Guillermo Alonso propose a new binary formulation of the Travelling Salesman Problem (TSP), with which we overcome the best formulation of the Vehicle Route Generation Problem (VRP) in terms of number minimum of necessary variables. Furthermore, we present a detailed study of the restrictions used and compare our model (GPS) with other frequent formulations (MTZ and native formulation). Finally, we have performed a consistency and efficiency check of the proposed formulation by running it on a quantum annealing computer, D-Wave 2000Q6.