 |


VLSI TSPs

World TSP

National TSPs



Bonn Institute

Back to DAN59296
|
 |

DAN59296 - Computation Log
Instance Created: April 26, 2002
Number of Cities: 59296
Status: OPEN
Best Tour: 165440
Best Lower Bound: xxx
History
| Date |
Gap |
Lower Bound |
Tour |
| 2.2.03 |
|
|
165450 - Found by Keld Helsgaun,
using a variant of LKH. |
| 3.16.03 |
|
|
165445 - Found by Hung
Dinh Nguyen using a hybrid genetic algorithm, starting with the above
tour. |
| 3.21.03 |
|
|
165444 - Found by Hung
Dinh Nguyen using a hybrid genetic algorithm, starting with the above
tour. |
| 5.3.03 |
|
|
165440 - Found by Keld Helsgaun,
using 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: August 13, 2004
Contact: bico@isye.gatech.edu
|