Jump to content

Genetic algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 136.186.1.117 (talk) at 15:51, 25 February 2002 (stub - must finish later ... :)). 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)

A general description for a class of algorithms used to find approximate solutions to difficult-to-solve problems, inspired by and named after biological processes of mutation, natural selection, and the genetic crossover that occurs when parents mate to produce offspring.