Informed Search II 1.When A* fails – Hill climbing, simulated annealing 2.Genetic algorithms.
1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The...
-
Upload
franklin-haynes -
Category
Documents
-
view
222 -
download
6
Transcript of 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The...
![Page 1: 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.](https://reader035.fdocuments.us/reader035/viewer/2022062713/56649f445503460f94c64dba/html5/thumbnails/1.jpg)
1
Genetic Algorithms
K.Ganesh
IntroductionGAs and Simulated Annealing
The Biology of GeneticsThe Logic of Genetic Programmes
DemoSummary
![Page 2: 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.](https://reader035.fdocuments.us/reader035/viewer/2022062713/56649f445503460f94c64dba/html5/thumbnails/2.jpg)
2
Genotypes/Phenotypes & Mutation
• Genotypes are representations of the genetic sequence• Phenotypes are the physical results of the decoding of the genotype• Mutations
– A permanent change in the genetic material.– Rare (excepting nuclear/chemical exposure).– Most are deleterious.– Some are beneficial.– Can ‘refresh’ the gene pool.
![Page 3: 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.](https://reader035.fdocuments.us/reader035/viewer/2022062713/56649f445503460f94c64dba/html5/thumbnails/3.jpg)
3
GAs and Simulated Annealing
• Simulated Annealing is Hill-Climbing with occasional reversals
• Genetic Algorithms are parallel Hill-Climbing– population of individuals– Selection based on fitness function– Crossover– Mutation
![Page 4: 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.](https://reader035.fdocuments.us/reader035/viewer/2022062713/56649f445503460f94c64dba/html5/thumbnails/4.jpg)
4
GAs
What are they? Programmes which emulate the
biological processes of genetic recombination, mutation, and natural selection to generate solutions to problems.
When are they used? Problems with massive search spaces
and many parameters resulting in a combinatorial explosion of possible solutions
![Page 5: 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.](https://reader035.fdocuments.us/reader035/viewer/2022062713/56649f445503460f94c64dba/html5/thumbnails/5.jpg)
5
Where are They Used?
Production Management (John Deere, BP). Credit Scoring ( UK Banks ). Robot Vision/Machine Learning. Network Design. Financial applications (eg. equity trading
and asset allocation.) Picking Pub Locations (BASS)
![Page 6: 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.](https://reader035.fdocuments.us/reader035/viewer/2022062713/56649f445503460f94c64dba/html5/thumbnails/6.jpg)
6
How do they work?
function GENETIC-ALGORITHM(population, FITNESS-FN) returns an individual
inputs: population, a set of individuals FITNESS-FN: a fn. that measures the fitness of an
individualrepeat
parents ¬ SELECTION(population, FITNESS-FN)population ¬ REPRODUCTION(parents)
until some individual is fit enough
return the best individual in population, according to FITNESS-FN
![Page 7: 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.](https://reader035.fdocuments.us/reader035/viewer/2022062713/56649f445503460f94c64dba/html5/thumbnails/7.jpg)
7
GA details
• Individuals are usually represented by a bit string– This is often the tricky bit
• The best individuals contribute most to the next generation
• Most change is achieved by crossover, little by mutation
![Page 8: 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.](https://reader035.fdocuments.us/reader035/viewer/2022062713/56649f445503460f94c64dba/html5/thumbnails/8.jpg)
8
The Biology of Genetics.
• Members of same species share similar sets of genes.
• Two members of the same species mate to recombine specific areas of their chromosomes into a new genotype.
• Progeny (phenotypes) will survive based on their fitness for the environment. Fit individuals are more likely to produce offspring than less fit individuals (natural selection).
• Over time less beneficial genes are eliminated from gene pool because progeny with these genes compete less successfully and therefore produce less progeny.
![Page 9: 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.](https://reader035.fdocuments.us/reader035/viewer/2022062713/56649f445503460f94c64dba/html5/thumbnails/9.jpg)
9
Biology of Genetics
• A gene pool is the sum total of ‘functional units’ of all chromosomes of the system.
• A genotype is the genetic pattern which encodes for a specific trait or set of traits.
• Gene Diversity - Maintaining a diversity of solutions to a wide variety of problems.
• Natural Selection - Culling phenotypes which are less fit to survive the environment.
• Recombination - Combining discrete features (genes) of different solutions (chromosomes) in order to come up with superior solutions.
![Page 10: 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.](https://reader035.fdocuments.us/reader035/viewer/2022062713/56649f445503460f94c64dba/html5/thumbnails/10.jpg)
10
Mutations.
• A permanent change in the genetic material.
• Rare (excepting nuclear/chemical exposure).
• Most are deleterious.• Some are beneficial.• Can ‘refresh’ the gene pool.
![Page 11: 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.](https://reader035.fdocuments.us/reader035/viewer/2022062713/56649f445503460f94c64dba/html5/thumbnails/11.jpg)
11
Recombination--Crossover
Genotype 1
New Genotypes
Genotype 2
![Page 12: 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.](https://reader035.fdocuments.us/reader035/viewer/2022062713/56649f445503460f94c64dba/html5/thumbnails/12.jpg)
12
GAs: What We Need?
• Decide what constitutes a viable part of a solution (what are our genes?).
• Decide how to determine fitness of a solution. • A method to select chromosomes from
population for mating or mutation.• Decide on a data structure to represent the
chromosome.• Choose a technique for mutating chromosomes.• Choose a technique to enable crossover.• Choose a technique to reinsert children into
population.
![Page 13: 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.](https://reader035.fdocuments.us/reader035/viewer/2022062713/56649f445503460f94c64dba/html5/thumbnails/13.jpg)
13
Greeness Height Width Taste Weight Height/Width ClassNo. 1 210 60 62 Sweet 186 0.97 AppleNo. 2 220 70 51 Sweet 180 1.37 PearNo. 3 215 55 55 Tart 152 1.00 AppleNo. 4 180 76 40 Sweet 152 1.90 PearNo. 5 220 68 45 Sweet 153 1.51 PearNo. 6 160 65 68 Sour 221 0.96 AppleNo. 7 215 63 45 Sweet 140 1.40 PearNo. 8 180 55 56 Sweet 154 0.98 AppleNo. 9 220 68 65 Tart 221 1.05 Apple
No. 10 190 60 58 Sour 174 1.03 Apple
What is the best feature subset to use?
Consider the Feature Selection problem
![Page 14: 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.](https://reader035.fdocuments.us/reader035/viewer/2022062713/56649f445503460f94c64dba/html5/thumbnails/14.jpg)
14
Fitness Evaluation.
• Maximum of function.– Magnitude of Y value.
• Schema to Predict the Dow Jones.– Quality of Match with Historical
Values.• Generating Schedules.
– Complex evaluation function to determine the quality of the generated schedule.
![Page 15: 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.](https://reader035.fdocuments.us/reader035/viewer/2022062713/56649f445503460f94c64dba/html5/thumbnails/15.jpg)
15
Selection – Roulette Wheel
• Want to maintain an element of randomness but ‘fix’ the selection so that fitter individuals have better odds of being chosen.
• Assign areas on a number line relative to each individuals fitness.
• Generate a random number within the range of the number line.
• Determine which individual occupies that area of the number line.
• Choose that individual.
![Page 16: 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.](https://reader035.fdocuments.us/reader035/viewer/2022062713/56649f445503460f94c64dba/html5/thumbnails/16.jpg)
16
Roulette Wheel -Example
Chromosome Fitness------------------------
10110110 20 10000000 5 11101110 15 10010011 8 10100010 12
20 5 15 8 12
![Page 17: 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.](https://reader035.fdocuments.us/reader035/viewer/2022062713/56649f445503460f94c64dba/html5/thumbnails/17.jpg)
17
Roulette Wheel -Example
Random Numbers Father Mother 44, 31 10010011 11101110 5, 32 10110110 11101110 49, 3 10100010 10110110 18, 27 10110110 11101110 22, 54 10000000 10100010
![Page 18: 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.](https://reader035.fdocuments.us/reader035/viewer/2022062713/56649f445503460f94c64dba/html5/thumbnails/18.jpg)
18
Cross-Over Example
ORIGINAL individual 1 0 1 1 1 0 0 1 1 0 1 0 individual 2 1 0 1 0 1 1 0 0 1 0 1 CROSSOVER POINTS 2 6 10 AFTER CROSSOVER offspring 1 0 1| 1 0 1 1| 1 1 0 1 | 1 offspring 2 1 0| 1 1 0 0| 0 0 1 0| 0
![Page 19: 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.](https://reader035.fdocuments.us/reader035/viewer/2022062713/56649f445503460f94c64dba/html5/thumbnails/19.jpg)
19
What do we do with Progeny?
• Must re-insert them back into population.
• Candidate strategies– replace the worst individual in the
population.– replace a randomly chosen
individual. – Select a random subset of
chromosomes and replace the worst of that subset.
![Page 20: 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.](https://reader035.fdocuments.us/reader035/viewer/2022062713/56649f445503460f94c64dba/html5/thumbnails/20.jpg)
20
Schemata and Recombination.
• Schema are subsets of genes in a chromosome that have some determinable affect on fitness.
• Crossover can disrupt schema.• The more spread out schema are
and the more genes they entail the higher the probability that will be disrupted.
1 01
![Page 21: 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.](https://reader035.fdocuments.us/reader035/viewer/2022062713/56649f445503460f94c64dba/html5/thumbnails/21.jpg)
21
Building Blocks.
• BUILDING BLOCK: (EC) A small, tightly clustered group of GENEs which have co-evolved in such a way that their introduction into any CHROMOSOME will be likely to give increased FITNESS to that chromosome.
• The "building block hypothesis" [GOLD89] states that GAs find solutions by first finding as many BUILDING BLOCKs as possible, and then combining them together to give the highest fitness.
![Page 22: 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.](https://reader035.fdocuments.us/reader035/viewer/2022062713/56649f445503460f94c64dba/html5/thumbnails/22.jpg)
22
Special
Problems:
Solution
Spaces
http://www.cwp.mines.edu/html_reports/coool/node3.html
![Page 23: 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.](https://reader035.fdocuments.us/reader035/viewer/2022062713/56649f445503460f94c64dba/html5/thumbnails/23.jpg)
23
Demos
Complex cost functions• http://www.oursland.net/projects/P
opulationExperiment/
TSP• http://cs.felk.cvut.cz/~xobitko/ga/
![Page 24: 1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.](https://reader035.fdocuments.us/reader035/viewer/2022062713/56649f445503460f94c64dba/html5/thumbnails/24.jpg)
24
Summary
• Genetic Algorithms mimic evolution and genetics.
• Used for problems with large search spaces.
• Computational Intensive.• Parallelisable