Traveling Salesman Problem on TSPLIB-gen (n=100)
5.6911CostOptimum
Evaluation results
| Method | Links | ||
|---|---|---|---|
| Optimum2026.04 | 5.6911 | — | |
| LEHD + NICORestarts=32, Budget=10n improvement steps2026.04 | 5.6922 | 57.92 | |
| NICORestarts=32, Budget=10n improvement steps2026.04 | 5.6927 | 56.89 | |
| LEHD + NICORestarts=8, Budget=10n improvement steps2026.04 | 5.6929 | 12.44 | |
| NICORestarts=8, Budget=10n improvement steps2026.04 | 5.6964 | 12.4 | |
| LEHD + NICOBudget=10n improvement steps2026.04 | 5.6998 | 3.98 | |
| NICOBudget=10n improvement steps2026.04 | 5.7036 | 3.47 | |
| LEHDMode=Single forward pass2026.04 | 5.759 | 0.72 | |
| NeuOptBudget=10n improvement steps2026.04 | 5.8435 | 29.07 | |
| 3opt Local SearchBudget=10n improvement steps2026.04 | 5.9126 | 10.97 | |
| 2opt-DRLBudget=10n improvement steps2026.04 | 5.9674 | 13.34 | |
| DACTBudget=10n improvement steps2026.04 | 5.9935 | 26.65 | |
| Tabu SearchBudget=10n improvement steps2026.04 | 6.0668 | 31.4 | |
| 2opt Local SearchBudget=10n improvement steps2026.04 | 6.0862 | 6.81 | |
| GAT-ImprovBudget=10n improvement steps2026.04 | 31.4524 | 31.04 |