Massive parallelization of the compact genetic algorithm

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

DOI: 10.1007/3-211-27389-1_128

Cite this paper as:
Lobo F.G., Lima C.F., Mártires H. (2005) Massive parallelization of the compact genetic algorithm. In: Ribeiro B., Albrecht R.F., Dobnikar A., Pearson D.W., Steele N.C. (eds) Adaptive and Natural Computing Algorithms. Springer, Vienna

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.

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