1. Applications of Genetic Algorithms By Harry Beddo 3 rd Quarter

2. Basic Genetic Algorithm Create Initial Population Pairing Mating Mutation Checking

3. Initial Population Chromosome made up of 1’s and 0’s Large initial population

4. Pairing Simple pairing Random pairing Random weighted pairing Tournament style pairing

5. Mating Random selection point Crossover 010100110110101010001001 010101000010100101010101010100101010 101010101000010100111101 101010101011010111010101011010110110 010100110110101010001001 101010101011010111010101011010110110 101010101000010100111101 010101000010100101010101010100101010

6. Mutations Change a 1 to a 0 and visa versa Only 5%

7. Checking Reached iteration limit Convergence Stops or goes back to pairing step

8. Highest Elevation

12. “Mary Had a Little Lamb”

13. Note Conversion CodeNote 000Hold 001A 010B 011C 100D 101E 110F 111G

14. Cost Function Cost = EDCDEEEholdDDDholdEGGhold 101 100 011 100 101 101 101 000 100 100 100 000 101 111 111 000 ANSWER

15. Results Find solution Limit search area