Improving flexibility and efficiency by adding parallelism to genetic algorithms

  • Authors:
  • Enrique Alba;José M. Troya

  • Affiliations:
  • Dpto. de Lenguajes y Ciencias de la Computación, Univ. de Málaga Campus de Teatinos (3.2.12), 29071—Málaga, Spain. eat@lcc.uma.es;Dpto. de Lenguajes y Ciencias de la Computación, Univ. de Málaga Campus de Teatinos (3.2.12), 29071—Málaga, Spain. troya@lcc.uma.es

  • Venue:
  • Statistics and Computing
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we develop a study on several types of parallel genetic algorithms (PGAs). Our motivation is to bring some uniformity to the proposal, comparison, and knowledge exchange among the traditionally opposite kinds of serial and parallel GAs. We comparatively analyze the properties of steady-state, generational, and cellular genetic algorithms. Afterwards, this study is extended to consider a distributed model consisting in a ring of GA islands. The analyzed features are the time complexity, selection pressure, schema processing rates, efficacy in finding an optimum, efficiency, speedup, and resistance to scalability. Besides that, we briefly discuss how the migration policy affects the search. Also, some of the search properties of cellular GAs are investigated. The selected benchmark is a representative subset of problems containing real world difficulties. We often conclude that parallel GAs are numerically better and faster than equivalent sequential GAs. Our aim is to shed some light on the advantages and drawbacks of various sequential and parallel GAs to help researchers using them in the very diverse application fields of the evolutionary computation.