How to analyse evolutionary algorithms.

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

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

Publication date: 21 January 2003

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00137-8

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Randomized algorithms (68W20)

Related Items (21)

A new simple, fast and efficient algorithm for global optimization over continuous search-space problems: radial movement optimization ⋮ Convergence analysis of a self-adaptive multi-objective evolutionary algorithm based on grids ⋮ Analysis of evolutionary algorithms for the longest common subsequence problem ⋮ A new approach to estimating the expected first hitting time of evolutionary algorithms ⋮ A rigorous analysis of the compact genetic algorithm for linear functions ⋮ Randomized local search, evolutionary algorithms, and the minimum spanning tree problem ⋮ The use of tail inequalities on the probable computational time of randomized search heuristics ⋮ Convergence of multi-objective evolutionary algorithms to a uniformly distributed representation of the Pareto front ⋮ Evolutionary algorithms for quantum computers ⋮ A framework for evolutionary algorithms based on Charles Sanders Peirce's evolutionary semiotics ⋮ Evolutionary algorithms and dynamic programming ⋮ PREDICTION OF SEVERE THUNDERSTORMS WITH MINIMALA PRIORIINFORMATION ⋮ Drift conditions for estimating the first hitting times of evolutionary algorithms ⋮ Customized crossover in evolutionary sets of safe ship trajectories ⋮ Mathematical analysis of the cumulative effect of novel ternary crossover operator and mutation on probability of survival of a schema ⋮ 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 ⋮ autoBOT: evolving neuro-symbolic representations for explainable low resource text classification ⋮ 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
• A computational view of population genetics
• 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

This page was built for publication: How to analyse evolutionary algorithms.