Ant Colony Optimization in a Changing Environment

Ant colony optimization (ACO) algorithms are computational problem-solving methods that are inspired by the complex behaviors of ant colonies; specifically, the ways in which ants interact with each other and their environment to optimize the overall performance of the ant colony. Our eventual goal is to develop and experiment with ACO methods that can more effectively adapt to dynamically changing environments and problems. We describe biological ant systems and the dynam-ics of their environments and behaviors. We then introduce a family of dynamic ACO algorithms that can handle dy-namic modifications of their inputs. We report empirical re-sults, showing that dynamic ACO algorithms can effectively adapt to time-varying environments