Populations can be essential in tracking dynamic optima

DOI10.1007/s00453-016-0187-yzbMath1366.68258arXiv1607.03317OpenAlexW2474885930WikidataQ38660675 ScholiaQ38660675MaRDI QIDQ2362363

Duc-Cuong Dang, Per Kristian Lehre, Thomas Jansen

Publication date: 7 July 2017

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.03317

zbMATH Keywords

runtime analysisdynamic optimisationpopulation-based algorithm

Mathematics Subject Classification ID

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

Related Items

A runtime analysis of parallel evolutionary algorithms in dynamic optimization, Sorting by swaps with noisy comparisons, Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem

Cites Work

• Unnamed Item
• Unnamed Item
• Runtime analysis of non-elitist populations: from classical optimisation to partial information
• MMAS versus population-based EA on a family of dynamic fitness functions
• Evolutionary computation for dynamic optimization problems
• Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change
• Runtime analysis of ant colony optimization on dynamic shortest path problems
• Simplified drift analysis for proving lower bounds in evolutionary computation
• On the analysis of the \((1+1)\) evolutionary algorithm
• Upper and lower bounds for randomized search heuristics in black-box optimization
• (1+1) EA on Generalized Dynamic OneMax
• Probability and Computing