
128 Chapter Four—Evolutionary Computation Implementations
The last optimization problem G9 consists of minimizing:
f(x) = (x
1
− 10)
2
+ 5(x
2
− 12)
2
+ x
4
3
+ 3(x
4
− 11)
2
+ 10x
6
5
+ 7x
2
6
− 4x
6
x
7
− 10x
6
− 8x
7
subject to
127 − 2x
2
1
− 3x
4
2
− x
3
− 4x
2
4
− 5x
5
≥ 0
282 − 7x
1
− 3x
2
− 10x
2
3
− x
4
+ x
5
≥ 0
196 − 23x
1
− x
2
2
− 6x
2
6
+ 8x
7
≥ 0
−4x
2
1
− x
2
2
+ 3x
1
x
2
− 2x
2
3
− 5x
6
+ 11x
7
≥ 0
where
−10 ≤ x
i
≤ 10;i= 1, ..., 7
The global minimum is known to be
x
∗
= (2.330499, 1.951372, –0.4775414, 4.365726,
–0.6244870, 1.038131, 1.594227)
with f(x
∗
) = 680.6300573.
For all three benchmark problems, the population sizes can be set to 40 and 30,
respectively. The maximum number of generations for each PSO of one cycle ...