Finite Markov chain analysis of genetic algorithms
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Statistical dynamics of the Royal Road genetic algorithm
Theoretical Computer Science - Special issue on evolutionary computation
The Simple Genetic Algorithm: Foundations and Theory
The Simple Genetic Algorithm: Foundations and Theory
Foundations of Genetic Algorithms
Foundations of Genetic Algorithms
The Design of Innovation: Lessons from and for Competent Genetic Algorithms
The Design of Innovation: Lessons from and for Competent Genetic Algorithms
Calculating the expected loss of diversity of selection schemes
Evolutionary Computation
Proceedings of the 5th International Conference on Genetic Algorithms
Generalized Convergence Models for Tournament- and (mu, lambda)-Selection
Proceedings of the 6th International Conference on Genetic Algorithms
On the Mean Convergence Time of Evolutionary Algorithms without Selection and Mutation
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Analysis of selection algorithms: A markov chain approach
Evolutionary Computation
A comparison of selection schemes used in evolutionary algorithms
Evolutionary Computation
Genetic drift in genetic algorithm selection schemes
IEEE Transactions on Evolutionary Computation
Inheriting Parents Operators: A New Dynamic Strategy for Improving Evolutionary Algorithms
ISMIS '02 Proceedings of the 13th International Symposium on Foundations of Intelligent Systems
IEA/AIE '08 Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence
An Evolutionary Approach for Vector Quantization Codebook Optimization
ISNN '08 Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks
Improving Image Vector Quantization with a Genetic Accelerated K-Means Algorithm
ACIVS '08 Proceedings of the 10th International Conference on Advanced Concepts for Intelligent Vision Systems
A genetic approach to statistical disclosure control
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Journal of Network and Computer Applications
Enhancing the performance of hybrid genetic algorithms by differential improvement
Computers and Operations Research
TSOIA: An efficient node selection algorithm facing the uncertain process for Internet of Things
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Steady State models of Evolutionary Algorithms are widely used, yet surprisingly little attention has been paid to the effects arising from different replacement strategies. This paper explores the use of mathematical models to characterise the selection pressures arising in a selection-only environment. The first part brings together models for the behaviour of seven different replacement mechanisms and provides expressions for various proposed indicators of Evolutionary Algorithm behaviour. Some of these have been derived elsewhere, and are included for completeness, but the majority are new to this paper. These theoretical indicators are used to compare the behaviour of the different strategies. The second part of this paper examines the practical relevance of these indicators as predictors for algorithms' relative performance in terms of optimisation time and reliability. It is not the intention of this paper to come up with a “one size fits all” recommendation for choice of replacement strategy. Although some strategies may have little to recommend them, the relative ranking of others is shown to depend on the intended use of the algorithm to be implemented, as reflected in the choice of performance metrics.