Benchmarking the (1+1) evolution strategy with one-fifth success rule on the BBOB-2009 function testbed

Anne Auger
2009 Proceedings of the 11th annual conference companion on Genetic and evolutionary computation conference - GECCO '09  
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 10 6 times the dimension of the search space function evaluations.
doi:10.1145/1570256.1570342 dblp:conf/gecco/Auger09 fatcat:yfwopqq7hzc3fawoihz7tceqfy