Skip to main content

Design and Usage of a New Benchmark Problem for Genetic Programming

  • Conference paper
Computer and Information Sciences - ISCIS 2003 (ISCIS 2003)

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

Included in the following conference series:

Abstract

Not so many benchmark problems have been proposed in the area of Genetic Programming (GP). In this study, a new artificial benchmark problem is designed for GP. The different parameters that can be used to tune the difficulty of the problem are analyzed. Also, the initial experimental results obtained on different instances of the problem are presented.

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

Access this chapter

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. Chellapilla, K.: A Preliminary Investigation into Evolving Modular Programs without Subtree Crossover. In: Genetic Programming 1998: Proceedings of the Third Annual (1998)

    Google Scholar 

  2. Gathercole, C., Ross, P.: Tackling the Boolean Even N Parity Problem with Genetic Programming and Limited-Error Fitness. In: Genetic Programming 1997: Proceedings of the Second Annual Conference, pp. 119–127. Stanford University, CA (1997)

    Google Scholar 

  3. Janes, T.: A Description of Holland’s Royal Road Function. Evolutionary Computation 2(4), 409–415 (1994)

    Article  Google Scholar 

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

    Google Scholar 

  5. Langdon, W. B.: Better Trained Ants. Late Breaking Papers at EuroGP 1998: the First European Workshop on Genetic Programming, Paris, France (1998)

    Google Scholar 

  6. Punch, W.F., Zongker, D., Goodman, E.D.: The Royal Tree Problem, a Benchmark for Single and Multi-population Genetic Programming. Appears in Advances in Genetic Programming g 2, pp. 299–316. MIT Press, Cambridge (1996)

    Google Scholar 

  7. Tackett, W.A.: Recombination, Selection and the Genetic Construction of Computer Programs. PhD thesis, University of Southern California (April 1994)

    Google Scholar 

  8. Soule, T., Foster, J.A.: Code Size and Depth Flows in Genetic Programming. In: Genetic Programming 1997: Proceedings of the Second Annual Conference, pp. 313–320. Stanford University, CA (1997)

    Google Scholar 

  9. Wong, M.L., Leung, K.S.: Evolving Recursive Functions for the Even-Parity Problem Using Genetic Programming. In: Advances in Genetic Programming 2, pp. 221–240. MIT Press, Cambridge (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Korkmaz, E.E., Üçoluk, G. (2003). Design and Usage of a New Benchmark Problem for Genetic Programming. In: Yazıcı, A., Şener, C. (eds) Computer and Information Sciences - ISCIS 2003. ISCIS 2003. Lecture Notes in Computer Science, vol 2869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39737-3_70

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39737-3_70

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20409-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics