Adaptive and Natural Computing Algorithms pp 530-533
Massive parallelization of the compact genetic algorithm
- 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
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.
Unable to display preview. Download preview PDF.