Evolutionary computation

Part of a series on
Evolutionary biology
Darwin's finches by John Gould
Index Introduction Main Outline Glossary Evidence History
Processes and outcomes Population genetics Variation Diversity Mutation Natural selection Adaptation Polymorphism Genetic drift Gene flow Speciation Adaptive radiation Co-operation Coevolution Coextinction Contingency Divergence Convergence Parallel evolution Extinction
Natural history Origin of life Common descent History of life Timeline of evolution Human evolution Recent human evolution Phylogeny Biodiversity Biogeography Classification Evolutionary taxonomy Cladistics Transitional fossil Extinction event
History of evolutionary theory Overview Renaissance Before Darwin Darwin Origin of Species Before synthesis Modern synthesis Molecular evolution Evo-devo Current research History of speciation History of paleontology (timeline)
Fields and applications Applications of evolution Biosocial criminology Ecological genetics Evolutionary aesthetics Evolutionary anthropology Evolutionary computation Evolutionary ecology Evolutionary economics Evolutionary epistemology Evolutionary ethics Evolutionary game theory Evolutionary linguistics Evolutionary medicine Evolutionary neuroscience Evolutionary physiology Evolutionary psychology Experimental evolution Phylogenetics Paleontology Selective breeding Speciation experiments Sociobiology Island biogeography Systematics Universal Darwinism
Social implications Eugenics Evolution as fact and theory Dysgenics Social effects Creation–evolution controversy Theistic evolution Objections to evolution Level of support Nature-nurture controversy
Evolutionary biology portal  Category
v t e

In computer science, evolutionary computation is a family of algorithms for global optimization inspired by biological evolution, and the subfield of artificial intelligence and soft computing studying these algorithms. In technical terms, they are a family of population-based trial and error problem solvers with a metaheuristic or stochastic optimization character.

In evolutionary computation, an initial set of candidate solutions is generated and iteratively updated. Each new generation is produced by stochastically removing less desired solutions, and introducing small random changes as well as, depending on the method, mixing parental information. In biological terminology, a population of solutions is subjected to natural selection (or artificial selection), mutation and possibly recombination. As a result, the population will gradually evolve to increase in fitness, in this case the chosen fitness function of the algorithm.

Evolutionary computation techniques can produce highly optimized solutions in a wide range of problem settings, making them popular in computer science. Many variants and extensions exist, suited to more specific families of problems and data structures. Evolutionary computation is also sometimes used in evolutionary biology as an in silico experimental procedure to study common aspects of general evolutionary processes.