27.06.2013 Views

Evolution and Optimum Seeking

Evolution and Optimum Seeking

Evolution and Optimum Seeking

SHOW MORE
SHOW LESS

Create successful ePaper yourself

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

Genetic Algorithms 159<br />

Average<br />

Number of<br />

Offspring<br />

5<br />

4<br />

3<br />

2<br />

1<br />

0<br />

1 5 10<br />

Average<br />

Number of<br />

Offspring<br />

5<br />

4<br />

3<br />

2<br />

1<br />

0<br />

Fitness 1 5 10<br />

Figure 5.17: Comparison of selection consequences in EAs<br />

left: ES right: GA<br />

Fitness<br />

de nes the initial distance from the optimum <strong>and</strong> thus determines largely the number of<br />

iterations needed to approximate the solution at the prede ned accuracy, but also because<br />

it may provide more or less topological di culties in its vicinity. GAs, however, should<br />

be started at r<strong>and</strong>om in the whole hypercube de ned by the lower <strong>and</strong> upper bounds<br />

of the variables, in order to give themachance of approaching the global or, at least,<br />

avery good local optimum. Reliability tests (see Appendix A, Sect. A.2), especially<br />

in cases of multimodal functions would thus be biased against all other methods, if one<br />

allows the GA to start from many points at the same time <strong>and</strong> if one gives the GA the<br />

needed extra information about the relevant search region that is not available for the<br />

other methods. One might provide special test conditions to compare di erent EAs with<br />

each other without giving one of them an advantage from the very beginning, but no large<br />

e ort of this kind has been made so far.<br />

Even in cases of special constraints or side conditions one may formulate appropriate<br />

instantiations of suitable GA versions. This has been done, for example, for the<br />

combinatorial optimization task of solving the travelling salesperson problem (TSP) by<br />

Gorges-Schleuter (1991a,b) repair mechanisms were used in cases where unfeasible tours<br />

were caused by recombination. Beyer (1992) has investigated ESs for solving TSP-likeoptimization<br />

problems. It is much better to look for data structures tted to the special task<br />

<strong>and</strong> to rede ne the genetic operators to keep to the feasible solution set (see Michalewicz,<br />

1992, 1994). The time for developing such special EAs must be added to the run time<br />

on the computer, <strong>and</strong> one argument infavor of EAs is lost, i.e., their simplicity of use or<br />

generality of application.<br />

As the short analysis of GA mutation <strong>and</strong> recombination operators above has clearly

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

Saved successfully!

Ooh no, something went wrong!