An ant-based algorithm for coloring graphs

Thang N. Bui, Thanh Vu H. Nguyen, Chirag M. Patel, Kim Anh T. Phan

Research output: Contribution to journalArticle

58 Scopus citations

Abstract

This paper presents an ant-based algorithm for the graph coloring problem. An important difference that distinguishes this algorithm from previous ant algorithms is the manner in which ants are used in the algorithm. Unlike previous ant algorithms where each ant colors the entire graph, each ant in this algorithm colors just a portion of the graph using only local information. These individual coloring actions by the ants form a coloring of the graph. Even with the lack of pheromone laying capacity by the ants, the algorithm performed well on a set of 119 benchmark graphs. Furthermore, the algorithm produced very consistent results, having very small standard deviations over 50 runs of each graph tested.

Original languageEnglish (US)
Pages (from-to)190-200
Number of pages11
JournalDiscrete Applied Mathematics
Volume156
Issue number2
DOIs
StatePublished - Jan 15 2008

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'An ant-based algorithm for coloring graphs'. Together they form a unique fingerprint.

  • Cite this