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.

A Multimembered <strong>Evolution</strong> Strategy 141<br />

7<br />

6<br />

5<br />

4<br />

3<br />

2<br />

1<br />

0<br />

1<br />

Maximal universal rate<br />

of progress<br />

ϕ * ( σ * )<br />

max opt<br />

(1+1) - theory<br />

Number of descendants<br />

10 20 30 40 50 λ 60<br />

Figure 5.14: Maximal rate of progress for the corridor model<br />

+<br />

=<br />

opt<br />

p<br />

2<br />

' + =<br />

'max p<br />

2 opt c<br />

"<br />

c = 1 ; 1 ; exp<br />

; opt<br />

p<br />

2<br />

Pairs of values found by iteration are shown in Figure 5.13. Figure 5.14 shows ' max<br />

versus .To determine opt for the (1 , ) strategy, i.e., the value of for which ' max= is<br />

a maximum, it is necessary to solve the system of three non-linear equations, comprising<br />

Equation (5.29), Equation (5.30), <strong>and</strong><br />

The result is<br />

opt = ' + np exp (' +2 )[ erf (' + ) + 2 exp ( + ) ; 1][1+2' +2 ]+2' + o<br />

!#<br />

( opt<br />

c [1 ; exp (; + )] ln[1 ; exp(; + )]+ 1<br />

opt ' 6:0 (as an integer: opt =6)<br />

)<br />

(5.31)

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

Saved successfully!

Ooh no, something went wrong!