RBW2481 - Computation Log
Instance Created: April 26, 2002
Number of Cities: 2481
Optimal Value: 7724
Solved: March 26, 2003
History
Date |
Gap |
Lower Bound |
Tour |
10.6.02 |
|
|
7724 - Best of 10 runs of LKH, each with n trials. Total running time 2078 seconds on an AMD Althlon 1900+ processor (1.6 GHz). |
27.3.03 |
Optimal |
7724 - Established by
Concorde (defaults); 5 nodes in branch-and-cut tree; 564 seconds on
2.4 GHz Intel Xeon workstation. |
|
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 26, 2003