Traveling Salesman Problem on TSPLIB (1-500)
30,468.03LengthTSP-MDF
Evaluation results
| Method | Links | |
|---|---|---|
| TSP-MDFT=30, Base Heuristic=Farthest, Inference Time=10.48s2026.01 | 30,468.03 | |
| FastT2T+MS+GSInference Time=1m4s2026.01 | 30,953.51 | |
| DIMES+ASInference Time=5m44s2026.01 | 31,314.18 | |
| PointerformerInference Time=13.30s2026.01 | 31,370.4 | |
| TSP-MDFT=1, Base Heuristic=Farthest, Inference Time=0.31s2026.01 | 31,440.27 | |
| DIFUSCOInference Time=1m48s2026.01 | 31,995.12 | |
| Farthest InsertionInference Time=0.01s2026.01 | 32,051.45 | |
| FastT2TInference Time=8.36s2026.01 | 32,757.16 | |
| TSP-MDFT=30, Base Heuristic=Nearest, Inference Time=10.68s2026.01 | 33,040.38 | |
| DeepACOInference Time=2m24s2026.01 | 33,611.65 | |
| DIMESInference Time=3.16s2026.01 | 34,422.59 | |
| TSP-MDFT=1, Base Heuristic=Nearest, Inference Time=0.32s2026.01 | 34,833.57 | |
| Nearest InsertionInference Time=0.01s2026.01 | 35,896.11 |