Submitted:
09 December 2021
Posted:
21 December 2021
You are already at the latest version
Abstract
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.
Keywords:
n/a
; Quantum Computing
; Quantum Annealing
; Optimización combinatoria
; QUBO
; TSP
; VRP
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
