Abstract
Non-stationary function optimization has proved a difficult area for Genetic Algorithms. Standard haploid populations find it difficult 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Jürgen Branke, “Evolutionary Approaches to Dynamic Optimization”, In Evolutionary Algorithms for Dynamic Optimization Problems, 2001, pp. 27–30.
J.J. Collins and M. Eaton, “Genocodes for genetic algorithms”, In Procs. of Mendel’97, 1997, pp. 23–30.
G. Elseth and K. Baumgardner, Principles of Modern Genetics, West Publishing Company, 1995.
A. Ghosh, S. Tsutsui and H. Tanaka, “Function Optimization in Nonstationary Environment using Steady State Genetic Algorithms with Aging of Individuals”, In Proc. of the 1998 IEEE International Conference on Evolutionary Computation.
D. Goldberg and R.E. Smith, “Nonstationary function optimisation with dominance and diploidy”, In Procs. of ICGA2, 1987, pp. 59–68.
D. Hillis, “Coevolving parasites improves simulated evolution as an optmisation procedure”, In Proceedings of ALife II, 1989.
R.B. Hollstein, “Artificial genetic adaptation in computer control systems”, PhD Dissertation, University of Michigan, 1971.
J. Lewis, E. Hart, and G. Ritchie, “A Comparison of Dominance Mechanisms and Simple Mutation on Non-stationary Problems”, In Proc. of Parallel Problem Solving from Nature — PPSN V, 1998, pp. 139–148.
K.E. Mathias and L.D. Whitley, “Transforming the search space with gray coding”, In Proc. of IEEE Int. Conf. on Evolutionary Computing.
K. Ng and K. Wong, “A new diploid scheme and dominance change mechanism for non-stationary function optimisation”, In Proc. of ICGA-5, 1995.
P. Ošmera, V. Kvasnička and J. Pospìchal, “Genetic algorithms with diploid chromosomes”, In Proc. of Mendel’ 97, 1997, pp. 111–116.
A. Pai, Foundations of Genetics: A Science for Society. McGraw-Hill, 1989.
M. Ridley, The Red Queen: Sex and the Evolution of Human Nature, Viking London, 1993.
C. Ryan, “The Degree of Oneness”, In Proceedings of the 2nd Workshop on Soft Computing, 1996.
C. Ryan, “Reducing Premature Convergence in Evolutionary Algorithms”, PhD Dissertation, University College Cork, Ireland, 1996.
C. Ryan, “Shades: A Polygenic Inheritance Scheme”. In Proceedings of Mendel’ 97, 1997, pp. 140–147.
C. Ryan, and J.J. Collins. “Polygenic Inheritance–A Haploid Scheme that Can Outperform Diploidy”, In Proc. of Parallel Problem Solving from Nature — PPSN V, 1998, pp. 178–187.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ryan, C., Collins, J.J., Wallin, D. (2003). Non-stationary Function Optimization Using Polygenic Inheritance. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45110-2_7
Download citation
DOI: https://doi.org/10.1007/3-540-45110-2_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40603-7
Online ISBN: 978-3-540-45110-5
eBook Packages: Springer Book Archive