The complex parameter landscape of the compact genetic algorithm
From MaRDI portal
Publication:2661997
DOI10.1007/S00453-020-00778-4OpenAlexW3095083526MaRDI QIDQ2661997FDOQ2661997
Authors: Johannes Lengler, Dirk Sudholt, Carsten Witt 
Publication date: 8 April 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-020-00778-4
Recommendations
- The runtime of the compact genetic algorithm on jump functions
- An exponential lower bound for the runtime of the compact genetic algorithm on jump functions
- A rigorous analysis of the compact genetic algorithm for linear functions
- On the runtime analysis of the simple genetic algorithm
- Improved time complexity analysis of the simple genetic algorithm
evolutionary algorithmstheoryruntime analysiscompact genetic algorithmestimation-of-distribution algorithms
Cites Work
- Probability and random processes.
- Title not available (Why is that?)
- A study of drift analysis for estimating computation time of evolutionary algorithms
- The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
- Concentration of first hitting times under additive drift
- Simplified drift analysis for proving lower bounds in evolutionary computation
- Concentration of measure for the analysis of randomized algorithms.
- A rigorous analysis of the compact genetic algorithm for linear functions
- A sharp uniform bound for the distribution of sums of Bernoulli trials
- Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax
- Level-based analysis of the univariate marginal distribution algorithm
- On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization
- Lower bounds on the run time of the univariate marginal distribution algorithm on OneMax
Cited In (7)
- Parallel Processing and Applied Mathematics
- Title not available (Why is that?)
- Two-dimensional drift analysis: optimizing two functions simultaneously can be hard
- The runtime of the compact genetic algorithm on jump functions
- How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys
- Estimation-of-distribution algorithms for multi-valued decision variables
- An exponential lower bound for the runtime of the compact genetic algorithm on jump functions
This page was built for publication: The complex parameter landscape of the compact genetic algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2661997)
