

















Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
A historical background of genetic algorithms (gas), from their origins in the works of charles darwin and gregor mendel to their modern applications. It also covers the key developments in ga research, including the works of holland, goldberg, rechenberg, fogel, owens, walsh, and koza. The principles of ga, including codifying the chromosome, defining the initial population, selection by the environment, chromosome recombination, mutation, and evolution. It also includes examples of ga applications and the use of gas in minimax functions.
Typology: Slides
1 / 25
This page cannot be seen from the preview
Don't miss anything!
mathematician Al Khowarizmi (790-840). Advocates of the new math system were called algorists as opposed to the abacists who continued to use the abacus inherited from the Romans. The first use of the word Algorithm is from Liebnitz in the late 1600 referring to a method of solving problems my means of sequence of procedures that loops and branches depending on what's coming up for them thereby optimizing their chances of having a productive experience.
.
History: The lighter side of it
2
So. What happened here ?????
Genetic algorithms
to finding a solution by letting the machine try different solutions in time until we get a good approximation to the best solution.
comprised by a set of elements and just recombining the elements will get us there.
The Simple book of GA’s
7
The Simple book of GA’s
F(x,y) = 21.5 + xSIN(4πx) + ySIN(20πy)
8
Source: Michalewicz Z. Genetic Algorithms Springer Verlag 1992
Source: Michalewicz Z. Genetic Algorithms Springer Verlag 1992 Docsity.com^10
…..
Chromosome Yields: c 0 = f(c 0 )/F(pop) , c 1 = f(c 1 )/F(pop), c (^) n = f(c (^) n)/F(pop)
5. Crossover swap bits between genes 6. Substitution (or addition) into the population (^) 14
The Evaluation Function
In the ranges of -rmin < ci < rmx y pmin < p (^) i < p (^) mx
Code the doefficients of the function as parts of a chromosome
Play the game and determine the best genes
Cross the genes and so on …..
Chromosome 1 : (01010100101010101010)
Chromosome 2 : (01110101101110100010)
..........
Chromosome 19 : (11101101101110101111)
Chromosome20 : (10010111101110100110)