Back to Vietnam
TSP Home Page
VM22775 - Vietnam Computation Log
Instance Created: July 29, 2001
Number of Cities: 22,775
Optimal Value: 569,288
Solved: April 28, 2009
Solution Method: Concorde
||569,335 - Found by merging 3 LKH tours (each with n trials). The total time to find the tours was 482,069 seconds on a 500 MHz EV6 Alpha; merging required an additional 279.50 seconds). The best LKH tour had length 569,366.
||569,115 - Established by Concorde with -C 20 (used 23 nodes in the branch-and-cut tree, 114,751 seconds on a 500 MHz EV6 Alpha).
||569,295 - Found by morphing and merging 10 LKH tours (each with n trials). The total time to find the tours was 1,654,780 seconds on a 500 MHz EV6 Alpha; morphing the tours required an additional 66.74 seconds and merging the morphed tours required an 14,886.06 seconds). The best LKH tour had length 569,362.
||569,288 - Found by Keld Helsgaun using variants of his LKH code. The running time was approximately 1 week on a 400 MHz PowerMac G4.
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: April 28, 2008