Benchmarking the (1+1) Evolution Strategy with One-Fifth Success Rule on the BBOB-2009 Function Testbed - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

Benchmarking the (1+1) Evolution Strategy with One-Fifth Success Rule on the BBOB-2009 Function Testbed

(1, 2)
1
2

Abstract

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.
Fichier principal
Vignette du fichier
wk2037-auger.pdf (436 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00430515 , version 1 (08-11-2009)

Identifiers

  • HAL Id : inria-00430515 , version 1

Cite

Anne Auger. Benchmarking the (1+1) Evolution Strategy with One-Fifth Success Rule on the BBOB-2009 Function Testbed. ACM-GECCO Genetic and Evolutionary Computation Conference, Jul 2009, Montreal, Canada. ⟨inria-00430515⟩
1233 View
4243 Download

Share

Gmail Facebook Twitter LinkedIn More