Instance Created:  April 26, 2002
Number of Cities:  7168
Optimal Value:  21834
Solved:  April 6, 2017
Solution Method:  Concorde, CPLEX LP solver
Solution Time:  8 hours, 12 minutes (24-core Intel Xeon E5-2620 @ 2.00GHz)

History

Date	Gap	Lower Bound	Tour
10.6.02			21834 - Best of 10 runs of LKH, each with n trials. Total running time 29879 seconds on an AMD Althlon 1900+ processor (1.6 GHz).
4.6.17	Optimal	21834 - Concorde -Z1 -J4 (with domino-parity inequalities). Run on a network of two machines, each with two 6-core Intel Xeon E5-2620 @ 2.00GHz processors. Wall clock time 8 hours, 12 minutes (for branch-and-cut search)

Notes

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.