Synthetic Objective Functions and ZDT1

Preamble¶

Introduction¶

In mathematics, optimisation is concerned with the selection of optimal solutions to objective functions. An objective function consists of input arguments referred to as problem variables (or genotype) which are computed by one or many mathematical functions to determine the objective value (or phenotype).

Real-world optimisation problems are divided into one (in the case of single-objective optimisation) or many (in the case of multi-objective optimisation) objective functions in order to be optimised by an optimisation algorithm. The difficulty of convergence can be reduced by the bounding of problem variables as this reduces the size of the search domain.

In order to determine an Evolutionary Algorithm's robustness when solving problems consisting of multiple objectives, its performance must be assessed on the optimisation of synthetic test functions which are created for the purpose of testing. These problems may also be used to systematically compare two or more Evolutionary Algorithms.

Synthetic test functions are typically:

• Intentionally difficult, meaning they are designed to include optimisation difficulties which are present in real-world problems.
• Scalable, meaning they can be configured with a different number of problem variables and objectives.
• Computationally efficient, meaning they are faster to execute than a real-world problem. This is desirable when benchmarking an Evolutionary Algorithm.

In contrast, real-world problems which have been encapsulated within an objective function in order to be used by an optimiser are often computationally expensive and have long execution times. This is because synthetic test functions are often mathematical equations which aim to cause difficulty for an optimiser when searching for problem variables that produce optimal objective values, whereas real-world problems often involve computationally expensive simulations in order to arrive at the objective values.

Put simply, using a real-world problem to evaluate the performance of a newly proposed Evolutionary Algorithm only allows us to determine if an algorithm is good at solving that single problem. What we're interested in is analysing how Evolutionary Algorithms perform when encountering various difficulties that appear in multi-objective problems, and how they compare to each other.

The ZDT1 test function¶

We will be using a synthetic test problem throughout this notebook called ZDT1. It is part of the ZDT test suite, consisting of six different two-objective synthetic test problems. This is quite an old test suite, easy to solve, and very easy to visualise.

Mathematically, the ZDT11 two-objective test function can be expressed as:

f1(x1)=x1f2(x)=g⋅hg(x2,…,xD)=1+9⋅∑d=2Dxd(D−1)h(f1,g)=1−f1/g(1) \begin{aligned} f_1(x_1) &= x_1 \tag{1} \\ f_2(x) &= g \cdot h \\ g(x_2,\ldots,x_{\mathrm{D}}) &= 1 + 9 \cdot \sum_{d=2}^{\mathrm{D}} \frac{x_d}{(D-1)}\\ h(f_1,g) &= 1 - \sqrt{f1/g} \end{aligned} f1​(x1​)f2​(x)g(x2​,…,xD​)h(f1​,g)​=x1​=g⋅h=1+9⋅d=2∑D​(D−1)xd​​=1−f1/g​​(1)

where xxx is a solution to the problem, defined as a vector of DDD decision variables.

x=⟨x1,x2,…,xD⟩(2) x= \langle x_{1},x_{2},\ldots,x_{\mathrm{D}} \rangle \tag{2} x=⟨x1​,x2​,…,xD​⟩(2)

and all decision variables fall between 000 and 111.

0≤xd≤1,d=1,…,D(3) 0 \le x_d \le 1, d=1,\ldots,\mathrm{D} \tag{3} 0≤xd​≤1,d=1,…,D(3)

For this bi-objective test function, f1f_1f1​ is the first objective, and f2f_2f2​ is the second objective. This particular objective function is, by design, scalable up to any number of problem variables but is restricted to two problem objectives.

Let's start implementing this in Python, beginning with the initialisation of a solution according to Equations 2 and 3. In this case, we will have 30 problem variables D=30\mathrm{D}=30D=30.

Now that we have a solution to evaluate, let's implement the ZDT1 synthetic test function using Equation 1.

Finally, let's invoke our implemented test function using our solution xxx from earlier.

Now we can see the two objective values that measure our solution xxx according to the ZDT1 synthetic test function, which is a minimisation problem.

Performance in Objective Space¶

We will be discussing desirable characteristics in multi-objective solutions, but for now, let's plot some randomly initialised solutions against an optimal set of solutions for ZDT1. This is a synthetic test function, and as such the authors have provided us with a way to calculate the optimal set.

f2=1−f1(4) f_2 = 1 - \sqrt{f_1} \tag{4} f2​=1−f1​​(4)

Let's use this to generate 20 ideal sets of objective values.

Now we can plot them to have an idea of the shape of the true front for ZDT1 in objective space.

To wrap things up, let's generate 50 objective values using the ZDT1 objective function created above. We achieve this by passing in 50 randomly initialised sets of problem variables.

Now we will plot the objective values of our randomly initialised solutions on top of a plot of the true front, this will give us some idea of the difference in performance between the two sets.

Conclusion¶

In this section, we introduced the concept of synthetic test functions along with ZDT1, a popular and relatively easy example. We expressed the concept mathematically and then made a direct implementation using Python. We then generated a set of 50 solutions, calculated the objective values for each one, and plotted the objective space using a scatter plot.

There are many suites of synthetic test functions in the literature, some to read about are ZDT, DTLZ, CEC09, and WFG Toolkit.