Skip to main content
SpringerLink
Log in
Book cover

Genetic Programming Theory and Practice II pp 67–86Cite as

Considering the Roles of Structure in Problem Solving by Computer

Cause and Emergence in Genetic Programming

  • Chapter

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

Abstract

This chapter presents a tiered view of the roles of structure in genetic programming. This view can be used to frame theory on how some problems are more difficult than others for genetic programming to solve. This chapter subsequently summarizes my group’s current theoretical work at the University of Michigan and extends the implications of that work to real-world problem solving.

This is a preview of subscription content, 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   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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Angeline, P. (1994). Genetic Programming and Emergent Intelligence. In J. Kinnear, K.E. (Ed.), Advances in Genetic Programming, 75–97. Cambridge: The MIT Press.

    Google Scholar 

  • Angeline, P. J. (1997). Parse Trees. In T. Back, D. B. Fogel and Z. Michalewicz (Eds.), Handbook of Evolutionary Computation, C1.6:l–C1.6:3. Bristol: Institute of Physics Publishing.

    Google Scholar 

  • Banzhaf, W. and W. B. Langdon (2002). Some Considerations on the Reason for Bloat. Genetic Programming and Evolvable Machines, 3(1), 81–91.

    Article  Google Scholar 

  • Banzhaf, W., P. Nordin, et al. (1998). Genetic Programming: An Introduction: On the Automatic Evolution of Computer Programs and Its Applications. San Francisco: Morgan Kaufmann Publishers.

    Google Scholar 

  • Blickle, T. (1997). Tournament Selection. In T. Back, D. B. Fogel and Z. Michalewicz (Eds.), Handbook of Evolutionary Computation, C2.3:l–C2.3:4. Bristol: Institute of Physics Publishing.

    Google Scholar 

  • Blickle, T. and L. Thiele (1995). A Mathematical Analysis of Tournament Selection. In L. J. Eshelman (Ed.), ICGA95: Proceedings of the Sixth International Conference on Genetic Algorithms, 9–16. San Francisco: Morgan Kaufmann Publishers.

    Google Scholar 

  • Burke, E., S. Gustafson, et al. (2002a). A Survey and Analysis of Diversity Measures in Genetic Programming. In W. B. Langdon, E. Cantu-Paz, K. Mathias, et al. (Eds.), GECCO-2002: Proceedings of the Genetic and Evolutionary Computation Conference, 716–723. San Francisco: Morgan Kaufmann Publishers.

    Google Scholar 

  • Burke, E., S. Gustafson, et al. (2004). Diversity in Genetic Programming: An Analysis of Measure and Correlation with Fitness. IEEE Transactions on Evolutionary Computation, 8(l), 47–62.

    Article  Google Scholar 

  • Burke, E., S. Gustafson, et al. (2002b). Advanced Population Diversity Measures in Genetic Programming. In J. J. Merelo Guervos, P. Adamidis, H.-G. Beyer, J.-L. Fernández-Villacañas and H.-P. Schwefel (Eds.), Parallel Problem Solving from Nature-PPSN VII: Proceedings, 341–350. Berlin: Springer-Verlag.

    Google Scholar 

  • Clergue, M., P. Collard, et al. (2002). Fitness Distance Correlation and Problem Difficulty for Genetic Programming. In W. B. Langdon, E. Cantu-Paz, K. Mathias, et al. (Eds.), GECCO-2002: Proceedings of the Genetic and Evolutionary Computation Conference, 724–732. San Francisco: Morgan Kaufmann Publishers.

    Google Scholar 

  • Daida, J. M. (2002). Limits to Expression in Genetic Programming: Lattice-Aggregate Modeling. The 2002 IEEE World Congress on Computational Intelligence: Proceedings of the 2002 Congress on Evolutionary Computation, 273–278. Piscataway: IEEE.

    Google Scholar 

  • Daida, J. M. (2003). What Makes a Problem GP-Hard? A Look at How Structure Affects Content. In R. L. Riolo and W. Worzel (Eds.), Theory and Applications in Genetic Programming, 99–118. Dordrecht: Kluwer Academic Publishers.

    Google Scholar 

  • Daida, J. M., R. B. Bertram, et al. (1999). Analysis of Single-Node (Building) Blocks in Genetic Programming. In L. Spector, W. B. Langdon, U.-M. O’Reilly and P. J. Angeline (Eds.), Advances in Genetic Programming 3, 217–241. Cambridge: The MIT Press.

    Google Scholar 

  • Daida, J. M. and A. M. Hilss (2003). Identifying Structural Mechanisms in Standard Genetic Programming. In E. Cantú-Paz, J. A. Foster, K. Deb, et al. (Eds.), Genetic and Evolutionary Computation-GECCO 2003, 1639–1651. Berlin: Springer-Verlag.

    Google Scholar 

  • Daida, J. M., A. M. Hilss, et al. (2003). Visualizing Tree Structures in Genetic Programming. In E. Cantú-Paz, J. A. Foster, K. Deb, et al. (Eds.), Genetic and Evolutionary Computation-GECCO 2003, 1652–1664. Berlin: Springer-Verlag.

    Google Scholar 

  • Daida, J. M., H. Li, et al. (2003). What Makes a Problem GP-Hard? Validating a Hypothesis of Structural Causes. In E. Cantú-Paz, J. A. Foster, K. Deb, et al. (Eds.), Genetic and Evolutionary Computation-GECCO 2003, 1665–1677. Berlin: Springer-Verlag.

    Google Scholar 

  • Daida, J. M., J. A. Polito 2, et al. (1999). What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming. In W. Banzhaf, J. M. Daida, A. E. Eiben, et al. (Eds.), GECCO’ 99: Proceeding of the Genetic and Evolutionary Computation Conference, 982–989. San Francisco: Morgan Kaufmann Publishers.

    Google Scholar 

  • Daida, J. M., J. A. Polito 2, et al. (2001). What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming. Genetic Programming and Evolvable Machines, 2(2), 165–191.

    Article  Google Scholar 

  • Daida, J. M., M. E. Samples, et al. (2004). Demonstrating Constraints to Diversity with a Tunably Difficult Problem for Genetic Programming. Proceedings of CEC 2004. Piscataway: IEEE Press.

    Google Scholar 

  • Daida, J. M., D. J. Ward, et al. (2004). Visualizing the Loss of Diversity in Genetic Programming. Proceedings of CEC 2004. Piscataway: IEEE Press.

    Google Scholar 

  • Galar, R. (1985). Handicapped Individua in Evolutionary Processes. Biological Cybernetics, 53, 1–9.

    Article  MATH  Google Scholar 

  • Goldberg, D. E. and U.-M. O’Reilly (1998). Where Does the Good Stuff Go, and Why? In W. Banzhaf, R. Poli, M. Schoenauer and T. C. Fogarty (Eds.), Proceedings of the First European Conference on Genetic Programming, 16–36. Berlin: Springer-Verlag.

    Google Scholar 

  • Hall, J. M. and T. Soule (2004). Does Genetic Programming Inherently Adopt Structured Design Techniques? In U.-M. O’Reilly, T. Yu, R. L. Riolo and W. Worzel (Eds.), Genetic Programming Theory and Practice II. Boston: Kluwer Academic Publishers.

    Google Scholar 

  • Kaye, B. H. (1989). A Random Walk Through Fractal Dimensions. Weinheim: VCH Verlagsgesellschaft.

    Google Scholar 

  • Knuth, D. E. (1997). The Art of Computer Programming: Volume 1: Fundamental Algorithms. Reading: Addison-Wesley.

    Google Scholar 

  • Koza, J. R. (1994). Genetic Programming II: Automatic Discovery of Reusable Programs. Cambridge: The MIT Press.

    Google Scholar 

  • Koza, J. R. (1995). Two Ways of Discovering the Size and Shape of a Computer Program to Solve a Problem. In L. J. Eshelman (Ed.), ICGA95: Proceedings of the Sixth International Conference on Genetic Algorithms, 287–294. San Francisco: Morgan Kaufmann Publishers.

    Google Scholar 

  • Koza, J. R., F. H. Bennett III, et al. (1999). Genetic Programming 111: Darwinian Invention and Problem Solving. San Francisco: Morgan Kaufmann Publishers.

    Google Scholar 

  • Koza, J. R., M. A. Keane, et al. (2003). Genetic Programming IV: Routine Human-Competitive Machine Intelligence. Norwell: Kluwer Academic Publishers.

    Google Scholar 

  • Koza, J. R., M. A. Keane, et al. (2000). Automatic Creation of Human-Competitive Programs and Controllers by Means of Genetic Programming. Genetic Programming and Evolvable Machines, 1(1/2), 121–164.

    Article  Google Scholar 

  • Langdon, W. B. and R. Poli (1997). Fitness Causes Bloat. In P. K. Chawdhry, R. Roy and R. K. Pant (Eds.), Soft Computing in Engineering Design and Manufacturing, 23–27. London: Springer-Verlag.

    Google Scholar 

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

    Google Scholar 

  • Luke, S. (2003). Modification Point Depth and Genome Growth in Genetic Programming. Evolutionary Computation, 11(1), 67-106.

    Google Scholar 

  • MacArthur, R. H. and E. O. Wilson (1967). The Theory of Island Biogeography. Princeton: Princeton University Press.

    Google Scholar 

  • McPhee, N. F. and N. J. Hopper (1999). Analysis of Genetic Diversity through Population History. In W. Banzhaf, J. M. Daida, A. E. Eiben, et al. (Eds.), GECCO’ 99: Proceeding of the Genetic and Evolutionary Computation Conference, 1112–1120. San Francisco: Morgan Kaufmann Publishers.

    Google Scholar 

  • Motoki, T. (2002). Calculating the Expected Loss of Diversity of Selection Schemes. Evolutionary Computation, 10(4), 397–422.

    Article  Google Scholar 

  • O’Reilly, U.-M. and D. E. Goldberg (1998). How Fitness Structure Affects Subsolution Acquisition in Genetic Programming. In J. R. Koza, W. Banzhaf, K. Chellapilla, et al. (Eds.), Genetic Programming 1998: Proceedings of the Third Annual Conference, 269–277. San Francisco: Morgan Kaufmann Publishers.

    Google Scholar 

  • Pincus, M. (1970). An Evolutionary Strategy. Journal of Theoretical Biology, 28, 483–488.

    Article  Google Scholar 

  • Poli, R. (2000). Exact Schema Theorem and Effective Fitness for GP with One-Point Crossover. In L. D. Whitley, D. E. Goldberg, E. Canhi-Paz, et al. (Eds.), GECCO 2000: Proceedings of the Genetic and Evolutionary Computation Conference, 469–476. San Francisco: Morgan Kaufmann Publishers.

    Google Scholar 

  • Poli, R. (2001). Exact Schema Theory for Genetic Programming and Variable-Length Genetic Algorithms with One-Point Crossover. Genetic Programming and Evolvable Machines, 2(2), 123–163.

    Article  MATH  MathSciNet  Google Scholar 

  • Punch, W., D. Zongker, et al. (1996). The Royal Tree Problem, A Benchmark for Single and Multiple Population Genetic Programming. In P. J. Angeline and J. K.E. Kinnear (Eds.), Advances in Genetic Programming, 299–316. Cambridge: The MIT Press.

    Google Scholar 

  • Rosca, J. P. (1995). Genetic Programming Exploratory Power and the Discovery of Functions. In J. R. McDonnell, R. G. Reynolds and D. B. Fogel (Eds.), Evolutionary Programming IV: Proceedings of the Fourth Annual Conference on Evolutionary Programming, 719–736. Cambridge: The MIT Press.

    Google Scholar 

  • Rosca, J. P. (1997). Analysis of Complexity Drift in Genetic Programming. In J. R. Koza, K. Deb, M. Dorigo, et al. (Eds.), Genetic Programming 1997: Proceedings of the Second Annual Conference, 286–94. San Francisco: Morgan Kaufmann Publishers.

    Google Scholar 

  • Sakai, A. K., F. W. Allendorf, et al. (2001). The Population Biology of Invasive Species. Annual Review of Ecology and Systematics, 32, 305–332.

    Article  Google Scholar 

  • Schwartz, B. (2004). The Paradox of Choice: Why More is Less. New York: HarperCollins Publishers, Inc.

    Google Scholar 

  • Soule, T., J. A. Foster, et al. (1996). Code Growth in Genetic Programming. In J. R. Koza, D. E. Goldberg, D. B. Fogel and R. L. Riolo (Eds.), Genetic Programming 1996: Proceedings of the First Annual Conference, 215–223. Cambridge: The MIT Press.

    Google Scholar 

  • Soule, T. and R. B. Heckendorn (2002). An Analysis of the Causes of Code Growth in Genetic Programming. Genetic Programming and Evolvable Machines, 3(3), 283–309.

    Article  Google Scholar 

  • Wilson, E. O. (1992). The Diversity of Life. Cambridge: The Belknap Press.

    Google Scholar 

  • Witten, T. A. and L. M. Sander (1981). Diffusion-Limited Aggregation: A Kinetic Critical Phenomenon. Physics Review Letters, 47, 1400–1403.

    Article  Google Scholar 

  • Witten, T. A. and L. M. Sander (1983). Diffusion-Limited Aggregation. Physics Review B, 27(9), 5686–5697.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for the Study of Complex Systems and Space Physics Research Laboratory, The University of Michigan, USA

    Jason M. Daida

Authors
  1. Jason M. Daida
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Massachusetts Institute of Technology, USA

    Una-May O’Reilly

  2. Chevron Texaco Information Technology Group, Chevron

    Tina Yu

  3. University of Michigan, Michigan

    Rick Riolo

  4. Genetics Squared, Inc., Genetics

    Bill Worzel

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Daida, J.M. (2005). Considering the Roles of Structure in Problem Solving by Computer. In: O’Reilly, UM., Yu, T., Riolo, R., Worzel, B. (eds) Genetic Programming Theory and Practice II. Genetic Programming, vol 8. Springer, Boston, MA. https://doi.org/10.1007/0-387-23254-0_5

Download citation

  • DOI: https://doi.org/10.1007/0-387-23254-0_5

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-23253-9

  • Online ISBN: 978-0-387-23254-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation