from the origin of species to evolutionary computation

59
From the Origin of Species to Evolutionary Computation Francisco Fernández de Vega Francisco Fernández de Vega Grupo de Evolución Artificial Grupo de Evolución Artificial University of Extremadura (Spain) University of Extremadura (Spain) http://gea.unex.es

Upload: yazid

Post on 19-Jan-2016

24 views

Category:

Documents


0 download

DESCRIPTION

http://gea.unex.es. From the Origin of Species to Evolutionary Computation. Francisco Fernández de Vega Grupo de Evolución Artificial University of Extremadura (Spain). Summary:. Evolution. Evolutionary Algorithms. Summary:. Evolution . Evolutionary Algorithms. - PowerPoint PPT Presentation

TRANSCRIPT

Page 1: From the Origin of Species to Evolutionary Computation

From the Origin of Speciesto Evolutionary Computation

Francisco Fernaacutendez de VegaFrancisco Fernaacutendez de Vega

Grupo de Evolucioacuten ArtificialGrupo de Evolucioacuten Artificial

University of Extremadura (Spain)University of Extremadura (Spain)

httpgeaunexes

Summary

Evolution Evolutionary Algorithms

Summary

Evolution Evolutionary Algorithms

Evolution

In biology In biology evolutionevolution is a change in the is a change in the heritable traits of a heritable traits of a populationpopulation over over successive generations as determined successive generations as determined by changes in the allele frequencies of by changes in the allele frequencies of genes genes

Over time this process can result in Over time this process can result in speciationspeciation the development of new species the development of new species from existing onesfrom existing ones

httpwwwwikipediaorg

Different TheoriesDifferent Theories

Lamarkian EvolutionLamarkian Evolution Darwinian EvolutionDarwinian Evolution Theory of GeneticsTheory of Genetics Modern Evolutionary SynthesisModern Evolutionary Synthesis

Evolution

Evolution LamarkismLamark based his theory on two observations in Lamark based his theory on two observations in his day considered to be generally truehis day considered to be generally true

Use and disuse ndash Individuals lose Use and disuse ndash Individuals lose characteristics they do not require (or use) characteristics they do not require (or use) and develop characteristics that are useful and develop characteristics that are useful Inheritance of acquired traits ndash Individuals Inheritance of acquired traits ndash Individuals inherit the traits of their ancestorsinherit the traits of their ancestors

Philosophie Zoologique 1809

Evolution Lamarkism

1 Giraffes stretches their necks to reach leaves high in trees

2 This gradually lengthen their necks

3 These giraffes have offspring with slightly longer necks

Evolution Lamarkism

Cultural Evolution Cultures and Societies develop over timeMeme Unit of cultural information transferable from one mind to another (coined by R Dawkins)Case of Interest Free Software

Evolution Darwinism

One Theory Natural Selection Two Authors

Charles DarwinsCharles Darwins

Arthur WallaceArthur Wallace

Evolution Natural Selection

Alfred Wallace

Evolution Natural Selection

Wallace Line (at Malay Archipielago) ndash Biogeography

On the Law Which has Regulated the Introduction of Species 1855

Evolution Natural Selection

Charles Darwin

The Beagle around the world

Evolution Natural Selection

Natural selection is the process by which individual organisms with favorable traits are more likely to survive and reproduce than those with unfavorable traits Darwin and Wallace reach the same ideas independenty

Evolution Natural Selection

Wallace knew Darwinrsquos interest in the question of how species originateHe sent him his essay ldquoOn the Tendency of Varieties to Depart Indefinitely from the Original Typerdquo and asked him to review it It was the same theory that Darwin had worked on for twenty years

Evolution Natural Selection

And published together their conclusions

On the Tendency of Species to form Varieties and on the On the Tendency of Species to form Varieties and on the Perpetuation of Varieties and Species by Natural Means of Selection Perpetuation of Varieties and Species by Natural Means of Selection By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and J D HOOKER Esq MD VPRS FLS ampcJ D HOOKER Esq MD VPRS FLS ampc

Evolution Natural Selection

Individual organism with favourable traits are more likely to survive and reproduce

What is requiredVariability

Inheritance

Natural Selection

Natural Selection Some Problems

Darwin was able to observe variation infer natural selection and thereby adaptation

He did not know the basis of heritability It seemed that when two individuals were

crossed their traits must be blended in the progeny

Theory of Genetics

Gregor Mendel

Population Genetics

Population genetics is the study of the allele frequency distribution and change under the influence of the four evolutionary forces natural selection genetic drift mutation

and gene flow It also takes account of population

subdivision and population structure in space

As such it attempts to explain such phenomena as adaptation and speciation

Founders Sewall Wright J B S Haldane and R A Fisher

Theory of Molecular Evolution Molecular

evolution is the process of evolution at the scale of DNA RNA and proteins

Modern Synthesis

Darwin and Wallace observe variation and infer natural selection and adaptation

Population-Genetics (Mendelian genetics) solved by Fisher Wright and Haldane

Avery identified DNA as the genetic material Watson and Crick showed how genes were

encoded in DNA

Can we watch evolution Peter amp Rose Mary Grant (Princeton

University) They are noted for their work on Darwins

Finches on the Galapagos Island named Daphne Major

The Grants spent six months of the year each year since 1973 capturing tagging taking blood samples and releasing finches from the islands

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 2: From the Origin of Species to Evolutionary Computation

Summary

Evolution Evolutionary Algorithms

Summary

Evolution Evolutionary Algorithms

Evolution

In biology In biology evolutionevolution is a change in the is a change in the heritable traits of a heritable traits of a populationpopulation over over successive generations as determined successive generations as determined by changes in the allele frequencies of by changes in the allele frequencies of genes genes

Over time this process can result in Over time this process can result in speciationspeciation the development of new species the development of new species from existing onesfrom existing ones

httpwwwwikipediaorg

Different TheoriesDifferent Theories

Lamarkian EvolutionLamarkian Evolution Darwinian EvolutionDarwinian Evolution Theory of GeneticsTheory of Genetics Modern Evolutionary SynthesisModern Evolutionary Synthesis

Evolution

Evolution LamarkismLamark based his theory on two observations in Lamark based his theory on two observations in his day considered to be generally truehis day considered to be generally true

Use and disuse ndash Individuals lose Use and disuse ndash Individuals lose characteristics they do not require (or use) characteristics they do not require (or use) and develop characteristics that are useful and develop characteristics that are useful Inheritance of acquired traits ndash Individuals Inheritance of acquired traits ndash Individuals inherit the traits of their ancestorsinherit the traits of their ancestors

Philosophie Zoologique 1809

Evolution Lamarkism

1 Giraffes stretches their necks to reach leaves high in trees

2 This gradually lengthen their necks

3 These giraffes have offspring with slightly longer necks

Evolution Lamarkism

Cultural Evolution Cultures and Societies develop over timeMeme Unit of cultural information transferable from one mind to another (coined by R Dawkins)Case of Interest Free Software

Evolution Darwinism

One Theory Natural Selection Two Authors

Charles DarwinsCharles Darwins

Arthur WallaceArthur Wallace

Evolution Natural Selection

Alfred Wallace

Evolution Natural Selection

Wallace Line (at Malay Archipielago) ndash Biogeography

On the Law Which has Regulated the Introduction of Species 1855

Evolution Natural Selection

Charles Darwin

The Beagle around the world

Evolution Natural Selection

Natural selection is the process by which individual organisms with favorable traits are more likely to survive and reproduce than those with unfavorable traits Darwin and Wallace reach the same ideas independenty

Evolution Natural Selection

Wallace knew Darwinrsquos interest in the question of how species originateHe sent him his essay ldquoOn the Tendency of Varieties to Depart Indefinitely from the Original Typerdquo and asked him to review it It was the same theory that Darwin had worked on for twenty years

Evolution Natural Selection

And published together their conclusions

On the Tendency of Species to form Varieties and on the On the Tendency of Species to form Varieties and on the Perpetuation of Varieties and Species by Natural Means of Selection Perpetuation of Varieties and Species by Natural Means of Selection By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and J D HOOKER Esq MD VPRS FLS ampcJ D HOOKER Esq MD VPRS FLS ampc

Evolution Natural Selection

Individual organism with favourable traits are more likely to survive and reproduce

What is requiredVariability

Inheritance

Natural Selection

Natural Selection Some Problems

Darwin was able to observe variation infer natural selection and thereby adaptation

He did not know the basis of heritability It seemed that when two individuals were

crossed their traits must be blended in the progeny

Theory of Genetics

Gregor Mendel

Population Genetics

Population genetics is the study of the allele frequency distribution and change under the influence of the four evolutionary forces natural selection genetic drift mutation

and gene flow It also takes account of population

subdivision and population structure in space

As such it attempts to explain such phenomena as adaptation and speciation

Founders Sewall Wright J B S Haldane and R A Fisher

Theory of Molecular Evolution Molecular

evolution is the process of evolution at the scale of DNA RNA and proteins

Modern Synthesis

Darwin and Wallace observe variation and infer natural selection and adaptation

Population-Genetics (Mendelian genetics) solved by Fisher Wright and Haldane

Avery identified DNA as the genetic material Watson and Crick showed how genes were

encoded in DNA

Can we watch evolution Peter amp Rose Mary Grant (Princeton

University) They are noted for their work on Darwins

Finches on the Galapagos Island named Daphne Major

The Grants spent six months of the year each year since 1973 capturing tagging taking blood samples and releasing finches from the islands

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 3: From the Origin of Species to Evolutionary Computation

Summary

Evolution Evolutionary Algorithms

Evolution

In biology In biology evolutionevolution is a change in the is a change in the heritable traits of a heritable traits of a populationpopulation over over successive generations as determined successive generations as determined by changes in the allele frequencies of by changes in the allele frequencies of genes genes

Over time this process can result in Over time this process can result in speciationspeciation the development of new species the development of new species from existing onesfrom existing ones

httpwwwwikipediaorg

Different TheoriesDifferent Theories

Lamarkian EvolutionLamarkian Evolution Darwinian EvolutionDarwinian Evolution Theory of GeneticsTheory of Genetics Modern Evolutionary SynthesisModern Evolutionary Synthesis

Evolution

Evolution LamarkismLamark based his theory on two observations in Lamark based his theory on two observations in his day considered to be generally truehis day considered to be generally true

Use and disuse ndash Individuals lose Use and disuse ndash Individuals lose characteristics they do not require (or use) characteristics they do not require (or use) and develop characteristics that are useful and develop characteristics that are useful Inheritance of acquired traits ndash Individuals Inheritance of acquired traits ndash Individuals inherit the traits of their ancestorsinherit the traits of their ancestors

Philosophie Zoologique 1809

Evolution Lamarkism

1 Giraffes stretches their necks to reach leaves high in trees

2 This gradually lengthen their necks

3 These giraffes have offspring with slightly longer necks

Evolution Lamarkism

Cultural Evolution Cultures and Societies develop over timeMeme Unit of cultural information transferable from one mind to another (coined by R Dawkins)Case of Interest Free Software

Evolution Darwinism

One Theory Natural Selection Two Authors

Charles DarwinsCharles Darwins

Arthur WallaceArthur Wallace

Evolution Natural Selection

Alfred Wallace

Evolution Natural Selection

Wallace Line (at Malay Archipielago) ndash Biogeography

On the Law Which has Regulated the Introduction of Species 1855

Evolution Natural Selection

Charles Darwin

The Beagle around the world

Evolution Natural Selection

Natural selection is the process by which individual organisms with favorable traits are more likely to survive and reproduce than those with unfavorable traits Darwin and Wallace reach the same ideas independenty

Evolution Natural Selection

Wallace knew Darwinrsquos interest in the question of how species originateHe sent him his essay ldquoOn the Tendency of Varieties to Depart Indefinitely from the Original Typerdquo and asked him to review it It was the same theory that Darwin had worked on for twenty years

Evolution Natural Selection

And published together their conclusions

On the Tendency of Species to form Varieties and on the On the Tendency of Species to form Varieties and on the Perpetuation of Varieties and Species by Natural Means of Selection Perpetuation of Varieties and Species by Natural Means of Selection By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and J D HOOKER Esq MD VPRS FLS ampcJ D HOOKER Esq MD VPRS FLS ampc

Evolution Natural Selection

Individual organism with favourable traits are more likely to survive and reproduce

What is requiredVariability

Inheritance

Natural Selection

Natural Selection Some Problems

Darwin was able to observe variation infer natural selection and thereby adaptation

He did not know the basis of heritability It seemed that when two individuals were

crossed their traits must be blended in the progeny

Theory of Genetics

Gregor Mendel

Population Genetics

Population genetics is the study of the allele frequency distribution and change under the influence of the four evolutionary forces natural selection genetic drift mutation

and gene flow It also takes account of population

subdivision and population structure in space

As such it attempts to explain such phenomena as adaptation and speciation

Founders Sewall Wright J B S Haldane and R A Fisher

Theory of Molecular Evolution Molecular

evolution is the process of evolution at the scale of DNA RNA and proteins

Modern Synthesis

Darwin and Wallace observe variation and infer natural selection and adaptation

Population-Genetics (Mendelian genetics) solved by Fisher Wright and Haldane

Avery identified DNA as the genetic material Watson and Crick showed how genes were

encoded in DNA

Can we watch evolution Peter amp Rose Mary Grant (Princeton

University) They are noted for their work on Darwins

Finches on the Galapagos Island named Daphne Major

The Grants spent six months of the year each year since 1973 capturing tagging taking blood samples and releasing finches from the islands

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 4: From the Origin of Species to Evolutionary Computation

Evolution

In biology In biology evolutionevolution is a change in the is a change in the heritable traits of a heritable traits of a populationpopulation over over successive generations as determined successive generations as determined by changes in the allele frequencies of by changes in the allele frequencies of genes genes

Over time this process can result in Over time this process can result in speciationspeciation the development of new species the development of new species from existing onesfrom existing ones

httpwwwwikipediaorg

Different TheoriesDifferent Theories

Lamarkian EvolutionLamarkian Evolution Darwinian EvolutionDarwinian Evolution Theory of GeneticsTheory of Genetics Modern Evolutionary SynthesisModern Evolutionary Synthesis

Evolution

Evolution LamarkismLamark based his theory on two observations in Lamark based his theory on two observations in his day considered to be generally truehis day considered to be generally true

Use and disuse ndash Individuals lose Use and disuse ndash Individuals lose characteristics they do not require (or use) characteristics they do not require (or use) and develop characteristics that are useful and develop characteristics that are useful Inheritance of acquired traits ndash Individuals Inheritance of acquired traits ndash Individuals inherit the traits of their ancestorsinherit the traits of their ancestors

Philosophie Zoologique 1809

Evolution Lamarkism

1 Giraffes stretches their necks to reach leaves high in trees

2 This gradually lengthen their necks

3 These giraffes have offspring with slightly longer necks

Evolution Lamarkism

Cultural Evolution Cultures and Societies develop over timeMeme Unit of cultural information transferable from one mind to another (coined by R Dawkins)Case of Interest Free Software

Evolution Darwinism

One Theory Natural Selection Two Authors

Charles DarwinsCharles Darwins

Arthur WallaceArthur Wallace

Evolution Natural Selection

Alfred Wallace

Evolution Natural Selection

Wallace Line (at Malay Archipielago) ndash Biogeography

On the Law Which has Regulated the Introduction of Species 1855

Evolution Natural Selection

Charles Darwin

The Beagle around the world

Evolution Natural Selection

Natural selection is the process by which individual organisms with favorable traits are more likely to survive and reproduce than those with unfavorable traits Darwin and Wallace reach the same ideas independenty

Evolution Natural Selection

Wallace knew Darwinrsquos interest in the question of how species originateHe sent him his essay ldquoOn the Tendency of Varieties to Depart Indefinitely from the Original Typerdquo and asked him to review it It was the same theory that Darwin had worked on for twenty years

Evolution Natural Selection

And published together their conclusions

On the Tendency of Species to form Varieties and on the On the Tendency of Species to form Varieties and on the Perpetuation of Varieties and Species by Natural Means of Selection Perpetuation of Varieties and Species by Natural Means of Selection By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and J D HOOKER Esq MD VPRS FLS ampcJ D HOOKER Esq MD VPRS FLS ampc

Evolution Natural Selection

Individual organism with favourable traits are more likely to survive and reproduce

What is requiredVariability

Inheritance

Natural Selection

Natural Selection Some Problems

Darwin was able to observe variation infer natural selection and thereby adaptation

He did not know the basis of heritability It seemed that when two individuals were

crossed their traits must be blended in the progeny

Theory of Genetics

Gregor Mendel

Population Genetics

Population genetics is the study of the allele frequency distribution and change under the influence of the four evolutionary forces natural selection genetic drift mutation

and gene flow It also takes account of population

subdivision and population structure in space

As such it attempts to explain such phenomena as adaptation and speciation

Founders Sewall Wright J B S Haldane and R A Fisher

Theory of Molecular Evolution Molecular

evolution is the process of evolution at the scale of DNA RNA and proteins

Modern Synthesis

Darwin and Wallace observe variation and infer natural selection and adaptation

Population-Genetics (Mendelian genetics) solved by Fisher Wright and Haldane

Avery identified DNA as the genetic material Watson and Crick showed how genes were

encoded in DNA

Can we watch evolution Peter amp Rose Mary Grant (Princeton

University) They are noted for their work on Darwins

Finches on the Galapagos Island named Daphne Major

The Grants spent six months of the year each year since 1973 capturing tagging taking blood samples and releasing finches from the islands

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 5: From the Origin of Species to Evolutionary Computation

Different TheoriesDifferent Theories

Lamarkian EvolutionLamarkian Evolution Darwinian EvolutionDarwinian Evolution Theory of GeneticsTheory of Genetics Modern Evolutionary SynthesisModern Evolutionary Synthesis

Evolution

Evolution LamarkismLamark based his theory on two observations in Lamark based his theory on two observations in his day considered to be generally truehis day considered to be generally true

Use and disuse ndash Individuals lose Use and disuse ndash Individuals lose characteristics they do not require (or use) characteristics they do not require (or use) and develop characteristics that are useful and develop characteristics that are useful Inheritance of acquired traits ndash Individuals Inheritance of acquired traits ndash Individuals inherit the traits of their ancestorsinherit the traits of their ancestors

Philosophie Zoologique 1809

Evolution Lamarkism

1 Giraffes stretches their necks to reach leaves high in trees

2 This gradually lengthen their necks

3 These giraffes have offspring with slightly longer necks

Evolution Lamarkism

Cultural Evolution Cultures and Societies develop over timeMeme Unit of cultural information transferable from one mind to another (coined by R Dawkins)Case of Interest Free Software

Evolution Darwinism

One Theory Natural Selection Two Authors

Charles DarwinsCharles Darwins

Arthur WallaceArthur Wallace

Evolution Natural Selection

Alfred Wallace

Evolution Natural Selection

Wallace Line (at Malay Archipielago) ndash Biogeography

On the Law Which has Regulated the Introduction of Species 1855

Evolution Natural Selection

Charles Darwin

The Beagle around the world

Evolution Natural Selection

Natural selection is the process by which individual organisms with favorable traits are more likely to survive and reproduce than those with unfavorable traits Darwin and Wallace reach the same ideas independenty

Evolution Natural Selection

Wallace knew Darwinrsquos interest in the question of how species originateHe sent him his essay ldquoOn the Tendency of Varieties to Depart Indefinitely from the Original Typerdquo and asked him to review it It was the same theory that Darwin had worked on for twenty years

Evolution Natural Selection

And published together their conclusions

On the Tendency of Species to form Varieties and on the On the Tendency of Species to form Varieties and on the Perpetuation of Varieties and Species by Natural Means of Selection Perpetuation of Varieties and Species by Natural Means of Selection By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and J D HOOKER Esq MD VPRS FLS ampcJ D HOOKER Esq MD VPRS FLS ampc

Evolution Natural Selection

Individual organism with favourable traits are more likely to survive and reproduce

What is requiredVariability

Inheritance

Natural Selection

Natural Selection Some Problems

Darwin was able to observe variation infer natural selection and thereby adaptation

He did not know the basis of heritability It seemed that when two individuals were

crossed their traits must be blended in the progeny

Theory of Genetics

Gregor Mendel

Population Genetics

Population genetics is the study of the allele frequency distribution and change under the influence of the four evolutionary forces natural selection genetic drift mutation

and gene flow It also takes account of population

subdivision and population structure in space

As such it attempts to explain such phenomena as adaptation and speciation

Founders Sewall Wright J B S Haldane and R A Fisher

Theory of Molecular Evolution Molecular

evolution is the process of evolution at the scale of DNA RNA and proteins

Modern Synthesis

Darwin and Wallace observe variation and infer natural selection and adaptation

Population-Genetics (Mendelian genetics) solved by Fisher Wright and Haldane

Avery identified DNA as the genetic material Watson and Crick showed how genes were

encoded in DNA

Can we watch evolution Peter amp Rose Mary Grant (Princeton

University) They are noted for their work on Darwins

Finches on the Galapagos Island named Daphne Major

The Grants spent six months of the year each year since 1973 capturing tagging taking blood samples and releasing finches from the islands

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 6: From the Origin of Species to Evolutionary Computation

Evolution LamarkismLamark based his theory on two observations in Lamark based his theory on two observations in his day considered to be generally truehis day considered to be generally true

Use and disuse ndash Individuals lose Use and disuse ndash Individuals lose characteristics they do not require (or use) characteristics they do not require (or use) and develop characteristics that are useful and develop characteristics that are useful Inheritance of acquired traits ndash Individuals Inheritance of acquired traits ndash Individuals inherit the traits of their ancestorsinherit the traits of their ancestors

Philosophie Zoologique 1809

Evolution Lamarkism

1 Giraffes stretches their necks to reach leaves high in trees

2 This gradually lengthen their necks

3 These giraffes have offspring with slightly longer necks

Evolution Lamarkism

Cultural Evolution Cultures and Societies develop over timeMeme Unit of cultural information transferable from one mind to another (coined by R Dawkins)Case of Interest Free Software

Evolution Darwinism

One Theory Natural Selection Two Authors

Charles DarwinsCharles Darwins

Arthur WallaceArthur Wallace

Evolution Natural Selection

Alfred Wallace

Evolution Natural Selection

Wallace Line (at Malay Archipielago) ndash Biogeography

On the Law Which has Regulated the Introduction of Species 1855

Evolution Natural Selection

Charles Darwin

The Beagle around the world

Evolution Natural Selection

Natural selection is the process by which individual organisms with favorable traits are more likely to survive and reproduce than those with unfavorable traits Darwin and Wallace reach the same ideas independenty

Evolution Natural Selection

Wallace knew Darwinrsquos interest in the question of how species originateHe sent him his essay ldquoOn the Tendency of Varieties to Depart Indefinitely from the Original Typerdquo and asked him to review it It was the same theory that Darwin had worked on for twenty years

Evolution Natural Selection

And published together their conclusions

On the Tendency of Species to form Varieties and on the On the Tendency of Species to form Varieties and on the Perpetuation of Varieties and Species by Natural Means of Selection Perpetuation of Varieties and Species by Natural Means of Selection By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and J D HOOKER Esq MD VPRS FLS ampcJ D HOOKER Esq MD VPRS FLS ampc

Evolution Natural Selection

Individual organism with favourable traits are more likely to survive and reproduce

What is requiredVariability

Inheritance

Natural Selection

Natural Selection Some Problems

Darwin was able to observe variation infer natural selection and thereby adaptation

He did not know the basis of heritability It seemed that when two individuals were

crossed their traits must be blended in the progeny

Theory of Genetics

Gregor Mendel

Population Genetics

Population genetics is the study of the allele frequency distribution and change under the influence of the four evolutionary forces natural selection genetic drift mutation

and gene flow It also takes account of population

subdivision and population structure in space

As such it attempts to explain such phenomena as adaptation and speciation

Founders Sewall Wright J B S Haldane and R A Fisher

Theory of Molecular Evolution Molecular

evolution is the process of evolution at the scale of DNA RNA and proteins

Modern Synthesis

Darwin and Wallace observe variation and infer natural selection and adaptation

Population-Genetics (Mendelian genetics) solved by Fisher Wright and Haldane

Avery identified DNA as the genetic material Watson and Crick showed how genes were

encoded in DNA

Can we watch evolution Peter amp Rose Mary Grant (Princeton

University) They are noted for their work on Darwins

Finches on the Galapagos Island named Daphne Major

The Grants spent six months of the year each year since 1973 capturing tagging taking blood samples and releasing finches from the islands

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 7: From the Origin of Species to Evolutionary Computation

Evolution Lamarkism

1 Giraffes stretches their necks to reach leaves high in trees

2 This gradually lengthen their necks

3 These giraffes have offspring with slightly longer necks

Evolution Lamarkism

Cultural Evolution Cultures and Societies develop over timeMeme Unit of cultural information transferable from one mind to another (coined by R Dawkins)Case of Interest Free Software

Evolution Darwinism

One Theory Natural Selection Two Authors

Charles DarwinsCharles Darwins

Arthur WallaceArthur Wallace

Evolution Natural Selection

Alfred Wallace

Evolution Natural Selection

Wallace Line (at Malay Archipielago) ndash Biogeography

On the Law Which has Regulated the Introduction of Species 1855

Evolution Natural Selection

Charles Darwin

The Beagle around the world

Evolution Natural Selection

Natural selection is the process by which individual organisms with favorable traits are more likely to survive and reproduce than those with unfavorable traits Darwin and Wallace reach the same ideas independenty

Evolution Natural Selection

Wallace knew Darwinrsquos interest in the question of how species originateHe sent him his essay ldquoOn the Tendency of Varieties to Depart Indefinitely from the Original Typerdquo and asked him to review it It was the same theory that Darwin had worked on for twenty years

Evolution Natural Selection

And published together their conclusions

On the Tendency of Species to form Varieties and on the On the Tendency of Species to form Varieties and on the Perpetuation of Varieties and Species by Natural Means of Selection Perpetuation of Varieties and Species by Natural Means of Selection By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and J D HOOKER Esq MD VPRS FLS ampcJ D HOOKER Esq MD VPRS FLS ampc

Evolution Natural Selection

Individual organism with favourable traits are more likely to survive and reproduce

What is requiredVariability

Inheritance

Natural Selection

Natural Selection Some Problems

Darwin was able to observe variation infer natural selection and thereby adaptation

He did not know the basis of heritability It seemed that when two individuals were

crossed their traits must be blended in the progeny

Theory of Genetics

Gregor Mendel

Population Genetics

Population genetics is the study of the allele frequency distribution and change under the influence of the four evolutionary forces natural selection genetic drift mutation

and gene flow It also takes account of population

subdivision and population structure in space

As such it attempts to explain such phenomena as adaptation and speciation

Founders Sewall Wright J B S Haldane and R A Fisher

Theory of Molecular Evolution Molecular

evolution is the process of evolution at the scale of DNA RNA and proteins

Modern Synthesis

Darwin and Wallace observe variation and infer natural selection and adaptation

Population-Genetics (Mendelian genetics) solved by Fisher Wright and Haldane

Avery identified DNA as the genetic material Watson and Crick showed how genes were

encoded in DNA

Can we watch evolution Peter amp Rose Mary Grant (Princeton

University) They are noted for their work on Darwins

Finches on the Galapagos Island named Daphne Major

The Grants spent six months of the year each year since 1973 capturing tagging taking blood samples and releasing finches from the islands

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 8: From the Origin of Species to Evolutionary Computation

Evolution Lamarkism

Cultural Evolution Cultures and Societies develop over timeMeme Unit of cultural information transferable from one mind to another (coined by R Dawkins)Case of Interest Free Software

Evolution Darwinism

One Theory Natural Selection Two Authors

Charles DarwinsCharles Darwins

Arthur WallaceArthur Wallace

Evolution Natural Selection

Alfred Wallace

Evolution Natural Selection

Wallace Line (at Malay Archipielago) ndash Biogeography

On the Law Which has Regulated the Introduction of Species 1855

Evolution Natural Selection

Charles Darwin

The Beagle around the world

Evolution Natural Selection

Natural selection is the process by which individual organisms with favorable traits are more likely to survive and reproduce than those with unfavorable traits Darwin and Wallace reach the same ideas independenty

Evolution Natural Selection

Wallace knew Darwinrsquos interest in the question of how species originateHe sent him his essay ldquoOn the Tendency of Varieties to Depart Indefinitely from the Original Typerdquo and asked him to review it It was the same theory that Darwin had worked on for twenty years

Evolution Natural Selection

And published together their conclusions

On the Tendency of Species to form Varieties and on the On the Tendency of Species to form Varieties and on the Perpetuation of Varieties and Species by Natural Means of Selection Perpetuation of Varieties and Species by Natural Means of Selection By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and J D HOOKER Esq MD VPRS FLS ampcJ D HOOKER Esq MD VPRS FLS ampc

Evolution Natural Selection

Individual organism with favourable traits are more likely to survive and reproduce

What is requiredVariability

Inheritance

Natural Selection

Natural Selection Some Problems

Darwin was able to observe variation infer natural selection and thereby adaptation

He did not know the basis of heritability It seemed that when two individuals were

crossed their traits must be blended in the progeny

Theory of Genetics

Gregor Mendel

Population Genetics

Population genetics is the study of the allele frequency distribution and change under the influence of the four evolutionary forces natural selection genetic drift mutation

and gene flow It also takes account of population

subdivision and population structure in space

As such it attempts to explain such phenomena as adaptation and speciation

Founders Sewall Wright J B S Haldane and R A Fisher

Theory of Molecular Evolution Molecular

evolution is the process of evolution at the scale of DNA RNA and proteins

Modern Synthesis

Darwin and Wallace observe variation and infer natural selection and adaptation

Population-Genetics (Mendelian genetics) solved by Fisher Wright and Haldane

Avery identified DNA as the genetic material Watson and Crick showed how genes were

encoded in DNA

Can we watch evolution Peter amp Rose Mary Grant (Princeton

University) They are noted for their work on Darwins

Finches on the Galapagos Island named Daphne Major

The Grants spent six months of the year each year since 1973 capturing tagging taking blood samples and releasing finches from the islands

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 9: From the Origin of Species to Evolutionary Computation

Evolution Darwinism

One Theory Natural Selection Two Authors

Charles DarwinsCharles Darwins

Arthur WallaceArthur Wallace

Evolution Natural Selection

Alfred Wallace

Evolution Natural Selection

Wallace Line (at Malay Archipielago) ndash Biogeography

On the Law Which has Regulated the Introduction of Species 1855

Evolution Natural Selection

Charles Darwin

The Beagle around the world

Evolution Natural Selection

Natural selection is the process by which individual organisms with favorable traits are more likely to survive and reproduce than those with unfavorable traits Darwin and Wallace reach the same ideas independenty

Evolution Natural Selection

Wallace knew Darwinrsquos interest in the question of how species originateHe sent him his essay ldquoOn the Tendency of Varieties to Depart Indefinitely from the Original Typerdquo and asked him to review it It was the same theory that Darwin had worked on for twenty years

Evolution Natural Selection

And published together their conclusions

On the Tendency of Species to form Varieties and on the On the Tendency of Species to form Varieties and on the Perpetuation of Varieties and Species by Natural Means of Selection Perpetuation of Varieties and Species by Natural Means of Selection By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and J D HOOKER Esq MD VPRS FLS ampcJ D HOOKER Esq MD VPRS FLS ampc

Evolution Natural Selection

Individual organism with favourable traits are more likely to survive and reproduce

What is requiredVariability

Inheritance

Natural Selection

Natural Selection Some Problems

Darwin was able to observe variation infer natural selection and thereby adaptation

He did not know the basis of heritability It seemed that when two individuals were

crossed their traits must be blended in the progeny

Theory of Genetics

Gregor Mendel

Population Genetics

Population genetics is the study of the allele frequency distribution and change under the influence of the four evolutionary forces natural selection genetic drift mutation

and gene flow It also takes account of population

subdivision and population structure in space

As such it attempts to explain such phenomena as adaptation and speciation

Founders Sewall Wright J B S Haldane and R A Fisher

Theory of Molecular Evolution Molecular

evolution is the process of evolution at the scale of DNA RNA and proteins

Modern Synthesis

Darwin and Wallace observe variation and infer natural selection and adaptation

Population-Genetics (Mendelian genetics) solved by Fisher Wright and Haldane

Avery identified DNA as the genetic material Watson and Crick showed how genes were

encoded in DNA

Can we watch evolution Peter amp Rose Mary Grant (Princeton

University) They are noted for their work on Darwins

Finches on the Galapagos Island named Daphne Major

The Grants spent six months of the year each year since 1973 capturing tagging taking blood samples and releasing finches from the islands

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 10: From the Origin of Species to Evolutionary Computation

Evolution Natural Selection

Alfred Wallace

Evolution Natural Selection

Wallace Line (at Malay Archipielago) ndash Biogeography

On the Law Which has Regulated the Introduction of Species 1855

Evolution Natural Selection

Charles Darwin

The Beagle around the world

Evolution Natural Selection

Natural selection is the process by which individual organisms with favorable traits are more likely to survive and reproduce than those with unfavorable traits Darwin and Wallace reach the same ideas independenty

Evolution Natural Selection

Wallace knew Darwinrsquos interest in the question of how species originateHe sent him his essay ldquoOn the Tendency of Varieties to Depart Indefinitely from the Original Typerdquo and asked him to review it It was the same theory that Darwin had worked on for twenty years

Evolution Natural Selection

And published together their conclusions

On the Tendency of Species to form Varieties and on the On the Tendency of Species to form Varieties and on the Perpetuation of Varieties and Species by Natural Means of Selection Perpetuation of Varieties and Species by Natural Means of Selection By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and J D HOOKER Esq MD VPRS FLS ampcJ D HOOKER Esq MD VPRS FLS ampc

Evolution Natural Selection

Individual organism with favourable traits are more likely to survive and reproduce

What is requiredVariability

Inheritance

Natural Selection

Natural Selection Some Problems

Darwin was able to observe variation infer natural selection and thereby adaptation

He did not know the basis of heritability It seemed that when two individuals were

crossed their traits must be blended in the progeny

Theory of Genetics

Gregor Mendel

Population Genetics

Population genetics is the study of the allele frequency distribution and change under the influence of the four evolutionary forces natural selection genetic drift mutation

and gene flow It also takes account of population

subdivision and population structure in space

As such it attempts to explain such phenomena as adaptation and speciation

Founders Sewall Wright J B S Haldane and R A Fisher

Theory of Molecular Evolution Molecular

evolution is the process of evolution at the scale of DNA RNA and proteins

Modern Synthesis

Darwin and Wallace observe variation and infer natural selection and adaptation

Population-Genetics (Mendelian genetics) solved by Fisher Wright and Haldane

Avery identified DNA as the genetic material Watson and Crick showed how genes were

encoded in DNA

Can we watch evolution Peter amp Rose Mary Grant (Princeton

University) They are noted for their work on Darwins

Finches on the Galapagos Island named Daphne Major

The Grants spent six months of the year each year since 1973 capturing tagging taking blood samples and releasing finches from the islands

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 11: From the Origin of Species to Evolutionary Computation

Evolution Natural Selection

Wallace Line (at Malay Archipielago) ndash Biogeography

On the Law Which has Regulated the Introduction of Species 1855

Evolution Natural Selection

Charles Darwin

The Beagle around the world

Evolution Natural Selection

Natural selection is the process by which individual organisms with favorable traits are more likely to survive and reproduce than those with unfavorable traits Darwin and Wallace reach the same ideas independenty

Evolution Natural Selection

Wallace knew Darwinrsquos interest in the question of how species originateHe sent him his essay ldquoOn the Tendency of Varieties to Depart Indefinitely from the Original Typerdquo and asked him to review it It was the same theory that Darwin had worked on for twenty years

Evolution Natural Selection

And published together their conclusions

On the Tendency of Species to form Varieties and on the On the Tendency of Species to form Varieties and on the Perpetuation of Varieties and Species by Natural Means of Selection Perpetuation of Varieties and Species by Natural Means of Selection By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and J D HOOKER Esq MD VPRS FLS ampcJ D HOOKER Esq MD VPRS FLS ampc

Evolution Natural Selection

Individual organism with favourable traits are more likely to survive and reproduce

What is requiredVariability

Inheritance

Natural Selection

Natural Selection Some Problems

Darwin was able to observe variation infer natural selection and thereby adaptation

He did not know the basis of heritability It seemed that when two individuals were

crossed their traits must be blended in the progeny

Theory of Genetics

Gregor Mendel

Population Genetics

Population genetics is the study of the allele frequency distribution and change under the influence of the four evolutionary forces natural selection genetic drift mutation

and gene flow It also takes account of population

subdivision and population structure in space

As such it attempts to explain such phenomena as adaptation and speciation

Founders Sewall Wright J B S Haldane and R A Fisher

Theory of Molecular Evolution Molecular

evolution is the process of evolution at the scale of DNA RNA and proteins

Modern Synthesis

Darwin and Wallace observe variation and infer natural selection and adaptation

Population-Genetics (Mendelian genetics) solved by Fisher Wright and Haldane

Avery identified DNA as the genetic material Watson and Crick showed how genes were

encoded in DNA

Can we watch evolution Peter amp Rose Mary Grant (Princeton

University) They are noted for their work on Darwins

Finches on the Galapagos Island named Daphne Major

The Grants spent six months of the year each year since 1973 capturing tagging taking blood samples and releasing finches from the islands

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 12: From the Origin of Species to Evolutionary Computation

Evolution Natural Selection

Charles Darwin

The Beagle around the world

Evolution Natural Selection

Natural selection is the process by which individual organisms with favorable traits are more likely to survive and reproduce than those with unfavorable traits Darwin and Wallace reach the same ideas independenty

Evolution Natural Selection

Wallace knew Darwinrsquos interest in the question of how species originateHe sent him his essay ldquoOn the Tendency of Varieties to Depart Indefinitely from the Original Typerdquo and asked him to review it It was the same theory that Darwin had worked on for twenty years

Evolution Natural Selection

And published together their conclusions

On the Tendency of Species to form Varieties and on the On the Tendency of Species to form Varieties and on the Perpetuation of Varieties and Species by Natural Means of Selection Perpetuation of Varieties and Species by Natural Means of Selection By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and J D HOOKER Esq MD VPRS FLS ampcJ D HOOKER Esq MD VPRS FLS ampc

Evolution Natural Selection

Individual organism with favourable traits are more likely to survive and reproduce

What is requiredVariability

Inheritance

Natural Selection

Natural Selection Some Problems

Darwin was able to observe variation infer natural selection and thereby adaptation

He did not know the basis of heritability It seemed that when two individuals were

crossed their traits must be blended in the progeny

Theory of Genetics

Gregor Mendel

Population Genetics

Population genetics is the study of the allele frequency distribution and change under the influence of the four evolutionary forces natural selection genetic drift mutation

and gene flow It also takes account of population

subdivision and population structure in space

As such it attempts to explain such phenomena as adaptation and speciation

Founders Sewall Wright J B S Haldane and R A Fisher

Theory of Molecular Evolution Molecular

evolution is the process of evolution at the scale of DNA RNA and proteins

Modern Synthesis

Darwin and Wallace observe variation and infer natural selection and adaptation

Population-Genetics (Mendelian genetics) solved by Fisher Wright and Haldane

Avery identified DNA as the genetic material Watson and Crick showed how genes were

encoded in DNA

Can we watch evolution Peter amp Rose Mary Grant (Princeton

University) They are noted for their work on Darwins

Finches on the Galapagos Island named Daphne Major

The Grants spent six months of the year each year since 1973 capturing tagging taking blood samples and releasing finches from the islands

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 13: From the Origin of Species to Evolutionary Computation

The Beagle around the world

Evolution Natural Selection

Natural selection is the process by which individual organisms with favorable traits are more likely to survive and reproduce than those with unfavorable traits Darwin and Wallace reach the same ideas independenty

Evolution Natural Selection

Wallace knew Darwinrsquos interest in the question of how species originateHe sent him his essay ldquoOn the Tendency of Varieties to Depart Indefinitely from the Original Typerdquo and asked him to review it It was the same theory that Darwin had worked on for twenty years

Evolution Natural Selection

And published together their conclusions

On the Tendency of Species to form Varieties and on the On the Tendency of Species to form Varieties and on the Perpetuation of Varieties and Species by Natural Means of Selection Perpetuation of Varieties and Species by Natural Means of Selection By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and J D HOOKER Esq MD VPRS FLS ampcJ D HOOKER Esq MD VPRS FLS ampc

Evolution Natural Selection

Individual organism with favourable traits are more likely to survive and reproduce

What is requiredVariability

Inheritance

Natural Selection

Natural Selection Some Problems

Darwin was able to observe variation infer natural selection and thereby adaptation

He did not know the basis of heritability It seemed that when two individuals were

crossed their traits must be blended in the progeny

Theory of Genetics

Gregor Mendel

Population Genetics

Population genetics is the study of the allele frequency distribution and change under the influence of the four evolutionary forces natural selection genetic drift mutation

and gene flow It also takes account of population

subdivision and population structure in space

As such it attempts to explain such phenomena as adaptation and speciation

Founders Sewall Wright J B S Haldane and R A Fisher

Theory of Molecular Evolution Molecular

evolution is the process of evolution at the scale of DNA RNA and proteins

Modern Synthesis

Darwin and Wallace observe variation and infer natural selection and adaptation

Population-Genetics (Mendelian genetics) solved by Fisher Wright and Haldane

Avery identified DNA as the genetic material Watson and Crick showed how genes were

encoded in DNA

Can we watch evolution Peter amp Rose Mary Grant (Princeton

University) They are noted for their work on Darwins

Finches on the Galapagos Island named Daphne Major

The Grants spent six months of the year each year since 1973 capturing tagging taking blood samples and releasing finches from the islands

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 14: From the Origin of Species to Evolutionary Computation

Evolution Natural Selection

Natural selection is the process by which individual organisms with favorable traits are more likely to survive and reproduce than those with unfavorable traits Darwin and Wallace reach the same ideas independenty

Evolution Natural Selection

Wallace knew Darwinrsquos interest in the question of how species originateHe sent him his essay ldquoOn the Tendency of Varieties to Depart Indefinitely from the Original Typerdquo and asked him to review it It was the same theory that Darwin had worked on for twenty years

Evolution Natural Selection

And published together their conclusions

On the Tendency of Species to form Varieties and on the On the Tendency of Species to form Varieties and on the Perpetuation of Varieties and Species by Natural Means of Selection Perpetuation of Varieties and Species by Natural Means of Selection By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and J D HOOKER Esq MD VPRS FLS ampcJ D HOOKER Esq MD VPRS FLS ampc

Evolution Natural Selection

Individual organism with favourable traits are more likely to survive and reproduce

What is requiredVariability

Inheritance

Natural Selection

Natural Selection Some Problems

Darwin was able to observe variation infer natural selection and thereby adaptation

He did not know the basis of heritability It seemed that when two individuals were

crossed their traits must be blended in the progeny

Theory of Genetics

Gregor Mendel

Population Genetics

Population genetics is the study of the allele frequency distribution and change under the influence of the four evolutionary forces natural selection genetic drift mutation

and gene flow It also takes account of population

subdivision and population structure in space

As such it attempts to explain such phenomena as adaptation and speciation

Founders Sewall Wright J B S Haldane and R A Fisher

Theory of Molecular Evolution Molecular

evolution is the process of evolution at the scale of DNA RNA and proteins

Modern Synthesis

Darwin and Wallace observe variation and infer natural selection and adaptation

Population-Genetics (Mendelian genetics) solved by Fisher Wright and Haldane

Avery identified DNA as the genetic material Watson and Crick showed how genes were

encoded in DNA

Can we watch evolution Peter amp Rose Mary Grant (Princeton

University) They are noted for their work on Darwins

Finches on the Galapagos Island named Daphne Major

The Grants spent six months of the year each year since 1973 capturing tagging taking blood samples and releasing finches from the islands

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 15: From the Origin of Species to Evolutionary Computation

Evolution Natural Selection

Wallace knew Darwinrsquos interest in the question of how species originateHe sent him his essay ldquoOn the Tendency of Varieties to Depart Indefinitely from the Original Typerdquo and asked him to review it It was the same theory that Darwin had worked on for twenty years

Evolution Natural Selection

And published together their conclusions

On the Tendency of Species to form Varieties and on the On the Tendency of Species to form Varieties and on the Perpetuation of Varieties and Species by Natural Means of Selection Perpetuation of Varieties and Species by Natural Means of Selection By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and J D HOOKER Esq MD VPRS FLS ampcJ D HOOKER Esq MD VPRS FLS ampc

Evolution Natural Selection

Individual organism with favourable traits are more likely to survive and reproduce

What is requiredVariability

Inheritance

Natural Selection

Natural Selection Some Problems

Darwin was able to observe variation infer natural selection and thereby adaptation

He did not know the basis of heritability It seemed that when two individuals were

crossed their traits must be blended in the progeny

Theory of Genetics

Gregor Mendel

Population Genetics

Population genetics is the study of the allele frequency distribution and change under the influence of the four evolutionary forces natural selection genetic drift mutation

and gene flow It also takes account of population

subdivision and population structure in space

As such it attempts to explain such phenomena as adaptation and speciation

Founders Sewall Wright J B S Haldane and R A Fisher

Theory of Molecular Evolution Molecular

evolution is the process of evolution at the scale of DNA RNA and proteins

Modern Synthesis

Darwin and Wallace observe variation and infer natural selection and adaptation

Population-Genetics (Mendelian genetics) solved by Fisher Wright and Haldane

Avery identified DNA as the genetic material Watson and Crick showed how genes were

encoded in DNA

Can we watch evolution Peter amp Rose Mary Grant (Princeton

University) They are noted for their work on Darwins

Finches on the Galapagos Island named Daphne Major

The Grants spent six months of the year each year since 1973 capturing tagging taking blood samples and releasing finches from the islands

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 16: From the Origin of Species to Evolutionary Computation

Evolution Natural Selection

And published together their conclusions

On the Tendency of Species to form Varieties and on the On the Tendency of Species to form Varieties and on the Perpetuation of Varieties and Species by Natural Means of Selection Perpetuation of Varieties and Species by Natural Means of Selection By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED By CHARLES DARWIN Esq FRS FLS amp FGS and ALFRED WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and WALLACE Esq Communicated by Sir CHARLES LYELL FRS FLS and J D HOOKER Esq MD VPRS FLS ampcJ D HOOKER Esq MD VPRS FLS ampc

Evolution Natural Selection

Individual organism with favourable traits are more likely to survive and reproduce

What is requiredVariability

Inheritance

Natural Selection

Natural Selection Some Problems

Darwin was able to observe variation infer natural selection and thereby adaptation

He did not know the basis of heritability It seemed that when two individuals were

crossed their traits must be blended in the progeny

Theory of Genetics

Gregor Mendel

Population Genetics

Population genetics is the study of the allele frequency distribution and change under the influence of the four evolutionary forces natural selection genetic drift mutation

and gene flow It also takes account of population

subdivision and population structure in space

As such it attempts to explain such phenomena as adaptation and speciation

Founders Sewall Wright J B S Haldane and R A Fisher

Theory of Molecular Evolution Molecular

evolution is the process of evolution at the scale of DNA RNA and proteins

Modern Synthesis

Darwin and Wallace observe variation and infer natural selection and adaptation

Population-Genetics (Mendelian genetics) solved by Fisher Wright and Haldane

Avery identified DNA as the genetic material Watson and Crick showed how genes were

encoded in DNA

Can we watch evolution Peter amp Rose Mary Grant (Princeton

University) They are noted for their work on Darwins

Finches on the Galapagos Island named Daphne Major

The Grants spent six months of the year each year since 1973 capturing tagging taking blood samples and releasing finches from the islands

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 17: From the Origin of Species to Evolutionary Computation

Evolution Natural Selection

Individual organism with favourable traits are more likely to survive and reproduce

What is requiredVariability

Inheritance

Natural Selection

Natural Selection Some Problems

Darwin was able to observe variation infer natural selection and thereby adaptation

He did not know the basis of heritability It seemed that when two individuals were

crossed their traits must be blended in the progeny

Theory of Genetics

Gregor Mendel

Population Genetics

Population genetics is the study of the allele frequency distribution and change under the influence of the four evolutionary forces natural selection genetic drift mutation

and gene flow It also takes account of population

subdivision and population structure in space

As such it attempts to explain such phenomena as adaptation and speciation

Founders Sewall Wright J B S Haldane and R A Fisher

Theory of Molecular Evolution Molecular

evolution is the process of evolution at the scale of DNA RNA and proteins

Modern Synthesis

Darwin and Wallace observe variation and infer natural selection and adaptation

Population-Genetics (Mendelian genetics) solved by Fisher Wright and Haldane

Avery identified DNA as the genetic material Watson and Crick showed how genes were

encoded in DNA

Can we watch evolution Peter amp Rose Mary Grant (Princeton

University) They are noted for their work on Darwins

Finches on the Galapagos Island named Daphne Major

The Grants spent six months of the year each year since 1973 capturing tagging taking blood samples and releasing finches from the islands

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 18: From the Origin of Species to Evolutionary Computation

Individual organism with favourable traits are more likely to survive and reproduce

What is requiredVariability

Inheritance

Natural Selection

Natural Selection Some Problems

Darwin was able to observe variation infer natural selection and thereby adaptation

He did not know the basis of heritability It seemed that when two individuals were

crossed their traits must be blended in the progeny

Theory of Genetics

Gregor Mendel

Population Genetics

Population genetics is the study of the allele frequency distribution and change under the influence of the four evolutionary forces natural selection genetic drift mutation

and gene flow It also takes account of population

subdivision and population structure in space

As such it attempts to explain such phenomena as adaptation and speciation

Founders Sewall Wright J B S Haldane and R A Fisher

Theory of Molecular Evolution Molecular

evolution is the process of evolution at the scale of DNA RNA and proteins

Modern Synthesis

Darwin and Wallace observe variation and infer natural selection and adaptation

Population-Genetics (Mendelian genetics) solved by Fisher Wright and Haldane

Avery identified DNA as the genetic material Watson and Crick showed how genes were

encoded in DNA

Can we watch evolution Peter amp Rose Mary Grant (Princeton

University) They are noted for their work on Darwins

Finches on the Galapagos Island named Daphne Major

The Grants spent six months of the year each year since 1973 capturing tagging taking blood samples and releasing finches from the islands

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 19: From the Origin of Species to Evolutionary Computation

Natural Selection Some Problems

Darwin was able to observe variation infer natural selection and thereby adaptation

He did not know the basis of heritability It seemed that when two individuals were

crossed their traits must be blended in the progeny

Theory of Genetics

Gregor Mendel

Population Genetics

Population genetics is the study of the allele frequency distribution and change under the influence of the four evolutionary forces natural selection genetic drift mutation

and gene flow It also takes account of population

subdivision and population structure in space

As such it attempts to explain such phenomena as adaptation and speciation

Founders Sewall Wright J B S Haldane and R A Fisher

Theory of Molecular Evolution Molecular

evolution is the process of evolution at the scale of DNA RNA and proteins

Modern Synthesis

Darwin and Wallace observe variation and infer natural selection and adaptation

Population-Genetics (Mendelian genetics) solved by Fisher Wright and Haldane

Avery identified DNA as the genetic material Watson and Crick showed how genes were

encoded in DNA

Can we watch evolution Peter amp Rose Mary Grant (Princeton

University) They are noted for their work on Darwins

Finches on the Galapagos Island named Daphne Major

The Grants spent six months of the year each year since 1973 capturing tagging taking blood samples and releasing finches from the islands

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 20: From the Origin of Species to Evolutionary Computation

Theory of Genetics

Gregor Mendel

Population Genetics

Population genetics is the study of the allele frequency distribution and change under the influence of the four evolutionary forces natural selection genetic drift mutation

and gene flow It also takes account of population

subdivision and population structure in space

As such it attempts to explain such phenomena as adaptation and speciation

Founders Sewall Wright J B S Haldane and R A Fisher

Theory of Molecular Evolution Molecular

evolution is the process of evolution at the scale of DNA RNA and proteins

Modern Synthesis

Darwin and Wallace observe variation and infer natural selection and adaptation

Population-Genetics (Mendelian genetics) solved by Fisher Wright and Haldane

Avery identified DNA as the genetic material Watson and Crick showed how genes were

encoded in DNA

Can we watch evolution Peter amp Rose Mary Grant (Princeton

University) They are noted for their work on Darwins

Finches on the Galapagos Island named Daphne Major

The Grants spent six months of the year each year since 1973 capturing tagging taking blood samples and releasing finches from the islands

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 21: From the Origin of Species to Evolutionary Computation

Population Genetics

Population genetics is the study of the allele frequency distribution and change under the influence of the four evolutionary forces natural selection genetic drift mutation

and gene flow It also takes account of population

subdivision and population structure in space

As such it attempts to explain such phenomena as adaptation and speciation

Founders Sewall Wright J B S Haldane and R A Fisher

Theory of Molecular Evolution Molecular

evolution is the process of evolution at the scale of DNA RNA and proteins

Modern Synthesis

Darwin and Wallace observe variation and infer natural selection and adaptation

Population-Genetics (Mendelian genetics) solved by Fisher Wright and Haldane

Avery identified DNA as the genetic material Watson and Crick showed how genes were

encoded in DNA

Can we watch evolution Peter amp Rose Mary Grant (Princeton

University) They are noted for their work on Darwins

Finches on the Galapagos Island named Daphne Major

The Grants spent six months of the year each year since 1973 capturing tagging taking blood samples and releasing finches from the islands

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 22: From the Origin of Species to Evolutionary Computation

Theory of Molecular Evolution Molecular

evolution is the process of evolution at the scale of DNA RNA and proteins

Modern Synthesis

Darwin and Wallace observe variation and infer natural selection and adaptation

Population-Genetics (Mendelian genetics) solved by Fisher Wright and Haldane

Avery identified DNA as the genetic material Watson and Crick showed how genes were

encoded in DNA

Can we watch evolution Peter amp Rose Mary Grant (Princeton

University) They are noted for their work on Darwins

Finches on the Galapagos Island named Daphne Major

The Grants spent six months of the year each year since 1973 capturing tagging taking blood samples and releasing finches from the islands

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 23: From the Origin of Species to Evolutionary Computation

Modern Synthesis

Darwin and Wallace observe variation and infer natural selection and adaptation

Population-Genetics (Mendelian genetics) solved by Fisher Wright and Haldane

Avery identified DNA as the genetic material Watson and Crick showed how genes were

encoded in DNA

Can we watch evolution Peter amp Rose Mary Grant (Princeton

University) They are noted for their work on Darwins

Finches on the Galapagos Island named Daphne Major

The Grants spent six months of the year each year since 1973 capturing tagging taking blood samples and releasing finches from the islands

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 24: From the Origin of Species to Evolutionary Computation

Can we watch evolution Peter amp Rose Mary Grant (Princeton

University) They are noted for their work on Darwins

Finches on the Galapagos Island named Daphne Major

The Grants spent six months of the year each year since 1973 capturing tagging taking blood samples and releasing finches from the islands

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 25: From the Origin of Species to Evolutionary Computation

Can we watch evolution

They won the 2005 Balzan Prize for Population Biology [2]

They demonstrated evolution in action in Galaacutepagos finches very rapid changes in body and beak size in

response to changes in the food supply are driven by natural selection They also elucidated the mechanisms by which new species arise and how genetic diversity is maintained in natural populations

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 26: From the Origin of Species to Evolutionary Computation

Can we Wacth evolution

John Endler University of California

Evolution and ecology of animal color patterns vision and morphology

Relationship among Predation Level Guppies coloration

patterns Island Drainages

Large Level or Predation Guppies try to hide

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 27: From the Origin of Species to Evolutionary Computation

Algunas pruebas

Low Level of Predation Guppies try to show

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 28: From the Origin of Species to Evolutionary Computation

Summary

Evolution Evolutionary Algorithms

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 29: From the Origin of Species to Evolutionary Computation

Evolutionary Computation The next step

Artificial Evolution

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 30: From the Origin of Species to Evolutionary Computation

Evolutionary Computation

Subfield of Artificial Intelligence Involves Combinatorial Optimization

problems Stochastic and parallel by nature based on

populations Includes

Evolutionary Algorithms Swarm Intelligence Artificial Life Inmune Systems

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 31: From the Origin of Species to Evolutionary Computation

What are Evolutionary Algorithms Generic population-based metaheuristic

optimization algorithms inspired by biological evolution reproduction

mutation recombination natural selection and survival of the fittest

Can be also considered a Search technique

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 32: From the Origin of Species to Evolutionary Computation

Different Search Techniques

Search Techniques

Enumeratives Calculus Based

Stochastic

Hill Climbing Evolutionary Algorithms

Genetic Programming

Depth First

Breadth first

Simulated Annealing

Neural Networks

Genetic Algorithms

As classified by Banzhaf et al

Beam Search

Introduction 34

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 33: From the Origin of Species to Evolutionary Computation

How Do EAs work

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 34: From the Origin of Species to Evolutionary Computation

They find acceptably good solutions acceptably quick

Donrsquot require complex mathematics to run Donrsquot need to know the shape of the objective

function Well suited for parallel execution Get a set of answers to the problem

How Do EAs work

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 35: From the Origin of Species to Evolutionary Computation

How do EAs work

Population and Individuals

Different characters

Individuals compete for resources

Reproduction amp Heredity

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 36: From the Origin of Species to Evolutionary Computation

For Evolutionary Algorithms to work

bullIndividuals can reproduce

bullVariations affect individual traits and their survival

bullCharacters are transferred from parents to children by inheritance

bullIndividuals struggle for resources

T38

VARIATIONINHERITANCESUPERPOPULATION

Main Conditions

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 37: From the Origin of Species to Evolutionary Computation

How does an Ea Work

Summary T=0 Generate and Evaluate initial population [P(t)] While end-condition not reached do

Pacute(t)=variation [P(t)] Evaluate Pacute(t) P(t+1)=select [Pacute(t)P(t)] T=t+1

end while

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 38: From the Origin of Species to Evolutionary Computation

4 Ingredients A Genetic Encoding of possible solutions An initialization function How to create the initial

population A Fitness Function for evaluating individuals Genetic Operators Values for the parameters of the Algorithm

(Michalewiz 1996)

How to build an EA

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 39: From the Origin of Species to Evolutionary Computation

Basic Operations

Evaluation Selection Crossover Mutation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 40: From the Origin of Species to Evolutionary Computation

Why do they work

Informally EAs perform two tasks Exploration of the search space Exploitation of good areas

Rigorously Convergence has been mathematically demonstrated Nevertheless consider the No Free Lunch

Theorem

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 41: From the Origin of Species to Evolutionary Computation

Fitness Landscape

Candidates solutions are evaluated according the problem to be solved

The fitness function computes the fitness values when evaluating individuals

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 42: From the Origin of Species to Evolutionary Computation

Genotype - Phenotype

Phenotype 1048766 Domain-dependent representation of a potential solution

Genotype 1048766 Domain-independent representation of a potential solution

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 43: From the Origin of Species to Evolutionary Computation

Fitness Landscape

The fitness landscape corresponds to all possible fitness values for all possible individuals that could be generated for the problem at hand

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 44: From the Origin of Species to Evolutionary Computation

Be careful Not all the problems

can be solved with GAs

Fitness Landscape

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 45: From the Origin of Species to Evolutionary Computation

Be careful The Free Lunch Theorem There not exist a

better optimization technique for all the possible optimization problems

Fitness Landscape

Wolpert DH Macready WG (1997) No Free Lunch Theorems for Optimization IEEE Transactions on Evolutionary Computation 1 67

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 46: From the Origin of Species to Evolutionary Computation

Different flavours

Evolution Strategies [Rechenberg 1973] [Shwefel 1975]

Evolutionary Programming [Fogel 1962] Genetic Algorithms [Holland 1975] Genetic Programming [Koza 1992]

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 47: From the Origin of Species to Evolutionary Computation

Problems solved with EAs

Air-Injected Hydrocyclone OptimizationArtificial IntelligenceAssignation of Radio-Link FrequenciesAutomated Parameter Tuning for Sonar Information ProcessingBin PackingClusteringCommunication Network DesignConformational Analysis of DNAData MiningDynamic Anticipatory Routing in Circuit-Switched Telecommunications NetworksElectronic-Circuit LayoutFlow ControlFuzzy Controller DesignGas-Pipeline ControlGenetic Synthesis of Neural Network ArchitectureHybrid EC SystemsImage Generation and RecognitionInterdigitation (Engineering Design Optimization)Job Shop SchedulingKnowledge AcquisitionLearningMathematical and Numerical OptimizationModels of International SecurityMultiple Fault DiagnosisNeural Network DesignNonlinear Dynamical SystemsOrdering Problems (TSP N-Queens )Parallel Process SchedulingParametric Design of AircraftPortfolio OptimizationQuery Optimization in DatabasesReal Time Control of Physical SystemsRobot Trajectory GenerationSequence Scheduling (Genetic Edge Recombination)Strategy AcquisitionSymbolic Integration and DifferentiationTime-Serie Analysis and PredictionTraveling Salesman (Genetic Edge Recombination)Validation of Communication ProtocolsVLSI DesignWYSIWYG Artistic DesignX-Ray Crystallography

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 48: From the Origin of Species to Evolutionary Computation

Problems Solved with EAs

Virtual creatures httpcsfelkcvutcz~xobitkoga httpwww4ncsuedueosusersddhloughl

publicstablehtm httpwwwrennardorgalifeenglish

gavgbhtml

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 49: From the Origin of Species to Evolutionary Computation

Genetic Algorithms

Letrsquos Begin with a problem

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 50: From the Origin of Species to Evolutionary Computation

Genetic Algorithms

Letrsquos Begin with a problem

Consider a simpler problem

httpcsfelkcvutcz~xobitkoga

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 51: From the Origin of Species to Evolutionary Computation

What we need A Genetic Representation of the solution domain (bit

string) A Fitness Function to evaluate the solution domain And also

Initialization Selection Reproduction (Crossover Mutation) Termination criteria

Genetic Algorithms

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 52: From the Origin of Species to Evolutionary Computation

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 53: From the Origin of Species to Evolutionary Computation

S1=S1=1111`1101010111010101S2=11`10110101S2=11`10110101

S1rsquo=S1rsquo=1111`10110101`10110101S2rsquo=11`S2rsquo=11`1101010111010101

Genetic Algorithms Crossover

F(S1)F(S1)F(S2)F(S2)

F(S1rsquo)F(S1rsquo)F(S2rsquo)F(S2rsquo)

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 54: From the Origin of Species to Evolutionary Computation

S1acute=S1acute=1110111101`1010110101

S1rdquo=S1rdquo=1110111101` 0001010101

Genetic Algorithms Mutation

F(S1rdquo)F(S1rdquo)

F(S1rsquo)F(S1rsquo)

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 55: From the Origin of Species to Evolutionary Computation

Genetic Algorithms

httpcsfelkcvutcz~xobitkoga

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 56: From the Origin of Species to Evolutionary Computation

Genetic Algorithms

A problem with several optima

GAs can find each of the optima on several runs

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 57: From the Origin of Species to Evolutionary Computation

Bibliografiacutea

Genetic Algorithms + Data Structures = Evolution Programsby Zbigniew Michalewicz

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 58: From the Origin of Species to Evolutionary Computation

Tools

GALOPS (Garage Lab Michigan State University) httpgaragecsemsuedu

GAlib httplancetmiteduga PGAPack Dream Project Paradiseo

Questions

Page 59: From the Origin of Species to Evolutionary Computation

Questions