Instance Created:  July 29, 2001
Number of Cities:  8,246
Status:  OPEN
Best Tour:  206,171
Best Lower Bound:  206,128

History

Date	Gap	Lower Bound	Tour
8.23.01			206,171 - Best tour from 40 runs of LKH (n trials per run). The 40 LKH runs took a total of 304,886 seconds on a 500 MHz EV6 Alpha. Merging the tours (52.99 seconds) did not make an improvement.
8.27.01	0.021%	206,128 - Established by Concorde with -C 20 (used 1,175 nodes in the branch-and-cut tree, 743,371 seconds on a 500 MHz EV6 Alpha).

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.