Exploring macroevolutionary algorithms: some extensions and improvements

  • Authors:
  • J. A. Becerra;V. Díaz Casás;R. J. Duro

  • Affiliations:
  • Grupo Integrado de Ingeniería, Universidade da Coruña, Spain;Grupo Integrado de Ingeniería, Universidade da Coruña, Spain;Grupo Integrado de Ingeniería, Universidade da Coruña, Spain

  • Venue:
  • IWANN'07 Proceedings of the 9th international work conference on Artificial neural networks
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Macroevolutionary Algorithms seem to work better than other Evolutionary Algorithms in problems characterized by having small populations where the evaluation of the individuals is computationally very expensive or is characterized by a very difficult search space with multiple narrow hyper-dimensional peaks and large areas between those peaks showing the same fitness value. This paper focuses on some aspects of Macroevolutionary Algorithms introducing some modifications that address weak points in the original algorithm, which are very relevant in some types of complex real world problems. All the modifications on the algorithm are tested in real world problems.