DGA9698 - Computation Log
Instance Created: April 26, 2002
Number of Cities: 9698
Optimal Value: 27724
Solved: April 16, 2017
||27724 - Best of 10 runs of LKH, each with n trials. Total running time 70172 seconds on an AMD Althlon 1900+ processor (1.6 GHz).
||27724 - Concorde (-Z1 -J4), using CPLEX as an LP solver. Wall-clock time for the branch-and-cut search was 1.3 days on a 48-core Intel Xeon E5-2620 @ 2.00GHz cluster; search tree contained 1,085 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 12, 2017