Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

GPS: Improvement in the Formulation of the TSP for Its Generalizations Type QUBO

Version 1 : Received: 9 December 2021 / Approved: 21 December 2021 / Online: 21 December 2021 (08:49:24 CET)

How to cite: Gonzalez-Bermejo, S.; Alonso-Linaje, G.; Atchade-Adelomou, P. GPS: Improvement in the Formulation of the TSP for Its Generalizations Type QUBO. Preprints 2021, 2021120316 (doi: 10.20944/preprints202112.0316.v1). Gonzalez-Bermejo, S.; Alonso-Linaje, G.; Atchade-Adelomou, P. GPS: Improvement in the Formulation of the TSP for Its Generalizations Type QUBO. Preprints 2021, 2021120316 (doi: 10.20944/preprints202112.0316.v1).

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

Subject

MATHEMATICS & COMPUTER SCIENCE, Computational Mathematics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.