A MOS-based dynamic memetic differential evolution algorithm for continuous optimization: a scalability test

  • Authors:
  • Antonio LaTorre;Santiago Muelas;José-María Peña

  • Affiliations:
  • Universidad Politécnica de Madrid, Department of Computer Systems Architecture and Technology, Facultad de Informática, Madrid, Spain;Universidad Politécnica de Madrid, Department of Computer Systems Architecture and Technology, Facultad de Informática, Madrid, Spain;Universidad Politécnica de Madrid, Department of Computer Systems Architecture and Technology, Facultad de Informática, Madrid, Spain

  • Venue:
  • Soft Computing - A Fusion of Foundations, Methodologies and Applications - Special Issue on scalability of evolutionary algorithms and other metaheuristics for large-scale continuous optimization problems
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Continuous optimization is one of the areas with more activity in the field of heuristic optimization. Many algorithms have been proposed and compared on several benchmarks of functions, with different performance depending on the problems. For this reason, the combination of different search strategies seems desirable to obtain the best performance of each of these approaches. This contribution explores the use of a hybrid memetic algorithm based on the multiple offspring framework. The proposed algorithm combines the explorative/exploitative strength of two heuristic search methods that separately obtain very competitive results. This algorithm has been tested with the benchmark problems and conditions defined for the special issue of the Soft Computing Journal on Scalability of Evolutionary Algorithms and other Metaheuristics for Large Scale Continuous Optimization Problems. The proposed algorithm obtained the best results compared with both its composing algorithms and a set of reference algorithms that were proposed for the special issue.