An Ant System Algorithm for Coloring Graphs

Thang N. Bui and Chirag M. Patel

To appear at Computational Symposium on Graph Coloring and Generalizations (COLOR02), Ithaca, NY, 7-8 September 2002

Abstract

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.

Server START Conference Manager
Update Time 23 Jul 2002 at 13:35:57
Maintainer trick@cmu.edu.
Start Conference Manager
Conference Systems