Evolution and Optimum Seeking

( + ) Evolution Strategy KORR 407
RETURN
20 DO 21 I=1,NX
21 XX(I)=XX(I)+(Y((L1+IFIX(IELTER*GLEICH(D)))*NZ+NN+I)
1+Y((L1+IFIX(IELTER*GLEICH(D)))*NZ+NN+I))*.5
RETURN
END
---------------------------------------------------------
Subroutine SPEICH
SPEICH transfers to the data pool Y for the parents of the next generation the data of
a descendant representing a successful mutation (the object variables X and the strategy
parameters S (and P, if used) together with the corresponding value of the objective function).
A check is made that S (and P) fall within speci ed bounds.
J is the address in array Y from which pointonwards the data are to be written and is
provided by KORR.
ZZ represents ZSTERN or Z, XX represents XSTERN or X.
---------------------------------------------------------
SUBROUTINE SPEICH
1(J,BKORRL,EPSILO,N,NS,NP,NY,ZZ,XX,S,P,Y)
LOGICAL BKORRL
DIMENSION EPSILO(4),XX(N),S(NS),P(NP),Y(NY)
COMMON/PIDATA/PIHALB,PIEINS,PIZWEI
K=J
DO 1 I=1,N
K=K+1
1 Y(K)=XX(I)
DO 2 I=1,NS
K=K+1
2 Y(K)=AMAX1(S(I),EPSILO(1))
IF(.NOT.BKORRL) GOTO 4
DO 3 I=1,NP
K=K+1
PI=P(I)
IF(ABS(PI).GT.PIEINS) PI=PI-SIGN(PIZWEI,PI)
3 Y(K)=PI
4 K=K+1
Y(K)=ZZ
RETURN
END
---------------------------------------------------------