Evolution and Optimum Seeking

( + ) Evolution Strategy KORR 395
C
8
DO 8 I=1,N
X(I)=X(I)+Y(I)
IF(IFALLK.GT.0) GOTO 9
C
C IF THE STARTING POINT IS NOT FEASIBLE, EACH
C MUTATION IS CHECKED AT ONCE TO SEE WHETHER A
C FEASIBLE VECTOR HAS BEEN FOUND. THE SEARCH ENDS
C
C
WITH IFALLK = 0 IF THIS IS SO.
Z=ZULASS(N,M,X,RESTRI)
IF(Z)40,40,12
9 IF(M.EQ.0) GOTO 11
IF(.NOT.BLETAL(N,M,X,RESTRI)) GOTO 11
C
C IF A MUTATION FROM A FEASIBLE STARTING POINT
C RESULTS IN A NON-FEASIBLE X VECTOR, THEN THE STEP
C SIZES ARE REDUCED (ON THE ASSUMPTION THAT THEY WERE
C INITIALLY TOO LARGE) IN ORDER TO AVOID THE
C THE CONSUMPTION OF EXCESSIVE TIME IN DEFINING THE
C
C
THE FIRST PARENT GENERATION.
DO 10 I=1,NS
10 S(I)=S(I)*.5
GOTO 5
11 Z=ZIELFU(N,X)
12 IF(Z.GT.ZBEST) GOTO 13
ZBEST=Z
LBEST=L-1
DSMAXI=DSMAXI*ALOG(2.)
13 CALL SPEICH
1((L-1)*NZ,BKORRL,EPSILO,N,NS,NP,NY,Z,X,S,P,Y)
C
C
C
STORE PARENT DATA IN ARRAY Y.
IF(KONVKR.GT.1) Z1=Z1+Z
14
C
CONTINUE
C THE INITIAL PARENT GENERATION IS NOW COMPLETE.
C ZSTERN AND XSTERN, WHICH HOLD THE BEST VALUES, ARE
C OVERWRITTEN WHEN AN IMPROVEMENT OF THE INITIAL
C
C
SITUATION IS OBTAINED.
IF(LBEST.EQ.0) GOTO 16