Researchers propose a new binary formulation of the Travelling Salesman Problem (TSP), with which they overcame the best formulation of the Vehicle Routing Problem (VRP) in terms of the minimum number of necessary variables. Furthermore, they present a detailed study of the constraints used and compare their model (GPS) with other frequent formulations (MTZ and native formulation). Finally, they have carried out a coherence and efficiency check of the proposed formulation by running it on a quantum annealing computer, D-Wave 2000Q6.