GPS: A new TSP formulation for its generalizations type QUBO
| Autor: | Saul Gonzalez-Bermejo, Guillermo Alonso-Linaje, Parfait Atchade-Adelomou |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: |
Quantum Physics
QUBO General Mathematics Computer Science::Neural and Evolutionary Computation quantum annealing MathematicsofComputing_NUMERICALANALYSIS FOS: Physical sciences quantum computing combinatorial optimization TSP VRP QA1-939 Computer Science (miscellaneous) Quantum Physics (quant-ph) Engineering (miscellaneous) Mathematics |
| Zdroj: | Mathematics; Volume 10; Issue 3; Pages: 416 Mathematics, Vol 10, Iss 416, p 416 (2022) |
| Popis: | We propose a new Quadratic Unconstrained Binary Optimization (QUBO) 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. After, we present a detailed study of the constraints subject to the new TSP model and benchmark it with MTZ and native formulations. Finally, we tested whether the correctness of the formulation by entering it into a QUBO problem solver. The solver chosen is a D-Wave\_2000Q6 quantum computer simulator due to the connection between Quantum Annealing and QUBO formulations. 15 pages, 10 figures and 4 tables |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|