Exchange Strategies for Multi-Colony Ant Algorithms in Dynamic Environments

In dynamic optimization problems where optimal solutions change over time, traditional ant colony optimization (ACO) algorithms face limitations. This study explores the adaptation of multi-colony ACO algorithms, known for their enhanced search capabilities in stationary problems, to tackle optimization problems in dynamic environments. Various strategies for exchanging information between colonies, which is a critical factor influencing algorithm performance, are investigated. Using the dynamic traveling salesman problem as a foundation, we generate test cases to reflect real-world complexities. Our results on a set of problem instances reveal that the choice of communication strategy between colonies significantly impacts the adaptability and efficiency of multi-colony ACO algorithms in tracking moving optimum.