Optimization by ant algorithms: possible roles for an individual ant

In most ant algorithms, the role of each ant is to build a solution in a constructive way, basing each decision on the greedy force and the trails. However, different roles are possible for each individual ant, ranging from a negligible help in the decision process to a refined local search heuristic. In this paper, the importance of the role assigned to each ant is discussed. Three general ant methodologies are presented. Comparative results are analyzed for the well-known graph coloring problem.