Using Affine Combinations of BBOB Problems for Performance Assessment
Genetic and Evolutionary Computation Conference (GECCO), pp. 873–881
Abstract
Benchmarking plays a major role in the development and analysis of optimization algorithms. As such, the way in which the used benchmark problems are defined significantly affects the insights that can be gained from any given benchmark study. One way to easily extend the range of available benchmark functions is through affine combinations between pairs of functions. From the perspective of landscape analysis, these function combinations smoothly transition between the two base functions.
Authors 3
-
Diederick Vermetten Aachen
Affiliation as printed
Leiden University, Leiden, Netherlands
LIACS - Leiden Institute of Advanced Computer Science [Leiden] (Niels Bohrweg 1 2333 CA Leiden - Netherlands)
-
Furong Ye Aachen
Affiliation as printed
Leiden University, Leiden, Netherlands
LIACS - Leiden Institute of Advanced Computer Science [Leiden] (Niels Bohrweg 1 2333 CA Leiden - Netherlands)
-
Centre National de la Recherche Scientifique · Sorbonne Université
Affiliation as printed
CNRS, Paris, France
Sorbonne Universite, Paris, France
Cited by 10 stored of 10
10 results
No patents citing this paper on Lens.org (checked 2026-10-11).