Skip to main content
Springer Nature Link
Log in

Evolution and Acquisition of Modules in Cartesian Genetic Programming

  • Conference paper
Genetic Programming (EuroGP 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3003))

Included in the following conference series:

Abstract

The paper presents for the first time automatic module acquisition and evolution within the graph based Cartesian Genetic Programming method. The method has been tested on a set of even parity problems and compared with Cartesian Genetic Programming without modules. Results are given that show that the new modular method evolves solutions up to 20 times quicker than the original non-modular method and that the speedup is more pronounced on larger problems. Analysis of some of the evolved modules shows that often they are lower order parity functions. Prospects for further improvement of the method are discussed.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Angeline, P.J., Pollack, J.: Evolutionary Module Acquisition. In: Proceedings of the 2nd Annual Conference on Evolutionary Programming, pp. 154–163. MIT Press, Cambridge (1993)

    Google Scholar 

  2. Dessi, A., Giani, A., Starita, A.: An Analysis of Automatic Subroutine Discovery in Genetic Programming. In: GECCO 1999: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 996–1001. Morgan-Kaufmann, San Francisco (1999)

    Google Scholar 

  3. Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, London (1993)

    Google Scholar 

  4. Koza, J.R.: Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, London (1994)

    MATH  Google Scholar 

  5. Miller, J.F.: An Empirical Study of the Efficiency of Learning Boolean Functions using a Cartesian Genetic Programming Approach. In: GECCO 1999: Proceedings of the Genetic and Evolutionary Computation Conference, Orlando, Florida, pp. 1135–1142. Morgan Kaufmann, San Francisco (1999)

    Google Scholar 

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

    Chapter  Google Scholar 

  7. Rosca, J.P.: Genetic Programming Exploratory Power and the Discovery of Functions. In: Proceedings of the 4th Annual Conference of Evolutionary Programming, San Diego, pp. 719–736. MIT Press, Cambridge (1995)

    Google Scholar 

  8. Spector, L.: Simultaneous evolution of programs and their control structures. In: Advances in Genetic Programming II, pp. 137–154. MIT Press, Cambridge (1996)

    Google Scholar 

  9. Spector, L.: Autoconstructive Evolution: Push, PushGP, and Pushpop. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2001, pp. 137–146. Morgan Kaufmann Publishers, San Francisco (2001)

    Google Scholar 

  10. Van Belle, T., Ackley, D.H.: Code Factoring and the Evolution of Evolvability. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2001, pp. 1383–1390. Morgan Kaufmann Publishers, San Francisco (2001)

    Google Scholar 

  11. Vassilev, V.K., Miller, J.F.: The Advantages of Landscape Neutrality in Digital Circuit Evolution. In: Miller, J.F., Thompson, A., Thompson, P., Fogarty, T.C. (eds.) ICES 2000. LNCS, vol. 1801, pp. 252–263. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  12. Woodward, J.R.: Modularity in Genetic Programming. In: Proceedings of the Fifth European Conference on Genetic Programming. LNCS, vol. 2610, pp. 258–267. Springer, Berlin (2003)

    Google Scholar 

  13. Yu, T., Clack, C.: Recursion, Lambda Abstractions and Genetic Programming. In: Proceedings of the 3rd Annual Conference on Genetic Programming, pp. 422–431. Morgan Kaufmann, San Francisco (1998)

    Google Scholar 

  14. Yu, T., Miller, J.F.: Neutrality and the evolvability of Boolean function landscape. In: Miller, J., Tomassini, M., Lanzi, P.L., Ryan, C., Tetamanzi, A.G.B., Langdon, W.B. (eds.) EuroGP 2001. LNCS, vol. 2038, pp. 204–217. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, University of Birmingham, Edgbaston, Birmingham, UK B15 2TT

    James Alfred Walker

  2. Department of Electronics, University of York, Heslington, York, UK, YO10 5DD

    Julian Francis Miller

Authors
  1. James Alfred Walker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Julian Francis Miller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. No Affiliation,  

    Maarten Keijzer

  2. Computer Science and Artificial Intelligence Lab, Massachusetts Institute of Technology, 02139, Cambridge, MA, USA

    Una-May O’Reilly

  3. University of Essex Department of Computing and Electronic Systems, Wivenhoe Park, CO4 3SQ, Colchester, UK

    Simon Lucas

  4. Centre of Informatics and Systems of the University of Coimbra,  

    Ernesto Costa

  5. Department of Computer Science, University of Idaho, ID 83844-1010, Moscow,  

    Terence Soule

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Walker, J.A., Miller, J.F. (2004). Evolution and Acquisition of Modules in Cartesian Genetic Programming. In: Keijzer, M., O’Reilly, UM., Lucas, S., Costa, E., Soule, T. (eds) Genetic Programming. EuroGP 2004. Lecture Notes in Computer Science, vol 3003. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24650-3_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24650-3_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21346-8

  • Online ISBN: 978-3-540-24650-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics