.... Solving TSPs
....


VLSI TSPs

World TSP

National TSPs

Bonn Institute

Bonn Institute

Back to BBY34656

BBY34656 - Computation Log

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


History

Date Gap Lower Bound Tour
2.2.03 99189 - Found by Keld Helsgaun, using a variant of LKH.
3.16.03 99188 - Found by Hung Dinh Nguyen using a hybrid genetic algorithm, starting with the above tour.
18.3.03 99181 - Found by Keld Helsgaun, using a variant of LKH.
15.5.07 99172 - Found by Keld Helsgaun, using a variant of LKH.
7.4.08 99161 - Found by Keld Helsgaun, using a variant of LKH.
30.06.08 99159 - Found by Changxing Dong, Gerold Jaeger, Paul Molitor, Dirk Richter on an AMD Opteron 2,6 GHz by 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.

Last Updated:  July 22, 2008