Learning probability distributions in continuous evolutionary algorithms– a comparative review
Natural Computing: an international journal
Completely Derandomized Self-Adaptation in Evolution Strategies
Evolutionary Computation
Benchmarking the (1+1)-CMA-ES on the BBOB-2009 function testbed
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Benchmarking the (1+1)-ES with one-fifth success rule on the BBOB-2009 noisy testbed
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Benchmarking the (1+1)-CMA-ES on the BBOB-2009 function testbed
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Lessons from the black-box: fast crossover-based genetic algorithms
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Hi-index | 0.00 |
In this paper, we benchmark the (1+1) Evolution Strategy (ES) with one-fifth success rule which is one of the first and simplest adaptive search algorithms proposed for optimization. The benchmarking is conducted on the noise-free BBOB-2009 testbed. We implement a restart version of the algorithm and conduct for each run 106 times the dimension of the search space function evaluations.