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

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

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

problems with unknown characteristics. In rugged problem spaces comprising multiple<br />

peaks and flat plateaus, recombination and mutation are still beneficial to evolution;<br />

however, their benefits cannot be explained by the genetic repair hypothesis alone.<br />

2.3.2.3 Mutation<br />

In contrast to both the GA (in which recombination is widely regarded to be the primary<br />

variation operator) and EP (relying upon mutation alone), the ES takes an intermediate<br />

position: mutation and recombination are applied with equal importance (Beyer, 2001).<br />

However, the mutation operator does provide the primary source <strong>of</strong> variation, and thus<br />

<strong>exploration</strong>. Recombination works synergistically with mutation, reducing variation error<br />

and accelerating progress rates.<br />

Object Parameter Mutation<br />

Mutation is applied to the object parameters <strong>of</strong> each recombinant with the addition <strong>of</strong><br />

the mutation vector :<br />

This delivers the mutated object parameters . Each element <strong>of</strong> the mutation vector is<br />

drawn randomly from the standard normal distribution and scaled according to<br />

the mutation strength specified by the strategy parameters <strong>of</strong> the recombinant individual.<br />

This mutation scheme ensures that mutative jumps through the search space are:<br />

ordinal, favouring small jumps through the search space over large jumps.<br />

scalable, according to the mutation strength , such that any point within the space<br />

may be reached.<br />

unbiased, ensuring that, on average, mutants deviate from their point <strong>of</strong> origin<br />

isotropically.<br />

The lack <strong>of</strong> bias in the mutation operator ensures that that there is no deterministic drift<br />

without selection.<br />

Variations<br />

In its most rudimentary form, the mutation normal distribution is isotropic, i.e., only one<br />

step-size parameter is required for the mutation <strong>of</strong> all object parameters . With an<br />

isotropic mutation scheme, the surface <strong>of</strong> mutation probability isodensity forms a circle,<br />

21

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

Saved successfully!

Ooh no, something went wrong!