A population initialization method for evolutionary algorithms based on clustering and Cauchy deviates

D Bajer, G Martinović, J Brest - Expert Systems with Applications, 2016 - Elsevier
The initial population of an evolutionary algorithm is an important factor which affects the
convergence rate and ultimately its ability to find high quality solutions or satisfactory …

Cluster-based population initialization for differential evolution frameworks

I Poikolainen, F Neri, F Caraffini - Information Sciences, 2015 - Elsevier
This article proposes a procedure to perform an intelligent initialization for population-based
algorithms. The proposed pre-processing procedure, namely Cluster-Based Population …

Analyzing convergence performance of evolutionary algorithms: A statistical approach

J Derrac, S García, S Hui, PN Suganthan, F Herrera - Information Sciences, 2014 - Elsevier
The analysis of the performance of different approaches is a staple concern in the design of
Computational Intelligence experiments. Any proper analysis of evolutionary optimization …

A novel diversity-based replacement strategy for evolutionary algorithms

C Segura, CAC Coello, E Segredo… - IEEE transactions on …, 2015 - ieeexplore.ieee.org
Premature convergence is one of the best-known drawbacks that affects the performance of
evolutionary algorithms. An alternative for dealing with this problem is to explicitly try to …

Sequence-based deterministic initialization for evolutionary algorithms

S Elsayed, R Sarker, CAC Coello - IEEE transactions on …, 2016 - ieeexplore.ieee.org
It is well known that the performances of evolutionary algorithms are influenced by the
quality of their initial populations. Over the years, many different techniques for generating …

Implementation matters: Programming best practices for evolutionary algorithms

JJ Merelo, G Romero, MG Arenas, PA Castillo… - … Work-Conference on …, 2011 - Springer
While a lot of attention is usually devoted to the study of different components of evolutionary
algorithms or the creation of heuristic operators, little effort is being directed at how these …

Replacement strategies to maintain useful diversity in steady-state genetic algorithms

M Lozano, F Herrera, JR Cano - Soft Computing: Methodologies and …, 2005 - Springer
In this paper, we propose a replacement strategy for steady-state genetic algorithms that
takes into account two features of the element to be included into the population: a measure …

A retrospective view and outlook on evolutionary algorithms

LJ Fogel - International Conference on Computational …, 1997 - Springer
A retrospective view and outlook on evolutionary algorithms Page 1 A Retrospective View and
Outlook on Evolutionary Algorithms Lawrence J. Fogel Natural Selection, Inc. 3333 North Torrey …

Fast evolution strategies

X Yao, Y Liu - International conference on evolutionary programming, 1997 - Springer
Evolution strategies are a class of general optimisation algorithms which are applicable to
functions that are multimodal, non-differentiable, or even discontinuous. Although …

A comparison of evolution strategies with other direct search methods in the presence of noise

DV Arnold, HG Beyer - Computational Optimization and Applications, 2003 - Springer
Evolution strategies are general, nature-inspired heuristics for search and optimization. Due
to their use of populations of candidate solutions and their advanced adaptation schemes …