Professional Documents
Culture Documents
V
O
L
U
T
I
O
N
GENETIC A
R
LGORITHMS
Y
T
E
C
H
N
GENET I C PROGRAMMING
Q
U
E
A presentation by Anna, Seyi, Mahdi and Silvano
S MSC Computing and Design
UEL
EVOLU TION
Recombination:
•occurs randomly in nature .
• is enhanced by the phenomenon of
crossing over.
• acts to ensure constant variability: no two
daughter cells are identical, nor are any
identical in genetic content to the parent
cell
Cross-over:
Two chromosomes are lined up next to
each other and cut across somewhere
along their length. The two cut ends are
then swapped and glued back onto the
opposite end of the chromosome.
Gene mutations :
•Are random with no respect to adaptation and independent
of any possible consequences.
•Newly arisen mutations are more likely to be harmful than
beneficial to their carriers.
•Mutations can be beneficial if environments change
drastically because mutation provides each generation with
many new genetic variations.
Adaptation is process by which an animal or plant species becomes fitted to its environment; It is
the result of natural selection‟s acting upon heritable variation.
“…humans exhibit genetic variation and are subject to natural selection, the two fundamental
conditions for evolution to occur. But in humans, biological evolution has transcended itself,
opening up a new mode of evolution: adaptation by technological manipulation of the
environment. Organisms adapt to the environment by changing their genetic constitution over the
generations to suit the demands of the environment. Humans have developed the capacity to
adapt to hostile environments by modifying the environments according to the needs of
their genes.”Francisco Ayala
Designed by Patrick Marsilli, the Dome House a mechanical structure that allows it to rotate 360
degrees, thereby maximizing sun absorption by the roof mounted solar panels. While this building
responds to its environment, it is not evolutionary as it avoids the social factor.
Important points:
• The concept must be driven by process not by object (by generating rules not by form)
• The concept must also be generic and universal thus capable of being expressed in a variety of
structures and spatial configurations in response to different environments.
• Focus away from optimization – not perfect solution, just good enough
Evolutionary
computation
Evolutionary Programming
Genetic programming
MSC Computing and Design
UEL
Inspired by and based upon evolution in nature
Images by Michel-Hansmeyer
EVOLUTIONARY
COMPUTATION
Computers are
It is a search
not instructed to
method evolve anything.
Improve speed
Evolutionary
computation
Reduce cost of designing
Improve productivity
Computer science
•Instead of typically working with one solution in the search space, evolutionary algorithms consider a
large collection or population of solutions at once
•It is the search algorithms that define a computational problem in terms of search, where the search
space is filled with all the possible solutions to the problem and a point in that space defines a solution
Evolutionary algorithms (EAs) are search methods that take their inspiration from natural selection
and survival of the fittest in the biological world. EAs differ from more traditional optimization techniques
in that they involve a search from a "population" of solutions, not from a single point.
Where Evolutionary Algorithms focus on the solution space, Genetic algorithms differ as they look at the
search space. Genetic algorithms are a particular class of Evolutionary algorithms (EA) that use
techniques inspired by evolutionary biology such as inheritance, mutation, selection, and crossover.
Biology Lesson
1 : Start Generate random population of n chromosomes (suitable solutions for the problem)
3 : New Population Create a new population by repeating following steps until the new population is complete
1: [Selection] Select two parent chromosomes from a population according to their fitness
(the better the fitness, the bigger chance to be selected)
2 : [Crossover] With a crossover probability cross over the parents to form a new offspring
(children).
3 : [Mutation] With a mutation probability mutate new offspring at each locus (position in
chromosome).
5 : Test If the end condition is satisfied, stop, and return the best solution in current population
5: Loop Go to step 2
MSC Computing and Design
UEL
INITIAL POPULATION
SELECTION
MATING
CROSSOVER
MUTATION
NO
TERMINATE
Encoding of a chromosome
To use a genetic algorithm to solve a problem, a way must be found to encode potential solutions
to a problem that can be stored in the computer. This could be as a string of real numbers, or as
more typically the case, a binary bit string. This object is a genome (or chromosome).
Chromosome 1 1101100100110110
Chromosome 2 1101111000011110
The genetic algorithm creates a population of genomes then applies crossover and mutation to
the individuals in the population to generate new individuals.
It uses various selection criteria so that it picks the best individuals for mating (and subsequent
crossover). Your objective function determines how „good‟ each individual is.
The genetic algorithm then creates a population of solutions and applies genetic operators such as
mutation and crossover to evolve the solutions in order to find the best one(s).
Parents are selected according to their fitness. The better the chromosomes are, the more chances
they have of being selected.
There are many methods how to select the best chromosomes, for example roulette wheel selection,
Boltzman selection, tournament selection, rank selection, steady state selection and some others.
Mutation
After crossover mutation takes place. This is the chance for a bit in the chromosome to be flipped.
Mutation changes randomly the new offspring.
Evolutionary computation?
Evolutionary
Evolutionary Genetic
Programming
Strategies Algorithms (GA)
(EP)
Genetic programming provides a way to successfully conduct the search for a computer program in the
space of computer programs.
MSC Computing and Design
UEL
Genetic Programming structure
Genetic operations include crossover (sexual This measurement yields a single explicit numerical
recombination), mutation, reproduction, gene value, called fitness.
duplication, and gene deletion.
MSC Computing and Design
UEL
Entry Paradise Pavillion
The phenomenology and structure of micro-organisms like coral polyps or radiolarians are the basis of
the computer simulation of naturally evolving systems. In the field of ‘genetic architecture’, algorithmic
codes are created. These codes trigger chains of commands that are similar to organic growth. In this
way, the process of design is replaced by the process of discovery and selection.”
Microscopic cell structures served as the inspiration for the design of a pavilion that is reminiscent of
irregular natural forms like foam, sponge, or coral reefs.
Genetic furniture
Books
John Frazer(1995) An evolutionary Architecture
Peter j. Bentley (1999) Evolutionary design by computers
Brian K. Hall, Jones(1941) Evolution: Principles and Processes
Paul Coates (2010) Programming. Architecture
Websites
http://schoolworkhelper.net/wp-content/uploads/2010/11/meiosis.jpg
http://www.cs.sandia.gov/opt/survey/ea.html
http://www.genetic-programming.org/
http://www.cs.northwestern.edu/~fjs750/netlogo/final/gpdemo.html
http://www.cs.ucl.ac.uk/research/genprog/gp2faq/gp2faq.html
http://www.bloomshare.com/genetic-programming/
http://www.gene-expression-
programming.com/GepBook/Chapter1/Section5.htm
http://rogeralsing.com/2008/12/07/genetic-programming-evolution-of-
mona-lisahttp://www.cs.sandia.gov/opt/survey/ea.html