Self-adjusting offspring population sizes outperform fixed parameters on the cliff function

DOI10.1145/3450218.3477306OpenAlexW3193338811MaRDI QIDQ5075414

Dirk Sudholt, Mario Alejandro Hevia Fajardo

Publication date: 16 May 2022

Published in: Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Related Items (6)

When move acceptance selection hyper-heuristics outperform metropolis and elitist evolutionary algorithms and when not ⋮ Self-adaptation Can Improve the Noise-tolerance of Evolutionary Algorithms ⋮ OneMax is not the easiest function for fitness improvements ⋮ More precise runtime analyses of non-elitist evolutionary algorithms in uncertain environments ⋮ Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter ⋮ Runtime analysis for permutation-based evolutionary algorithms

This page was built for publication: Self-adjusting offspring population sizes outperform fixed parameters on the cliff function