
SRA104815 - Computation Log
Instance Created: May 6, 2002
Number of Cities: 104,815
Status: OPEN
Best Tour: 251,365
Best Lower Bound: xxx
History
| Date |
Gap |
Lower Bound |
Tour |
| 12.02.02 |
|
|
251,433 - Found by Keld Helsgaun using variants of his LKH code. |
| 3.21.03 |
|
|
251,426 - Found by Hung
Dinh Nguyen using a hybrid genetic algorithm, starting with the above
tour. |
| 9.12.04 |
|
|
251,365 - Found by Keld Helsgaun using variants of his LKH code. |
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: September 13, 2004
Contact: bico@isye.gatech.edu