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

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

Résumé

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.

langue originale	Anglais
titre	Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10 - Companion Publication
Pages	1689-1696
Nombre de pages	8
Les DOIs	https://doi.org/10.1145/1830761.1830790
état	Publié - 30 août 2010
Modification externe	Oui
Evénement	12th Annual Genetic and Evolutionary Computation Conference, GECCO-2010 - Portland, OR, États-Unis Durée: 7 juil. 2010 → 11 juil. 2010

Série de publications

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

Une conférence

Une conférence	12th Annual Genetic and Evolutionary Computation Conference, GECCO-2010
Pays/Territoire	États-Unis
La ville	Portland, OR
période	7/07/10 → 11/07/10

Accès au document

10.1145/1830761.1830790

Autres fichiers et liens

Lien vers la publication dans Scopus

Contient cette citation

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. Dans Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10 - Companion Publication (p. 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. p. 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. Dans 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, p. 1689-1696, 12th Annual Genetic and Evolutionary Computation Conference, GECCO-2010, Portland, OR, États-Unis, 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).

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

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

Résumé

Série de publications

Une conférence

Accès au document

Autres fichiers et liens

Empreinte digitale

Contient cette citation