.... Solving TSPs


World TSP

National TSPs

Bonn Institute

Bonn Institute

Back to FNC19402

FNC19402 - Computation Log

Instance Created:  April 26, 2002
Number of Cities:  19402
Status:  OPEN
Best Tour:  59287
Best Lower Bound:  59275


Date Gap Lower Bound Tour
10.6.02 59303 - Best of 10 runs of LKH, each with n trials. Total running time 330209 seconds on an AMD Althlon 1900+ processor (1.6 GHz).
2.2.03 59295 - Found by Keld Helsgaun, using a variant of LKH.
3.3.03 59291 - Found by Hung Dinh Nguyen using a parallel hybrid genetic algorithm. The running time was 75273 seconds on a Sun Ultra 80 with four 450-MHz processors (taking the best of five runs).
16.3.03 59289 - Found by Hung Dinh Nguyen using a hybrid genetic algorithm, starting with the above tour (10455 seconds).
18.3.03 59288 - Found by Keld Helsgaun, using a variant of LKH.
1.4.08 59287 Found by Changxing Dong, Gerold Jaeger, Paul Molitor, Dirk Richter by a variant of LKH based an backbone contraction. The running time was 25320 seconds on an AMD Opteron (2.6 GHz).
3.5.17 0.020% 59275 - Concorde (-Z1 -J4), using CPLEX as an LP solver. Wall-clock time for the branch-and-cut search was 2.6 days on a 48-core Intel Xeon E5-2620 @ 2.00GHz cluster; search tree contained 1,621 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:  May 3, 2017