
LAP7454 - Computation Log
Instance Created: April 26, 2002
Number of Cities: 7454
Status: OPEN
Best Tour: 19535
Best Lower Bound: xxx
History
| Date |
Gap |
Lower Bound |
Tour |
| 6.10.02 |
|
|
19538 - Best of 10 runs of LKH, each with n trials. Total running time 28597 seconds on an AMD Althlon 1900+ processor (1.6 GHz). |
| 2.2.03 |
|
|
19535 - 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: February 3, 2003
Contact: bico@isye.gatech.edu