Traveling Salesman Problem on TSPLIB (501-1000)
1,995,797.52Tour LengthTSP-MDF
Evaluation Results
| Method | Links | |
|---|---|---|
| TSP-MDFT=30, Base Heuristic=Farthest, Inference Time=8.73s2026.01 | 1,995,797.52 | |
| FastT2T+MS+GSInference Time=34.43s2026.01 | 2,025,285.39 | |
| DIMES+ASInference Time=4m8s2026.01 | 2,069,587.26 | |
| TSP-MDFT=1, Base Heuristic=Farthest, Inference Time=0.19s2026.01 | 2,078,129.38 | |
| Farthest InsertionInference Time=0.014s2026.01 | 2,089,399.54 | |
| FastT2TInference Time=5.43s2026.01 | 2,090,940.55 | |
| DIFUSCOInference Time=2m16s2026.01 | 2,155,408.74 | |
| TSP-MDFT=30, Base Heuristic=Nearest, Inference Time=9.10s2026.01 | 2,198,357.65 | |
| DIMESInference Time=2.41s2026.01 | 2,250,053.44 | |
| PointerformerInference Time=12.58s2026.01 | 2,265,651.43 | |
| TSP-MDFT=1, Base Heuristic=Nearest, Inference Time=0.21s2026.01 | 2,312,856.72 | |
| Nearest InsertionInference Time=0.017s2026.01 | 2,321,590.17 | |
| DeepACOInference Time=1m40s2026.01 | 2,391,352.04 |