Traveling Salesman Problem on Uniform Euclidean TSP n = 100
7.7352Solution CostOptimum
Evaluation results
| Method | Links | ||
|---|---|---|---|
| Optimum2026.04 | 7.7352 | — | |
| NICORestarts=8, Budget=10n improvement steps2026.04 | 7.7352 | 12.59 | |
| NICORestarts=32, Budget=10n improvement steps2026.04 | 7.7352 | 58.48 | |
| LEHD + NICORestarts=8, Budget=10n improvement steps2026.04 | 7.7352 | 12.66 | |
| LEHD + NICORestarts=32, Budget=10n improvement steps2026.04 | 7.7352 | 59.17 | |
| LEHD + NICOBudget=10n improvement steps2026.04 | 7.7386 | 3.98 | |
| NICOBudget=10n improvement steps2026.04 | 7.742 | 3.47 | |
| NeuOptBudget=10n improvement steps2026.04 | 7.7596 | 29.02 | |
| LEHDMode=Single forward pass2026.04 | 7.7746 | 0.72 | |
| 2opt-DRLBudget=10n improvement steps2026.04 | 7.8201 | 13.38 | |
| DACTBudget=10n improvement steps2026.04 | 7.8861 | 26.42 | |
| 3opt Local SearchBudget=10n improvement steps2026.04 | 8.0875 | 12.37 | |
| Tabu SearchBudget=10n improvement steps2026.04 | 8.2621 | 31.31 | |
| 2opt Local SearchBudget=10n improvement steps2026.04 | 8.3318 | 6.43 | |
| GAT-ImprovBudget=10n improvement steps2026.04 | 39.0326 | 31.4 |