Editor: Samchen (last updated 07062023)
| Algo. name | Total Runtime | Problem Type | Poblem Definition | Global Optimal |
|---|---|---|---|---|
| Exhaustive Search | 30 mins | Single-based | Onemax-100bits | 26 bits |
| Hill Climbing | 0.591s | Single-based | Onemax-100bits | 100 bits |
| Simulated Annealing | 0.680s | Single-based | Onemax-100bits | 99.96 bits |
| Tabu Search | 6.697s | Single-based | Onemax-100bits | 99.99 bits |
| Genetic Algorithm | 45.356s | Populaiotn-based | Onemax-100bits | 89.56 bits |
| Ant Colony Optimization | Populaiotn-based | TSP-bays29.tsp | ||
| Particle Swarm Optimization | Populaiotn-based | Ackely function | (0,0) |
p.s. Total Runtime includes 51 runs for each algorithm to minimize the effect of random picking starting point. (except for exhausive search, only run single cycle)
Press each Algo. name for further description