LSB22777 - Computation Log
Instance Created: April 26, 2002
Number of Cities: 22777
Status: OPEN
Best Tour: 60977
Best Lower Bound: xxx
History
Date |
Gap |
Lower Bound |
Tour |
3.3.03 |
|
|
60980 - Found by Hung
Dinh Nguyen using
a parallel hybrid genetic algorithm.
The running time was 93251 seconds on a Sun Ultra 80 with four 450-MHz
processors (taking the best of five runs). |
18.3.03 |
|
|
60977 - 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: March 19, 2003