.... Solving TSPs
....


VLSI TSPs

World TSP

National TSPs

Bonn Institute

Bonn Institute

Back to LRB744710

LRB744710 - Computation Log

Instance Created:  May 6, 2002
Number of Cities:  744710
Status:  OPEN
Best Tour:  1,611,534
Best Lower Bound:  xxx


History

Date Gap Lower Bound Tour
12.08.02 1,612,132 - Found by Keld Helsgaun using variants of his LKH code.
3.21.03 1,612,036 - Found by Hung Dinh Nguyen using a hybrid genetic algorithm, starting with the above tour.
9.12.04 1,611,547 - Found by Keld Helsgaun using variants of his LKH code.
4.25.06 1,611,534 - Found by Keld Helsgaun using variants of his LKH code.


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:  May 5, 2006
Contact:  bico@isye.gatech.edu