Comma selection outperforms plus selection on OneMax with randomly planted optima

DOI10.1007/S00453-025-01330-YMaRDI QIDQ6917985zbMATH OpenFDO

Authors Joost Jorritsma, Johannes Lengler, Dirk Sudholt

Publication date 10 October 2025

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-025-01330-Y

zbMATH Keywords

comma strategiesdrift analysisfixed-target running timesmultimodal optimisationnon-elitismruntime analysis

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• A simple ant colony optimizer for stochastic shortest path problems
• Adaptive drift analysis
• Adaptive population models for offspring populations and parallel evolutionary algorithms
• Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial
• Analyzing randomized search heuristics via stochastic domination
• Do additional target points speed up evolutionary algorithms?
• Does comma selection help to cope with local optima?
• Efficient optimisation of noisy fitness functions with population-based evolutionary algorithms
• Fixed-target runtime analysis
• scientific article; zbMATH DE number 3349081 (Why is no real title available?)
• Multiplicative drift analysis
• OneMax is not the easiest function for fitness improvements
• Optimizing expected path lengths with ant colony optimization using fitness proportional update
• Robustness of populations in stochastic environments
• Run-time analysis of population-based evolutionary algorithm in noisy environments
• Runtime analysis of non-elitist populations: from classical optimisation to partial information
• Self-adjusting offspring population sizes outperform fixed parameters on the Cliff function
• Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter
• Tail bounds for sums of geometric and exponential variables
• Tail bounds on hitting times of randomized search heuristics using variable drift analysis
• The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
• The interplay of population size and mutation probability in the (1+ ) EA on OneMax
• The runtime of the compact genetic algorithm on jump functions
• Tight bounds on the optimization time of a randomized search heuristic on linear functions
• Towards a runtime comparison of natural and artificial evolution

This page was built for publication: Comma selection outperforms plus selection on OneMax with randomly planted optima

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6917985)