Traveling Salesman Problem on TSP 100 nodes (held-out instances)
0Optimality GapOptimal (LKH-3)
Evaluation results
| Method | Links | ||
|---|---|---|---|
| Optimal (LKH-3)2026.02 | 0 | 7.813 | |
| G-LNSruns=3, evolution_size=502026.02 | 1.1 | 7.899 | |
| POMO2026.02 | 2.34 | 7.996 | |
| MCTS-AHD(ACO)runs=32026.02 | 3.45 | 8.083 | |
| ALNS2026.02 | 4.85 | 8.192 | |
| Evo-MCTSruns=32026.02 | 9.54 | 8.599 | |
| MCTS-AHDruns=32026.02 | 12.02 | 8.753 | |
| ReEvoruns=32026.02 | 12.88 | 8.82 | |
| FunSearchruns=32026.02 | 17.24 | 9.16 | |
| EoHruns=32026.02 | 17.28 | 9.163 |