LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Dang, Duc-Cuong; Jansen, Thomas; Lehre, Per Kristian (2016)
Publisher: Springer US
Journal: Algorithmica
Languages: English
Types: Article
Subjects: Applied Mathematics, Computer Science - Artificial Intelligence, Quantitative Biology - Populations and Evolution, Computer Science(all), Population-based algorithm, Dynamic optimisation, Computer Science Applications, Runtime analysis, Computer Science - Neural and Evolutionary Computing, Article
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.\ud \ud 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.

Share - Bookmark

Funded by projects

  • EC | SAGE

Related to

  • fet-fp7FET Open: FET Open FET Young Explorers
  • fet-fp7FET Open: Speed of Adaptation in Population Genetics and Evolutionary Computation

Cite this article