Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s00453-016-0187-y | Algorithmica |
Keywords | DocType | Volume |
Runtime analysis,Population-based algorithm,Dynamic optimisation | Journal | abs/1607.03317 |
Issue | ISSN | Citations |
2 | 0178-4617 | 7 |
PageRank | References | Authors |
0.48 | 16 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Duc-Cuong Dang | 1 | 190 | 13.08 |
| Thomas Jansen | 2 | 1285 | 95.80 |
| Per Kristian Lehre | 3 | 627 | 42.60 |