.... Solving TSPs


World TSP

National TSPs

Bonn Institute

Bonn Institute

Back to DLB3694

DLB3694 - Computation Log

Instance Created:  April 26, 2002
Number of Cities:  3694
Optimal Value:  10959
Solved:  March 27, 2003


Date Gap Lower Bound Tour
6.10.02 10959 - Best of 10 runs of LKH, each with n trials. Total running time 6275 seconds on an AMD Althlon 1900+ processor (1.6 GHz).
27.3.03 Optimal 10959 - Established by Concorde (defaults); 91 nodes in branch-and-cut tree; 47160 seconds on 2.4 GHz Intel Xeon workstation.


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 27, 2003