Skip to main navigation Skip to search Skip to main content

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

  • Anne Auger
  • INRIA

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 106 times the dimension of the search space function evaluations.

Original languageEnglish
Title of host publicationProceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009
PublisherAssociation for Computing Machinery
Pages2447-2452
Number of pages6
ISBN (Print)9781605583259
DOIs
Publication statusPublished - 1 Jan 2009
Externally publishedYes
Event11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009 - Montreal, QC, Canada
Duration: 8 Jul 200912 Jul 2009

Publication series

NameProceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009
Volume2009-January

Conference

Conference11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009
Country/TerritoryCanada
CityMontreal, QC
Period8/07/0912/07/09

Keywords

  • adaptive search
  • benchmarking
  • black-box optimization
  • evolution strategies
  • evolutionary computation
  • one-fifth success rule

Fingerprint

Dive into the research topics of 'Benchmarking the (1+1) evolution strategy with one-fifth success rule on the BBOB-2009 function testbed'. Together they form a unique fingerprint.

Cite this