Comparing Results of 31 Algorithms from the Black-Box Optimization Benchmarking BBOB-2009 - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Comparing Results of 31 Algorithms from the Black-Box Optimization Benchmarking BBOB-2009

Résumé

This paper presents results of the BBOB-2009 benchmark- ing of 31 search algorithms on 24 noiseless functions in a black-box optimization scenario in continuous domain. The runtime of the algorithms, measured in number of function evaluations, is investigated and a connection between a sin- gle convergence graph and the runtime distribution is uncov- ered. Performance is investigated for different dimensions up to 40-D, for different target precision values, and in dif- ferent subgroups of functions. Searching in larger dimension and multi-modal functions appears to be more difficult. The choice of the best algorithm also depends remarkably on the available budget of function evaluations.
Fichier principal
Vignette du fichier
ws1p34.pdf (691.38 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00545727 , version 1 (11-12-2010)

Identifiants

  • HAL Id : hal-00545727 , version 1

Citer

Nikolaus Hansen, Anne Auger, Raymond Ros, Steffen Finck, Petr Posik. Comparing Results of 31 Algorithms from the Black-Box Optimization Benchmarking BBOB-2009. ACM-GECCO Genetic and Evolutionary Computation Conference, Jul 2010, Portland, United States. ⟨hal-00545727⟩
706 Consultations
1184 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More