.... 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:  80361
Best Lower Bound:  xxx


History

Date Gap Lower Bound Tour
2.2.03 80377 - Found by Keld Helsgaun, using a variant of LKH.
3.16.03 80371 - Found by Hung Dinh Nguyen using a parallel hybrid genetic algorithm.
7.7.04 80361 - 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:  August 13, 2004
Contact:  bico@isye.gatech.edu