Solving dynamic combinatorial problems poses a particular challenge to optimisation algorithms. Optimising a dynamic 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, while Ant Colony System has been used to solve a large variety of problem types in static and dynamic contexts. Both algorithms seem well suited to solving problems with hidden dynamics. We present a performance comparison of the two algorithms and endeavour to highlight particular strengths and weaknesses observed with different types of dynamic problem changes.