Runtime Analysis of Non-elitist Populations: From Classical Optimisation to Partial Information
- 9 February 2016
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 75 (3) , 428-461
Abstract
No abstract availableKeywords
Funding Information
- Seventh Framework Programme (BE) (618091)
This publication has 31 references indexed in Scilit:
- The choice of the offspring population size in the () evolutionary algorithmTheoretical Computer Science, 2014
- Multiplicative Drift AnalysisAlgorithmica, 2012
- Surrogate-assisted evolutionary computation: Recent advances and future challengesSwarm and Evolutionary Computation, 2011
- Evolutionary Optimization in Uncertain Environments—A SurveyIEEE Transactions on Evolutionary Computation, 2005
- Analysis of the (1 + 1) EA for a Noisy OneMax2004
- Analysis of the (1+1) EA for a Dynamically Bitwise Changing OneMax2003
- From an individual to a population: an analysis of the first hitting time of population-based evolutionary algorithmsIEEE Transactions on Evolutionary Computation, 2002
- Drift analysis and average time complexity of evolutionary algorithmsArtificial Intelligence, 2001
- Genetic Algorithms, Selection Schemes, and the Varying Effects of NoiseEvolutionary Computation, 1996
- Hitting-time and occupation-time bounds implied by drift analysis with applicationsAdvances in Applied Probability, 1982