Benchmarking RCGAu on the Noiseless BBOB Testbed

Figure 2

Empirical cumulative distribution functions (ECDF), plotting the fraction of trials with an outcome not larger than the respective values on the -axis. Left subplots: ECDF of the number of function evaluations (FEvals) divided by search space dimension , to fall below with , where is the first value in the legend. The thick red line represents the most difficult target value . Legends indicate for each target the number of functions that were solved in at least one trial within the displayed budget. Right subplots: ECDF of the best achieved for running times of function evaluations (from right to left cycling cyan-magenta-black) and final -value (red), where and Df denote the difference to the optimal function value. Light brown lines in the background show ECDF for the most difficult target of all algorithms benchmarked during BBOB-2009.

(a)

(b)