Non-stationary function optimization has proved a difficult area for Genetic Algorithms. Standard haploid populations find it dimcult to track a moving target, and tend to converge on a local optimum that appears early in a run. It is generally accepted that diploid GAs can cope with these problems because they have a genetic memory, that is, genes that may be required in the future are maintained in the current population. This paper describes a haploid GA that appears to have this property, through the use of Polygenic Inheritance. Polygenic inheritance differs from most implementations of GAs in that several genes contribute to each phenotypic trait. Two non-stationary function optimization problems from the literature are described, and a number of comparisons performed. We show that Polygenic inheritance enjoys all the advantages normally associated with diploid structures, with none of the usual costs, such as complex crossover mechanisms, huge mutation rates or ambiguity in the mapping process. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Ryan, C., Collins, J. J., & Wallin, D. (2003). Non-stationary function optimization using polygenic inheritance. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2724, 1320–1331. https://doi.org/10.1007/3-540-45110-2_7
Mendeley helps you to discover research relevant for your work.