Robustness of populations in stochastic environments
From MaRDI portal
Publication:306488
DOI10.1007/s00453-015-0072-0zbMath1360.68778MaRDI QIDQ306488
Christian Gießen, Timo Kötzing
Publication date: 31 August 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-015-0072-0
68Q25: Analysis of algorithms and problem complexity
68T05: Learning and adaptive systems in artificial intelligence
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Self-adaptation Can Improve the Noise-tolerance of Evolutionary Algorithms, The cost of randomness in evolutionary algorithms: crossover can save random bits, More precise runtime analyses of non-elitist evolutionary algorithms in uncertain environments, Runtime analysis of non-elitist populations: from classical optimisation to partial information, Robustness of populations in stochastic environments, Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise, Sorting by swaps with noisy comparisons, Running time analysis of the (1+1)-EA for robust linear optimization, Working principles of binary differential evolution, Modeling the dynamics of a changing range genetic algorithm in noisy environments, Analysis of the \((1 + 1)\) EA on subclasses of linear functions under uniform and linear constraints, Exponential upper bounds for the runtime of randomized search heuristics, Multiplicative up-drift, Runtime analyses of the population-based univariate estimation of distribution algorithms on LeadingOnes, Analysis of noisy evolutionary optimization when sampling fails, Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial, A tight runtime analysis for the \((\mu + \lambda)\) EA, The voting algorithm is robust to various noise models
Cites Work
- Robustness of populations in stochastic environments
- Simplified drift analysis for proving lower bounds in evolutionary computation
- A survey on metaheuristics for stochastic combinatorial optimization
- A study of drift analysis for estimating computation time of evolutionary algorithms
- Simulated annealing for noisy cost functions
- A simple ant colony optimizer for stochastic shortest path problems
- Multiplicative drift analysis
- The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
- Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links
- Optimizing expected path lengths with ant colony optimization using fitness proportional update
- Stochastic Algorithms: Foundations and Applications
