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

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. Categories and Subject Descriptors

• Type: Conference
• Year: 2009
• Where: GECCO
• Authors: Anne Auger
• Keywords: GECCO 2009, One-fifth Success Rule, Optimization, Run 106 Times, Simplest Adaptive Search