Introduction To Evolutionary Computing
Introduction To Evolutionary Computing
Introduction To Evolutionary Computing
Evolutionary Computing II
A.E. Eiben
Free University Amsterdam
http://www.cs.vu.nl/~gusz/
with thanks to the EvoNet Training Committee and its Flying Circus
Contents
Parent selection
Parents
Intialization
Recombination
(crossover)
Population
Mutation
Termination
Offspring
Survivor selection
A.E. Eiben, Introduction to EC II 3 EvoNet Summer School 2002
The two pillars of evolution
mutation
of survivors
recombination
phenotype: genotype:
a d c a a c b
Encoding
(representation) R0c01cd
B0c01cd
G0c01cd
Decoding
(inverse representation)
Role:
represents the task to solve, the requirements to adapt to
enables selection (provides basis for comparison)
surviving
fitness(A) = 3 A B
C
fitness(B) = 1 3/6 = 50% 2/6 = 33%
fitness(C) = 2
before 1 1 1 1 1 1 1
after 1 1 1 0 1 1 1
cut cut
parents
1 1 1 1 1 1 1 0 0 0 0 0 0 0
offspring
1 1 1 0 0 0 0 0 0 0 1 1 1 1
Phenotype:
a board configuration
Penalty of a configuration:
the sum of the penalties of all queens.
Fitness of a configuration:
inverse penalty to be maximized
A.E. Eiben, Introduction to EC II 16 EvoNet Summer School 2002
The 8 queens problem
Mutation
1 3 5 2 6 4 7 8 1 3 7 2 6 4 5 8
1 3 5 2 6 4 7 8 1 3 5 4 2 8 7 6
8 7 6 5 4 3 2 1 8 7 6 2 4 1 3 5
Early phase:
quasi-random population distribution
Mid-phase:
population arranged around/on hills
Late phase:
population concentrated on high hills
T
Time (number of generations)
Evolutionary algorithm
Random search
EA 2
EA 3
EA 1
P
Scale of all problems
A.E. Eiben, Introduction to EC II 26 EvoNet Summer School 2002
General EA framework and dialects
Evolutionary Computation:
is a method, based on biological metaphors,
areas
could be useful for your problem
is FUN