Parallel probabilistic model-building genetic algorithms with elitism

  • Authors:
  • Yutana Jewajinda

  • Affiliations:
  • National Electronics and Computer Technology Center, National Science and Technology Development Agency, Pathumthani, Thailand

  • Venue:
  • ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a parallel probabilistic model-building genetic algorithms (PMBGAs) called cellular compact genetic algorithm (CCGA) with elitism. The elitismbased CCCA is a coarse-grained parallel GA that migrates probability model between nodes instead of individuals. Each CCGA node is enhanced from compact genetic algorithm by using elitism. With elitism and our parallelized approach, the performance of the proposed parallel genetic algorithm is improved. The benchmarks and experimental results presented in the this paper confirm the performance of the proposed algorithm.