Network Design Optimization on Unconstrained Network Design
27.34Time to EpsilonGrA
Evaluation Results
| Method | Links | |||||
|---|---|---|---|---|---|---|
| GrAOptimization runs=302025.12 | 27.34 | 0 | 27.34 | 27.34 | — | |
| GrA-TSOptimization runs=30, Variant=Greedy-Tabu search2025.12 | 118.51 | 104.35 | 113.39 | 538.45 | — | |
| Gr-SAOptimization runs=30, Variant=Greedy-Simulated Annealing2025.12 | 118.71 | 116.76 | 98.84 | 577.23 | — | |
| TSOptimization runs=30, Full Name=Tabu Search2025.12 | 119.18 | 105.22 | 108.32 | 531.62 | — | |
| SAOptimization runs=30, Full Name=Simulated Annealing2025.12 | 121.94 | 118.48 | 75.86 | 583 | — | |
| GAOptimization runs=30, Full Name=Genetic Algorithm2025.12 | 134.55 | 113.17 | 45.26 | 547.84 | — | |
| PSOOptimization runs=30, Full Name=Particle Swarm Optimization2025.12 | 135.02 | 114.27 | 43.59 | 553.17 | — | |
| ACOOptimization runs=30, Full Name=Ant Colony Optimization2025.12 | 141.44 | 116.79 | 31.48 | 557.46 | — |