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

History

Date	Gap	Lower Bound	Tour
6.10.02			28388 - Best of 10 runs of LKH, each with n trials. Total running time 53022 seconds on an AMD Althlon 1900+ processor (1.6 GHz).
3.16.03			28387 - Found by Hung Dinh Nguyen using a hybrid genetic algorithm. The running time was 9089 seconds on a Sun Ultra 80 (450-MHz processor), starting from a tour found from an earlier run with a parallel version of the algorithm (22752 seconds with four processors).

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.