Runtime analysis of non-elitist populations: from classical optimisation to partial information
DOI10.1007/S00453-015-0103-XzbMATH Open1348.68225OpenAlexW2197473496MaRDI QIDQ306486FDOQ306486
Authors: Duc-Cuong Dang, Per Kristian Lehre 
Publication date: 31 August 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://eprints.nottingham.ac.uk/31142/
Recommendations
- Dynamic optimization of large-population systems with partial information
- Distributed optimization with information-constrained population dynamics
- Information-theoretic bounded rationality and \(\epsilon\)-optimality
- Complexity of non–adaptive optimization algorithms for a class of diffusions
- Selection of the best population: An information theoretic approach
- Functionals using bounded information and the dynamics of algorithms
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Randomized algorithms (68W20) Analysis of algorithms (68W40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probability and Computing
- Concentration of Measure for the Analysis of Randomized Algorithms
- Multiplicative drift analysis
- The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
- Evolutionary computation in practice
- Robustness of populations in stochastic environments
- Hitting-time and occupation-time bounds implied by drift analysis with applications
- Title not available (Why is that?)
- Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
- 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.
Cited In (17)
- A tight runtime analysis for the \((\mu + \lambda)\) EA
- How to escape local optima in black box optimisation: when non-elitism outperforms elitism
- Runtime analysis of competitive co-evolutionary algorithms for maximin optimisation of a bilinear function
- Populations can be essential in tracking dynamic optima
- Runtime analysis for self-adaptive mutation rates
- Exponential upper bounds for the runtime of randomized search heuristics
- Does comma selection help to cope with local optima?
- Choosing the right algorithm with hints from complexity theory
- Multiplicative up-drift
- Lower bounds from fitness levels made easy
- More precise runtime analyses of non-elitist evolutionary algorithms in uncertain environments
- Runtime analysis for permutation-based evolutionary algorithms
- On non-elitist evolutionary algorithms optimizing fitness functions with a plateau
- Analyzing randomized search heuristics via stochastic domination
- Hitting times of local and global optima in genetic algorithms with very high selection pressure
- The voting algorithm is robust to various noise models
- Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial
This page was built for publication: Runtime analysis of non-elitist populations: from classical optimisation to partial information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306486)
