Toward Better Performance of ColorAnt ACO Algorithm

Abstract

This paper presents the Color Ant-RT algorithm version 3, an algorithm for graph coloring problems which is based on the Ant Colony Optimization metaheuristic and uses Tabu Search as local search. The experiments demonstrated that ColorAnt3-RT is a promising option in finding good approximations to the best known results for geometric random, geometric standard and le450 graphs of DIMACS benchmark in an acceptable runtime, also, it is good in minimizing the amount of conflicts, the main problem of graph coloring with a fixed number of colors.