Benchmarking the pure random search on the BBOB-2009 testbed

Authors:
Anne Auger;Raymond Ros
Affiliations:
INRIA Saclay Ile-de-France, Orsay, France;University Paris-Sud, Orsay, France
Venue:
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Year:
2009

Citing 0
Cited 3

Benchmarking the pure random search on the BBOB-2009 noisy testbed

Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
AOAB: automated optimization algorithm benchmarking

Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009

Proceedings of the 12th annual conference companion on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

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 106 times the search space dimension. With this budget the algorithm is not able to solve any single function of the testbed.