5f05ca25_on_and_Planning_Research_Group__Description
[Research Theme] Runtime Analysis. [Description] 
Most research about evolutionary algorithms and other randomised search heuristics is of an empirical nature. The theoretical understanding of these methods has been limited. We analyse the runtime (also called optimisation time) of randomised search heuristics mathematically using techniques from probability theory, randomised algorithms, and computational complexity. This type of analysis provides mathematically proven statements about the performance of randomised search heuristics. Such results give valuable insights into how the performance of a given randomised search heuristic depends on its parameter-settings and on the characteristics of the underlying optimisation problem.
Research Themes | Automated Scheduling, Optimisation and Planning Research Group
Description