Speciation (genetic algorithm)
An editor has nominated this article for deletion. You are welcome to participate in the deletion discussion, which will decide whether or not to retain it. |
Speciation is a process that occurs naturally in evolution and is modeled explicitly in some genetic algorithms. In nature, speciation occurs when two populations of similar reproducing beings evolve to become too dissimilar to share genetic information effectively or correctly. By analogy, 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 evaluating this function is too low, then interbreeding those solutions is disallowed or penalized. Some implementations forbid the application of the crossover operator between dissimilar individuals, while others apply selection pressure by modifying fitness values.[1][2][3]
- ^ Deb, Kalyanmoy; Spears, William M. (1997). "C6.2: Speciation methods". Handbook of Evolutionary Computation (PDF). Institute of Physics Publishing.
- ^ Hwang, Keum-Sung; Cho, Sung-Bae (May 2002). "Evolving diverse hardwares using speciated genetic algorithm". Proceedings of the 2002 Congress on Evolutionary Computation, 2002. CEC '02. 1: 437–442. doi:10.1109/CEC.2002.1006274.
- ^ Shir, Ofer M. (2012). "Niching in Evolutionary Algorithms". In Rozenberg, Grzegorz; Bäck, Thomas; Kok, Joost N. (eds.). Handbook of Natural Computing. Springer Berlin Heidelberg. pp. 1035–1069. doi:10.1007/978-3-540-92910-9_32. ISBN 9783540929093.