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 129<br />

For the distance covered towards the objective, s`, the portion is now calculated that<br />

contributes to an improvement of the objective function, i.e., in this case the radial difference<br />

s` = rE ; r` (see Fig. 5.8). The locus of all points N` for which s` is the same is<br />

the surface of the n-dimensional hypersphere about the origin with radius r` = rE ; s`.<br />

Accordingly the total probability density that a mutation (index `) starting from point<br />

E will cover the distance s` is the n-fold line integral:<br />

w(s`) =<br />

Z Z<br />

rE ; r` = s`<br />

1<br />

p2<br />

! n<br />

exp ; 1<br />

r2<br />

2 2 ` + r 2<br />

E ; 2 rE x`1 dx`1 :::dx`n<br />

By transforming to spherical coordinates one obtains a simple integral<br />

w(s`) =<br />

1<br />

p2<br />

! n<br />

n;1<br />

2<br />

; n;1<br />

2<br />

exp<br />

; r2 E + r2 `<br />

2 2<br />

!<br />

r n;1<br />

`<br />

2Z<br />

=0<br />

exp rE r` cos<br />

2<br />

The remaining integral can be expressed as a modi ed Bessel function:<br />

w(s`) =<br />

r n<br />

2<br />

`<br />

r1; n<br />

2<br />

E<br />

2<br />

exp<br />

; r2<br />

E<br />

+ r2<br />

`<br />

2 2<br />

!<br />

I n 2 ;1<br />

rE r`<br />

To simplify the notation we nowintroduce the following de nitions:<br />

We thereby obtain<br />

w(s`) = a<br />

rE<br />

= n<br />

2 a= r2 E<br />

2<br />

v= r`<br />

a<br />

av2<br />

; ;<br />

e 2 v e 2 I ;1(av) with s` = rE (1 ; v)<br />

rE<br />

2<br />

sin n;2<br />

In order to use Equation (5.15) to calculate the total probability that the best of<br />

descendants will cover the distance<br />

the following quantities are still required:<br />

with<br />

<strong>and</strong><br />

s 0 =max<br />

` fs` j ` = 1(1) g = rE ; r 0<br />

w(s` = s 0 )= a<br />

r 0<br />

rE<br />

rE<br />

e ; a au2 ; 2 u e 2 I ;1(au)<br />

= u <strong>and</strong> s 0 = rE (1 ; u)<br />

p(s` s 0 )<br />

=1; s0<br />

=1; uR<br />

R<br />

s`=rE<br />

v=0<br />

w(s`) ds`<br />

a av2<br />

; ; ae 2 v e 2 I ;1(av) dv<br />

d

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

Saved successfully!

Ooh no, something went wrong!