TY - GEN
T1 - Benchmarking the (1+1) evolution strategy with one-fifth success rule on the BBOB-2009 function testbed
AU - Auger, Anne
N1 - Publisher Copyright:
© 2009 ACM.
PY - 2009/1/1
Y1 - 2009/1/1
N2 - 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.
AB - 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.
KW - adaptive search
KW - benchmarking
KW - black-box optimization
KW - evolution strategies
KW - evolutionary computation
KW - one-fifth success rule
U2 - 10.1145/1570256.1570342
DO - 10.1145/1570256.1570342
M3 - Conference contribution
AN - SCOPUS:84883112719
SN - 9781605583259
T3 - Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009
SP - 2447
EP - 2452
BT - Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009
PB - Association for Computing Machinery
T2 - 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009
Y2 - 8 July 2009 through 12 July 2009
ER -