Skip to main content
SpringerLink
Log in
Book cover

European Conference on Genetic Programming

EuroGP 1999: Genetic Programming pp 39–48Cite as

Mutation in Genetic Programming: A Preliminary Study

  • Conference paper
  • First Online:

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

Abstract

In this paper we examine the behaviour of the uniform crossover and point mutation GP operators [12] on the even-η-parity problem for η = 3;4; 6 and present a novel representation of function nodes, designed to allow the search operators to make smaller movements around the solution space. Using this representation, performance on the even-6-parity problem is improved by three orders of magnitude relative to the estimate given for standard GP in [5].

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Tobias Blickle and Lothar Thiele. Genetic programming and redundancy. In J. Hopf, editor, Genetic Algorithms within the Framework of Evolutionary Computation (Workshop at KI-94, Saarbrücken), pages 33–38, Im Stadtwald, Building 44, D-66123 Saarbrücken, Germany, 1994. Max-Planck-Institut für Informatik (MPII-94-241).

    Google Scholar 

  2. Chris Gathercole and Peter Ross. The MAX problem for genetic programming-highlighting an adverse interaction between the crossover operator and a restriction on tree depth. Technical report, Department of Artificial Intelligence, University of Edinburgh, 80 South Bridge, Edinburgh, EH1 1HN, UK, 1995.

    Google Scholar 

  3. Chris Gathercole and Peter Ross. Tackling the boolean even N parity problem with genetic programming and limited-error fitness. In John R. Koza, Kalyanmoy Deb, Marco Dorigo, David B. Fogel, Max Garzon, Hitoshi Iba, and Rick L. Riolo, editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 119–127, Stanford University, CA, USA, 13–16 July 1997. Morgan Kaufmann.

    Google Scholar 

  4. John R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992.

    MATH  Google Scholar 

  5. John R. Koza. Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge Massachusetts, May 1994.

    MATH  Google Scholar 

  6. W. B. Langdon and R. Poli. Boolean functions fitness spaces. In R. Poli, P. Nordin, W. B. Langdon, and T. Fogarty, editors, Proceedings of the Second European Workshop on Genetic Programming-EuroGP’99, Goteborg, May 1999. Springer-Verlag.

    Google Scholar 

  7. Ben McKay, Mark J. Willis, and Geoffrey W. Barton. Using a tree structured genetic algorithm to perform symbolic regression. In A. M. S. Zalzala, editor, First International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, GALESIA, volume 414, pages 487–492, Sheffeld, UK, 12–14 September 1995. IEE.

    Google Scholar 

  8. Una-May O’Reilly and Franz Oppacher. Hybridized crossover-based search techniques for program discovery. In Proceedings of the 1995 World Conference on Evolutionary Computation, volume 2, page 573, Perth, Australia, 29 November–1 December 1995. IEEE Press.

    Chapter  Google Scholar 

  9. Riccardo Poli. Is crossover a local search operator? Position paper at theWorkshop on Evolutionary Computation with Variable Size Representation at ICGA-97, 20 July 1997.

    Google Scholar 

  10. Riccardo Poli and W. B. Langdon. Genetic programming with one-point crossover. In P. K. Chawdhry, R. Roy, and R. K. Pant, editors, Soft Computing in Engineering Design and Manufacturing, pages 180–189. Springer-Verlag London, 23–27 June 1997.

    Google Scholar 

  11. Riccardo Poli and W. B. Langdon. A new schema theory for genetic programming with one-point crossover and point mutation. In John R. Koza, Kalyanmoy Deb, Marco Dorigo, David B. Fogel, Max Garzon, Hitoshi Iba, and Rick L. Riolo, editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 278–285, Stanford University, CA, USA, 13–16 July 1997. Morgan Kaufmann.

    Google Scholar 

  12. Riccardo Poli and William B. Langdon. On the search properties of different crossover operators in genetic programming. In John R. Koza, Wolfgang Banzhaf, Kumar Chellapilla, Kalyanmoy Deb, Marco Dorigo, David B. Fogel, Max H. Garzon, David E. Goldberg, Hitoshi Iba, and Rick Riolo, editors, Genetic Programming 1998: Proceedings of the Third Annual Conference, pages 293–301, University of Wisconsin, Madison, Wisconsin, USA, 22–25 July 1998. Morgan Kaufmann.

    Google Scholar 

  13. Riccardo Poli and William B. Langdon. Schema theory for genetic programming with one-point crossover and point mutation. Evolutionary Computation, 6(3):231–252, 1998.

    Article  Google Scholar 

  14. Riccardo Poli, Jonathan Page, and William B. Langdon. Solving even-12,-13,-15,-17,-20 and-22 boolean parity problems using sub-machine code GP with smooth uniform crossover, smooth point mutation and demes. Technical Report CSRP-99-2, University of Birmingham, School of Computer Science, January 1999.

    Google Scholar 

  15. Justinian P. Rosca. Hierarchical Learning with Procedural Abstraction Mechanisms. PhD thesis, University of Rochester, Rochester, NY 14627, February 1997.

    Google Scholar 

  16. Terence Soule and James A. Foster. Removal bias: a new cause of code growth in tree based evolutionary programming. In 1998 IEEE International Conference on Evolutionary Computation, pages 781–186, Anchorage, Alaska, USA, 5–9 May 1998. IEEE Press.

    Google Scholar 

  17. G. Syswerda. Uniform crossover in genetic algorithms. In J. Schaffer, editor, Proceedings of the Third International Conference on Genetic ALgorithms. MOrgan Kaufmann, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    J. Page, R. Poli & W. B. Langdon

Authors
  1. J. Page
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Poli
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. W. B. Langdon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

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

    Riccardo Poli

  2. Department of Physical Resource Theory, Chalmers University of Technology, S-412 96, Göteborg, Sweden

    Peter Nordin

  3. Centrum voorWiskunde en Informatic, Kruislaan 413, 1098, SJ Amsterdam, The Netherlands

    William B. Langdon

  4. Napier University, 219 Colinton Road, Edinburgh, EH14 1DJ, UK

    Terence C. Fogarty

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Page, J., Poli, R., Langdon, W.B. (1999). Mutation in Genetic Programming: A Preliminary Study. In: Poli, R., Nordin, P., Langdon, W.B., Fogarty, T.C. (eds) Genetic Programming. EuroGP 1999. Lecture Notes in Computer Science, vol 1598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48885-5_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-48885-5_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65899-3

  • Online ISBN: 978-3-540-48885-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation