The Benefit of Recombination in Noisy Evolutionary Search

DOI10.1007/978-3-662-48971-0_13zbMath1472.68232OpenAlexW2296129337MaRDI QIDQ3459857

Andrew M. Sutton, Timo Kötzing, Martin S. Krejca, Tobias Friedrich

Publication date: 11 January 2016

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48971-0_13

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (7)

Lower bounds on the run time of the univariate marginal distribution algorithm on OneMax ⋮ The cost of randomness in evolutionary algorithms: crossover can save random bits ⋮ More precise runtime analyses of non-elitist evolutionary algorithms in uncertain environments ⋮ Exponential upper bounds for the runtime of randomized search heuristics ⋮ Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax ⋮ On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization ⋮ Exponential slowdown for larger populations: the \(( \mu + 1)\)-EA on monotone functions

This page was built for publication: The Benefit of Recombination in Noisy Evolutionary Search