|
View: |
Part 1: Document Description
|
|
Citation |
|
|---|---|
|
Title: |
Hard to Solve Instances of the Euclidean Traveling Salesman Problem |
|
Identification Number: |
doi:10.60507/FK2/ESZ1QZ |
|
Distributor: |
bonndata |
|
Date of Distribution: |
2024-05-24 |
|
Version: |
1 |
|
Bibliographic Citation: |
Hougardy, Stefan, 2024, "Hard to Solve Instances of the Euclidean Traveling Salesman Problem", https://doi.org/10.60507/FK2/ESZ1QZ, bonndata, V1 |
|
Citation |
|
|
Title: |
Hard to Solve Instances of the Euclidean Traveling Salesman Problem |
|
Identification Number: |
doi:10.60507/FK2/ESZ1QZ |
|
Authoring Entity: |
Hougardy, Stefan (University of Bonn) |
|
Distributor: |
bonndata |
|
Access Authority: |
Hougardy, Stefan |
|
Depositor: |
Hougardy, Stefan |
|
Date of Deposit: |
2024-05-21 |
|
Holdings Information: |
https://doi.org/10.60507/FK2/ESZ1QZ |
|
Study Scope |
|
|
Keywords: |
Computer and Information Science, Mathematical Sciences, Computer and Information Science, Mathematical Sciences |
|
Abstract: |
In our paper Hard to Solve Instances of the Euclidean Traveling Salesman Problem (Mathematical Programming Computation (2021) 13:51-74) we construct a family of Euclidean instances for the Traveling Salesman Problem for which the integrality ratio of the subtour LP converges to 4/3. These instances turn out to be very hard to solve with exact TSP solvers. On a 200 vertex instance from our family, Concorde, the fastest known exact TSP solver, needs more than 1,000,000 times the runtime it needs for TSPLIB instances of similar size. On a 1000 vertex instance the runtime factor is already about 10^27. Here we provide instances with up to 200 vertices from our family in TSPLIB format. We also provide code for generating these instances for an arbitrary number of vertices. Finally we make all the .log-files available of the runs of Concorde we describe in our paper. |
|
Methodology and Processing |
|
|
Sources Statement |
|
|
Data Access |
|
|
Other Study Description Materials |
|
|
Related Publications |
|
|
Citation |
|
|
Title: |
Hougardy, S., Zhong, X. Hard to solve instances of the Euclidean Traveling Salesman Problem. Math. Prog. Comp. 13, 51–74 (2021). https://doi.org/10.1007/s12532-020-00184-5 |
|
Identification Number: |
10.1007/s12532-020-00184-5 |
|
Bibliographic Citation: |
Hougardy, S., Zhong, X. Hard to solve instances of the Euclidean Traveling Salesman Problem. Math. Prog. Comp. 13, 51–74 (2021). https://doi.org/10.1007/s12532-020-00184-5 |
|
Label: |
readme.txt |
|
Notes: |
text/plain |
|
Label: |
Tnm.cpp |
|
Text: |
A C++-program to generate the Tnm-instances. |
|
Notes: |
text/plain |
|
Label: |
Tnm_instances.zip |
|
Text: |
All Tnm-instances with 52 to 199 vertices. |
|
Notes: |
application/zip |
|
Label: |
TSPLIB_logfiles.zip |
|
Text: |
log files of all Concorde runs on the TSPLIB instances as described in our paper. |
|
Notes: |
application/zip |
|
Label: |
Tnm_logfiles.zip |
|
Notes: |
application/zip |