Optimization Models for the Quadratic Traveling Salesperson Problem
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917762342846464 |
|---|---|
| author | Chen, Yuxiao Sathish, Nivetha Singh, Anubhav Kuroiwa, Ryo Beck, J. Christopher |
| author_facet | Chen, Yuxiao Sathish, Nivetha Singh, Anubhav Kuroiwa, Ryo Beck, J. Christopher |
| contents | The quadratic traveling salesperson problem (QTSP) is a generalization of the traveling salesperson problem, in which all triples of consecutive customers in a tour determine the travel cost. We propose compact optimization models for QTSP in mixed-integer quadratic programming (MIQP), mixed-integer linear programming (MILP), constraint programming (CP), and domain-independent dynamic programming (DIDP). Our experimental results demonstrate that the DIDP model performs better than other approaches in optimality gap and solution quality when the problem size is large enough. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_16680 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Optimization Models for the Quadratic Traveling Salesperson Problem Chen, Yuxiao Sathish, Nivetha Singh, Anubhav Kuroiwa, Ryo Beck, J. Christopher Optimization and Control Combinatorics The quadratic traveling salesperson problem (QTSP) is a generalization of the traveling salesperson problem, in which all triples of consecutive customers in a tour determine the travel cost. We propose compact optimization models for QTSP in mixed-integer quadratic programming (MIQP), mixed-integer linear programming (MILP), constraint programming (CP), and domain-independent dynamic programming (DIDP). Our experimental results demonstrate that the DIDP model performs better than other approaches in optimality gap and solution quality when the problem size is large enough. |
| title | Optimization Models for the Quadratic Traveling Salesperson Problem |
| topic | Optimization and Control Combinatorics |
| url | https://arxiv.org/abs/2408.16680 |