Skip to main content
SpringerLink
Log in

Recurrent Cartesian Genetic Programming

  • Conference paper
Parallel Problem Solving from Nature – PPSN XIII (PPSN 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8672))

Included in the following conference series:

Abstract

This paper formally introduces Recurrent Cartesian Genetic Programming (RCGP), an extension to Cartesian Genetic Programming (CGP) which allows recurrent connections. The presence of recurrent connections enables RCGP to be successfully applied to partially observable tasks. It is found that RCGP significantly outperforms CGP on two partially observable tasks: artificial ant and sunspot prediction. The paper also introduces a new parameter, recurrent connection probability, which biases the number of recurrent connections created via mutation. Suitable choices of this parameter significantly improve the effectiveness of RCGP.

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. Miller, J.F. (ed.): Cartesian Genetic Programming. Springer (2011)

    Google Scholar 

  2. Koza, J.R.: Genetic Programming: On the programming of computers by means of natural selection, vol. 1. MIT Press (1992)

    Google Scholar 

  3. Teller, A.: Turing completeness in the language of genetic programming with indexed memory. In: IEEE Evolutionary Computation, pp. 136–141 (1994)

    Google Scholar 

  4. Teredesai, A., Govindaraju, V., Ratzlaff, E., Subrahmonia, J.: Recurrent genetic programming. In: 2002 IEEE International Conference on Systems, Man and Cybernetics, vol. 4, pp. 5–9. IEEE (2002)

    Google Scholar 

  5. 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 

  6. Miller, J.F.: What bloat? Cartesian genetic programming on Boolean problems. In: Genetic and Evolutionary Computation Conference, pp. 295–302 (2001)

    Google Scholar 

  7. Turner, A.J., Miller, J.F.: Cartesian Genetic Programming: Why No Bloat? In: Genetic Programming: 17th European Conference (to appear, 2014)

    Google Scholar 

  8. Silva, S., Costa, E.: Dynamic limits for bloat control in genetic programming and a review of past and current bloat theories. Genetic Programming and Evolvable Machines 10(2), 141–179 (2009)

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  10. 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 

  11. Miller, J.F., Smith, S.: Redundancy and computational efficiency in Cartesian genetic programming. Evolutionary Computation 10(2), 167–174 (2006)

    Article  Google Scholar 

  12. Goldman, B.W., Punch, W.F.: Length bias and search limitations in Cartesian genetic programming. In: Proceeding of the Fifteenth Annual Conference on Genetic and Evolutionary Computation Conference, pp. 933–940. ACM (2013)

    Google Scholar 

  13. Jordan, M.I.: Serial order: A parallel distributed processing approach. Technical report, Institute for Cognitive Science (1986)

    Google Scholar 

  14. Khan, M., Khan, G., Miller, J.: Efficient representation of recurrent neural networks for markovian/non-markovian non-linear control problems. In: IEEE Intelligent Systems Design and Applications, pp. 615–620 (2010)

    Google Scholar 

  15. Khan, M.M., Ahmad, M.A., Khan, M.G., Miller, J.F.: Fast learning neural networks using Cartesian Genetic Programming. Neurocomputing 121, 274–289 (2013)

    Article  Google Scholar 

  16. Turner, A.J., Miller, J.F.: Cartesian Genetic Programming encoded Artificial Neural Networks: A Comparison using Three Benchmarks. In: Genetic and Evolutionary Computation, pp. 1005–1012 (2013)

    Google Scholar 

  17. Jefferson, D., Collins, R., Cooper, C., Dyer, M., Flowers, M., Korf, R., Taylor, C., Wang, A.: The genesys system: Evolution as a theme in artificial life. In: Artificial Life. Addison-Wesley, Redwood City (1990)

    Google Scholar 

  18. Langdon, W.B., Poli, R.: Why ants are hard. Technical report, School of Computer Science, The University of Birmingham, Birmingham, UK (1998)

    Google Scholar 

  19. SIDC-team: The International Sunspot Number. Monthly Report on the International Sunspot Number, online catalogue (1700-1987)

    Google Scholar 

  20. Khashei, M., Bijari, M.: An artificial neural network (p,d,q) model for timeseries forecasting. Expert Systems with Applications 37(1), 479–489 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The University of York, UK

    Andrew James Turner & Julian Francis Miller

Authors
  1. Andrew James Turner
    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. Faculty of Computer and Engineering Sciences, Cologne University of Applied Sciences, Steinmüllerallee 1, 51643, Gummersbach, Germany

    Thomas Bartz-Beielstein

  2. Warwick Business School, University of Warwick, CV8 2SY, Coventry, UK

    Jürgen Branke

  3. Department of Intelligent Systems, JožefStefan Institute, Jamova cesta 39, 1000, Ljubljana, Slovenia

    Bogdan Filipič

  4. Department of Computer Science and Creative Technologies, University of the West of England, BS16 1QY, Bristol, UK

    Jim Smith

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Turner, A.J., Miller, J.F. (2014). Recurrent Cartesian Genetic Programming. In: Bartz-Beielstein, T., Branke, J., Filipič, B., Smith, J. (eds) Parallel Problem Solving from Nature – PPSN XIII. PPSN 2014. Lecture Notes in Computer Science, vol 8672. Springer, Cham. https://doi.org/10.1007/978-3-319-10762-2_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-10762-2_47

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-10761-5

  • Online ISBN: 978-3-319-10762-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation