Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change

DOI10.1016/J.TCS.2014.10.028zbMATH Open1303.68124OpenAlexW4253706688MaRDI QIDQ477083FDOQ477083

Authors: Pietro S. Oliveto, Christine Zarges 

Publication date: 2 December 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.028

Recommendations

• Comparison of simple diversity mechanisms on plateau functions
• On the analysis of a dynamic evolutionary algorithm
• scientific article; zbMATH DE number 2013506
• Runtime analysis of the \((\mu + 1)\)-EA on the dynamic BinVal function
• Populations can be essential in tracking dynamic optima

zbMATH Keywords

populationsruntime analysisdiversity mechanismsevolutionary dynamic optimisation

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)

Cites Work

• Title not available (Why is that?)
• Real royal road functions for constant population size
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Drift analysis and average time complexity of evolutionary algorithms
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Analyzing evolutionary algorithms. The computer science perspective.
• Evolutionary multi-objective optimization in uncertain environments. Issues and algorithms
• On the analysis of the \((1+1)\) evolutionary algorithm
• Title not available (Why is that?)
• Designing evolutionary algorithms for dynamic environments.
• Comparison of simple diversity mechanisms on plateau functions

Cited In (8)

• Analysing equilibrium states for population diversity
• Populations can be essential in tracking dynamic optima
• MMAS versus population-based EA on a family of dynamic fitness functions
• A runtime analysis of parallel evolutionary algorithms in dynamic optimization
• Analysis of the clearing diversity-preserving mechanism
• Runtime analysis of RLS and \((1 + 1)\) EA for the dynamic weighted vertex cover problem
• Comparison of simple diversity mechanisms on plateau functions
• On the benefits and risks of using fitness sharing for multimodal optimisation

This page was built for publication: Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change

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