When do evolutionary algorithms optimize separable functions in parallel?

DOI10.1145/2460239.2460245MaRDI QIDQ5276110zbMATH OpenOpenAlexWikidataFDO

Authors Benjamin Doerr, Dirk Sudholt, Carsten Witt

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

zbMATH Keywords

linear functionspseudo-Boolean optimizationruntime analysisseparable functionstheory

Mathematics Subject Classification ID

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

Recommendations

• On the analysis of the \((1+1)\) evolutionary algorithm
• A parallel global optimization algorithm for rational separable- factorable functions
• On the analysis of a dynamic evolutionary algorithm
• scientific article; zbMATH DE number 2013477
• On the analysis of a simple evolutionary algorithm on quadratic pseudo-Boolean functions

Cited in

(6)

• Incremental cooperative coevolution for large-scale global optimization
• Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint
• 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
• Do additional optima speed up evolutionary algorithms?

This page was built for publication: When do evolutionary algorithms optimize separable functions in parallel?

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