Comparison of simple diversity mechanisms on plateau functions

DOI10.1016/j.tcs.2008.08.021zbMath1172.68053OpenAlexW2040330399MaRDI QIDQ1029353

Frank Neumann, Nils Hebbinghaus, Tobias Friedrich

Publication date: 10 July 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.08.021

zbMATH Keywords

evolutionary algorithmsdiversityruntime analysis

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Plateaus can be harder in multi-objective optimization ⋮ On benefits and drawbacks of aging strategies for randomized search heuristics ⋮ Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change

Cites Work

• Unnamed Item
• Unnamed Item
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• On the analysis of the \((1+1)\) evolutionary algorithm
• The analysis of evolutionary algorithms -- A proof that crossover really can help
• Expected runtimes of evolutionary algorithms for the Eulerian cycle problem
• STACS 2005
• Drift analysis and average time complexity of evolutionary algorithms

This page was built for publication: Comparison of simple diversity mechanisms on plateau functions