Information Theoretic Measures for Ant Colony Optimization

We survey existing measures to analyze the search behavior of Ant Colony Optimization (ACO) algorithms and introduce a new uncertainty measure for characterizing three ACO variants. Unlike previous measures, the group uncertainty allows for quantifying the exploration of the search space with respect to the group assignment. We use the group uncertainty to analyze the search behavior of Group-Based Ant Colony Optimization.