Link Search Menu Expand Document
COCO Home

The bbob Test Suite

The blackbox optimization benchmarking (bbob) test suite is COCO's standard and most established test suite with 24 noiseless, scalable test functions. Each function is provided in various dimensions (2, 3, 5, 10, 20, 40) and available in an arbitrary number of instances. Direct links to their definition as well as to visualizations of their properties can be found below. A list of all so-far benchmarked algorithms on the bbob suite together with their links to papers describing the experiment can be found in our bbob data archive. Postprocessed data can be found here. For detailed explanations of how to use the functions in a COCO benchmarking experiment, please go to the COCO code page on Github. ECDF of runtimes for 31 algorithms on the bbob suite

The bbob functions

1 Separable Functions
f1Sphere Function
f2Separable Ellipsoidal Function
f3Rastrigin Function
f4Büche-Rastrigin Function
f5Linear Slope
2 Functions with low or moderate conditioning
f6Attractive Sector Function
f7Step Ellipsoidal Function
f8Rosenbrock Function, original
f9Rosenbrock Function, rotated
3 Functions with high conditioning and unimodal
f10Ellipsoidal Function
f11Discus Function
f12Bent Cigar Function
f13Sharp Ridge Function
f14Different Powers Function
4 Multi-modal functions with adequate global structure
f15Rastrigin Function
f16Weierstrass Function
f17Schaffer's F7 Function
f18Schaffer's F7 Function, moderately ill-conditioned
f19Composite Griewank-Rosenbrock Function F8F2
5 Multi-modal functions with weak global structure
f20Schwefel Function
f21Gallagher's Gaussian 101-me Peaks Function
f22Gallagher's Gaussian 21-hi Peaks Function
f23Katsuura Function
f24Lunacek bi-Rastrigin Function

Only f1 and f5 are purely quadratic or linear respectively.

See also N. Hansen et al (2010): Comparing Results of 31 Algorithms from the Black-Box Optimization Benchmarking BBOB-2009. Workshop Proceedings of the GECCO Genetic and Evolutionary Computation Conference 2010, ACM. 1)