When do evolutionary algorithms optimize separable functions in parallel?
From MaRDI portal
Publication:5276110
DOI10.1145/2460239.2460245zbMath1369.68304OpenAlexW2027881843WikidataQ57200606 ScholiaQ57200606MaRDI QIDQ5276110
Dirk Sudholt, Carsten Witt, Benjamin Doerr
Publication date: 14 July 2017
Published in: Proceedings of the twelfth workshop on Foundations of genetic algorithms XII (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2460239.2460245
Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas ⋮ Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial ⋮ When move acceptance selection hyper-heuristics outperform metropolis and elitist evolutionary algorithms and when not ⋮ Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint ⋮ Incremental cooperative coevolution for large-scale global optimization
