Sciweavers

Share
GECCO
2010
Springer

Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009

9 years 6 months ago
Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009
This paper presents results of the BBOB-2009 benchmarking 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 single convergence graph and the runtime distribution is uncovered. Performance is investigated for different dimensions up to 40-D, for different target precision values, and in different 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. Categories and Subject Descriptors
Nikolaus Hansen, Anne Auger, Raymond Ros, Steffen
Added 19 Jul 2010
Updated 19 Jul 2010
Type Conference
Year 2010
Where GECCO
Authors Nikolaus Hansen, Anne Auger, Raymond Ros, Steffen Finck, Petr Posík
Comments (0)
books