Gradual distributed real-coded genetic algorithms

  • Authors:
  • F. Herrera;M. Lozano

  • Affiliations:
  • Dept. de Ciencias de la Comput. e Inteligencia Artificial, Granada Univ.;-

  • Venue:
  • IEEE Transactions on Evolutionary Computation
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

A major problem in the use of genetic algorithms is premature convergence. One approach for dealing with this problem is the distributed genetic algorithm model. Its basic idea is to keep, in parallel, several subpopulations that are processed by genetic algorithms, with each one being independent of the others. Making distinctions between the subpopulations by applying genetic algorithms with different configurations, we obtain the so-railed heterogeneous distributed genetic algorithms. These algorithms represent a promising way for introducing a correct exploration/exploitation balance in order to avoid premature convergence and reach approximate final solutions. This paper presents the gradual distributed real-coded genetic algorithms, a type of heterogeneous distributed real-coded genetic algorithms that apply a different crossover operator to each sub-population. Experimental results show that the proposals consistently outperform sequential real-coded genetic algorithms