Probing for limits to building block mixing with a tunably-difficult problem for genetic programming

GECCO 2005 - Genetic and Evolutionary Computation Conference

Volumn , Issue , 2005, Pages 1713-1720

  Daida, Jason M ^a   Samples, Michael E ^a   Byom, Matthew J ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Building blocks; Highlander problem; Initial populations; Tunably difficult problems

Indexed keywords

BUILDING BLOCKS; HIGHLANDER PROBLEMS; INITIAL POPULATIONS; TUNABLY-DIFFICULT PROBLEMS;

COMPUTATION THEORY; DYNAMICS; POPULATION STATISTICS; PROBLEM SOLVING;

MATHEMATICAL PROGRAMMING;

EID: 32444441487     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1068009.1068295     Document Type: Conference Paper

References (25)

1. Banzhaf, W., et al. GP: An Introduction. Morgan Kaufmann, San Francisco, 1998.
2. Daida, J.M. Limits to Expression in Genetic Programming: Lattice-Aggregate Modeling, in CEC 2002, IEEE, Piscataway, 2002, 273-278.
3. Daida, J.M. Towards Identifying Populations that Increase the Likelihood of Success in Genetic Programming, in GECCO 2005, 2005.
4. Daida, J.M. What Makes a Problem GP-Hard? A Look at How Structure Affects Content, in Riolo, R.L. and Worzel, W. eds. GP Theory and Practice, Kluwer Academic Publishers, Dordrecht, 2003, 99-118.
5. Daida, J.M., Bertram, R.B., Polito 2, J.A. and Stanhope, S.A. Analysis of Single-Node (Building) Blocks in GP. in Spector, L., et al. eds. Advances in GP 3, MIT Press, Cambridge, 1999, 217-241.
6. Daida, J.M. and Hilss, A.M. Identifying Structural Mechanisms in Standard GP. in Cantú-Paz, et al. eds. GECCO 2003, Springer-Verlag, Berlin, 2003, 1639-1651.
7. Daida, J.M., et al. What Makes a Problem GP-Hard? Validating a Hypothesis of Structural Causes, in Canrú-Paz, et al. eds. GECCO 2003, Springer-Verlag, Berlin, 2003, 1665-1677.
8. Daida, J.M., et al. What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in GP. in Banzhaf, W., et al. eds. GECCO '99, Morgan Kaufmann, San Francisco, 1999, 982-989.
9. Daida, J.M., et al. What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in GP. GPEM, 2 (2). 165-191.
10. Gathercole, C. and Ross, P. An Adverse Interaction Between Crossover and Restricted Tree Depth in GP. in Koza, J.R., et al. eds. GP 1996, MIT Press, Cambridge, 1996, 291-296.
11. Goldberg, D.E. and O'Reilly, U.-M. Where Does the Good Stuff Go, and Why? in Banzhaf, W., et al. eds. EuroGP, Springer-Verlag, Berlin, 1998, 16-36.
12. Hall, J.M. and Soule, T. Does GP Inherently Adopt Structured Design Techniques? in O'Reilly, U.-M., et al. eds. GP Theory and Practice II, Kluwer Academic Publishers, Boston, 2004.
13. Langdon, W.B. and Poli, R. An Analysis of the MAX Problem in Genetic Programming, in Koza, J.R., et al. eds. GP 1997, Morgan Kaufmann, San Francisco, 1997, 222-230.
14. Langdon, W.B. and Poli, R. Foundations of GP. Springer-Verlag, Berlin, 2002.
15. Matsumoto, M. and Nishimura, T. Mersenne Twister: A 623-Dimensionally Equidistributed Uniform Pseudorandom Number Generator. ACM Trans Mod and Comp Sim, 8 (1). 3-30.
16. McPhee, N.F. and Hopper, N.J. Analysis of Genetic Diversity through Population History, in Banzhaf, W., et al. eds. GECCO '99, Morgan Kaufmann, San Francisco, 1999, 1112-1120.
17. Motoki, T. Calculating the Expected Loss of Diversity of Selection Schemes. EC, 10 (4). 397-422.
18. O'Reilly, U.-M. The Impact of External Dependency in GP Primitives, in CEC 1999, IEEE Press, Piscataway, 1998, 306-311.
19. O'Reilly, U.-M. and Goldberg, D.E. How Fitness Structure Affects Subsolution Acquisition in GP. in Koza, J.R., et al. eds. GP 1998, Morgan Kaufmann, San Francisco, 1998, 269-277.
20. Poli, R. General Schema Theory for GP with Subtree-Swapping Crossover, in Miller, J.F., et al. eds. EuroGP 2001, Springer-Verlag, Berlin, 2001, 143-159.
21. Punch, W., et al. The Royal Tree Problem, A Benchmark for Single and Multiple Population GP. in Angeline, P.J. and K.E. Kinnear, J. eds. Advances in GP, MIT Press, Cambridge, 1996, 299-316.
22. Rosca, J.P. Analysis of Complexity Drift in GP. in Koza, J.R., et al. eds. GP 1997, Morgan Kaufmann, San Francisco, 1997, 286-294.
23. Sastry, K., et al. Population Sizing for GP Based on Decision Making, in O'Reilly, U.-M., et al. eds. GP Theory and Practice II, Kluwer Academic, Boston, 2004, 49-65.
24. Soule, T., et al. Code Growth in Genetic Programming, in Koza, J.R., et al. eds. GP 1996, MIT Press, Cambridge, 1996, 215-223.
25. Zongker, D. and Punch, W. Iilgp, Michigan State University Genetic Algorithms Research and Applications Group, Lansing, 1995.