An ant-based algorithm for coloring graphs

Authors:
Thang N. Bui;ThanhVu H. Nguyen;Chirag M. Patel;Kim-Anh T. Phan
Affiliations:
Computer Science Program, Penn State Harrisburg, Middletown, PA 17057, USA;Computer Science Program, Penn State Harrisburg, Middletown, PA 17057, USA;Transfer Technology, Inc. 423 Walnut Street PO Box 2677, Harrisburg, PA 17105, USA;Mekong Tech, LLC, Philadelphia, PA, USA
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 9
Cited 5

Using tabu search techniques for graph coloring

Computing
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
A still better performance guarantee for approximate graph coloring

Information Processing Letters
Free Bits, PCPs, and Nonapproximability---Towards Tight Results

SIAM Journal on Computing
The ant colony optimization meta-heuristic

New ideas in optimization
New methods to color the vertices of a graph

Communications of the ACM
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993

Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem

INFORMS Journal on Computing
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

Combinatorial optimization in system configuration design

Automation and Remote Control
Multi-route railroad blocking problem by improved model and ant colony algorithm in real world

Computers and Industrial Engineering
MTPSO algorithm for solving planar graph coloring problem

Expert Systems with Applications: An International Journal
Note: Three new upper bounds on the chromatic number

Discrete Applied Mathematics
Improving the extraction and expansion method for large graph coloring

Discrete Applied Mathematics

Quantified Score

Hi-index	0.05

Visualization

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.