The complex parameter landscape of the compact genetic algorithm

DOI10.1007/S00453-020-00778-4MaRDI QIDQ2661997zbMATH OpenOpenAlexFDO

Authors Johannes Lengler, Dirk Sudholt, Carsten Witt

Publication date 8 April 2021

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00453-020-00778-4

zbMATH Keywords

evolutionary algorithmstheoryruntime analysiscompact genetic algorithmestimation-of-distribution algorithms

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

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

Cites work

• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• A rigorous analysis of the compact genetic algorithm for linear functions
• A sharp uniform bound for the distribution of sums of Bernoulli trials
• A study of drift analysis for estimating computation time of evolutionary algorithms
• Concentration of first hitting times under additive drift
• Concentration of measure for the analysis of randomized algorithms.
• Level-based analysis of the univariate marginal distribution algorithm
• Lower bounds on the run time of the univariate marginal distribution algorithm on OneMax
• On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization
• Probability and random processes.
• Simplified drift analysis for proving lower bounds in evolutionary computation
• The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
• Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax

Cited in

(8)

• An exponential lower bound for the runtime of the compact genetic algorithm on jump functions
• On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization
• Parallel Processing and Applied Mathematics
• scientific article; zbMATH DE number 7403911 (Why is no real title available?)
• The runtime of the compact genetic algorithm on jump functions
• Two-dimensional drift analysis: optimizing two functions simultaneously can be hard
• How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys
• Estimation-of-distribution algorithms for multi-valued decision variables

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)