Jump to content

Genetic Algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 199.43.13.1 (talk) at 14:53, 9 December 2003. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Definition
A genetic algorithm is a computer simulation in which a population of abstract representations of candidate solutions to an optimization problem are stochastically selected, recombined, mutated, and then either eliminated or retained, based on their relative fitnesses.


Anna Hondroudakis, Joel Malard, Gregory V. Wilson, An Introduction to Genetic Algorithms Using RPL2, 1995 Revised May 1996: http://www.epcc.ed.ac.uk/computing/training/document_archive/GAs-course/main.html