Abstract
We introduce two novel evolutionary formulations of the problem of coloring the nodes of a graph. The first formulation is based on the relationship that exists between a graph's chromatic number and its acyclic orientations. It views such orientations as individuals and evolves them with the aid of evolutionary operators that are very heavily based on the structure of the graph and its acyclic orientations. The second formulation, unlike the first one, does not tackle one graph at a time, but rather aims at evolving a “program” to color all graphs belonging to a class whose members all have the same number of nodes and other common attributes. The heuristics that result from these formulations have been tested on some of the Second DIMACS Implementation Challenge benchmark graphs, and have been found to be competitive when compared to the several other heuristics that have also been tested on those graphs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Arora and C. Lund, “Hardness of approximations,” in Approximation Algorithms for NP-Hard Problems, D.S. Hochbaum (Ed.), PWS Publishing Company: Boston, MA, 1997, pp. 399–446.
G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi, Complexity and Approximation, Springer-Verlag: Berlin, Germany, 1999.
W. Banzhaf, P. Nordin, R.E. Keller, and F.D. Francone, Genetic Programming: An Introduction, Morgan Kaufmann Publishers: San Francisco, CA, 1998.
V.C. Barbosa, An Atlas of Edge-Reversal Dynamics, Chapman & Hall/CRC: London, UK, 2000.
V.C. Barbosa and E. Gafni, “A distributed implementation of simulated annealing,” J. of Parallel and Distributed Computing, vol. 6, pp. 411–434, 1989.
M. Bellare, O. Goldreich, and M. Sudan, “Free bits, PCPs, and nonapproximability—towards tight results,” SIAM J. on Computing, vol. 27, pp. 804–915, 1998.
J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, North-Holland: New York, NY, 1976.
D. Brélaz, “New methods to color vertices of a graph,” Comm. of the ACM, vol. 22, pp. 251–256, 1979.
F.C. Chow and J.L. Hennessy, “The priority-based coloring approach to register allocation,” ACM Trans. on Programming Languages and Systems, vol. 12, pp. 501–536, 1990.
T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed., The MIT Press: Cambridge, MA, 2001.
J.C. Culberson and F. Luo, “Exploring the k-colorable landscape with Iterated Greedy,” in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), American Mathematical Society: Providence, RI, 1996, pp. 245–284.
D. de Werra, “An introduction to timetabling,” European J. of Operational Research, vol. 19, pp. 151–162, 1985.
R.W. Deming, “Acyclic orientations of a graph and chromatic and independence numbers,” J. of Combinatorial Theory B, vol. 26, pp. 101–110, 1979.
A.E. Eiben, J.K. van der Hauw, and J.I. van Hemert, “Graph coloring with adaptive evolutionary algorithms,” J. of Heuristics, vol. 4, pp. 25–46, 1998.
C. Fleurent and J. Ferland, “Genetic and hybrid algorithms for graph coloring,” Annals of Operations Research, vol. 63, pp. 437–461, 1996a.
C. Fleurent and J.A. Ferland, “Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability,” in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), American Mathematical Society: Providence, RI, 1996b, pp. 619–652.
D.B. Fogel, Evolutionary Computation, IEEE Press: New York, NY, 1995.
P. Galinier and J.-K. Hao, “Hybrid evolutionary algorithms for graph coloring,” J. of Combinatorial Optimization, vol. 3, pp. 379–397, 1999.
A. Gamst, “Some lower bounds for a class of frequency assignment problems,” IEEE Trans. on Vehicular Technology, vol. 35, pp. 8–14, 1986.
M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman: New York, NY, 1979.
M.R. Garey, D.S. Johnson, and H.C. So, “An application of graph coloring to printed circuit testing,” IEEE Trans. on Circuits and Systems, vol. CAS-23, pp. 591–599, 1976.
F. Glover and M. Laguna, Tabu Search, Kluwer Academic Publishers: Boston, MA, 1997.
F. Glover, M. Parker, and J. Ryan, “Coloring by tabu branch and bound,” in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), American Mathematical Society: Providence, RI, 1996, pp. 285–307.
D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Publishing Company: Reading, MA, 1989.
D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon, “Optimization by simulated annealing: an experimental evaluation; part ii, graph coloring and number partitioning,” Operations Research, vol. 39, pp. 378–406, 1991.
D.S. Johnson and M.A. Trick (Eds.), Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, American Mathematical Society: Providence, RI, 1996.
R.M. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations, R.E. Miller and J.W. Thatcher (Eds.), Plenum Press: New York, NY, 1972, pp. 85–103.
J.R. Koza, Genetic Programming, The MIT Press: Cambridge, MA, 1992.
F.T. Leighton, “A graph coloring algorithm for large scheduling problems,” J. of Research of the National Bureau of Standards, vol. 84, pp. 489–505, 1979.
G. Lewandowski and A. Condon, “Experiments with parallel graph coloring heuristics and applications of graph coloring,” in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), American Mathematical Society: Providence, RI, 1996, pp. 309–334.
B.D. McKay, “Isomorph-free exhaustive generation,” J. of Algorithms, vol. 26, pp. 306–324, 1998.
Z. Michalewicz and D.B. Fogel, How to Solve It: Modern Heuristics, Springer-Verlag: Berlin, Germany, 2000.
M. Mitchell, An Introduction to Genetic Algorithms, The MIT Press: Cambridge, MA, 1996.
C. Morgenstern, “Distributed coloration neighborhood search,” in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), American Mathematical Society: Providence, RI, 1996, pp. 335–357.
Y. Saad, Iterative Methods for Sparse Linear Systems, PWS Publishing Company: Boston, MA, 1996.
E.C. Sewell, “An improved algorithm for exact graph coloring,” in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), American Mathematical Society: Providence, RI, 1996, pp. 359–373.
R.P. Stanley, “Acyclic orientations of graphs,” Discrete Mathematics, vol. 5, pp. 171–178, 1973.
M.A. Trick, “Appendix: Second DIMACS Challenge test problems,” in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), American Mathematical Society: Providence, RI, 1996, pp. 653–657.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Barbosa, V.C., Assis, C.A. & Do Nascimento, J.O. Two Novel Evolutionary Formulations of the Graph Coloring Problem. Journal of Combinatorial Optimization 8, 41–63 (2004). https://doi.org/10.1023/B:JOCO.0000021937.26468.b2
Issue Date:
DOI: https://doi.org/10.1023/B:JOCO.0000021937.26468.b2