Jump to content

Chromosome (evolutionary algorithm)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Chopchopwhitey (talk | contribs) at 23:53, 26 March 2004 (created disambig. article for genetic algorithms). 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)

In genetic algorithms, the term chromosome is used to describe any one of the possible solutions to the task that the particular genetic algorithm has been designed to solve. A GAs chromosomes represent a population of solutions to the problem. The terms are used in analogy to biological chromosomes.

Chromosomes are represented as a list of parameters; most commonly this is a string of 0s and 1s, though other representations are also used. The set of chromosomes is operated upon using the genetic operators to refine the population from one generation to the next.

See also