A new efficient entropy population-merging parallel model for evolutionary algorithms

Javier Arellano-Verdejo, Salvador Godoy-Calderon, Federico Alonso-Pecina, Adolfo Guzmán Arenas, Marco Antonio Cruz-Chavez

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

In this paper a coarse-grain execution model for evolutionary algorithms is proposed and used for solving numerical and combinatorial optimization problems. This model does not use migration as the solution dispersion mechanism, in its place a more efficient population-merging mechanism is used that dynamically reduces the population size as well as the total number of parallel evolving populations. Even more relevant is the fact that the proposed model incorporates an entropy measure to determine how to merge the populations such that no valuable information is lost during the evolutionary process. Extensive experimentation, using genetic algorithms over a well-known set of classical problems, shows the proposed model to be faster and more accurate than the traditional one.

Original languageEnglish
Pages (from-to)1186-1197
Number of pages12
JournalInternational Journal of Computational Intelligence Systems
Volume10
Issue number1
DOIs
StatePublished - Jan 2017

Keywords

  • Evolutionary algorithms
  • Global optimization
  • Heuristic spatially structured
  • Island genetic algorithm
  • Parallel genetic algorithm
  • Parallel heuristics

Fingerprint

Dive into the research topics of 'A new efficient entropy population-merging parallel model for evolutionary algorithms'. Together they form a unique fingerprint.

Cite this