08.08.2013 Views

Mitchell, T. J. (2010) An exploration of evolutionary computation ...

Mitchell, T. J. (2010) An exploration of evolutionary computation ...

Mitchell, T. J. (2010) An exploration of evolutionary computation ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

each individual ( ) and adapted with the step-size parameters . For further reading and<br />

implementation details <strong>of</strong> this generalised self-adaptation mechanism, see (Schwefel,<br />

1981).<br />

When the endogenous strategy parameters ( , and ) are adapted along with the object-<br />

variables, optimisation takes place simultaneously in both the object and strategy<br />

parameter spaces. This process ensures that high performing solutions are selected for<br />

reproduction along with their corresponding strategy parameters, which may go on to yield<br />

even stronger solutions throughout subsequent generations.<br />

Strategy Parameter Adaptation<br />

By selecting optimal values for the strategy parameters controlling the mutation strength,<br />

the maximum rate <strong>of</strong> progress can be maintained. The problem then arises as to how the<br />

strategy parameters may be continuously adapted throughout the course <strong>of</strong> evolution. For<br />

the ES there are two standard approaches for step-size adaptation: the rule and self-<br />

adaptation.<br />

The Rule<br />

By studying the dynamics <strong>of</strong> the ES when applied to two differing objective<br />

functions, Rechenberg observed that the maximum rate <strong>of</strong> progress corresponds to a<br />

particular value for the probability <strong>of</strong> a successful mutation (Rechenberg, 1973, as cited in<br />

Beyer and Schwefel, 2002). As the mutation step-size tends to zero, the probability <strong>of</strong><br />

success becomes very high; conversely, as the step-size tends to infinity, the probability <strong>of</strong><br />

success becomes very low. In order to maintain an optimal rate <strong>of</strong> progress, the step-size<br />

parameter should be adjusted to maintain a probability <strong>of</strong> success within these two<br />

extremes; a range that has become known as the evolution window. This observation led to<br />

the derivation <strong>of</strong> a general rule for the probability <strong>of</strong> success: mutation step-size adaptation<br />

by the rule. Successful mutations are measured over several generations (<strong>of</strong>ten equal<br />

to the dimensionality <strong>of</strong> the problem) and if the probability <strong>of</strong> a successful mutation is<br />

found to be below , the mutation step-size is decreased. A recommended factor for the<br />

multiplicative/multiplicative inverse adaptation <strong>of</strong> the step-size parameter by the<br />

rule is 0.85 (Schwefel, 1995).<br />

However, there are certain limitations that apply when adapting the mutation step-size<br />

using the rule:<br />

23

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

Saved successfully!

Ooh no, something went wrong!