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

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.

Anne Auger | A. Auger

[1] Samuel H. Brooks. A Discussion of Random Methods for Seeking Maxima , 1958 .

[2] Anne Auger,et al. Benchmarking the (1+1)-CMA-ES on the BBOB-2009 function testbed , 2009, GECCO '09.

[3] W. Vent,et al. Rechenberg, Ingo, Evolutionsstrategie — Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. 170 S. mit 36 Abb. Frommann‐Holzboog‐Verlag. Stuttgart 1973. Broschiert , 1975 .

[4] Nikolaus Hansen,et al. Completely Derandomized Self-Adaptation in Evolution Strategies , 2001, Evolutionary Computation.

[5] K. Steiglitz,et al. Adaptive step size random search , 1968 .

[6] Anne Auger,et al. Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions , 2009 .

[7] Petros Koumoutsakos,et al. Learning probability distributions in continuous evolutionary algorithms – a comparative review , 2004, Natural Computing.

[8] Raymond Ros,et al. Real-Parameter Black-Box Optimization Benchmarking 2009: Experimental Setup , 2009 .