Skip to main content
SpringerLink
Log in

An Empirical Investigation of How Degree Neutrality Affects GP Search

  • Conference paper
MICAI 2009: Advances in Artificial Intelligence (MICAI 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5845))

Included in the following conference series:

Abstract

Over the last years, neutrality has inspired many researchers in the area of Evolutionary Computation (EC) systems in the hope that it can aid evolution. However, there are contradictory results on the effects of neutrality in evolutionary search. The aim of this paper is to understand how neutrality - named in this paper degree neutrality - affects GP search. For analysis purposes, we use a well-defined measure of hardness (i.e., fitness distance correlation) as an indicator of difficulty in the absence and in the presence of neutrality, we propose a novel approach to normalise distances between a pair of trees and finally, we use a problem with deceptive features where GP is well-known to have poor performance and see the effects of neutrality in GP search.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Altenberg, L.: Fitness Distance Correlation Analysis: An Instructive Counterexample. In: Back, T. (ed.) Proceedings of the Seventh International Conference on Genetic Algorithms, pp. 57–64. Morgan Kaufmann, San Francisco (1997)

    Google Scholar 

  2. Collins, M.: Finding Needles in Haystacks is Harder with Neutrality. In: Beyer, H.-G., O’Reilly, U.-M., Arnold, D.V., Banzhaf, W., Blum, C., Bonabeau, E.W., Cantu-Paz, E., Dasgupta, D., Deb, K., Foster, J.A., de Jong, E.D., Lipson, H., Llora, X., Mancoridis, S., Pelikan, M., Raidl, G.R., Soule, T., Tyrrell, A.M., Watson, J.-P., Zitzler, E. (eds.) GECCO 2005: Proceedings of the 2005 conference on Genetic and evolutionary computation, Washington DC, USA, June 2005, vol. 2, pp. 1613–1618. ACM Press, New York (2005)

    Chapter  Google Scholar 

  3. Galván-López, E.: An Analysis of the Effects of Neutrality on Problem Hardness for Evolutionary Algorithms. PhD thesis, School of Computer Science and Electronic Engineering, University of Essex, United Kingdom (2009)

    Google Scholar 

  4. Galván-López, E., Dignum, S., Poli, R.: The Effects of Constant Neutrality on Performance and Problem Hardness in GP. In: O’Neill, M., Vanneschi, L., Gustafson, S., Esparcia Alcázar, A.I., De Falco, I., Della Cioppa, A., Tarantino, E. (eds.) EuroGP 2008. LNCS, vol. 4971, pp. 312–324. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  5. Galván-López, E., Poli, R.: Some Steps Towards Understanding How Neutrality Affects Evolutionary Search. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 778–787. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Goldberg, D.E., Deb, K., Horn, J.: Massive Multimodality, Deception, and Genetic Algorithms. In: Männer, R., Manderick, B. (eds.) PPSN II: Proceedings of the 2nd International Conference on Parallel Problem Solving from Nature, pp. 37–48. Elsevier Science Publishers, Amsterdam (1992)

    Google Scholar 

  7. Jones, T.: Evolutionary Algorithms, Fitness Landscapes and Search. PhD thesis, University of New Mexico, Albuquerque (1995)

    Google Scholar 

  8. Kimura, M.: The Neutral Theory of Molecular Evolution. Cambridge University Press, Cambridge (1983)

    Google Scholar 

  9. Miller, J.F.: An Empirical Study of the Efficiency of Learning Boolean Functions Using a Cartesian Genetic Approach. In: Banzhaf, W., Daida, J.M., Eiben, A.E., Garzon, M.H., Honavar, V., Jakiela, M.J., Smith, R.E. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference GECCO 1999, Orlando, Florida, vol. 2, pp. 1135–1142. Morgan Kaufmann, San Francisco (1999)

    Google Scholar 

  10. Miller, J.F., Thomson, P.: Cartesian genetic programming. In: Poli, R., Banzhaf, W., Langdon, W.B., Miller, J., Nordin, P., Fogarty, T.C. (eds.) EuroGP 2000. LNCS, vol. 1802, pp. 121–132. Springer, Heidelberg (2000)

    Google Scholar 

  11. O’Reilly, U.-M.: Using a Distance Metric on Genetic Programs to Understand Genetic Operators. In: IEEE International Conference on Systems, Man, and Cybernetics, Computational Cybernetics and Simulation, Orlando, Florida, USA, vol. 5, pp. 4092–4097. IEEE Press, Los Alamitos (1997)

    Chapter  Google Scholar 

  12. Poli, R., Galván-López, E.: On The Effects of Bit-Wise Neutrality on Fitness Distance Correlation, Phenotypic Mutation Rates and Problem Hardness. In: Stephens, C.R., Toussaint, M., Whitley, D., Stadler, P.F. (eds.) Foundations of Genetic Algorithms IX, Mexico city, Mexico, pp. 138–164. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  13. 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)

    Chapter  Google Scholar 

  14. Punch, B., Zongker, D., Godman, E.: The Royal Tree Problem, A Benchmark for Single and Multi-population Genetic Programming. In: Angeline, P., Kinnear, K. (eds.) Advances in Genetic Programming 2, pp. 299–316. The MIT Press, Cambridge (1996)

    Google Scholar 

  15. Quick, R.J., Rayward-Smith, V.J., Smith, G.D.: Fitness Distance Correlation and Ridge Functions. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 77–86. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  16. Slavov, V., Nikolaev, N.I.: Fitness Landscapes and Inductive Genetic Programming. In: Smith, G.D., Steele, N.C., Albrecht, R.F. (eds.) Artificial Neural Nets and Genetic Algorithms: Proceedings of the International Conference, ICANNGA 1997, University of East Anglia, Norwich, UK, Springer, Heidelberg (1997)

    Google Scholar 

  17. Tomassini, M., Vanneschi, L., Collard, P., Clergue, M.: Study of Fitness Distance Correlation as a Difficulty Measure in Genetic Programming. Evolutionary Computation 13(2), 213–239 (2005)

    Article  Google Scholar 

  18. Vanneschi, L.: Theory and Practice for Efficient Genetic Programming. PhD thesis, Faculty of Science, University of Lausanne, Switzerland (2004)

    Google Scholar 

  19. Vanneschi, L., Tomassini, M., Collard, P., Clergue, M.: Fitness Distance Correlation in Structural Mutation Genetic Programming. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E.P.K., Poli, R., Costa, E. (eds.) EuroGP 2003. LNCS, vol. 2610, pp. 455–464. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  20. Yu, T., Miller, J.F.: Finding Needles in Haystacks is not Hard with Neutrality. In: Foster, J.A., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A.G.B. (eds.) EuroGP 2002. LNCS, vol. 2278, pp. 13–25. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Natural Computing Research & Applications Group, Complex and Adaptive Systems Lab, University College Dublin,  

    Edgar Galván-López

  2. School of Computer Science and Electonic Engineering, University of Essex, Wivenhoe Park, Colchester, CO4 3SQ, UK

    Riccardo Poli

Authors
  1. Edgar Galván-López
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Riccardo Poli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centro de Investigación en Matemáticas, AC. (CIMAT), Area de Computación, Calle Jalisco S/N, Mineral de Valenciana, Guanajuato, CP 36250, Guanajuato, México

    Arturo Hernández Aguirre

  2. Ciencias de la Computación, Tecnológico de Monterrey, Campus Estado de México, Carretera al lago de Guadalupe Km 3,5, Col. Margarita Maza de Juárez, Atizapán de Zaragoza,, CP 52926, Estado de México, México

    Raúl Monroy Borja

  3. Instituto Nacional de Astrofísica, Optica y Electrónica (INAOE), Ciencias Computacionales, Luis Enrique Erro No. 1, Santa María Tonantzintla, CP 72840, Puebla, México

    Carlos Alberto Reyes Garciá

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Galván-López, E., Poli, R. (2009). An Empirical Investigation of How Degree Neutrality Affects GP Search. In: Aguirre, A.H., Borja, R.M., Garciá, C.A.R. (eds) MICAI 2009: Advances in Artificial Intelligence. MICAI 2009. Lecture Notes in Computer Science(), vol 5845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05258-3_64

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-05258-3_64

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-05257-6

  • Online ISBN: 978-3-642-05258-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation