Skip to main content

PSA Approach to Population Models for Parallel Genetic Algorithms

  • Conference paper
  • First Online:
Parallel Computing Technologies (PaCT 1999)

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

Included in the following conference series:

  • 342 Accesses

Abstract

A universal approach for describing the population model of genetic algorithms is developed which is based on the Parallel Substi- tution Algorithm (PSA) theory. Genetic algorithms (GA) are a suitable method if good approximations for problems are required which were otherwise not solvable in practical environments. Optimisation of GAs can be done on several levels, in this work we concentrate on the popu- lation model. Most prominent population models are the classical global model, the island model and it’s extreme variant, the cellular model. The PSA theory supports us with a general approach which is essential for systematically studying convergence behaviour of GA population model variants and consequently for their optimisation.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Achasova, O. Bandman, V. Markova, and S. Piskunov. Parallel Substitution Algorithm-Theory and Application. World-Scientific, 1994.

    Google Scholar 

  2. A. Becher. Konvergenzverhalten Zellularer Genetischer Algorithmen bei kombinatorischen Optimierungsproblemen. Diploma thesis at the University of Technology, Darmstadt. 1998.

    Google Scholar 

  3. D. Eichberg, U. Kohlmorgen, and H. Schmeck. Feinkörnig parallele Varianten des Insel-Modells Genetischer Algorithmen. Mitteilungen-Gesellschaft fĂ¼r Informatik e. V., Parallel-Algorithmen und Rechnerstrukturen, PARS Workshop Stuttgart, 1995.

    Google Scholar 

  4. David E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wessley, 1989.

    Google Scholar 

  5. J. Liebich. Zellulare Genetische Algorithmen mit Anwendung auf die Simulation von Ă–kosystemen. Diploma thesis at the University of Technology, Darmstadt. 1997.

    Google Scholar 

  6. J. Liebich and P. Hartmann. Zellulare Genetische Algorithmen mit Anwendungen bei der Simulation von ökosystemen. Second German Workshop on Artificial Life (GWAL97), April 1997.

    Google Scholar 

  7. M. Mitchell. An Introduction to Genetic Algorithms. The MIT Press, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hartmann, P. (1999). PSA Approach to Population Models for Parallel Genetic Algorithms. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1999. Lecture Notes in Computer Science, vol 1662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48387-X_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-48387-X_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66363-8

  • Online ISBN: 978-3-540-48387-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics