Evolutionary Computation
22c: 145,
Chapter 9
What is Evolutionary
Computation?
A technique borrowed from the theory of
biological evolution that is used to
create optimization procedures or
methodologies, usually implemented on
computers, that are used to solve
problems.
Classes of Search Techniques
It Is A Search Technique
Genetic Algorithm Flow Chart
The Argument
Evolution has optimized biological
processes;
therefore
Adoption of the evolutionary paradigm to
computation and other problems can
help us find optimal solutions.
Evolutionary Computing
Genetic Algorithms
invented by John Holland (University of
Michigan) in the 1960’s
Evolution Strategies
invented by Ingo Rechenberg (Technical
University Berlin) in the 1960’s
Started out as individual developments,
but converged in the later years
Natural Selection
Limited number of resources
Competition results in struggle for existence
Success depends on fitness

fitness of an individual: how well

adapted an
individual is to their environment. This is
determined by their genes (blueprints for their
physical and other characteristics).
Successful individuals are able to reproduce
and pass on their genes
When changes occur ...
Previously “fit” (well

adapted) individuals will
no longer be best

suited for their
environment
Some members of the population will have
genes that confer different characteristics
than “the norm”. Some of these
characteristics can make them more “fit” in
the changing environment.
Genetic Change in Individuals
Mutation in genes
may be due to various sources (e.g. UV
rays, chemicals, etc.)
Start:
1001001001001001001001
Location of Mutation
After Mutation:
100100
0
001001001001001
Genetic Change in Individuals
Recombination (Crossover)
occurs during reproduction

sections of
genetic material exchanged between two
chromosomes
Recombination (Cross
o
ver)
Image from http://esg

www.mit.edu:8001/bio/mg/meiosis.html
The Nature of Computational Problems
Require search through many possibilities to
find a solution
(e.g. search through sets of rules for one set that best
predicts the ups and downs of the financial markets)
Search space too big

search won’t return within
our lifetimes
Require algorithm to be adaptive or to
construct original solution
(e.g. interfaces that must adapt to idiosyncrasies of
different users)
Why Evolution Proves to be a Good Model
for Solving these Types of Problems
Evolution is a method of searching for an (almost)
optimal solution
Possibilities

all individuals
Best solution

the most “fit” or well

adapted individual
Evolution is a parallel process
Testing and changing of numerous species and individuals
occur at the same time (or, in parallel)
Evolution can be seen as a method that designs
new (original) solutions to a changing
environment
The Metaphor
EVOLUTION
Individual
Fitness
Environment
PROBLEM SOLVING
Candidate Solution
Quality
Problem
Individual Encoding
Bit strings (0101 ... 1100)
Real numbers (43.2

33.1 ... 0.0 89.2)
Permutations of element (E11 E3 E7 ... E1 E15)
Lists of rules (R1 R2 R3 ... R22 R23)
Program elements (genetic programming)
... any data structure ...
Genetic Algorithms
Closely follows a biological approach to
problem solving
A simulated population of randomly
selected individuals is generated then
allowed to evolve
Encoding the Problem
Example: Looking for a new
site which is
closest to several nearby cities.
Express the problem in terms of a bit string
z = (1001010101011100)
where the first 8 bits of the string
represent the X

coordinate and the
second 8 bits represent the Y

coordinate
Basic Genetic Algorithm
Step 1.
Generate a random population
of
n
individuals
Step 2.
Assign a fitness value to each
individual
Step 3.
Repeat until
n
children have
been
produced
Choose 2 parents based on fitness proportional
selection
Apply genetic operators to copies of the parents
Produce new chromosomes
Notes:
GAs fall into the category of “generate and test”
algorithms
They are stochastic,
population

based algorithms
Variation operators (recombination and mutation)
create the necessary diversity and thereby facilitate
novelty
Selection
reduces diversity and
acts as a force
pushing quality
Fitness Function
For each individual in the population,
evaluate its relative fitness
For a problem with
m
parameters, the fitness
can be plotted in an
m
+1 dimensional space
Sample Search Space
A randomly generated population of
individuals will be randomly distributed
throughout the search space
Image from http://www2.informatik.uni

erlangen.de/~jacob/Evolvica/Java/MultiModalSearch/rats.017/Surface.gif
An Abstract Example
Distribution of Individuals in Generation 0
Distribution of Individuals in Generation N
Genetic Operators
Cross

over
Mutation
Production of New
Chromosomes
2 parents give rise to 2 children
Generations
As each new generation of
n
individuals is
generated, they replace their parent
generation
To achieve the desired results, typically 500
to 5000 generations are required
The Evolutionary Cycle
Recombination
Mutation
Population
Offspring
Parents
Selection
Replacement
Ultimate Goal
Each subsequent generation will evolve
toward the global maximum
After sufficient generations a near optimal
solution will be present in the population of
chromosomes
Example: Find the max value
of f(x
1
, …, x
100
).
Population: real vectors of length 100.
Mutation: randomly replace a value in a
vector.
Combination: Take the average of two
vectors.
Dynamic Evolution
Genetic algorithms can adapt to a
dynamically changing search space
Seek out the moving maximum via a parasitic
fitness function
as the chromosomes adapt to the search
space, so does the fitness function
A Simple Example
The Traveling Salesman Problem:
Find a tour of a given set of cities so that
each city is visited only once
the total distance traveled is minimized
Representation
Representation is an ordered list of city
numbers known as an
order

based
GA.
1) London 3) Iowa City 5) Beijing 7) Tokyo
2) Venice 4) Singapore 6) Phoenix 8) Victoria
CityList1
(3 5 7 2 1 6 4 8)
CityList2
(2 5 7 6 8 1 3 4)
Crossover
Crossover combines inversion and recombination:
Parent1
(3 5 7 2 1 6 4 8)
Parent2
(2 5 7 6 8 1 3 4)
Child
(5 8 7 2 1 6 3 4)
(1)
Copy a randomly selected portion of Parent1 to Child
(2)
Fill the blanks in Child with those numbers in Parent2 from left to
right, as long as there are no duplication in Child.
This operator is called the
Order1
crossover.
Mutation involves swapping two numbers
of the list:
*
*
Before: (5 8 7 2 1 6 3 4)
After: (5 8 6 2 1 7 3 4)
Mutation
TSP Example: 30 Cities
Solution
i
(Distance = 941)
Solution
j
(Distance = 800)
Solution
k
(Distance = 652)
Best Solution (Distance = 420)
Overview of Performance
Typical run: progression of fitness
Typical run of an EA shows so

called “anytime behavior”
Best fitness in population
Time (number of generations)
Best fitness in population
Time (number of generations)
Progress in 1
st
half
Progress in 2
nd
half
Are long runs beneficial?
•
Answer:

it depends how much you want the last bit of progress

it may be better to do more shorter runs
T: time needed to reach level F after random initialisation
T
Time (number of generations)
Best fitness in population
F: fitness after smart initialisation
F
Is it worth expending effort on smart
initialisation?
•
Answer : it depends:

possibly, if good solutions/methods exist.

care is needed
Basic Evolution Strategy
1. Generate some random individuals
2. Select the
p
best individuals based on some
selection algorithm (fitness function)
3. Use these
p
individuals to generate
c
children
4. Go to step 2, until the desired result is achieved
(i.e. little difference between generations)
Many Variants of GA
Different kinds of selection (not roulette)
Tournament
Elitism, etc.
Different recombination
Multi

point crossover
3 way crossover etc.
Different kinds of encoding other than
bitstring
Integer values
Ordered set of symbols
Different kinds of mutation
A Combination Operator for
Expressions
Encoding
Individuals are encoded as vectors of
real numbers (object parameters)
op
= (
o
1
,
o
2
,
o
3
, … ,
o
m
)
The strategy parameters control the
mutation of the object parameters
sp
= (
s
1
,
s
2
,
s
3
, … ,
s
m
)
These two parameters constitute the
individual’s chromosome
Fitness Functions
Need a method for determining if one
solution is more optimal than another
Mathematical formula
Main difference from genetic algorithms is
that only the most fit individuals are
allowed to reproduce (elitist selection)
Forming the Next Generation
Number of individuals selected to be
parents (
p
)
too many: lots of persistent bad traits
too few: stagnant gene pool
Total number of children produced (
c
)
limited by computer resources
more children
faster evolution
Mutation
Needed to add new genes to the pool
optimal solution cannot be reached if a
necessary gene is not present
bad genes filtered out by evolution
Random changes to the chromosome
object parameter mutation
strategy parameter mutation
changes the step size used in object parameter
mutation
Discrete Recombination
Similar to crossover of genetic
algorithms
Equal probability of receiving each
parameter from each parent
(8, 12, 31, … ,5)
(2, 5, 23, … , 14)
(2, 12, 31, … , 14)
Intermediate Recombination
Often used to adapt the strategy
parameters
Each child parameter is the mean value
of the corresponding parent parameters
(8, 12, 31, … ,5)
(2, 5, 23, … , 14)
(5, 8.5, 27, … , 9.5)
Evolution Process
p
parents produce
c
children in each
generation
Four types of processes:
p,c
p/r,c
p+c
p/r+c
p,c
p
parents produce
c
children using
mutation only (no recombination)
The fittest
p
children become the
parents for the next generation
Parents are not part of the next
generation
c
p
p/r,c
is the above with recombination
Forming the Next Generation
Similar operators as genetic algorithms
mutation is the most important operator
(to uphold the principal of strong causality)
recombination needs to be used in cases
where each child has multiple parents
The parents can be included in the next
generation
smoother fitness curve
p+c
p
parents produce
c
children using
mutation only (no recombination)
The fittest
p
individuals (parents or
children) become the parents of the
next generation
p/r+c
is the above with recombination
Tuning a GA
“Typical” tuning parameters for a small problem
Other concerns
population diversity
ranking policies
removal policies
role of random bias
Population size:
50
–
100
Children per generation:
= population size
Crossovers:
0
–
3
Mutations:
< 5%
Generations:
20
–
20,000
Domains of Application
Numerical, Combinatorial Optimization
System Modeling and Identification
Planning and Control
Engineering Design
Data Mining
Machine Learning
Artificial Life
Drawbacks of GA
Difficult to find an encoding for
a
problem
Difficult to define a valid fitness
function
May not return the global maximum
Why use a GA?
requires little insight into the problem
the problem has a very large solution space
the problem is non

convex
does not require derivatives
objective function need not be smooth
variables do not need to be scaled
fitness function can be noisy (e.g. process data)
when the goal is a
good
solution
When NOT to use a GA?
if
global
optimality is required
if problem
insight
can:
significantly impact algorithm performance
simplify problem representation
if the problem is highly constrained
if the problem is smooth and convex
use a gradient

based optimizer
if the search space is very small
use enumeration
Taxonomy
What are the different types
of EAs
Historically different flavours of EAs have been
associated with different representations
Binary strings : Genetic Algorithms
Real

valued vectors : Evolution Strategies
Finite state Machines: Evolutionary Programming
LISP trees: Genetic Programming
These differences are largely irrelevant, best strategy
choose representation to suit problem
choose variation operators to suit representation
Selection operators only use fitness and so are
independent of representation
Some GA Application Types
Comments 0
Log in to post a comment