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.

The Two Membered <strong>Evolution</strong> Strategy 117<br />

x 2<br />

To the<br />

optimum<br />

x<br />

1<br />

Circle : line of equal probability density<br />

Bold segment : fraction where success can be scored<br />

x 2<br />

Figure 5.3: Failure of the 1/5 success rule<br />

Forbidden<br />

region<br />

<strong>Optimum</strong><br />

x<br />

1<br />

calculated by the above rule will be very di erent from that associated with the same<br />

step length if an average over the corridor cross section were taken. If now, on the basis<br />

of this low estimate of the success probability, the step length is further reduced, there<br />

is a corresponding decrease in the probability of escaping from the edge of the corridor.<br />

It would therefore be desirable in this special case to average the probability of success<br />

over a longer time period. Opposed to this, however, is the requirement from the sphere<br />

model that the step lengths should be adjusted to the topology as directly as possible.<br />

The present subroutine o ers several means of dealing with the problem. For example,<br />

the lower bounds on the variances (variables EA, EB in the subprogram EVOL) can be<br />

chosen to be relatively large, or the number of mutations (the variable LS) after which<br />

the convergence criterion is tested can be altered by the user. The user has besides a free<br />

choice with regard to the required probability of success (variable LR) <strong>and</strong> the multiplier<br />

of the variance (variable SN). The rate of change of the step lengths, given by the factor<br />

0:85 per n mutations, was xed on the basis of the sphere model. It is not ideal for all<br />

types of problems but rather in the nature of a lower bound. If it seems reasonable to<br />

operate with constant variances, the parameter in question should be set equal to one.<br />

An indication of a suitable choice for the initial step lengths (variable array SM) can be<br />

obtained from Equation (5.4). Since r increases as the root of the number of parameters,<br />

one is led to set<br />

(0)<br />

i<br />

= 4xi<br />

pn<br />

in which 4xi is a rough measure of the expected distance from the optimum. This does<br />

not actually give the optimal step length because r is a kind of local scale of curvature of<br />

the contours of the objective function. However, it does no harm to start with variances<br />

that are too large they will quickly be reduced to a suitable size by the1=5 success rule.<br />

During this transition phase there is still a chance of escaping from the neighborhood<br />

of a merely local optimum but very little chance afterwards. The global convergence

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

Saved successfully!

Ooh no, something went wrong!