Instance Created:  July 29, 2001
Number of Cities:  3,496
Optimal Value:  96132
Solved:  July 30, 2001
Solution Method:  concorde (-C 24), CPLEX 6.5 LP solver
Solution Time:  14787.74 seconds, Compaq Alpha EV6 500 MHz

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.
4. linkerh is an implementation of the Lin-Kernighan heuristic, making use of a number of the imporantant new ideas introduced in Keld Helsgaun's LKH code. We will include linkerh in the next release of Concorde.

Back to TSP home.