The runner-root algorithm: A metaheuristic for solving unimodal and multimodal optimization problems inspired by runners and roots of plants in nature.
F. Merrikh BayatPublished in: Appl. Soft Comput. (2015)
Keyphrases
- metaheuristic
- optimization problems
- combinatorial optimization
- ant colony optimization
- simulated annealing
- optimal solution
- cost function
- objective function
- search space
- harmony search
- dynamic programming
- scatter search
- particle swarm optimization
- tabu search
- benchmark problems
- guided local search
- threshold accepting
- hybrid algorithms
- solution space
- np hard
- evolutionary algorithm
- genetic algorithm
- optimization method
- optimization algorithm
- convex hull
- benchmark instances
- aco algorithm
- iterated local search
- linear programming
- greedy randomized adaptive search procedure