Traveling Salesman Problem on Uniform Euclidean TSP n = 50
5.6705Tour CostOptimum
Evaluation results
| Method | Links | ||
|---|---|---|---|
| Optimum2026.04 | 5.6705 | — | |
| NICORestarts=8, Budget=10n improvement steps2026.04 | 5.6705 | 3.3 | |
| NICORestarts=32, Budget=10n improvement steps2026.04 | 5.6705 | 16.93 | |
| LEHD + NICORestarts=8, Budget=10n improvement steps2026.04 | 5.6705 | 3.43 | |
| LEHD + NICORestarts=32, Budget=10n improvement steps2026.04 | 5.6705 | 17.65 | |
| NICOBudget=10n improvement steps2026.04 | 5.6708 | 1.35 | |
| LEHD + NICOBudget=10n improvement steps2026.04 | 5.6711 | 1.77 | |
| LEHDMode=Single forward pass2026.04 | 5.6964 | 0.47 | |
| 3opt Local SearchBudget=10n improvement steps2026.04 | 5.8338 | 6.54 | |
| 2opt-DRLBudget=10n improvement steps2026.04 | 5.9109 | 5.7 | |
| 2opt Local SearchBudget=10n improvement steps2026.04 | 5.9466 | 3.39 | |
| Tabu SearchBudget=10n improvement steps2026.04 | 5.9474 | 14.65 | |
| DACTBudget=10n improvement steps2026.04 | 6.7532 | 7.01 | |
| NeuOptBudget=10n improvement steps2026.04 | 7.3853 | 9.01 | |
| GAT-ImprovBudget=10n improvement steps2026.04 | 14.0424 | 8.83 |