@inproceedings{cf1dd992bef847d6b1075353395c524c,
title = "Polygenic inheritance - A haploid scheme that can outperform diploidy",
abstract = "Nonstationary function optimisation has proved a difficult area for Genetic Algorithms. Standard haploid populations find it difficult to track a moving target and tend to converge to a local optimum that appears early in a run. While it is generally accepted that various approaches involving diploidy can cope better with these kinds of problems, none of these have gained wide acceptance in the GA community. We survey a number of diploid GAs and outline some possible reasons why they have failed to gain wide acceptance, before describing a new haploid system which uses Polygenic Inheritance. Polygenic inheritance differs from most implementations of GAs in that several genes contribute to each phenotypic trait. A nonstationary function optmisation problem from the literature is described, and it is shown how various represenation scheme affect the performance of GAs on this problem.",
author = "Conor Ryan and Collins, {J. J.}",
year = "1998",
doi = "10.1007/bfb0056861",
language = "English",
isbn = "3540650784",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "178--187",
booktitle = "Parallel Problem Solving from Nature, PPSN 1998 - 5th International Conference, Proceedings",
note = "5th International Conference on Parallel Problem Solving from Nature, PPSN 1998 ; Conference date: 27-09-1998 Through 30-09-1998",
}