The compact genetic algorithm struggles on cliff functions
From MaRDI portal
Cites work
- A rigorous analysis of the compact genetic algorithm for linear functions
- Analyzing evolutionary algorithms. The computer science perspective.
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys
- scientific article; zbMATH DE number 699423 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- Improved time complexity analysis of the simple genetic algorithm
- On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization
- On the Distribution of the Number of Successes in Independent Trials
- Self-adjusting offspring population sizes outperform fixed parameters on the cliff function
- Some Inequalities on Mill's Ratio and Related Functions
- The complex parameter landscape of the compact genetic algorithm
- The runtime of the compact genetic algorithm on jump functions
- Theory of evolutionary computation. Recent developments in discrete optimization
- When hypermutations and ageing enable artificial immune systems to outperform evolutionary algorithms
This page was built for publication: The compact genetic algorithm struggles on cliff functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7006524)
