Where Elitists Start Limping Evolution Strategies at Ridge Functions
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
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 the (1, λ) - ES on the Parabolic Ridge
Evolutionary Computation
Toward a theory of evolution strategies: The (μ, λ)-theory
Evolutionary Computation
Toward a theory of evolution strategies: On the benefits of sex---the (μ/μ, λ) theory
Evolutionary Computation
Toward a theory of evolution strategies: Self-adaptation
Evolutionary Computation
Evolution strategies –A comprehensive introduction
Natural Computing: an international journal
A Comparison of Evolution Strategies with Other Direct Search Methods in the Presence of Noise
Computational Optimization and Applications
How to analyse evolutionary algorithms
Theoretical Computer Science - Natural computing
Hierarchically organised evolution strategies on the parabolic ridge
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Step length adaptation on ridge functions
Evolutionary Computation
Evolution strategies with cumulative step length adaptation on the noisy parabolic ridge
Natural Computing: an international journal
Adaptation of expansion rate for real-coded crossovers
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
On the behaviour of evolution strategies optimising cigar functions
Evolutionary Computation
Cumulative step length adaptation on ridge functions
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Searching for balance: understanding self-adaptation on ridge functions
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
| Hi-index | 0.00 |
The progress behavior of evolution strategies (ES) using recombination is analyzed in this paper on the parabolic ridge. This test function represents landscapes far from the optimum. The ES algorithms with intermediate and dominant recombination are considered in the analysis. The derivations are presented for intermediate recombination. Thereafter, the formulae for dominant recombination are obtained using the so-called surrogate mutation model. In the analysis, the formulae are derived for the progress rate ϕ and for the stationary distance R(∞) to the ridge axis. As a result, it will be shown that the progress rate ϕ can increase if recombination is applied. Simulations are used to show the appropriateness of the formulae derived.