Skip to main content
SpringerLink
Log in

Dynamic Trait Expression for Multiploid Individuals of Evolutionary Algorithms

  • Conference paper
  • First Online:
Engineering of Intelligent Systems (IEA/AIE 2001)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2070))

Abstract

The use of multiploid structures for individuals in evolutionary algorithms has been shown to have the advantage of including redundant information, increasing population diversity and in some cases improving non- stationary function optimisation performance. These advantages can translate into improved avoidance of premature convergence and an ability to cope with complex problems. However, as multiple information for the same trait is available, a method of gene selection or activation is required. This paper describes a dynamic decision method for gene selection, presents proof of concept results for this type of structure and outlines proposed benefits and applications.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baker, J. E. 1985. Adaptive selection methods for genetic algorithms. Proceedings of First International Conference on Genetic Algorithms and their Applications, editor J. J. Grefenstette, 101–11, Bittsburgh: Carnegie-Mellon University.

    Google Scholar 

  2. Calabretta, R., R. Galbiati, S. Nolfi, and D. Parisi. 1996. Haploid and Diploid Genotypes for Neural Networks, Technical Report NSAL-96005. Institute of Psychology, C.N.R., Rome.

    Google Scholar 

  3. Cohoon, J P, Hegde S U, Martin W N, and Richards D S. 1991. Distributed genetic algorithms for the floorplan design problem. IEEE Transactions Computer-Aided Design, CAD-10: 483–92.

    Google Scholar 

  4. Corne, David, Emma Collingwood, and Peter Ross. 1996. Investigating Multiploidy’s Niche. In Proceedings of AISB Workshop on Evolutionary Computation.

    Google Scholar 

  5. Dasgupta, Dipankar, and Douglas R. McGregor. 1992. Designing Application-Specific Neural Networks using the Structured Genetic Algorithm. In Proceedings of COGANN-92 (International Workshop on Combinations of genetic Algorithms and Neural Networks), Editors L. D. Whitley, and J. D. Schaffer, 87–96, IEEE Computer Society Press.

    Google Scholar 

  6. Davidor, Yuval. 1994. Free the Spirit of Evolutionary Computing: The Ecological Genetic Algorithm Paradigm. Computing With Biological Metaphors. Editor Ray Paton, 311–22. London, UK: Chapman and Hall.

    Google Scholar 

  7. Davis, Lawrence, ed. 1991. Handbook of Genetic Algorithms. first ed. New York: Von Nostrand Reinhold.

    Google Scholar 

  8. DeJong, K. A. 1975. “Analysis of the behavior of a class of genetic adaptive systems.” PhD thesis, University of Michigan.

    Google Scholar 

  9. Eldredge, N, and S J Gould. 1972. Punctuated Equlibria: an alternative to phyletic gradualism. In Models of Palaeobiology, editor T J M Schopf, 82–115, San Francisco, CA: Freeman, Cooper.

    Google Scholar 

  10. Eshelman, L. J., and J. D. Schaffer. 1991. Preventing premature convergence in genetic algorithms by preventing incest. Proceedings of the Fourth International Conference on Genetic Algorithms, 115–22, Morgan Kaufmann.

    Google Scholar 

  11. Fonteix, C., F. Bicking, E. Perrin, and I. Marc. 1995. Haploid and Diploid Algorithms, a New Approach for Global Optimization: Compared Performances. Int. J. of Systems Science 26, no. 10: 1919–33.

    Article  MATH  Google Scholar 

  12. Goldberg, D. E., B. Korb, and K. Deb. 1990. Messy genetic algorithms: Motivation, analysis and first results. Complex Systems 3: 493–530.

    MathSciNet  Google Scholar 

  13. Goldberg, David E. 1989. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley.

    Google Scholar 

  14. Goldberg, David E., and R. E. Smith. 1987. Nonstationary function optimization using genetic algorithms with dominance and diploidy. In Proceedings of the Second International Conference on Genetic Algorithms and their Applications, editor J. J. Grefenstette, 59–68, Morgan Kaufmann.

    Google Scholar 

  15. Greene, F. 1996. A new approach to diploid/dominance and its effects on stationary genetic search. In Proceedings of the Fifth Annual Conference on Evolutionary Programming, (Ed.) D. Fogel MIT Press.

    Google Scholar 

  16. Grosso, P. 1985. “Computer Simulation of Genetic Adaptation: Parallel Subcomponent Interation in a Multilocus Model.” PhD thesis, University of Michigan.

    Google Scholar 

  17. Jacob, F., and J. Monod. 1961. Genetic Regulatory Mechanism in the Synthesis of Proteins. Journal of Molecular Biology 3, no. 3: 318–56.

    Article  Google Scholar 

  18. Juillé, Hugues, and Jordan B. Pollack. 1996. Co-evolving Intertwined Spirals. In Proceedings of the Fifth Annual Conference on Evolutionary Programming, 461–68 MIT Press.

    Google Scholar 

  19. Kauffman, S. 1971. Gene regulatory networks: A theory for their global structure and behavior. Current Topics in Developmental Biology 6: 145–54.

    Article  Google Scholar 

  20. —. 1986. Boolean systems, adaptive automata, evolution. in Disordered Systems and Biological Organization. eds E. Beinenstock, F. Fogelman-Soulie, and G. Weisbuch, New York: Springer.

    Google Scholar 

  21. Koza, J. 1992. Genetic Programming. Cambridge, MA: MIT Press.

    MATH  Google Scholar 

  22. Lewis, Jonathan, Emma Hart, and Graeme Ritchie. 1998. A comparison of Dominance Mechanisms and Simple Mutation on Non-Stationary Problems. In Parallel Problem Solving from Nature-PPSN V, Ed. Agoston E. Eiben, Thomas Bäck, Marc Schoenauer, and Hans-Paul Schwefel, 139–48.

    Google Scholar 

  23. Mauldin, M. L. 1984. Maintaining diversity in genetic search. In Proceedings of the National Conference on Artificial Intelligence, 247–50.

    Google Scholar 

  24. Ng, Khim Peow, and Kok Cheong Wong. 1995. A new diploid scheme and dominance change mechanism for non-stationary function optimisation. In Proceedings of the Sixth International Conference on Genetic Algorithms.

    Google Scholar 

  25. Schnier, T., and J. S. Gero. 1997. Dominant and Recessive genes in evolutionary systems applied to spatial reasoning. in Advanced Topics in Artificial Intelligence. Sattar A. (ed.), 127–36. Heidelberg: Springer.

    Chapter  Google Scholar 

  26. Viennet, R., C. Fonteix, and Marc I. 1995. New Multicriteria Optimization Method based on the Use of a Diploid Genetic Algorithm: Example of an Industrial Problem. Lecture Notes on Computer Science. Artificial Evolution: European Conference, AE 95, 120–127, Springer-Verlag Ed.

    Google Scholar 

  27. Wolpert, D. H., and W. G. Macready. 1995. No Free Lunch Theorems for Search. Technical Report SFI-TR-95-02-010 Santa Fe Institute.

    Google Scholar 

  28. Wright, S. 1964. Stochastic processes in evolution. ed J Gurland, 199–241, Madison, WI: University of Wisconsin Press.

    Google Scholar 

  29. Yoshida, Yukiko, and Nobue Adachi. 1994. A diploid genetic algorithm for preserving population diversity-pseudo-meiosis GA. In the Third Conference on Parallel Problem Solving from Nature —PPSN III, editors Yuval Davidor, Hans-Paul Schwefel, and Reinhard Manner, 36–45, Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Intelligent Systems and Complex Processes, School of Biophysical Science and Electrical Engineering Swinburne University of Technology, Victoria, 3122, Australia

    Clinton Woodward & Tim Hendtlass

Authors
  1. Clinton Woodward
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tim Hendtlass
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Hungarian Academy of Sciences, Intelligent Manufacturing and Business Processes Computer and Automation Research Institute, Kende utca 13-17, 1111, Budapest, Hungary

    László Monostori  & József Váncza  & 

  2. Department of Computer Science 601 University Drive, Southwest Texas State University, San Marcos, TX, 78666-4616, USA

    Moonis Ali

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Woodward, C., Hendtlass, T. (2001). Dynamic Trait Expression for Multiploid Individuals of Evolutionary Algorithms. In: Monostori, L., Váncza, J., Ali, M. (eds) Engineering of Intelligent Systems. IEA/AIE 2001. Lecture Notes in Computer Science(), vol 2070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45517-5_42

Download citation

  • DOI: https://doi.org/10.1007/3-540-45517-5_42

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42219-8

  • Online ISBN: 978-3-540-45517-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation