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

History

Date	Gap	Lower Bound	Tour
2.02.03			96821 - Found by Keld Helsgaun, using a variant of LKH.
16.03.03			96780 - Found by Hung Dinh Nguyen using a parallel hybrid genetic algorithm.
7.07.04			96778 - Found by Keld Helsgaun, using a variant of LKH.
4.07.08			96762 - Found by Keld Helsgaun, using a variant of LKH.
7.07.08			96760 - Found by Changxing Dong, Gerold Jaeger, Paul Molitor, and Dirk Richter, using a variant of LKH.
25.07.08			96759 - Found by Keld Helsgaun, using a variant of LKH.
26.08.09			96757 - 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.