1. Genetic Search Algorithms Matt Herbster

2. Why Another Search?  Designed in the 1950s, heavily implemented under John Holland (1970s)  Genetic search is intended to simulate natural systems  Works best on continuous and discrete combinatorial problems  It will only take eight minutes of your time

3. Definitions  Chromosome  Gene  Allele  Locus  Genotype  Phenotype  String  Feature, character  Feature value  String position  Structure  Parameter set

4. Characteristics  Reproduction  Crossover  Mutation  Rarely used

5. Mutation Operations Generative Swap Node Swap Sequence Destructive

6. Crossover Operations Single pointOrder based

7. Other Representations  Array, matrix  Tree  String of bits  Any other data structure

8. Implementation 1.Start with an initial gene pool 2.Generate successors (either randomly or deterministically) to create the first generation pool 3.Each node is evaluated by a fitness function and sorted accordingly 4.Create new generations with the better most likely to reproduce

9. What is the meaning of the word better?  As determined by fitness function (essentially a heuristic)  Nodes with desired genes are predetermined  Can often approach local maxima rather than the global optimal solution  Assisted by random-restart hill climbing

10. Variations  Genetic algorithms produce optimal results for many problems, eventually …  Speciation – Two nodes will reproduce only if closely related  Technique helps improve speed  Parallel populations – simulates physical separation with possible migration

11. Applications  Traveling salesman problem  Drilling of printed circuit boards  Planning bus routes  Scheduling  Computer games – represent an evolution of players’ strategies  Stock market trading – data fitting, trend spotting, budgeting

12. Questions