Crossover, sampling, bloat and the harmful effects of size limits

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4971 LNCS, Issue , 2008, Pages 158-169

  Dignum, Stephen ^a   Poli, Riccardo ^a  

^a UNIVERSITY OF ESSEX   (United Kingdom)

Author keywords

Bloat; Crossover; Genetic Programming; Program length; Sampling; Search; Theory

Indexed keywords

COMPUTER PROGRAMMING; GENETIC ALGORITHMS; GENETIC PROGRAMMING; KETONES; SAMPLING; STANDARDS;

ACCURATE PREDICTION; EMPIRICAL VALIDATION; EUROPEAN; FITNESS LANDSCAPES; HARMFUL EFFECTS; HEIDELBERG (CO); INTERNAL NODES; LIMITING DISTRIBUTIONS; RE SAMPLING; SELECTION PRESSURES; SPEED UPS; STANDARD CROSSOVER; SUB-TREE CROSSOVER;

COMPUTER GRAPHICS;

EID: 47249144386     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78671-9_14     Document Type: Conference Paper

References (9)

1. Crane, E.F., McPhee, N.F.: The effects of size and depth limits on tree based genetic programming. In: Yu, T., Riolo, R.L., Worzel, B. (eds.) Genetic Programming Theory and Practice III, Ann Arbor, May 12-14. Genetic Programming, ch. 9, pp. 223-240. Springer, Heidelberg (2005)
2. Dignum, S., Poli, R.: Generalisation of the limiting distribution of program sizes in tree-based genetic programming and analysis of its effects on bloat. In: Thierens, D., Beyer, H.-G., Bongard, J., Branke, J., Clark, J.A., Cliff, D., Congdon, C.B., Deb, K., Doerr, B., Kovacs, T., Kumar, S., Miller, J.F., Moore, J., Neumann, F., Pelikan, M., Poli, R., Sastry, K., Stanley, K.O., Stutzle, T., Watson, R.A., Wegener, I. (eds.) GECCO 2007: Proceedings of the 9th annual conference on Genetic and evolutionary computation, London, July 7-11, vol. 2, pp. 1588-1595. ACM Press, New York (2007)
3. Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
4. Langdon, W.B.: How many good programs are there? How long are they? In: De Jong, K.A., Poli, R., Rowe, J.E. (eds.) Foundations of Genetic Algorithms VII, Torremolinos, Spain, Sepember 4-6 2002, pp. 183-202. Morgan Kaufmann, San Francisco (published, 2003)
5. Langdon, W.B.: Convergence of program fitness landscapes. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O'Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2724, pp. 1702-1714. Springer, Heidelberg (2003)
6. Langdon, W.B., Poli, R.: Foundations of Genetic Programming. Springer, Heidelberg (2002)
7. Luke, S.: Two fast tree-creation algorithms for genetic programming. IEEE Transactions on Evolutionary Computation 4(3), 274-283 (2000)
8. Luke, S.: ECJ 13: A Java-based Evolutionary Computation Research System (2005), http://cs.gmu.edu/∼eclab/projects/ecj/
9. Poli, R., Langdon, W.B., Dignum, S.: On the limiting distribution of program sizes in tree-based genetic programming. In: Ebner, M., O'Neill, M., Ekárt, A., Vanneschi, L., Esparcia-Alcázar, A.I. (eds.) EuroGP 2007. LNCS, vol. 4445, pp. 193-204. Springer, Heidelberg (2007)