Goto ZIB Goto TU-Braunschweig Goto TU-Darmstadt

Testset X

These instances are complete graphs with euclidian distances. They were converted by Ralf Borndörfer and Carlos Ferreira from TSPLIB problems, by selecting some nodes as Terminals.

berlin52 is made out of 52 sights in Berlin.
brazil58 are 58 cities in Brazil with the provincial capitals as terminals.
world666 are 666 cities around the world with the capitals as terminals.

More information can be found among others in KM98 and PD00 .

The files can be found in the download section.

Name   |V|    |E|    |T|    DC    Opt 
 berlin5252 1326 16 Ps 1044 
 brasil5858 1653 25 Ps 13655 
 world666666 221445 174 Ps 122467 

The column DC classifies the difficulty of the instance.

Solvable by usage of local preprocessing. Typical examples are the SD-Test, BD-n Tests and FST computations. Neither a global upper nor lower bound needs to be computed.
Solvable by polynomial time algorithms, like dual ascent in combination with primal heuristic, a integral LP formulation or advanced preprocessing like reduced cost criteria or the RCR-Test.
No polynomial time algorithm is known. Use of an exponential time enumeration sceme like Branch-and-Bound is neccessary.

The letter after class gives an impression how long it takes to solve the problem using state-of-the-art soft- and hardware. secounds means less than a minute (this includes instances which can be solved in fractions of a second). minutes means less than an hour. hours is less than a day and days is less than a week. weeks mean it takes really a long time to solve this instance. ? means the instance is not solved or the time is not known.

If the number in the Opt column is written in italics the optimum is not known. The number given is the best know upper bound.

Last Update : 2015/02/11 11:57:20 $ by Thorsten Koch
© 2001 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)