Information Technology Reference
In-Depth Information
3.
The individual string with the highest fitness value is used as the operation
result of genetic algorithm, which is regarded as the solution to the
problem(or approximate solution).
Fig. 13.8 presents the flow chart of basic genetic algorithm, where variable
GEN is currently evolution generation number.
GEN:=0
Randomly generate a population
Y
Is the criterion satisfied ? Output the result End
N
Calculate the fitness of each individual
i:=0
Y
GEN:=GEN+1 i:=M ?
N
With a probability, select a genetic operator
p(r) reproduction p(c) crossover p(m) mutation
Select an
individual
by fitness
Select an
individual
by fitness
Select two
individuals
by fitness
Reproduction i:=i+1 Mutation
Add offspring
to population
Add offspring
to population
Crossover
Add two offspring
to population
i:=i+1
Fig. 13.8. Flow chart of basic genetic algorithm
13.6.2
Representation schema
For genetic algorithm, let's consider an alphabet V
+
= {0,1,*} and use it to
express schema. So called schema is a structure, which is used to describe a
subset of strings. All strings in this subset take the same values at some positions.
Symbol " * " denotes uncertain letter; that is, the symbol “*” match both “0” and
