List your company
ResearchFormerly WizWand

Traveling Salesman Problem on TSPLIB (501-1000)

1,995,797.52Tour LengthTSP-MDF
1,979,975.33922,086,775.05962,193,574.782,300,374.5004Jan 31, 2026
Updated 8mo ago

Evaluation results

MethodLinks
TSP-MDFT=30, Base Heuristic=Farthest, Inference Time=8.73s2026.011,995,797.52
FastT2T+MS+GSInference Time=34.43s2026.012,025,285.39
DIMES+ASInference Time=4m8s2026.012,069,587.26
TSP-MDFT=1, Base Heuristic=Farthest, Inference Time=0.19s2026.012,078,129.38
Farthest InsertionInference Time=0.014s2026.012,089,399.54
FastT2TInference Time=5.43s2026.012,090,940.55
DIFUSCOInference Time=2m16s2026.012,155,408.74
TSP-MDFT=30, Base Heuristic=Nearest, Inference Time=9.10s2026.012,198,357.65
DIMESInference Time=2.41s2026.012,250,053.44
PointerformerInference Time=12.58s2026.012,265,651.43
TSP-MDFT=1, Base Heuristic=Nearest, Inference Time=0.21s2026.012,312,856.72
Nearest InsertionInference Time=0.017s2026.012,321,590.17
DeepACOInference Time=1m40s2026.012,391,352.04