On the limitations of classical benchmark functions for evaluating robustness of evolutionary algorithms
From MaRDI portal
(Redirected from Publication:846417)
Recommendations
- On the utility of randomly generated functions for performance evaluation of evolutionary algorithms
- Matrix adaptation evolution strategy with multi-objective optimization for multimodal optimization
- A robust real-coded evolutionary algorithm with toroidal search space conversion
- scientific article; zbMATH DE number 2040687
- scientific article; zbMATH DE number 1984139
Cites work
- scientific article; zbMATH DE number 2159376 (Why is no real title available?)
- A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
- Enhancing the performance of differential evolution using orthogonal design method
- Estimating the parameters of Weibull distribution using simulated annealing algorithm
- GEM: A novel evolutionary optimization method with improved neighborhood search
- Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems
- Iterated local search for the quadratic assignment problem
- Recent developments and trends in global optimization
- Scalability of the Bayesian optimization algorithm.
- Simulation optimisation using a genetic algorithm
- Test functions with variable attraction regions for global optimization problems
Cited in
(3)
This page was built for publication: On the limitations of classical benchmark functions for evaluating robustness of evolutionary algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q846417)