.... Solving TSPs


World TSP

National TSPs

Bonn Institute

Bonn Institute

Back to XQE3891

XQE3891 - Computation Log

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


Date Gap Lower Bound Tour
6.10.02 11996 - Best of 10 runs of LKH, each with n trials. Total running time 7174 seconds on an AMD Althlon 1900+ processor (1.6 GHz).
2.26.03 11995 - Found by Hung Dinh Nguyen using a parallel hybrid genetic algorithm. The running time was 8279 seconds on a Sun Ultra 80 with four 450-MHz processors (taking the best of five runs).


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:  February 26, 2003