On the influence of the number of algorithms, problems, and independent runs in the comparison of evolutionary algorithms.
Niki VecekMatej CrepinsekMarjan MernikPublished in: Appl. Soft Comput. (2017)
Keyphrases
- optimization problems
- evolutionary algorithm
- benchmark problems
- run times
- related problems
- computational complexity
- small number
- test problems
- learning algorithm
- polynomial time complexity
- multi objective
- difficult problems
- computationally efficient
- orders of magnitude
- combinatorial optimization
- approximate solutions
- problems in computer vision
- differential evolution algorithm
- metaheuristic
- np complete
- significant improvement
- computational problems
- search heuristics
- computational geometry
- constrained optimization problems
- memory requirements
- multidisciplinary design optimization
- evolution strategy
- heuristic methods
- hybrid algorithm
- search methods
- fitness function
- worst case
- data structure
- feature selection