Black-box Complexity of Parallel Search with Distributed Populations

DOI10.1145/2725494.2725504zbMath1361.68103OpenAlexW2049628352MaRDI QIDQ2981878

Golnaz Badkobeh, Dirk Sudholt, Per Kristian Lehre

Publication date: 10 May 2017

Published in: Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2725494.2725504

zbMATH Keywords

island modelsquery complexitystructured populationscellular evolutionary algorithmsruntime analysisblack-box complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed algorithms (68W15)

Related Items (13)

The interplay of population size and mutation probability in the \((1+\lambda )\) EA on OneMax ⋮ Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial ⋮ Runtime analysis for self-adaptive mutation rates ⋮ On the impact of the performance metric on efficient algorithm configuration ⋮ Analyzing randomized search heuristics via stochastic domination ⋮ When move acceptance selection hyper-heuristics outperform metropolis and elitist evolutionary algorithms and when not ⋮ Unnamed Item ⋮ Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter ⋮ The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate ⋮ Island models meet rumor spreading ⋮ Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm ⋮ Optimal mutation rates for the \((1+\lambda)\) EA on OneMax through asymptotically tight drift analysis ⋮ Static and self-adjusting mutation strengths for multi-valued decision variables

Cites Work

• Approximating fixation probabilities in the generalized Moran process
• On the fixation probability of superstars
• Unnamed Item
• Unnamed Item

This page was built for publication: Black-box Complexity of Parallel Search with Distributed Populations