Skip to main content

Improving Parallel GA Performances by Means of Plagues

  • Conference paper
  • 748 Accesses

Part of the book series: Advances in Soft Computing ((AINSC,volume 33))

Abstract

This paper describes a proposal for increasing performances when using Parallel Genetic Algorithms. We apply a new operator that has been recently described within Genetic Programming domain, the plague. By means of a series of experiments on a benchmark problem, we show that computational effort can be reduced when looking for solutions by means of Parallel GAs.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   329.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. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs. Springer Verlag. Heidelberg, 1996.

    MATH  Google Scholar 

  2. R. Darwin “On the origin of species”, 1892.

    Google Scholar 

  3. F. Fernández, M. Tomassini, L. Vanneschi, “An Empirical Study of Multipopulation Genetic Programming”. Genetic Programming and Evolvable Machines, Vol. 4. 2003.21–51. Kluwer Academic Publishers.

    Article  MATH  Google Scholar 

  4. F. Fernández, M. Tomassini, L. Vanneschi, “The effect of Plagues in Genetic Programming: A study of Variable-Size Populations”, Lecture Notes in Computer Science 2610. 317–326.

    Google Scholar 

  5. F. Fernández, A. Martín, “Saving effort in Parallel GP by means of Plagues”, LNCS 3003, 269–278. Springer Verlag.

    Google Scholar 

  6. F. Fernández, E. Cantú-Paz, T. Manzano, I. Lóopez, “Saving Resources in Genetic Algorithms by means of Plagues”, VIII Parallel Problem Solving from Nature Conference (accepted).

    Google Scholar 

  7. Deb, K., Goldberg, D.E.: Analyzing deception in trap functions. In Whitley, L.D., ed.: Foundations of Genetic Algorithms 2, San Mateo, CA, Morgan Kaufmann (1993) 93–108

    Google Scholar 

  8. Wall, M.: Galib 2.3.2 (1995)

    Google Scholar 

  9. E. Cant-Paz and D. Goldberg: Predicting Speedups of Ideal Bounding Cases of Parallel Genetic Algorithms. Proceedings of the Seventh International Conference on Genetic Morgan Kaufmann.

    Google Scholar 

  10. David Andre and John R. Koza. “Parallel Genetic Programming: A Scalable Implementation Using The Transputer Network Architecture”. P. Angeline and K. Kimea editors. Advances in Genetic Programming 2, Cambridge, MA, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fernández, F., Tomassini, M. (2005). Improving Parallel GA Performances by Means of Plagues. In: Reusch, B. (eds) Computational Intelligence, Theory and Applications. Advances in Soft Computing, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-31182-3_47

Download citation

  • DOI: https://doi.org/10.1007/3-540-31182-3_47

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics