.... Solving TSPs


World TSP

National TSPs

Bonn Institute

Bonn Institute

Back to XRB14233

XRB14233 - Computation Log

Instance Created:  April 26, 2002
Number of Cities:  14233
Status:  OPEN
Best Tour:  45462
Best Lower Bound:  45450


Date Gap Lower Bound Tour
10.6.02 45466 - Best of 10 runs of LKH, each with n trials. Total running time 177702 seconds on an AMD Althlon 1900+ processor (1.6 GHz).
2.2.03 45465 - Found by Keld Helsgaun, using a variant of LKH.
3.3.03 45464 - Found by Hung Dinh Nguyen using a parallel hybrid genetic algorithm. The running time was 39658 seconds on a Sun Ultra 80 with four 450-MHz processors (taking the best of five runs).
9.8.06 45462 - Found by Keld Helsgaun using LKH.
22.4.17 0.026% 45450 - Concorde (-Z1 -J4), using CPLEX as an LP solver. Wall-clock time for the branch-and-cut search was 3.8 days on a 48-core Intel Xeon E5-2620 @ 2.00GHz cluster; search tree contained 3,101 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 28, 2017