Skip to main content
Springer Nature Link
Log in

Studying the Influence of Communication Topology and Migration on Distributed Genetic Programming

  • Conference paper
  • First Online:
Genetic Programming (EuroGP 2001)

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

Included in the following conference series:

Abstract

In this paper we present a systematic experimental study of some of the parameters influencing parallel and distributed genetic programming (PADGP) by using three benchmark problems. We first present results on the system’s communication topology and then we study the parameters governing individual migration between subpopulations: the number of individuals sent and the frequency of exchange. Our results suggest that fitness evolution is more sensitive to the migration factor than the communication topology.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. D. Andre and J.R. Koza. Parallel genetic programming: A scalable implementation using the transputer network architecture. In P. Angeline and K. Kinnear, editors, Advances in Genetic Programming 2, pages 317–337, Cambridge, MA, 1996. The MIT Press.

    Google Scholar 

  2. E. Cantú-Paz and D.E. Goldberg. Modeling idealized bounding cases of parallel genetic algorithms. In J.R. Koza, K. Deb, M. Dorigo, D.B. Fogel, M. Garzon, H. Iba, and R.L. Riolo, editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 456–462. Morgan Kaufmann, San Francisco, CA, 1997.

    Google Scholar 

  3. J.P. Cohoon, S.U. Hedge, W.N. Martin, and D. Richards. Punctuated equilibria: A parallel genetic algorithm. In J.J. Grefenstette, editor, Proceedings of the Second International Conference on Genetic Algorithms, page 148. Lawrence Erlbaum Associates, 1987.

    Google Scholar 

  4. F. Fernández, J.M. Sánchez, and M. Tomassini. Feasibility study of genetic programming for solving the problem of placement and routing on FPGAs. In Proceedings of the XV Conference on Design of Circuits and Integrated Systems (DCIS 2000), pages 24–28. LIRMM, Montpellier University, 2000.

    Google Scholar 

  5. F. Fernández, M. Tomassini, W.F. Punch III, and J.M. Sánchez. Experimental study of multipopulation parallel genetic programming. In Riccardo Poli, Wolfgang Banzhaf, William B. Langdon, Julian F. Miller, Peter Nordin, and Terence C. Fogarty, editors, Genetic Programming, Proceedings of EuroGP’2000, volume 1802 of LNCS, pages 283–293. Springer-Verlag, Heidelberg, 2000.

    Google Scholar 

  6. F. Fernández, M. Tomassini, L. Vanneschi, and L. Bucher. A distributed computing environment for genetic programming using MPI. In J. Dongarra, P. Kaksuk, and N. Podhorzsky, editors, Recent Advances in Parallel Virtual Machine and Message Passing Interface, volume 1908 of Lecture Notes in Computer Science, pages 322–329. Springer-Verlag, Heidelberg, 2000.

    Chapter  Google Scholar 

  7. F.H. Bennet III, J. Koza, J. Shipman, and O. Stiffielman. Building a parallel computer system for $18,000 that performs a half peta-flop per day. In W. Banzhaf, J. Daida, A.E. Eiben, M. Garzon, V. Honavar, M. Jakiela, and R. Smith, editors, Proceedings of the genetic and evolutionary computation conference GECCO’99, pages 1484–1490, San Francisco, CA, 1999. Morgan Kaufmann.

    Google Scholar 

  8. J.R. Koza. Genetic Programming. The MIT Press, Cambridge, Massachusetts, 1992.

    MATH  Google Scholar 

  9. S.C. Lin, W.F. Punch, and E.D. Goodman. Coarse-grain parallel genetic algorithms: Categorization and a new approach. In Sixth IEEE SPDP, pages 28–37, 1994.

    Google Scholar 

  10. B. Manderick and P. Spiessens. Fine-grained parallel genetic algorithms. In J.D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms, page 428. Morgan Kaufmann, 1989.

    Google Scholar 

  11. D. Mange and M. Tomassini (Eds). Bio-Inspired Computing Machines: Towards Novel Computational Architectures. Presses Polytechniques et Universitaires Romandes, Lausanne, 1998.

    Google Scholar 

  12. M. Oussaidène, B. Chopard, O. Pictet, and M. Tomassini. Parallel genetic programming and its application to trading model induction. Parallel Computing, 23:1183–1198, 1997.

    Article  MATH  Google Scholar 

  13. W. Punch. How effective are multiple popululations in genetic programming. In J.R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D.B. Fogel, M. Garzon, D. Goldberg, H. Iba, and R.L. Riolo, editors, Genetic Programming 1998: Proceedings of the Third Annual Conference, pages 308–313, San Francisco, CA, 1998. Morgan Kaufmann.

    Google Scholar 

  14. T. Weinbrenner. Genetic Programming Kernel version 0.5.2_C++ Class Library. University of Darmstadt.

    Google Scholar 

  15. D. Whitley, S. Rana, and R.B. Heckendorn. Island model genetic algorithms and linearly separable problems. In D. Corne and J.L. Shapiro, editors, Evolutionary Computing: Proceedings of the AISB Workshop, Lecture notes in computer science, vol. 1305, pages 109–125. Springer-Verlag, Berlin, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Institute, University of Lausanne, 1015, Lausanne, Switzerland

    Marco Tomassini & Leonardo Vanneschi

  2. Dpto. Arquitectura y Tecnología de Computadores, Universidad de Extremadura, Cáceres, Spain

    Francisco Fernández

Authors
  1. Francisco Fernández
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marco Tomassini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Leonardo Vanneschi
    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, Birmingham

    Julian Miller

  2. Computer Science Institute, University of Lausanne, Lausanne

    Marco Tomassini

  3. Dipartimento di Elettronica e Informazione, Politecnico di Milano, Italy

    Pier Luca Lanzi

  4. Computer Science and Information Systems, University of Limerick, Limerick

    Conor Ryan

  5. Dipartimento di Tecnologie dell’Informazione, Università degli Studi di Milano, Italy

    Andrea G. B. Tettamanzi

  6. Department of Computer Science, University College London, London

    William B. Langdon

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fernández, F., Tomassini, M., Vanneschi, L. (2001). Studying the Influence of Communication Topology and Migration on Distributed Genetic Programming. In: Miller, J., Tomassini, M., Lanzi, P.L., Ryan, C., Tettamanzi, A.G.B., Langdon, W.B. (eds) Genetic Programming. EuroGP 2001. Lecture Notes in Computer Science, vol 2038. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45355-5_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-45355-5_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45355-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation