On the impact of the mutation-selection balance on the runtime of evolutionary algorithms

DOI10.1145/1527125.1527133zbMath1369.68318arXiv1012.3098OpenAlexW2000194396MaRDI QIDQ5276062

Xin Yao, Per Kristian Lehre

Publication date: 14 July 2017

Published in: Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms (Search for Journal in Brave)

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

zbMATH Keywords

branching processesevolutionary algorithmsruntime analysis

Mathematics Subject Classification ID

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

Related Items (6)

Evolutionary optimization: pitfalls and booby traps ⋮ Analyzing randomized search heuristics via stochastic domination ⋮ Runtime analysis of the \((1+1)\) EA on computing unique input output sequences ⋮ A large population size can be unhelpful in evolutionary algorithms ⋮ Non-existence of linear universal drift functions ⋮ The use of tail inequalities on the probable computational time of randomized search heuristics

This page was built for publication: On the impact of the mutation-selection balance on the runtime of evolutionary algorithms