A runtime analysis of parallel evolutionary algorithms in dynamic optimization

DOI10.1007/s00453-016-0262-4zbMath1366.68269OpenAlexW2560124257WikidataQ57200551 ScholiaQ57200551MaRDI QIDQ2362362

Carsten Witt, Andrei Lissovoi

Publication date: 7 July 2017

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://europepmc.org/articles/pmc7010375

zbMATH Keywords

evolutionary algorithmsdynamic problemsisland modelsruntime analysispopulations

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Runtime analysis of the \((\mu + 1)\)-EA on the dynamic BinVal function, The impact of a sparse migration topology on the runtime of island models in dynamic optimization

Cites Work

• Unnamed Item
• Unnamed Item
• MMAS versus population-based EA on a family of dynamic fitness functions
• Metaheuristics for bi-level optimization
• Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances
• Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Design and analysis of migration in parallel evolutionary algorithms
• The impact of a sparse migration topology on the runtime of island models in dynamic optimization
• Adaptive drift analysis
• Multiplicative drift analysis
• Populations can be essential in tracking dynamic optima
• (1+1) EA on Generalized Dynamic OneMax
• Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization
• Parallel metaheuristics: recent advances and new trends
• Using markov-chain mixing time estimates for the analysis of ant colony optimization