.... Solving TSPs


World TSP

National TSPs

Bonn Institute

Bonn Institute

Back to BGF4475

BGF4475 - Computation Log

Instance Created:  April 26, 2002
Number of Cities:  4475
Status:  Optimal (see summary page)
Best Tour:  13221
Best Lower Bound:  13221


Date Gap Lower Bound Tour
6.10.02 13221 - Best of 10 runs of LKH, each with n trials. Total running time 17943 seconds on an AMD Althlon 1900+ processor (1.6 GHz).


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:  June 10, 2002