XUA3937 - Computation Log
Instance Created: April 26, 2002
Number of Cities: 3937
Status: Optimal (see summary page)
Best Tour: 11239
Best Lower Bound: 11239
||11239 - Best of 10 runs of LKH, each with n trials. Total running time 6870 seconds on an AMD Althlon 1900+ processor (1.6 GHz).
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: June 10, 2002