Evolutionary computation is a family of global optimisation algorithms inspired by biological evolution. It originated conceptually with Alan Turing’s 1948 genetic search proposal. It emerged formally in the 1950s–1960s through independent developments: evolutionary programming (1962, USA), evolution strategies (1964, Germany), and genetic algorithms (1960s, USA). By the 1990s, the unifying term 'evolutionary computation' was coined, and genetic programming emerged as a fourth major branch. The approach is used both for engineering optimization and as an in silico tool in evolutionary biology.
philosophers of biology looking for ontological grounding
The written brief1 min read
What the work claims
Evolutionary computation is a family of global optimization algorithms inspired by biological evolution. It uses mutation, crossover, and selection—modelled on natural processes—to iteratively improve candidate solutions against a defined fitness function.
How it was done
Evolutionary computation starts with a population of candidate solutions. Each generation updates the population by stochastically removing less desired solutions. It introduces small random changes. Where applicable, it mixes parental information. Genetic operators—mutation, crossover, and selection—are modelled on biological functions.
What holds up
The algorithms produce highly optimized solutions across diverse problem settings. The population evolves to increase in fitness according to the chosen fitness function. The method relies on stochastic removal, random change, and (where used) recombination—all grounded in explicit, repeatable procedures.
What does not
It does not simulate evolution in full biological fidelity. It does not establish mechanisms of natural selection in nature. It does not prove claims about real-world evolutionary history. It does not replace empirical biology—it models abstractions of it.
Why it matters beyond the lab
It serves as an in silico experimental procedure in evolutionary biology. It lets researchers test general aspects of evolutionary processes without biological constraints. It bridges computer science and theoretical biology—but only where fitness functions are precisely defined and problems are abstracted.
Is it worth your time
Yes. It delivers highly optimized solutions across diverse problem settings. It is used in engineering optimization and as an in silico tool in evolutionary biology. Its conceptual roots go back to Turing’s 1948 genetic search proposal. The field coalesced in the 1950s–1960s.
