 |


VLSI TSPs

World TSP

National TSPs



Bonn Institute

Back to ARA238025
|
 |

ARA238025 - Computation Log
Instance Created: May 6, 2002
Number of Cities: 238025
Status: OPEN
Best Tour: 578,827
Best Lower Bound: xxx
History
| Date |
Gap |
Lower Bound |
Tour |
| 12.08.02 |
|
|
579,075 - Found by Keld Helsgaun using variants of his LKH code. |
| 3.21.03 |
|
|
579,045 - Found by Hung
Dinh Nguyen using a hybrid genetic algorithm, starting with the above
tour. |
| 9.12.04 |
|
|
578,865 - Found by Keld Helsgaun using variants of his LKH code. |
| 7.4.08 |
|
|
578,828 - Found by Keld Helsgaun using variants of his LKH code. |
| 19.7.08 |
|
|
578,827 - Found by Changxing Dong, Gerold Jaeger, Paul Molitor, Dirk Richter
on an AMD Opteron 2,6 GHz by a variant of LKH. |
Notes
1. Concorde is our linear-programming based TSP solver.

2. linkern is an implementation of Martin, Otto, and Felten's Chained Lin-Kernighan heuristic. It is included in the Concorde code.

3. LKH is Keld Helsgaun's powerful implementation of the Lin-Kernighan heuristic.

Back to TSP home.
Last Updated: July 22, 2008
Contact: bico@isye.gatech.edu
|