Advertisement

Optimizing for Change through Shades

  • Conor Ryan
  • J. J. Collins
  • Daniel Howard
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6935)

Abstract

The reliance of Evolutionary Algorithms on haploid genotypes has proved a difficult area for non-stationary function optimization. While it is generally accepted that various approaches involving diploidy can better cope with these kinds of problems, none of these paradigms have gained wide acceptance in the GA community. We describe Shades, 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 Knapsack non-stationary function optimization problems from the literature is described, and it is shown how Shades outperforms diploidy for this task.

Keywords

Polygenic Inheritance Diploidy Dynamic Environments 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Elseth, G., Baumgardner, K.: Principles of Modern Genetics. West Publishing Company, St. Paul (1995)Google Scholar
  2. 2.
    Goldberg, D., Smith, R.E.: Nonstationary function optimisation with dominance and diploidy. In: Procs. of ICGA2, pp. 59–68 (1987)Google Scholar
  3. 3.
    Ng, K., Wong, K.: A new diploid scheme and dominance change mechanism for non-stationary function optimisation. In: Proc. of ICGA-5 (1995)Google Scholar
  4. 4.
    Hollstein, R.B.: Artificial genetic adaptation in computer control systems. PhD Dissertation, University of Michigan (1971)Google Scholar
  5. 5.
    Hillis, D.: Coevolving parasites improves simulated evolution as an optmisation procedure. In: Proceedings of ALife II (1989)Google Scholar
  6. 6.
    Ridley, M.: The Red Queen: Sex and the Evolution of Human Nature. Viking, London (1993)Google Scholar
  7. 7.
    Ošmera, P., Kvasnička, V., Pospìchal, J.: Genetic algorithms with diploid chromosomes. In: Proc. of Mendel 1997, pp. 111–116 (1997)Google Scholar
  8. 8.
    Lewis, J., Hart, E., Ritchie, G.: A Comparison of Dominance Mechanisms and Simple Mutation on Non-stationary Problems. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 139–148. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  9. 9.
    Pai, A.: Foundations of Genetics: A Science for Society. McGraw-Hill, New York (1989)Google Scholar
  10. 10.
    Ryan, C.: The Degree of Oneness. In: Proceedings of the 2nd Workshop on Soft Computing (1996)Google Scholar
  11. 11.
    Ryan, C.: Reducing Premature Convergence in Evolutionary Algorithms. PhD Dissertation, University College Cork, Ireland (1996)Google Scholar
  12. 12.
    Ryan, C.: Shades: A Polygenic Inheritance Scheme. In: Proceedings of Mendel 1997, pp. 140–147 (1997)Google Scholar
  13. 13.
    Ryan, C., Collins, J.J.: Polygenic Inheritance - A Haploid Scheme that Can Outperform Diploidy. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 178–1331. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  14. 14.
    Ryan, C., Collins, J.J., Wallins, D.: Non-stationary function optimization using polygenic inheritance. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2724, pp. 178–187. Springer, Heidelberg (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Conor Ryan
    • 1
  • J. J. Collins
    • 1
  • Daniel Howard
    • 2
  1. 1.Department of Computer Science and Information Science (CSIS)University of LimerickIreland
  2. 2.Howard Science LimitedMalvernUnited Kingdom

Personalised recommendations