.... Solving TSPs


World TSP

National TSPs

Bonn Institute

Bonn Institute

Back to XPR2308

XPR2308 - Computation Log

Instance Created:  April 26, 2002
Number of Cities:  2308
Optimal Value:  7219
Solved:  January 8, 2003
Solution Method:  Concorde, QSopt LP solver
Solution Time:  1353264 seconds, Athlon 1900+


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


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