Skip to main content

A New Mutation Paradigm for Genetic Programming

  • Chapter
  • First Online:
Genetic Programming Theory and Practice X

Part of the book series: Genetic and Evolutionary Computation ((GEVO))

  • 1443 Accesses

Abstract

Lévy flights are a class of random walksdirectly inspired by observing animal foraging habits, where a power-law distribution of the stride length can be often observed. This implies that, while the vast majority of the strides will be short, on rare occasions, the strides are gigantic. We propose a mutation mechanism in Linear Genetic Programming inspired by this ethological behavior, thus obtaining a self-adaptive mutation rate. We experimentally test this original approach on three different classes of problems: Boolean regression, quadratic polynomial regression, and surface reconstruction. We find that in all cases, our method outperforms the generic, commonly used constant mutation rate of one over the size of the genotype. Moreover, we compare different common values of the power-law exponent to the another self-adaptive mutation mechanism directly inspired by Simulated Annealing. We conclude that our novel method is a viable alternative to constant and self-adaptive mutation rates, especially because it tends to reduce the number of parameters of genetic programming.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  • Banzhaf W, Nordin P, Keller RE, Francone FD (1998) Genetic Programming – An Introduction: On the Automatic Evolution of Computer Programs and its Applications. Morgan Kaufmann, San Francisco, CA, USA

    MATH  Google Scholar 

  • Benhamou S, Bovet P (1992) Distinguishing between elementary orientation mechanisms by means of path analysis. Animal Behaviour 43(3):371–377

    Article  Google Scholar 

  • Bovet P, Benhamou S (1988) Spatial analysis of animals’ movements using a correlated random walk model. Journal of Theoretical Biology 131(4):419 – 433

    Article  Google Scholar 

  • Brameier M, Banzhaf W (2007) Linear Genetic Programming. No. XVI in Genetic and Evolutionary Computation, Springer

    MATH  Google Scholar 

  • Cole BJ (1995) Fractal time in animal behaviour: the movement activity of drosophila. Animal Behaviour 50(5):1317–1324

    Article  Google Scholar 

  • Dunn OJ (1964) Multiple comparisons using rank sums. Technometrics 6(3):241–252

    Article  MathSciNet  Google Scholar 

  • Edwards AM (2011) Overturning conclusions of lévy flight movement patterns by fishing boats and foraging animals. Ecology 92(6):1247–1257

    Article  Google Scholar 

  • Edwards AM, Phillips RA, Watkins NW, Freeman MP, Murphy EJ, Afanasyev V, Buldyrev SV, Da Luz MGE, Raposo EP, Stanley HE, et al (2007) Revisiting lévy flight search patterns of wandering albatrosses, bumblebeesand deer. Nature 449(7165):1044–1048

    Article  Google Scholar 

  • James A, Plank MJ, Edwards AM (2011) Assessing lévy walks as models of animal foraging. Journal of the Royal Society Interface the Royal Society 8(62):1233–1247

    Article  Google Scholar 

  • Kantschik W, Banzhaf W (2001) Linear-tree gp and its comparison with other gp structures. In: Genetic Programming, Proceedings of EuroGP’2001, volume 2038 of LNCS, Springer-Verlag, pp 302–312

    Google Scholar 

  • Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680, DOI 10.1126/ science.220.4598.671, URL http://www.science mag.org/content/220/4598/671.abstract, http://www.sciencemag.org/ content/220/4598/671.full.pdf

    Google Scholar 

  • Koza JR (1992) A genetic approach to the truck backer upper problem and the inter-twined spiral problem. In: Proceedings of IJCNN International Joint Conference on Neural Networks, IEEE Press, vol IV, pp 310–318, URL http://www.genetic-programming.com/jkpdf/ijcnn1992.pdf

  • Lee CY, Yao X (2004) Evolutionary programming using mutations based on the levy probability distribution. Evolutionary Computation, IEEE Transactions on 8(1):1–13, DOI 10.1109/TEVC.2003.816583

    Article  Google Scholar 

  • Luke S, Panait L (2006) A comparison of bloat control methods for genetic programming. Evolutionary Computation 14(3):309–334

    Article  Google Scholar 

  • O’Neill M, Vanneschi L, Gustafson S, Banzhaf W (2010) Open issues in genetic programming. Genetic Programming and Evolvable Machines 11:339–363, 10.1007/s10710-010-9113-2

    Article  Google Scholar 

  • Shlesinger M, West B, Klafter J (1987) Lévy dynamics of enhanced diffusion: Application to turbulence. Physical Review Letters 58(11):1100–1103

    Article  MathSciNet  Google Scholar 

  • Silva S, Costa E (2009) 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

    Article  MathSciNet  Google Scholar 

  • Vafaee F, Nelson P (2009) A genetic algorithm that incorporates an adaptive mutation based on an evolutionary model. In: Machine Learning and Applications, 2009. ICMLA ’09. International Conference on, pp 101–107, DOI 10.1109/ICMLA.2009.101

    Google Scholar 

  • Viswanathan GM, Afanasyev V, Buldyrev S, Murphy E, Prince P, Stanley HE (1996) Lévy flight search patterns of wandering albatrosses. Nature 381(6581):413–415

    Article  Google Scholar 

  • Viswanathan GM, Buldyrev SV, Havlin S, Da Luz MG, Raposo EP, Stanley HE (1999) Optimizing the success of random searches. Nature 401(6756):911–914

    Article  Google Scholar 

  • Viswanathan GM, Afanasyev V, Buldyrev SV, Stanley HE (2000) Lévy flights in random searches. Physica A 282:1–12

    Article  Google Scholar 

  • Zar JH (2010) Biostatistical Analysis, 5th edn. Pearson Prentice-Hall, Upper Saddle River, NJ.

    Google Scholar 

Download references

Acknowledgements

This work was partially supported by NIH grants LM-009012, LM010098, AI59694, and by the Swiss National Science Foundation grant PBLAP3-136923. The authors are grateful to Luca Ferreri for his precious help with statistical calculations and the corresponding figures, and to Joshua L. Payne for his invaluable contribution to the discussions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Christian Darabos .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this chapter

Cite this chapter

Darabos, C., Giacobini, M., Hu, T., Moore, J.H. (2013). A New Mutation Paradigm for Genetic Programming. In: Riolo, R., Vladislavleva, E., Ritchie, M., Moore, J. (eds) Genetic Programming Theory and Practice X. Genetic and Evolutionary Computation. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-6846-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-6846-2_4

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-6845-5

  • Online ISBN: 978-1-4614-6846-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics