Duc-Cuong Dang firstname.lastname@example.org
Populations can be essential in tracking dynamic optima
Dang, Duc-Cuong; Jansen, Thomas; Lehre, Per Kristian
Thomas Jansen email@example.com
Per Kristian Lehre PerKristian.Lehre@nottingham.ac.uk
Real-world optimisation problems are often dynamic. Previously good solutions must be updated or replaced due to changes in objectives and constraints. It is often claimed that evolutionary algorithms are particularly suitable for dynamic optimisation because a large population can contain different solutions that may be useful in the future. However, rigorous theoretical demonstrations for how populations in dynamic optimisation can be essential are sparse and restricted to special cases.
This paper provides theoretical explanations of how populations can be essential in evolutionary dynamic optimisation in a general and natural setting. We describe a natural class of dynamic optimisation problems where a sufficiently large population is necessary to keep track of moving optima reliably. We establish a relationship between the population-size and the probability that the algorithm loses track of the optimum.
|Journal Article Type||Article|
|Peer Reviewed||Peer Reviewed|
|APA6 Citation||Dang, D., Jansen, T., & Lehre, P. K. (in press). Populations can be essential in tracking dynamic optima. Algorithmica, https://doi.org/10.1007/s00453-016-0187-y|
|Keywords||Runtime Analysis, Population-based Algorithm, Dynamic Optimisation|
|Copyright Statement||Copyright information regarding this work can be found at the following address: http://eprints.nottingh.../end_user_agreement.pdf|
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf
You might also like
Self-adaptation of mutation rates in non-elitist populations