27.06.2013 Views

Evolution and Optimum Seeking

Evolution and Optimum Seeking

Evolution and Optimum Seeking

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Numerical Comparison of Strategies 215<br />

Forbidden<br />

region<br />

α<br />

σ1<br />

σ2<br />

P 1<br />

Circles : lines of equal probability of a step<br />

P 2<br />

Negative<br />

gradient<br />

direction<br />

Figure 6.17: The situation at active constraints<br />

σ2<br />

To the<br />

minimum<br />

Lines of<br />

constant F(x)<br />

success is very much narrowed down by constraints. While the individuals are not yet at<br />

the edge of the feasible region, those descendants whose step lengths have become smaller<br />

have a higher probability of survival. Thus here too the entire population eventually<br />

concentrates itself in a smaller <strong>and</strong> smaller area at the edge of the feasible region.<br />

The theory of the rate of progress in the corridor model did not foresee this kind<br />

of di culty, indeed it gives an optimal success rate, almost the same as in the sphere<br />

model, simply because the gradient vector of the objective function always runs parallel<br />

to the boundaries. In this case the search weaves backwards <strong>and</strong> forwards between the<br />

center <strong>and</strong> side of the corridor. The reduced probability of success at multidimensional<br />

edges is compensated by the fact that with a uniform probability of occupation over the<br />

cross section of the corridor, the space that counts as near to the edges represents a very<br />

small fraction of the total. Provided that the success rate is obtained over long enough<br />

periods the 1=5 success rule does not lead to permanent reduction of the variances but to<br />

a constant near optimal step size (it really uctuates) that depends only on the width of<br />

the corridor <strong>and</strong> the number of variables.<br />

The situation is happier than in Figure 6.17 if the constraints are given explicitly as<br />

xi ai or xi bi<br />

For anyonevariable, the region of success at a boundary is reduced by one half. If at some<br />

position m variables are each bounded on one side, then on average it costs 2 m mutations<br />

before one l<strong>and</strong>s within the feasible region. Here again, the 1=5 success rule for m >2<br />

will continuously reduce the variances until they reach their minimum value. Depending<br />

on the route chosen by the search process the limiting values of the variances, which are<br />

individually adjustable for each variable, will be reached at di erent times. Their relative<br />

values thereby alter, <strong>and</strong> with the new combination of step lengths the convergence can<br />

be faster.<br />

The extra exibility of the multimembered evolution strategy with recombination,<br />

in which thevariances of the changes in the variables are individually adaptable during

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!