On the behaviour of extremal optimisation when solving problems with hidden dynamics

Abstract

Solving dynamic combinatorial problems poses a particular challenge to optimisation algorithms. Optimising a problem that does not notify the solver when a change has been made is very difficult for most well-known algorithms. Extremal Optimisation is a recent addition to the group of biologically inspired optimisation algorithms. Due to Its extremely simple functionality, it Is likely that the algorithm can be applied successfully in such a dynamic environment. This document examines the capabilities of Extremal Optimisation to solve a dynamic problem with a large variety of different changes that are not explicitly announced to the solver. © Springer-Verlag Berlin Heidelberg 2006.