title: Genetic algorithms and evolution.
abstract: The genetic algorithm (GA) as developed by Holland (1975, Adaptation in Natural and Artificial Systems. Ann Arbor: University of Michigan Press) is an optimization technique based on natural selection. We use a modified version of this technique to investigate which aspects of natural selection make it an efficient search procedure. Our main modification to Holland's GA is the subdividing of the population into semi-isolated demes. We consider two examples. One is a fitness landscape with many local optima. The other is a model of singing in birds that has been previously analysed using dynamic programming. Both examples have epistatic interactions. In the first example we show that the GA can find the global optimum and that its success is improved by subdividing the population. In the second example we show that GAs can evolve to the optimal policy found by dynamic programming.
authors.affiliation: Department of Zoology, Oxford University, U.K.
authors.forename: B H
authors.initials: BH
authors.lastname: Sumida
authors.forename: A I
authors.initials: AI
authors.lastname: Houston
authors.forename: J M
authors.initials: JM
authors.lastname: McNamara
authors.forename: W D
authors.initials: WD
authors.lastname: Hamilton
mesh_terms: D000465:Algorithms; D000818:Animals; D005075:Biological Evolution; D004843:Epistasis, Genetic; D008957:Models, Genetic; D012641:Selection, Genetic