Applications of Genetic Algorithms By Harry Beddo 3 rd Quarter

Basic Genetic Algorithm Create Initial Population Pairing Mating Mutation Checking

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

Pairing Simple pairing Random pairing Random weighted pairing Tournament style pairing

Mating Random selection point Crossover

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

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

Highest Elevation

“Mary Had a Little Lamb”

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

Cost Function Cost = EDCDEEEholdDDDholdEGGhold ANSWER

Results Find solution Limit search area