Skip to main content
SpringerLink
Log in

Schema Disruption in Chromosomes That Are Structured as Binary Trees

  • Conference paper
Genetic and Evolutionary Computation – GECCO 2004 (GECCO 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3102))

Included in the following conference series:

Abstract

We are interested in schema disruption behavior when chromosomes are structured as binary trees. We give the definition of the disruption probability dp(H) of a schema H, and also the relative diameter relΔ(H) of H. We show that in the general case that dp(H) can far exceed relΔ(H), but when the chromosome is a complete binary tree then the inequality dp(H) ≤ relΔ(H) holds almost always. Thus the more compactly the tree chromosome is structured, the better is the behavior to be expected from geneticism.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Holland, J.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  2. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Publishing, Reading (1989)

    MATH  Google Scholar 

  3. Greene, W.A.: A Non-Linear Schema Theorem for Genetic Algorithms. In: Whitley, D. (ed.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2000), pp. 189–194. Morgan Kaufmann Publishers, San Francisco (2000)

    Google Scholar 

  4. Koza, John, R. (eds.): Genetic Programming: On the Programming of Computers by Natural Selection. MIT Press, Cambridge (1992)

    MATH  Google Scholar 

  5. Una-May, O.: An Analysis of Genetic Programming. PhD thesis, Carleton University, Ottawa-Carleton Institute for Computer Science, Ottawa, Ontario, Canada, September 22 (1995)

    Google Scholar 

  6. Una-May, O., Oppacher, F.: The Troubling Aspects of a Building Block Hypothesis for Genetic Programming. In: Whitley, D., Vose, M.D. (eds.) Foundations of Genetic Algorithms 3, Morgan Kaufmann Publishers, San Francisco (1995)

    Google Scholar 

  7. Whigham, Peter, A.: A Schema Theorem for Context-Free Grammars’. In: 1995 IEEE Conference on Evolutionary Computation, vol. 1, pp. 178–181. IEEE Computer Society Press, Los Alamitos (1995)

    Chapter  Google Scholar 

  8. Rosca, Justinian, P.: Analysis of Complexity Drift in Genetic Programming. In: Koza, John, R., et al. (eds.) Genetic Programming 1997: Proceedings of the Second Annual Conference, pp. 286–294. Morgan Kaufmann Publishers, San Francisco (1997)

    Google Scholar 

  9. Riccardo, P., Langdon, W.: Schema Theory for Genetic Programming with One-Point Crossover and Point Mutation. In: Evolutionary Computation, vol. 6(3), pp. 231–252. MIT Press, Cambridge (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of New Orleans, New Orleans, LA, 70148, USA

    William A. Greene

Authors
  1. William A. Greene
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Indian Institute of Technology Kanpur, Department of Mechanical Engineering, Kanpur Genetic Algorithms Laboratory (KanGAL), 208016, Kanpur, Uttar Pradesh, India

    Kalyanmoy Deb

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Greene, W.A. (2004). Schema Disruption in Chromosomes That Are Structured as Binary Trees. In: Deb, K. (eds) Genetic and Evolutionary Computation – GECCO 2004. GECCO 2004. Lecture Notes in Computer Science, vol 3102. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24854-5_116

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24854-5_116

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22344-3

  • Online ISBN: 978-3-540-24854-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation