Processing math: 100%

Builds and returns the two-objective ZDT3 test problem. For m objective it is defined as follows f(x)=(f1(x1),f2(x)) with f1(x1)=x1,f2(x)=g(x)h(f1(x1),g(x)) where g(x)=1+9m1mi=2xi,h(f1,g)=1f1(x)g(x)(f1(x)g(x))sin(10πf1(x)) and xi[0,1],i=1,,m. This function has some discontinuities in the Pareto-optimal front introduced by the sine term in the h function (see above). The front consists of multiple convex parts.

makeZDT3Function(dimensions)

Arguments

dimensions

[integer(1)]
Number of decision variables.

Value

[smoof_multi_objective_function]

References

E. Zitzler, K. Deb, and L. Thiele. Comparison of Multiobjective Evolutionary Algorithms: Empirical Results. Evolutionary Computation, 8(2):173-195, 2000