Professional Documents
Culture Documents
10 EvolutionaryComputation PDF
10 EvolutionaryComputation PDF
Computation?
Evolutionary
Computation An abstraction from the theory of
biological evolution that is used to
create optimization procedures or
methodologies, usually implemented on
Solving problems computers, that are used to solve
with techniques problems.
inspired by biology.
Components of Evolutionary
Taxonomy Computing
COMPUTATIONAL Genetic Algorithms
INTELLIGENCE – invented by John Holland (University of
or
SOFT COMPUTING Michigan) in the 1960’s
Evolution Strategies
Neural Evolutionary Fuzzy
Networks Algorithms Systems – invented by Ingo Rechenberg (Technical
University Berlin) in the 1960’s
Evolutionary Evolution Genetic Genetic Started out as individual developments,
Programming Strategies Algorithms Programming
but have begun to converge in the last
few years
1
Intelligence and Evolution
The Ingredients One way of understanding intelligence is as the capability of a creature to
adapt its behaviour to an ever-
ever-changing environment
t+1
We normally think of adaptation as changes in the characteristics
characteristics
t reproduction (including behaviours) of a single animal in response to experiences
experiences over
its history
selection But adaptation is also change over the characteristics of a species,
species, over
the generations in response to environmental change
A creature must deal with other creatures of the same species who
who
compete for resources, mates etc.
There is also rivalry from other species which may be a direct (predator)
or indirect (food, water, land, etc.) threat
In nature, evolution operates on populations of organisms, ensuring by
mutation natural selection that characteristics that serve the members well tend to
recombination be passed on to the next generation, while those that didn’t die out
Image: Osvego City School District Regents Exam Prep Center Evolutionary computation is an umbrella term that includes genetic
Selection operates as survival and choice of mates between parents
parents algorithms (Holland, 1975) , evolution strategies (Schwefel,
Schwefel, 1981) and
Recombination of genes is the mechanism that generates the next genetic programming (Koza,
Koza, 1994)
generation’s characteristics
Sometimes random copying errors, called mutations,
mutations, occur during the A-life researchers frequently experiment with populations of organisms
organisms put
recombination process. These are also important because they lead
lead to into artificial competition and subjected to the laws of natural selection
new characteristics, usually useless, occasionally adaptive
2
Darwinian Evolution Darwinian Evolution
Survival of the fittest Four Postulates
Selection on phenotype 1. Individuals within species are variable
2. Some of the variations are passed on to offspring
– Through environment
3. In every generation, more offspring are produced than can
Genotypic inheritance survive
4. The survival and reproduction of individuals are not random:
random:
Reproduction The individuals who survive and go on to reproduce,
reproduce, or who
Blind variation reproduce the most,
most, are those with the most favourable
variations.
variations. They are naturally selected.
selected.
Replacement
Offspring
3
Domains of Application Performance
Acceptable performance at acceptable
Numerical, Combinatorial Optimization costs on a wide range of problems
System Modeling and Identification Intrinsic parallelism (robustness, fault
Planning and Control tolerance)
Engineering Design Superior to other techniques on
complex problems with
Data Mining
– lots of data, many free parameters
Machine Learning – complex relationships between
Artificial Life parameters
– many (local) optima
Advantages Disadvantages
No presumptions w.r.t. problem space
No guarantee for optimal solution within
Widely applicable finite time
Low development & application costs Weak theoretical basis
Easy to incorporate other methods May need parameter tuning
Solutions are interpretable (unlike NN) Often computationally expensive, i.e.
Can be run interactively, accommodate slow
user proposed solutions
Provide many alternative solutions
The Concept of
The Argument Natural Selection
4
Major Agents of Genetic
When changes occur ... Change in Individuals
Previously “fit” (well-
(well-adapted) Mutation in genes
individuals will no longer be best-
best-suited – may be due to various sources (e.g. UV
for their environment rays, chemicals, etc.)
Location of Mutation
Some members of the population will Start:
have genes that confer different 1001001
1001001001001001001001
characteristics than “the norm”. Some
of these characteristics can make them After Mutation:
1001000001001001001001
more “fit” in the changing environment.
Production of New
Chromosomes
2 parents give rise to 2 children Why use evolution as a model
for solving computational
problems?
5
The Nature of Computational Problems
The Nature of Computational Problems (2)
6
Basic Genetic Algorithm Fitness Function
Step 1. Generate a random population For each individual in the population,
of n chromosomes evaluate its relative fitness
Step 2. Assign a fitness to each
individual For a problem with m parameters, the
Step 3. Repeat until n children have fitness can be plotted in an m+1
been produced dimensional space
– Choose 2 parents based on fitness proportional
selection
– Apply genetic operators to copies of the parents
– Produce new chromosomes
After sufficient generations a near Seek out the moving maximum via a
optimal solution will be present in the parasitic fitness function
population of chromosomes – as the chromosomes adapt to the search
space, so does the fitness function