Traveling Salesperson Problem on TSPLIB ch150 (Cost and Time)
7,249Solution Cost2-opt
Evaluation Results
| Method | Links | ||
|---|---|---|---|
| 2-optinitialization=from NN, algorithm_type=Constructive heuristics and local search2026.06 | 7,249 | 0.84 | |
| DA-TS Hybridalgorithm_type=Metaheuristics, implementation=Python2026.06 | 7,482 | 48.1 | |
| ACOalgorithm_type=Metaheuristics, implementation=Python2026.06 | 7,612 | 72.4 | |
| TSalgorithm_type=Metaheuristics, implementation=Python2026.06 | 8,194 | 3.8 | |
| NNsearch_mode=best of multi-start, algorithm_type=Constructive heuristics and local search2026.06 | 8,344 | 0.02 | |
| GAalgorithm_type=Metaheuristics, implementation=Python2026.06 | 8,623 | 58.3 | |
| Farthest Insertionalgorithm_type=Constructive heuristics and local search2026.06 | 9,127 | 0.01 | |
| PSOalgorithm_type=Metaheuristics, implementation=Python2026.06 | 9,351 | 45.6 | |
| Random Search (RS)algorithm_type=Metaheuristics, implementation=Python2026.06 | 12,945 | 11.2 | |
| DAalgorithm_type=Metaheuristics, implementation=Python2026.06 | 14,520 | 42.7 |