Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets

DOI10.1145/1967654.1967665MaRDI QIDQ5276091zbMATH OpenOpenAlexFDO

Authors Benjamin Doerr, Daniel Johannsen, Martin Schmidt

Publication date 14 July 2017

Published in Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1967654.1967665

zbMATH Keywords

drift analysisevolutionary algorithmruntime analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Combining Markov-chain analysis and drift analysis. The \((1+1)\) evolutionary algorithm on linear functions reloaded
• On the analysis of the \((1+1)\) evolutionary algorithm
• Multiplicative drift analysis
• scientific article; zbMATH DE number 1696516
• Drift analysis and evolutionary algorithms revisited

Cited in

(6)

• Static and self-adjusting mutation strengths for multi-valued decision variables
• scientific article; zbMATH DE number 2086436 (Why is no real title available?)
• Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem
• Estimation-of-distribution algorithms for multi-valued decision variables
• Analysis and optimization of probabilities of beneficial mutation and crossover recombination in a Hamming space
• Runtime analysis of the (1+1) EA on computing unique input output sequences

This page was built for publication: Runtime analysis of the \((1+1)\) evolutionary algorithm on strings over finite alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5276091)