Building-Block Supply in Genetic Programming

  • Kumara Sastry
  • Una-May O’Reilly
  • David E. Goldberg
  • David Hill
Part of the Genetic Programming Series book series (GPEM, volume 6)


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.

Key words

building blocks population size schemas partition building-block supply expression 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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
  2. 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
  3. 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
  4. 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
  5. Goldberg, D. E. (2002). The design of innovation: Lessons from and for competent genetic algorithms. Boston MA: Kluwer Academic Publishers.zbMATHGoogle Scholar
  6. 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
  7. 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
  8. Holland, J. (1975). Adaptation in natural and artificial systems. Ann Arbor, MI: University of Michigan Press.Google Scholar
  9. Koza, John (1992). Genetic Programming: On the Programming of Computers by Natural Selection. MIT Press, Cambridge, MA, USA.Google Scholar
  10. Langdon, W. B. and Poli, R. (2002). Foundations of Genetic Programming. Springer-Verlag.Google Scholar
  11. Luke, S. (2000b). Two fast tree-creation algorithms for genetic programming. IEEE Transactions on Evolutionary Computation 4(3): 274.CrossRefGoogle Scholar
  12. 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
  13. 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
  14. 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
  15. Reeves, C. (1993). Using genetic algorithms with small populations. Proceedings of the Fifth International Conference on Genetic Algorithms, pp. 92–99.Google Scholar
  16. 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
  17. Stephens, C. and Waelbroeck, H. (1999). Schemata evolution and building blocks. Evolutionary Computation 7(2): 109–124.CrossRefGoogle Scholar
  18. 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

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • Kumara Sastry
    • 1
  • Una-May O’Reilly
    • 2
  • David E. Goldberg
    • 1
  • David Hill
    • 3
  1. 1.Illinois Genetic Algorithms LaboratoryUniversity of Illinois at Urbana-ChampaignUSA
  2. 2.Computer Science and Artificial Intelligence LaboratoryMassachusetts Institute of TechnologyUSA
  3. 3.Department of Civil and Environmental EngineeringUniversity of Illinois at Urbana-ChampaignUSA

Personalised recommendations