| .... |
|
.... |
|
|
World TSP National TSPs VLSI TSPs CIA Factbook GEOnet Server GNIS Data ![]() TSP Links
|
|
The best reported tour for the World TSP was found by by Keld Helsgaun using a variant of his LKH heuristic algorithm. The tour of length 7,515,877,991 was found on May 12, 2009, improving Helsgaun's previous record of 7,515,947,511 found on November 27, 2008. Previous best known tours were of length 7,517,285,610 also by Helsgaun (September 16, 2003) and of length 7,518,425,642 by Hung Dinh Nguyen, Ikuo Yoshihara, Kunihito Yamamori, and Moritoshi Yasunaga (June 2, 2003), using a combination of iterated Lin-Kernighan and a parallel hybrid genetic algorithm. The current best lower bound on the length of a tour for the World TSP is 7,512,218,268. This bound was established by the Concorde TSP code (June 5, 2007), using CPLEX as a linear-prgramming solver. The bound shows that Keld Helsgaun's tour has length at most 0.0487% greater than the length of an optimal tour. We will be most happy to report any improved tour or improved lower bound that you may find. Data  (Gzipped TSPLIB Format, world.tsp.gz, 11.5 mbytes) ![]()
Back to TSP home.
|