Instance Created:  April 26, 2002
Number of Cities:  39603
Status:  OPEN
Best Tour:  106820
Best Lower Bound:  xxx

History

Date	Gap	Lower Bound	Tour
2.2.03			106838 - Found by Keld Helsgaun, using a variant of LKH.
3.16.03			106827 - Found by Hung Dinh Nguyen using a hybrid genetic algorithm, starting with the above tour.
5.3.04			106826 - Found by Keld Helsgaun, using a variant of LKH.
15.8.06			106821 - Found by Keld Helsgaun, using a variant of LKH.
14.7.08			106820 - Found by Changxing Dong, Gerold Jaeger, Paul Molitor, and Dirk Richter, using a variant of LKH.

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.