Evolutionary Computation with Biogeography-based Optimization

Appendix AUnconstrained Benchmark Functions

The problem is to minimize f(x) over all x. We use x^* to represent the optimizing value of x, and f(x^*) is the minimum value of f(x)

[A.1]

Many of the benchmarks that we present in this section are from Yao et al. [YAO 99]. Detailed information about the unconstrained benchmarks and evaluation metrics for EA competitions at the 2005 IEEE Congress on Evolutionary Computation can be found in Suganthan et al. [SUG 05]. For the benchmarks presented here, their dimensionality can be varied so that performance can be explored as a function of the number of dimensions n.

F01 Sphere Function

[A.2]

F02 Schwefel’s Problem 2.22

[A.3]

F03 Schwefel’s Problem 1.2

[A.4]

F04 Schwefel’s Problem 2.21

[A.5]

F05 Generalized Rosenbrock’s Function

[A.6]

F06 Step Function

[A.7]

F07 Quartic Function

[A.8]

F08 Generalized Schwefel’s Problem 2.26

[A.9]

F09 Generalized ...