# Benchmarking the Pure Random Search on the BBOB-2009 Testbed

1 TAO - Machine Learning and Optimisation
LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8623
Abstract : We benchmark the pure random search algorithm on the BBOB 2009 noise-free testbed. Each candidate solution is sampled uniformly in $[-5, 5]^{D}$, where $D$ denotes the search space dimension. The maximum number of function evaluations chosen is $10^{6}$ times the search space dimension. With this budget the algorithm is not able to solve any single function of the testbed.
Document type :
Conference papers

Cited literature [4 references]

https://hal.inria.fr/inria-00430532
Contributor : Anne Auger <>
Submitted on : Sunday, November 8, 2009 - 4:57:23 PM
Last modification on : Monday, December 9, 2019 - 5:24:06 PM
Long-term archiving on: Thursday, June 17, 2010 - 7:45:28 PM

### File

wk2042-auger.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : inria-00430532, version 1

### Citation

Anne Auger, Raymond Ros. Benchmarking the Pure Random Search on the BBOB-2009 Testbed. ACM-GECCO Genetic and Evolutionary Computation Conference, Jul 2009, Montreal, Canada. ⟨inria-00430532⟩

Record views