Instance Created:  April 26, 2002
Number of Cities:  2323
Optimal Value:  8352
Solved:  January 11, 2003
Solution Method:  Concorde, QSopt LP solver
Solution Time:  11035 seconds, Athlon 1900+

History

Date	Gap	Lower Bound	Tour
6.10.02			8352 - Best of 10 runs of LKH, each with n trials. Total running time 1057 seconds on an AMD Althlon 1900+ processor (1.6 GHz).
1.8.03	Optimal	8352 - Concorde (default settings) using QSopt as an LP solver. The run was carried out on an Athlon 1900+, in 11035 seconds, using 67 nodes in the branch-and-bound-tree.

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.