IDA - Intelligent Data Analysis Research Group

BibTeX Entry

  file = {Hansen2010ComparisonOfBBOB2009.pdf},
  category = {ida-publications},
  author = {Nikolaus Hansen and Anne Auger and Raymond Ros and Steffen Finck and Petr Po{\v s}{\'i}k},
  title = {Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009},
  booktitle = {GECCO '10: Proceedings of the 12th annual conference on Genetic and evolutionary computation},
  year = {2010},
  publisher = {ACM},
  address = {New York, NY, USA},
  pages = {1689-1696},
  url = {},
  keywords = {bbob, benchmarking, comparison, ea, real-valued},
  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.},
  vvvs = {1},
  obory = {JC},
  projects = {MLSC},

Creative Commons License  Content on this site is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Czech Republic License.