A runtime analysis of parallel evolutionary algorithms in dynamic optimization

DOI10.1007/S00453-016-0262-4MaRDI QIDQ2362362zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Andrei Lissovoi, Carsten Witt

Publication date 7 July 2017

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

evolutionary algorithmsdynamic problemspopulationsruntime analysisisland models

Mathematics Subject Classification ID

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

Recommendations

• The impact of a sparse migration topology on the runtime of island models in dynamic optimization
• Design and analysis of migration in parallel evolutionary algorithms
• Analysis of speedups in parallel evolutionary algorithms and (1 + ) EAs for combinatorial optimization
• On the analysis of a dynamic evolutionary algorithm
• MMAS versus population-based EA on a family of dynamic fitness functions

Cites work

• scientific article; zbMATH DE number 2013543 (Why is no real title available?)
• scientific article; zbMATH DE number 5686753 (Why is no real title available?)
• (1+1) EA on Generalized Dynamic OneMax
• Adaptive drift analysis
• Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change
• Analysis of speedups in parallel evolutionary algorithms for combinatorial optimization (extended abstract)
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Design and analysis of migration in parallel evolutionary algorithms
• MMAS versus population-based EA on a family of dynamic fitness functions
• Metaheuristics for bi-level optimization
• Multiplicative drift analysis
• Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances
• Parallel metaheuristics: recent advances and new trends
• Populations can be essential in tracking dynamic optima
• The impact of a sparse migration topology on the runtime of island models in dynamic optimization
• Using Markov-chain mixing time estimates for the analysis of ant colony optimization

Cited in

(11)

• Analysis of speedups in parallel evolutionary algorithms and (1 + ) EAs for combinatorial optimization
• Analysing equilibrium states for population diversity
• The impact of a sparse migration topology on the runtime of island models in dynamic optimization
• scientific article; zbMATH DE number 6019547 (Why is no real title available?)
• On the impact of the migration topology on the island model
• A parallel evolutionary algorithm to optimize dynamic data types in embedded systems
• Parallel Evolutionary Algorithms Performing Pairwise Comparisons
• Design and analysis of migration in parallel evolutionary algorithms
• Foundations of Genetic Algorithms
• Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
• Runtime analysis of the ( + 1)-EA on the dynamic BinVal function

This page was built for publication: A runtime analysis of parallel evolutionary algorithms in dynamic optimization

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