Linkage equilibrium and genetic algorithms

Author

Chakraborty, Uday K. ; Mühlenbein, Heinz

Author_Institution

Dept. of Comput. Sci. & Eng., Jadavpur Univ., Calcutta, India

fYear

1997

fDate

13-16 Apr 1997

Firstpage

25

Lastpage

29

Abstract

The mathematical analysis of recombination/crossover in population genetics and genetic algorithms is very difficult. We investigate a result from H. Geiringer (1944), which states that by repeated applications of the recombination operator alone (with no selective pressure) the gene frequencies of diploid organisms converge to linkage equilibrium. The result is valid for any recombination/crossover scheme. It gives strong support to the conjecture that recombination is not able to explore nonlinear gene interactions. This fact explains the difficulties genetic algorithms have with optimization of fitness functions with nonlinear gene interactions

Keywords

convergence; genetic algorithms; genetics; search problems; diploid organisms; fitness functions; gene frequencies; genetic algorithms; linkage equilibrium; mathematical analysis; nonlinear gene interactions; population genetics; recombination operator; recombination/crossover; recombination/crossover scheme; Computer science; Couplings; Difference equations; Differential equations; Frequency; Genetic algorithms; Mathematical analysis; Nonlinear equations; Organisms;

fLanguage

English

Publisher

ieee

Conference_Titel

Evolutionary Computation, 1997., IEEE International Conference on

Conference_Location

Indianapolis, IN

Print_ISBN

0-7803-3949-5

Type

conf

DOI

10.1109/ICEC.1997.592262

Filename

592262