On the analysis of a dynamic evolutionary algorithm

DOI10.1016/j.jda.2005.01.002zbMath1128.68118OpenAlexW2015122083MaRDI QIDQ2466004

Ingo Wegener, Thomas Jansen

Publication date: 11 January 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2005.01.002

zbMATH Keywords

evolutionary algorithmsmutation probabilityrun time analysistime-dependent parameter setting

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (10)

Fixed-target runtime analysis ⋮ Runtime analysis for self-adaptive mutation rates ⋮ Analyzing randomized search heuristics via stochastic domination ⋮ Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations ⋮ Exponential upper bounds for the runtime of randomized search heuristics ⋮ The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate ⋮ A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation ⋮ Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm ⋮ Static and self-adjusting mutation strengths for multi-valued decision variables ⋮ How to analyse evolutionary algorithms.

Cites Work

• On the analysis of the \((1+1)\) evolutionary algorithm
• On the analysis of a simple evolutionary algorithm on quadratic pseudo-Boolean functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the analysis of a dynamic evolutionary algorithm