.... Solving TSPs


World TSP

National TSPs

Bonn Institute

Bonn Institute

Back to DBJ2924

DBJ2924 - Computation Log

Instance Created:  April 26, 2002
Number of Cities:  2924
Optimal Value:  10128
Solved:  December 27, 2002
Solution Method:  Concorde, QSopt LP solver
Solution Time:  611740 seconds, Athlon 1900+


Date Gap Lower Bound Tour
6.10.02 10128 - Best of 10 runs of LKH, each with n trials. Total running time 3799 seconds on an AMD Althlon 1900+ processor (1.6 GHz).
12.27.02 Optimal 10128 - Concorde (default settings) using QSopt as an LP solver. The run was carried out on an Athlon 1900+, in 611740 seconds, using 3427 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