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.

in chapter three. Diversity within the crowding model is maintained by adopting an<br />

overlapping (generational) strategy in which <strong>of</strong>fspring replace their progenitors based not<br />

on fitness, but similarity in the genotype space.<br />

In the next section <strong>of</strong> this thesis, the state-<strong>of</strong>-the-art ES is briefly examined, providing the<br />

general framework on which the algorithms presented throughout chapters four and five <strong>of</strong><br />

this thesis are based.<br />

2.3.2 Evolution Strategies<br />

While EP was being developed in the U.S.A., two engineers at the Technical University <strong>of</strong><br />

Berlin were independently developing their own evolution-inspired parameter optimisation<br />

technique known as the evolutionsstrategie. The earliest ES, developed by Rechenberg<br />

(1965), implemented a set <strong>of</strong> simple rules for the sequential design and analysis <strong>of</strong> real-<br />

world parametric engineering problems.<br />

The ES models the processes <strong>of</strong> evolution at the phenotypic level. As such, search points<br />

are represented directly as n-dimensional vectors <strong>of</strong> (usually) real-valued object variables<br />

. As well as representing object variables, individuals (denoted ) also include a set<br />

<strong>of</strong> endogenous strategy parameters , as well as a fitness value, equal to its objective<br />

function result :<br />

The original two-membered ES (the so-called ES) employs a simple<br />

mutation/selection mechanism, in which a single parent is mutated to produce a single<br />

<strong>of</strong>fspring. If the mutation is found to be pr<strong>of</strong>itable the <strong>of</strong>fspring replaces its parent,<br />

otherwise, the <strong>of</strong>fspring is discarded. Later, multi-membered ESs were developed in which<br />

populations <strong>of</strong> parent and <strong>of</strong>fspring individuals are maintained by the algorithm. The two<br />

most notable <strong>of</strong> these population-based ESs were introduced by Schwefel (1981) and<br />

constitute:<br />

the strategy, in which<br />

parents are varied to produce <strong>of</strong>fspring, and<br />

parents <strong>of</strong> the subsequent generation are selected from all individuals.<br />

the strategy, in which selection is made among only the<br />

are systematically discarded regardless <strong>of</strong> their fitness value.<br />

The pseudocode for the basic multi-membered ES is provided in figure 2.3.<br />

<strong>of</strong>fspring. Parents<br />

17

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

Saved successfully!

Ooh no, something went wrong!