Skip to main content

Building-Block Supply in Genetic Programming

  • Chapter
Genetic Programming Theory and Practice

Part of the book series: Genetic Programming Series ((GPEM,volume 6))

Abstract

This paper analyzes building block supply in the initial population for genetic programming. Facetwise models for the supply of a single schema as well as for the supply of all schemas in a partition are developed. An estimate for the population size, given the size (or size distribution) of trees, that ensures the presence of all raw building blocks with a given error is derived using these facetwise models. The facetwise models and the population sizing estimate are verified with empirical results.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

  • Altenberg, L. (1994b). Emergent phenomena in genetic programming. In Evolutionary Programming III — Proceedings of the Third Annual Conference, pp. 233–241, San Diego, CA. World Scientific.

    Google Scholar 

  • Deb, K. and Goldberg, D. E. (1993). Analyzing deception in trap functions. In Foundations of Genetic Algorithms 2, D. Whitley (Ed. ), pp. 93–108. Morgan Kaufmann.

    Google Scholar 

  • Goldberg, D. E. (1987). Simple genetic algorithms and the minimal, deceptive problem. In Genetic algorithms and simulated annealing, Davis, L. (Ed. ), pp. 74–88. Los Altos, CA: Morgan Kaufmann.

    Google Scholar 

  • Goldberg, D. E. (1989b). Sizing populations for serial and parallel genetic algorithms. In Proceedings of the Third International Conference on Genetic Algorithms (ICGA), J. Schaffer (Ed. ), pp. 70–79. Morgan Kaufmann.

    Google Scholar 

  • Goldberg, D. E. (2002). The design of innovation: Lessons from and for competent genetic algorithms. Boston MA: Kluwer Academic Publishers.

    MATH  Google Scholar 

  • Goldberg, D. E. and O’Reilly, U. -M. (1998). Where does the good stuff go, and why? How contextual semantics influences program structure in simple genetic programming. In Proceedings of the First European Workshop on Genetic Programming (EuroGP ’98), W. Banzhaf et al. (Eds. ), pp. 16–36. Springer, Berlin.

    Google Scholar 

  • Goldberg, D. E., Sastry, K. and Latoza, T. (2001). On the supply of building blocks. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2001), pp. 336–342. Morgan Kaufmann.

    Google Scholar 

  • Holland, J. (1975). Adaptation in natural and artificial systems. Ann Arbor, MI: University of Michigan Press.

    Google Scholar 

  • Koza, John (1992). Genetic Programming: On the Programming of Computers by Natural Selection. MIT Press, Cambridge, MA, USA.

    Google Scholar 

  • Langdon, W. B. and Poli, R. (2002). Foundations of Genetic Programming. Springer-Verlag.

    Google Scholar 

  • Luke, S. (2000b). Two fast tree-creation algorithms for genetic programming. IEEE Transactions on Evolutionary Computation 4(3): 274.

    Article  Google Scholar 

  • O’Reilly, U. -M. and Goldberg, D. E. (1998). How fitness structure affects subsolution acquisition in genetic programming. In Genetic Programming 1998: Proceedings of the Third Annual Conference, W. Banzhaf et al. (Eds. ), pp. 269–277.

    Google Scholar 

  • O’Reilly, U. -M. and Oppacher, F. (1995). The troubling aspects of a building block hypothesis for genetic programming. In Foundations of Genetic Algorithms 3, D. Whitley (Ed. ), pp. 73–88. Morgan Kaufmann.

    Google Scholar 

  • Poli, R. (2000). Recursive conditional schema theorem, convergence and population sizing in genetic algorithms. In Foundations of Genetic Algorithms 6, W. Martin and W. Spears (Eds. ). Morgan Kaufmann.

    Google Scholar 

  • Reeves, C. (1993). Using genetic algorithms with small populations. Proceedings of the Fifth International Conference on Genetic Algorithms, pp. 92–99.

    Google Scholar 

  • Rosca, J. P. (1997b). Analysis of complexity drift in genetic programming. In Genetic Programming 1997: Proceedings of the Second Annual Conference, pp. 286–294.

    Google Scholar 

  • Stephens, C. and Waelbroeck, H. (1999). Schemata evolution and building blocks. Evolutionary Computation 7(2): 109–124.

    Article  Google Scholar 

  • Whigham, P. A. (1995). A schema theorem for context-free grammars. In Proceedings of the 1995 IEEE Conference on Evolutionary Computation 1, pp. 178–181.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer Science+Business Media New York

About this chapter

Cite this chapter

Sastry, K., O’Reilly, UM., Goldberg, D.E., Hill, D. (2003). Building-Block Supply in Genetic Programming. In: Riolo, R., Worzel, B. (eds) Genetic Programming Theory and Practice. Genetic Programming Series, vol 6. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-8983-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-4419-8983-3_9

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-4747-7

  • Online ISBN: 978-1-4419-8983-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics