How to analyse evolutionary algorithms.

DOI10.1016/S0304-3975(02)00137-8zbMath1061.90119MaRDI QIDQ1853459

Ingo Wegener, Hans-Georg Beyer, Hans-Paul Schwefel

Publication date: 21 January 2003

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

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

68W20: Randomized algorithms

Related Items

PREDICTION OF SEVERE THUNDERSTORMS WITH MINIMALA PRIORIINFORMATION, A rigorous analysis of the compact genetic algorithm for linear functions, Randomized local search, evolutionary algorithms, and the minimum spanning tree problem, A new approach to estimating the expected first hitting time of evolutionary algorithms, Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem, Recent advances in evolutionary computation, Comparing evolutionary algorithms to the (\(1+1\))-EA, Population size versus runtime of a simple evolutionary algorithm, Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing

Cites Work

• Evolutionary algorithms. The role of mutation and recombination
• On the analysis of the \((1+1)\) evolutionary algorithm
• Evolution strategies. A comprehensive introduction
• On the analysis of a simple evolutionary algorithm on quadratic pseudo-Boolean functions
• Performance analysis of evolution strategies with multi-recombination in high-dimensional \(\mathbb R^N\)-search spaces disturbed by noise.
• Real royal road functions -- where crossover provably is essential
• On the analysis of a dynamic evolutionary algorithm
• Models of evolution
• On Linear Convergence of a Class of Random Search Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item