Abstract
The concept of bloat — the increase of program size without a corresponding increase in fitness — presents a significant drawback to the application of genetic programming. One approach to controlling bloat, dubbed spatial structure with elitism (SS+E), uses a combination of spatial population structure and local elitist replacement to implicitly constrain unwarranted program growth. However, the default implementation of SS+E uses a replacement scheme that prevents the introduction of smaller programs in the presence of equal fitness. This paper introduces a modified SS+E approach in which replacement is done under a lexicographic parsimony scheme. The proposed model, spatial structure with lexicographic parsimonious elitism (SS+LPE), exhibits an improvement in bloat reduction and, in some cases, more effectively searches for fitter solutions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bleuler, S., Brack, M., Thiele, L., Zitzler, E.: Multiobjective genetic programming: Reducing bloat using SPEA2. In: Proceedings of the 2001 Congress on Evolutionary Computation, CEC 2001, pp. 536–543. IEEE Press (2001)
Jackson, D.: The identification and exploitation of dormancy in genetic programming. Genetic Programming and Evolvable Machines 11, 89–121 (2010)
Jong, K.A.D., Sarma, J.: On decentralizing selection algorithms. In: Eshelman, L.J. (ed.) Proceedings of the 6th International Conference on Genetic Algorithms, pp. 17–23. Morgan Kaufmann Publishers Inc., San Francisco (1995)
Kennedy, C.J., Giraud-Carrier, C.: A depth controlling strategy for strongly typed evolutionary programming. In: Banzhaf, W., Daida, J., Eiben, A.E., Garzon, M.H., Honavar, V., Jakiela, M., Smith, R.E. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, July 13-17, vol. 1, pp. 879–885. Morgan Kaufmann, Orlando (1999)
Koza, J.R.: Genetic Programming: On the Programming of Computers by Natural Selection. MIT Press, Cambridge (1992)
Luke, S., Panait, L.: Lexicographic parsimony pressure. In: Langdon, W.B., et al. (eds.) Proceedings of the Fourth International Conference on Genetic and Evolutionary Computation, GECCO 2002, pp. 829–836. Morgan Kaufmann (2002)
Luke, S., Panait, L.: A comparison of bloat control methods for genetic programming. Evolutionary Computation 14(3), 309–344 (2006)
McDermott, J., White, D.R., Luke, S., Manzoni, L., Castelli, M., Vanneschi, L., Jaskowski, W., Krawiec, K., Harper, R., De Jong, K., O’Reilly, U.M.: Genetic programming needs better benchmarks. In: Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, GECCO 2012, pp. 791–798. ACM, New York (2012)
Pagie, L., Hogeweg, P.: Evolutionary consequences of coevolving targets. Evolutionary Computation 5(4), 401–418 (1997)
Poli, R.: A Simple but Theoretically-Motivated Method to Control Bloat in Genetic Programming. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E., Poli, R., Costa, E. (eds.) EuroGP 2003. LNCS, vol. 2610, pp. 204–217. Springer, Heidelberg (2003)
Poli, R., Langdon, W.B., McPhee, N.F.: A Field Guild to Genetic Programming, pp. 102–103. Lulu.com (2008)
Silva, S., Almeida, J.: Dynamic Maximum Tree Depth: A Simple Technique for Avoiding Bloat in Tree-Based GP. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, D., Roy, R., O’Reilly, U.M., Beyer, H.G., Standish, R., Kendall, G., Wilson, S., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A.C., Dowsland, K., Jonoska, N., Miller, J. (eds.) GECCO 2003. LNCS, vol. 2724, pp. 1776–1787. Springer, Heidelberg (2003)
Soule, T., Foster, J., Dickinson, J.: Code growth in genetic programming. In: Koza, J., Goldberg, D., Fogel, D., Riolo, R. (eds.) Genetic Programming 1996: Proceedings of the First Annual Conference, pp. 215–223. MIT Press, Stanford University (1996)
Soule, T., Heckendorn, R.: An analysis of the causes of code growth in genetic programming. Genetic Programming and Evolvable Machines 3(3), 283–309 (2002)
Teller, A.: The evolution of mental models. In: Kinnear Jr., K.E. (ed.) Advances in Genetic Programming, ch. 9, pp. 199–217. MIT Press (1994)
Whigham, P.A., Dick, G.: Implicitly controlling bloat in genetic programming. IEEE Transactions on Evolutionary Computation 14(2), 173–190 (2010)
Wong, P., Zhang, M.: Algebraic simplification of GP programs during evolution. In: Proceedings of the Eighth International Conference on Genetic and Evolutionary Computation, GECCO 2006, pp. 927–934. ACM Press, Seattle (2006)
Yamaguchi, H., Hiroyasu, T., Nunokawa, S., Koizumi, N., Okumura, N., Yokouchi, H., Miki, M., Yoshimi, M.: Comparison study of controlling bloat model of GP in constructing filter for cell image segmentation problems. In: 2012 IEEE Congress on Evolutionary Computation, CEC, pp. 3468–3475 (2012)
Zhang, B.T., Mühlenbein, H.: Balancing accuracy and parsimony in genetic programming. Evolutionary Computation 3(1), 17–38 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dick, G., Whigham, P.A. (2013). Controlling Bloat through Parsimonious Elitist Replacement and Spatial Structure. In: Krawiec, K., Moraglio, A., Hu, T., Etaner-Uyar, A.Ş., Hu, B. (eds) Genetic Programming. EuroGP 2013. Lecture Notes in Computer Science, vol 7831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37207-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-37207-0_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37206-3
Online ISBN: 978-3-642-37207-0
eBook Packages: Computer ScienceComputer Science (R0)