 |


VLSI TSPs

World TSP

National TSPs



Bonn Institute

Back to LRA498378
|
 |

LRA498378 - Computation Log
Instance Created: May 6, 2002
Number of Cities: 498378
Status: OPEN
Best Tour: 2,168,484
Best Lower Bound: xxx
History
| Date |
Gap |
Lower Bound |
Tour |
| 12.08.02 |
|
|
2,169,314 - Found by Keld Helsgaun using variants of his LKH code. |
| 3.21.03 |
|
|
2,169,110 - Found by Hung
Dinh Nguyen using a hybrid genetic algorithm, starting with the above
tour. |
| 9.12.04 |
|
|
2,168,484 - 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: September 12, 2004
Contact: bico@isye.gatech.edu
|