.... Solving TSPs


World TSP

National TSPs

Bonn Institute

Bonn Institute

Back to IDA8197

IDA8197 - Computation Log

Instance Created:  April 26, 2002
Number of Cities:  8197
Optimal Value:  22338
Solved:  April 7, 2017


Date Gap Lower Bound Tour
10.6.02 22339 - Best of 10 runs of LKH, each with n trials. Total running time 35609 seconds on an AMD Althlon 1900+ processor (1.6 GHz).
26.2.03 22338 - Found by Hung Dinh Nguyen using a parallel hybrid genetic algorithm. The running time was 15958 seconds on a Sun Ultra 80 with four 450-MHz processors (taking the best of five runs).
7.4.17 Optimal 22338 - Concorde (-Z1 -J4), using CPLEX as an LP solver. Wall-clock time for the branch-and-cut search was 81557 seconds, using a single core of an Intel Xeon E5-2620 @ 2.00GHz processor; search tree contained 249 nodes.


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:  April 19, 2017