Massive parallelization of the compact genetic algorithm

  • Fernando G. Lobo
  • Cláudio F. Lima
  • Hugo Mártires

Abstract

This paper presents an architecture which is suitable for a massive parallelization of the compact genetic algorithm. The resulting scheme has three major advantages. First, it has low synchronization costs. Second, it is fault tolerant, and third, it is scalable.

The paper argues that the benefits that can be obtained with the proposed approach is potentially higher than those obtained with traditional parallel genetic algorithms.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Cantú-Paz, E. (2000) Efficient and accurate parallel genetic algorithms. Kluwer Academic Publishers, Boston, MA.Google Scholar
  2. [2]
    Harik, G.R., Lobo, F.G., Goldberg, D.E. (1999) The compact genetic algorithm. IEEE Transactions on Evolutionary Computation 3, pp. 287–297CrossRefGoogle Scholar
  3. [3]
    Harik, G.R. (1997) Personal communication.Google Scholar
  4. [4]
    Deb, K., Goldberg, D.E. (1993) Analyzing deception in trap functions. In Whitley, L.D., ed.: Foundations of Genetic Algorithms 2, San Mateo, CA, Morgan Kaufmann, pp. 93–108Google Scholar
  5. [5]
    Pelikan, M., Goldberg, D.E., Lobo, F. (2002) A survey of optimization by building and using probabilistic models. Computational Optimization and Applications 21, pp. 5–20MathSciNetCrossRefGoogle Scholar
  6. [6]
    Korpela, E., Werthimer, D., Anderson, D., Cobb, J., Lebofsky, M. (2001) SETI@home-massively distributed computing for SETI. Computing in Science and Engineering 3 pp. 79Google Scholar

Copyright information

© Springer-Verlag/Wien 2005

Authors and Affiliations

  • Fernando G. Lobo
    • 1
  • Cláudio F. Lima
    • 1
  • Hugo Mártires
    • 1
  1. 1.DEEI-FCT, Universidade do AlgarveFaroPortugal

Personalised recommendations