(1+1) EA on Generalized Dynamic OneMax

DOI10.1145/2725494.2725502MaRDI QIDQ2981881zbMATH OpenOpenAlexWikidataFDO

Authors Timo Kötzing, Andrei Lissovoi, Carsten Witt

Publication date 10 May 2017

Published in Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII (Search for Journal in Brave)

Full work available at URL https://orbit.dtu.dk/en/publications/54479c6c-a7af-4fe0-afbc-d9b70b62c2d8

zbMATH Keywords

driftdynamic optimizationevolutionary computation

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

• scientific article; zbMATH DE number 2013543
• Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise
• Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools
• scientific article; zbMATH DE number 7204473
• On one problem of the dynamic optimization
• On a generalization of the -algorithm
• Some generalized fixed point results with applications to dynamic programming
• The 1‐minimax and 1‐maximin problems with demand weights of general probability distributions
• On the convergence of one-dimensional simplex search
• Generalized dynamic programming: Two new applications

Cites work

• Absorption time of the Moran process
• Approximating fixation probabilities in the generalized Moran process
• scientific article; zbMATH DE number 3148873 (Why is no real title available?)
• On the fixation probability of superstars

Cited in

(26)

• The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
• Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise
• Sorting by swaps with noisy comparisons
• Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
• The impact of a sparse migration topology on the runtime of island models in dynamic optimization
• Static and self-adjusting mutation strengths for multi-valued decision variables
• Markov chain analysis of evolutionary algorithms on OneMax function -- from coupon collector's problem to (1 + 1) EA
• Running time analysis of the (1+1)-EA for robust linear optimization
• Result diversification by multi-objective evolutionary algorithms with theoretical guarantees
• Analysis of the (1 + 1) EA on subclasses of linear functions under uniform and linear constraints
• Runtime analysis of RLS and (1 + 1) EA for the dynamic weighted vertex cover problem
• Runtime analysis of the ( + 1)-EA on the dynamic BinVal function
• Multiplicative up-drift
• A runtime analysis of parallel evolutionary algorithms in dynamic optimization
• Populations can be essential in tracking dynamic optima
• On the analysis of a dynamic evolutionary algorithm
• Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem
• Runtime analysis for self-adaptive mutation rates
• scientific article; zbMATH DE number 2013543 (Why is no real title available?)
• Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools
• First Steps Towards a Runtime Analysis of Neuroevolution
• Runtime Analysis of a Co-Evolutionary Algorithm
• More precise runtime analyses of non-elitist evolutionary algorithms in uncertain environments
• Estimation-of-distribution algorithms for multi-valued decision variables
• A runtime analysis of the multi-valued compact genetic algorithm on generalized \textsc{LeadingOnes}
• Selection hyper-heuristics can automatically adjust the learning period to optimally solve pseudo-Boolean problems

This page was built for publication: (1+1) EA on Generalized Dynamic OneMax

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