Analysis of Randomised Search Heuristics for Dynamic Optimisation

Thomas Jansen, Christine Zarges
2015 Evolutionary Computation  
Dynamic optimisation is an area of application where randomised search heuristics like evolutionary algorithms and artificial immune systems are often successful. The theoretical foundation of this important topic suffers from a lack of a generally accepted analytical framework as well as a lack of widely accepted example problems. This article tackles both problems by discussing necessary conditions for useful and practically relevant theoretical analysis as well as introducing a concrete
more » ... y of dynamic example problems that draws inspiration from a well-known static example problem and exhibits a bi-stable dynamic. After setting the stage this way the framework is made concrete by presenting the results of thorough theoretical and statistical analysis for mutation-based evolutionary algorithms and artificial immune systems.
doi:10.1162/evco_a_00164 pmid:26241197 fatcat:y2ossbibsrbx7j5ha4slgb2rsi