Adaptive population models for offspring populations and parallel evolutionary algorithms

DOI10.1145/1967654.1967671zbMath1369.68316arXiv1102.0588OpenAlexW2159653361MaRDI QIDQ5276098

Dirk Sudholt, Jörg Lässig

Publication date: 14 July 2017

Published in: Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.0588

zbMATH Keywords

island modelruntime analysisoffspring populationsparallel evolutionary algorithmsspatial structuresdynamic population size

Mathematics Subject Classification ID

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

Related Items (13)

Self-adjusting evolutionary algorithms for multimodal optimization ⋮ Runtime analysis for self-adaptive mutation rates ⋮ Self-adjusting population sizes for the (1,\( \lambda )\)-EA on monotone functions ⋮ Analysis of speedups in parallel evolutionary algorithms and \((1 + \lambda)\) EAs for combinatorial optimization ⋮ Design and analysis of migration in parallel evolutionary algorithms ⋮ Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter ⋮ The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate ⋮ From black-box complexity to designing new genetic algorithms ⋮ Self-adjusting mutation rates with provably optimal success rules ⋮ Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm ⋮ Static and self-adjusting mutation strengths for multi-valued decision variables ⋮ The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm ⋮ Parallel metaheuristics: recent advances and new trends

This page was built for publication: Adaptive population models for offspring populations and parallel evolutionary algorithms