A robust memetic algorithm with self-stopping capabilities

Authors:
José Luis Guerrero;Antonio Berlanga;José Manuel Molina
Affiliations:
University Carlos III of Madrid, Colmenarejo, Spain;University Carlos III of Madrid, Colmenarejo, Spain;University Carlos III of Madrid, Colmenarejo, Spain
Venue:
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Year:
2011

Citing 5
Cited 0

Stopping criteria for iterative solvers

SIAM Journal on Matrix Analysis and Applications
Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition

SIAM Journal on Optimization
Diversity-Guided Evolutionary Algorithms

PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES)

Evolutionary Computation
A tutorial for competent memetic algorithms: model, taxonomy, and design issues

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Evolutionary algorithms exhibit some traditional handicaps: lack of a stopping criterion, slow convergence towards the minimum, etc. Memetic algorithms try to combine the best exploration qualities of population based approaches with the exploitation qualities of local search ones. The proposed solution in this work, Robust Evolutionary Strategy Learned with Automated Termination Criteria (R-ESLAT) uses a memetic approach, combining an evolutionary strategy with derivative-free local search methods, adding as well a termination criteria based on the population diversity, according to the principles of the original ESLAT algorithm. The original algorithm is analyzed and its features improved towards an increased robustness, comparing the results obtained with the Covariance Matrix Adaptation Evolutionary Strategy (CMAES).