An adaptive memory algorithm for the k-coloring problem

Discrete Applied Mathematics

Volumn 156, Issue 2, 2008, Pages 267-279

  Galinier, Philippe ^a   Hertz, Alain ^a   Zufferey, Nicolas ^b  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

^b UNIVERSITÉ LAVAL   (Canada)

Author keywords

Adaptive memory algorithms; Graph coloring; Hybrid evolutionary heuristics; Tabu search

Indexed keywords

GRAPH THEORY; HEURISTIC ALGORITHMS; HYBRID COMPUTERS; PROBLEM SOLVING; TABU SEARCH;

ADAPTIVE MEMORY ALGORITHMS; GRAPH COLORING; HYBRID EVOLUTIONARY HEURISTICS; LOCAL SEARCH ALGORITHM;

ADAPTIVE ALGORITHMS;

EID: 37049006713     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.07.017     Document Type: Article

References (19)

1. I. Bloechliger, N. Zufferey, A graph coloring heuristic using partial solutions and a reactive tabu scheme, Comput. Oper. Res. 2007, to appear.
2. Brélaz D. New methods to color vertices of a graph. Commun. ACM 22 (1979) 251-256
3. Brown J.R. Chromatic scheduling and the chromatic number problem. Management Sci. 19 (1972) 456-463
4. Calegari P., Coray C., Hertz A., Kobler D., and Kuonen P. A taxonomy of evolutionary algorithms in combinatorial optimization. J. Heuristics 5 (1999) 145-158
5. Chams M., Hertz A., and de Werra D. Some experiments with simulated annealing for coloring graphs. European J. Oper. Res. 32 (1987) 260-266
6. Costa D., Hertz A., and Dubuis O. Embedding of a sequential algorithm within an evolutionary algorithm for coloring problems in graphs. J. Heuristics 1 (1995) 105-128
7. R. Dorne, J.-K Hao, A new genetic local search algorithm for graph coloring, Lecture Notes in Computer Science 1498, Springer, Berlin, Germany, 1998, p. 745-754.
8. Fleurent C., and Ferland J.A. Genetic and hybrid algorithms for graph coloring. Ann. Oper. Res. 63 (1996) 437-461
9. Garey M., and Johnson D. Computers and Intractability: a Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Company, New York
10. Galinier P., and Hao J.K. Hybrid evolutionary algorithms for graph coloring. J. Combin. Optim. 3 (1999) 379-397
11. Galinier P., and Hertz A. A survey of local search methods for graph coloring. Comput. Oper. Res. 33 (2006) 2547-2562
12. Hertz A. A colorful look on evolutionary techniques. Belgian J. Oper. Res. 35 (1997) 23-39
13. Hertz A., and Kobler D. A Framework for the description of evolutionary algorithms. European J. Oper. Res. 126 (2000) 1-12
14. Hertz A., and de Werra D. Using Tabu search techniques for graph coloring. Computing 39 (1987) 345-351
15. Johnson D.S., Aragon C.R., McGeoch L.A., and Schevon C. Optimization by simulated annealing: an experimental evaluation, Part II; graph coloring and number partitioning. Oper. Res. 39 (1991) 378-406
16. D.S. Johnson, M.A. Trick (Eds.), Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol 26, The American Mathematical Society, Providence, RI, 1996.
17. Peemöller J. A correction to Brélaz's modification of Brown's coloring algorithm. Commun. ACM 26 (1983) 593-597
18. Rochat Y., and Taillard E. Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1 (1995)
19. de Werra D. Heuristics for graph coloring. Computing 7 (1990) 191-208