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.

378 Appendix B<br />

man), vol. 15 of Problemata series, Verlag Frommann-Holzboog, Stuttgart, 1973 also<br />

H.-P. Schwefel, Numerical Optimization of Computer Models, Wiley, Chichester, 1981<br />

(translated by M. W. Finnis from Numerische Optimierung von Computer-Modellen mittels<br />

der <strong>Evolution</strong>sstrategie, vol. 26 of Interdisciplinary Systems Research, Birkhauser,<br />

Basle, Switzerl<strong>and</strong>, 1977).<br />

The current L parameter vectors are used to generate LL new ones by means of small<br />

r<strong>and</strong>om changes.<br />

The best L of these become the initial ones for the next generation (iteration). At the<br />

same time, the step sizes (st<strong>and</strong>ard deviations) for the changes in the variables (strategy<br />

parameters) are altered. The selection leads to adaptation to the local topology if LL/L<br />

is assigned a suitably large value, e.g., >6. The r<strong>and</strong>om changes in the parameters are<br />

produced by the addition of normally distributed r<strong>and</strong>om numbers, while those in the<br />

step sizes are produced from r<strong>and</strong>om numbers with a log-normal distribution by multiplication.<br />

4. Convergence criterion<br />

Based on the di erences in value of the objective function (see under EC <strong>and</strong> ED).<br />

5. Peripheral I/O: none.<br />

6. Notes<br />

The multimembered strategy represents an improvement in reliabilityover the two membered<br />

strategy. On the other h<strong>and</strong>, the run time is greater when an ordinary (serial)<br />

digital computer is used. The run time increases less rapidly than in proportion to LL<br />

(the number of descendants per generation), because increasing LL increases the convergence<br />

rate (over the generations). However, minima at a boundary of the feasible<br />

region or at a vertex are attained only slowly or inexactly. In any case, although the<br />

certainty of global convergence cannot be guaranteed, numerical tests have shown that<br />

the multimembered strategy is far better than other search procedures in this respect. It<br />

is capable of h<strong>and</strong>ling separated feasible regions provided that the number of parameters<br />

is not large <strong>and</strong> that the initial step sizes are set suitably large. In doubtful cases it is<br />

recommended to repeat the search each time with a di erent set of initial values <strong>and</strong>/or<br />

r<strong>and</strong>om numbers. If the optimum being sought lies at a boundary of the feasible region, it<br />

is probably better to choose a value for SN (the parameter governing the rates of change<br />

of the st<strong>and</strong>ard deviations) less than the (maximal) value suggested above.<br />

7. Subroutines or functions used<br />

The function names are to be declared as external in the segment that calls GRUP.<br />

7.1 Objective function<br />

To be written by the user in the form:

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

Saved successfully!

Ooh no, something went wrong!