This paper presents an ant system algorithm for the graph coloring problem.
This ant system algorithm has several different features than previous ant
system algorithms for the coloring problem. Even with the lack of pheromone
laying capacity by the ants in the algorithm, the algorithm performed well on a
set of 50 representative graphs selected from a set of benchmark graphs.