In recent years Ant Colony Optimisation (ACO) algorithms have been applied to more challenging and complex problem domains. One such domain" which is suggested in  is dynamic problems. The majority of dynamic problems addressed using biologically inspired computation techniques are from the general field of Operations Research and are usually modifications of popular static problem domains such as the travelling salesman problem and the vehicle routing problem. This document aims to summarise the current state of the field with regard to ACO algorithms and their application to dynamic problems. The document will attempt to answer questions such as: (1) What general algorithmic characteristics do these novel approaches deem most important when addressing dynamic problems? (2) What utility do these dynamic algorithms offer over standard approaches? To address these questions several recent research papers have been reviewed and relevant findings presented.