Traveling Salesman Problem on TSPLIB (1001-10000 nodes)
1,238,924.88Total Path LengthTSP-MDF
Evaluation results
| Method | Links | |
|---|---|---|
| TSP-MDFT=30, Base Heuristic=Farthest, Inference Time=4m26s2026.01 | 1,238,924.88 | |
| DIMES+ASInference Time=21m41s2026.01 | 1,260,123.03 | |
| TSP-MDFT=1, Base Heuristic=Farthest, Inference Time=8.96s2026.01 | 1,264,057.85 | |
| Farthest InsertionInference Time=0.64s2026.01 | 1,274,799.74 | |
| TSP-MDFT=30, Base Heuristic=Nearest, Inference Time=4m27s2026.01 | 1,330,555.17 | |
| DIMESInference Time=24.72s2026.01 | 1,336,129.23 | |
| TSP-MDFT=1, Base Heuristic=Nearest, Inference Time=8.47s2026.01 | 1,349,780.89 | |
| Nearest InsertionInference Time=0.67s2026.01 | 1,365,494.55 | |
| FastT2TInference Time=2m9s2026.01 | 1,577,897.58 | |
| DIFUSCOInference Time=22m31s2026.01 | 1,682,753.14 |