On the Brittleness of Evolutionary Algorithms

DOI10.1007/978-3-540-73482-6_4zbMath1196.68193OpenAlexW4206905063MaRDI QIDQ5758031

Thomas Jansen

Publication date: 7 September 2007

Published in: Foundations of Genetic Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73482-6_4

Mathematics Subject Classification ID

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

Related Items (10)

Drift Analysis and Evolutionary Algorithms Revisited ⋮ Self-adjusting population sizes for the (1,\( \lambda )\)-EA on monotone functions ⋮ OneMax is not the easiest function for fitness improvements ⋮ Two-dimensional drift analysis: optimizing two functions simultaneously can be hard ⋮ Runtime analysis of the \((1+1)\) EA on computing unique input output sequences ⋮ Exponential upper bounds for the runtime of randomized search heuristics ⋮ Runtime analysis of the \((\mu + 1)\)-EA on the dynamic BinVal function ⋮ Multiplicative up-drift ⋮ Exponential slowdown for larger populations: the \(( \mu + 1)\)-EA on monotone functions ⋮ Theoretical Analysis of Local Search in Software Testing

This page was built for publication: On the Brittleness of Evolutionary Algorithms