Genetic and Evolutionary Algorithms and Programming Michael Orlov, Moshe Sipper and Ami Hauptman Department of Computer Science, Ben-Gurion University PO Box 653, Beer-Sheva 84105, Israel {orlovm,sipper,amiha}@cs.bgu.ac.il July 2, 2007 Article Outline Glossary I. Definition of the Subject and its Importance II. Introduction III. Evolutionary Algorithms IV. A Touch of Theory V. Extensions of the Basic Methodology VI. Lethal Applications VII. Evolutionary Games VIII. The Future IX. Bibliography Glossary Evolutionary algorithms / Evolutionary computation A family of algorithms inspired by the workings of evolution by natural selection whose basic structure is: 1. produce an initial population of individuals, these latter being candidate solu- tions to the problem at hand 2. evaluate the fitness of each individual in accordance with the problem whose solution is sought 3. while termination condition not met do (a) select fitter individuals for reproduction (b) recombine (crossover) individuals (c) mutate individuals (d) evaluate fitness of modified individuals 4. end while 1