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

Nikolaus Hansen; Anne Auger; Raymond Ros; Steffen Finck; Petr Pošík

doi:10.1145/1830761.1830790

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

Nikolaus Hansen
, Anne Auger
, Raymond Ros
, Steffen Finck
, Petr Pošík

INRIA
Univ. of Applied Science Vorarlberg
Czech Technical University in Prague

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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.

Original language	English
Title of host publication	Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10 - Companion Publication
Pages	1689-1696
Number of pages	8
DOIs	https://doi.org/10.1145/1830761.1830790
Publication status	Published - 30 Aug 2010
Externally published	Yes
Event	12th Annual Genetic and Evolutionary Computation Conference, GECCO-2010 - Portland, OR, United States Duration: 7 Jul 2010 → 11 Jul 2010

Publication series

Name	Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10 - Companion Publication

Conference

Conference	12th Annual Genetic and Evolutionary Computation Conference, GECCO-2010
Country/Territory	United States
City	Portland, OR
Period	7/07/10 → 11/07/10

Keywords

Benchmarking
Black-box optimization

Access to Document

10.1145/1830761.1830790

Cite this

Hansen, N., Auger, A., Ros, R., Finck, S., & Pošík, P. (2010). Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009. In Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10 - Companion Publication (pp. 1689-1696). (Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10 - Companion Publication). https://doi.org/10.1145/1830761.1830790

Hansen, Nikolaus ; Auger, Anne ; Ros, Raymond et al. / Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009. Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10 - Companion Publication. 2010. pp. 1689-1696 (Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10 - Companion Publication).

@inproceedings{e84bdb8a7d494407b808d32200ee8d3b,

title = "Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009",

abstract = "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.",

keywords = "Benchmarking, Black-box optimization",

author = "Nikolaus Hansen and Anne Auger and Raymond Ros and Steffen Finck and Petr Po{\v s}{\'i}k",

year = "2010",

month = aug,

day = "30",

doi = "10.1145/1830761.1830790",

language = "English",

isbn = "9781450300735",

series = "Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10 - Companion Publication",

pages = "1689--1696",

booktitle = "Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10 - Companion Publication",

note = "12th Annual Genetic and Evolutionary Computation Conference, GECCO-2010 ; Conference date: 07-07-2010 Through 11-07-2010",

}

Hansen, N, Auger, A, Ros, R, Finck, S & Pošík, P 2010, Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009. in Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10 - Companion Publication. Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10 - Companion Publication, pp. 1689-1696, 12th Annual Genetic and Evolutionary Computation Conference, GECCO-2010, Portland, OR, United States, 7/07/10. https://doi.org/10.1145/1830761.1830790

Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009. / Hansen, Nikolaus; Auger, Anne; Ros, Raymond et al.
Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10 - Companion Publication. 2010. p. 1689-1696 (Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10 - Companion Publication).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Hansen, Nikolaus

AU - Auger, Anne

AU - Ros, Raymond

AU - Finck, Steffen

AU - Pošík, Petr

PY - 2010/8/30

Y1 - 2010/8/30

N2 - 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.

AB - 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.

KW - Benchmarking

KW - Black-box optimization

UR - https://www.scopus.com/pages/publications/77955938333

U2 - 10.1145/1830761.1830790

DO - 10.1145/1830761.1830790

M3 - Conference contribution

AN - SCOPUS:77955938333

SN - 9781450300735

T3 - Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10 - Companion Publication

SP - 1689

EP - 1696

BT - Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10 - Companion Publication

T2 - 12th Annual Genetic and Evolutionary Computation Conference, GECCO-2010

Y2 - 7 July 2010 through 11 July 2010

ER -

Hansen N, Auger A, Ros R, Finck S, Pošík P. Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009. In Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10 - Companion Publication. 2010. p. 1689-1696. (Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10 - Companion Publication). doi: 10.1145/1830761.1830790

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

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this