State-of-the-Art Traveling Salesman 

Compare timings for computing traveling salesman for graphs. Experiments were performed on an Intel Core i7 3.07 GHz Windows 7 system, with a time limit of 1000 seconds.

show complete Wolfram Language inputhide input

In[1]:=

X (* TSPLIB data set *) link = "http://www.iwr.uni-heidelberg.de/groups/comopt/software/\ TSPLIB95/tsp/"; datanames = {"eil51", "kroE100", "u159", "pr226", "pcb442", "p654", "pr1002"}; data = Cases[ Import[link <> # <> ".tsp.gz", "Table"], {_Integer, x_?NumericQ, y_?NumericQ} :> {x, y}] & /@ datanames; (* timing *) timing = First[AbsoluteTiming[FindShortestTour[#]]] & /@ data;

Out[1]=