On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization

DOI10.1007/s00453-018-0480-zzbMath1421.68155OpenAlexW2885992409MaRDI QIDQ1739102

Dirk Sudholt, Carsten Witt

Publication date: 25 April 2019

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://orbit.dtu.dk/en/publications/a0de8178-40dd-42aa-9fb2-399a4ddd4c5c

zbMATH Keywords

genetic algorithmsant colony optimizationruntime analysistheory of randomized search heuristicsestimation-of-distribution algorithmsprobabilistic model-building genetic algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Related Items (7)

The complex parameter landscape of the compact genetic algorithm ⋮ Two-dimensional drift analysis: optimizing two functions simultaneously can be hard ⋮ Choosing the right algorithm with hints from complexity theory ⋮ How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys ⋮ The voting algorithm is robust to various noise models ⋮ The runtime of the compact genetic algorithm on jump functions ⋮ The univariate marginal distribution algorithm copes well with deception and epistasis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A rigorous analysis of the compact genetic algorithm for linear functions
• Improved time complexity analysis of the simple genetic algorithm
• On the distribution of the number of successes in independent trials
• Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax
• The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
• \textsc{OneMax} in black-box models with several restrictions
• Upper and lower bounds for randomized search heuristics in black-box optimization
• Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift
• The Benefit of Recombination in Noisy Evolutionary Search
• Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions
• A Sharp Uniform Bound for the Distribution of Sums of Bernoulli Trials
• Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax
• Tail bounds on hitting times of randomized search heuristics using variable drift analysis
• Inequalities: theory of majorization and its applications

This page was built for publication: On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization