.... Solving TSPs


World TSP

National TSPs

Bonn Institute

Bonn Institute

Back to XRH24104

XRH24104 - Computation Log

Instance Created:  April 26, 2002
Number of Cities:  24104
Status:  OPEN
Best Tour:  69297
Best Lower Bound:  xxx


Date Gap Lower Bound Tour
2.2.03 69307 - Found by Keld Helsgaun, using a variant of LKH.
3.4.03 69306 - Found by Hung Dinh Nguyen using a parallel hybrid genetic algorithm. The running time was 103160 seconds on a Sun Ultra 80 with four 450-MHz processors (taking the best of five runs).
18.3.03 69297 - Found by Keld Helsgaun, using a variant of LKH.


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:  March 19, 2003