InterCriteria Analysis of ACO start startegies

In combinatorial optimization, the goal is to find the optimal object from a finite set. Since such problems are hard to be solved, usually some metaheuristics is applied. One of the most successful techniques for a number of classes of problems is Ant Colony Optimization (ACO). Some start strategies can be applied, to the ACO algorithms, to improve their performance. Here, the InterCriteria Analysis (ICrA) is applied to the ACO algorithm. On the basis of the ICrA, we examine and analyse the ACO performance according to the different start strategies.