A GRASP for Coloring Sparse Graphs

We first present a literature review of heuristics and metaheuristics developed for the problem of coloring graphs. We then present a Greedy Randomized Adaptive Search Procedure (GRASP) for coloring sparse graphs. The procedure is tested on graphs of known chromatic number, as well as random graphs with edge probability 0.1 having from 50 to 500 vertices. Empirical results indicate that the proposed GRASP implementation compares favorably to classical heuristics and implementations of simulated annealing and tabu search. GRASP is also found to be competitive with a genetic algorithm that is considered one of the best currently available for graph coloring.

[1]  P. Pardalos,et al.  The Graph Coloring Problem: A Bibliographic Survey , 1998 .

[2]  Charles Fleurent,et al.  Genetic and hybrid algorithms for graph coloring , 1996, Ann. Oper. Res..

[3]  B. Bollobás,et al.  Random Graphs of Small Order , 1985 .

[4]  D. J. A. Welsh,et al.  An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..

[5]  D. Werra,et al.  Some experiments with simulated annealing for coloring graphs , 1987 .

[6]  Anne Condon,et al.  Experiments with parallel graph coloring heuristics and applications of graph coloring , 1993, Cliques, Coloring, and Satisfiability.

[7]  Alain Hertz,et al.  Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs , 1995, J. Heuristics.

[8]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[9]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[10]  Frank Thomson Leighton,et al.  A Graph Coloring Algorithm for Large Scheduling Problems. , 1979, Journal of research of the National Bureau of Standards.

[11]  A. Jagota.  An adaptive, multiple restarts neural network algorithm for graph coloring , 1996 .

[12]  Kathryn E. Stecke,et al.  Design, planning, scheduling, and control problems of flexible manufacturing systems , 1985 .

[13]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[14]  J. J. Moré,et al.  Estimation of sparse jacobian matrices and graph coloring problems , 1983 .

[15]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[16]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[17]  David C. Wood,et al.  A technique for colouring a graph applicable to large scale timetabling problems , 1969, Computer/law journal.

[18]  Daniel Costa,et al.  An Evolutionary Tabu Search Algorithm And The NHL Scheduling Problem , 1995 .

[19]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[20]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[21]  Jano I. van Hemert,et al.  Graph Coloring with Adaptive Evolutionary Algorithms , 1998, J. Heuristics.