Speciation (genetic algorithm): Difference between revisions

Revision as of 03:15, 24 February 2012

Revision as of 16:19, 17 October 2015

Line 5:

In implementations of genetic search algorithms, the event of speciation is defined by some mathematical function that describes the similarity between two [[candidate solutions]] (usually described as individuals) in the population. If the result of the similarity is too low, the [[chromosomal crossover|crossover]] [[Operation (mathematics)|operator]] is disallowed between those individuals.

==See also==

{{DEFAULTSORT:Speciation (Genetic Algorithm)}}

[[Category:Evolutionary algorithms]]

[[Category:Genetic algorithms]]