.... Solving TSPs
....


VLSI TSPs

World TSP

National TSPs

Bonn Institute

Bonn Institute

Back to IRD29514

IRD29514 - Computation Log

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


History

Date Gap Lower Bound Tour
02.02.03 80377 - Found by Keld Helsgaun, using a variant of LKH.
16.03.03 80371 - Found by Hung Dinh Nguyen using a parallel hybrid genetic algorithm.
07.07.04 80361 - Found by Keld Helsgaun, using a variant of LKH.
xx.xx.xx 80356 - Found by Keld Helsgaun, using a variant of LKH.
10.11.08 80355 - Found by Changxing Dong, Gerold Jaeger, Paul Molitor and Dirk Richter using LKH2 with an extended candidate set.
11.27.08 80353 - Found by Keld Helsgaun, 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.

Last Updated:  November 29, 2008