A graph coloring heuristic using partial solutions and a reactive tabu scheme

Computers and Operations Research

Volumn 35, Issue 3, 2008, Pages 960-975

  Blöchliger, Ivo ^a   Zufferey, Nicolas ^b  

^a EPFL   (Switzerland)

^b UNIVERSITÉ LAVAL   (Canada)

Author keywords

Combinatorial optimization; Graph coloring; Tabu search

Indexed keywords

EVOLUTIONARY ALGORITHMS; GRAPH THEORY; HEURISTIC ALGORITHMS; SET THEORY; TABU SEARCH;

BENCHMARK GRAPHS; EVOLUTIONARY HEURISTICS; GRAPH COLORING; TABU ALGORITHMS; UNCOLORED VERTICES;

COMBINATORIAL OPTIMIZATION;

EID: 34548389659     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.05.014     Document Type: Article

References (31)

1. Garey M., and Johnson D.S. Computer and intractability (1979), Freeman, San Francisco
2. Chaitin G.J. Register allocation and spilling via graph coloring. Proceedings of ACM SIGPLAN 82 symposium on compiler construction (1982) 98-105
3. Gamst A., and Rave W. On the frequency assignment in mobile automatic telephone systems. Proceedings of GLOBECOM'92 (1992) 309-315
4. Leighton F.T. A graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau Standard 84 (1979) 489-505
5. Zufferey N. Heuristiques pour les Problèmes de la Coloration des Sommets d'un Graphe et d'Affectation de Fréquences avec Polarités. PhD Thesis, École Polytechnique Fédérale de Lausanne (EPFL), Lausanne; 2002.
6. Hertz A. Application des Métaheuristiques à la Coloration des Sommets d'un Graphe. Traités IC2 Hermès, 2003. Chapitre 3 dans Métaheuristiques et outils nouveaux en recherche opérationnelle.
7. Mehrotra A., and Trick M. A column generation approach for graph coloring. INFORMS Journal On Computing 8 4 (1996) 344-354
8. Peeöller J. A correction to Brélaz's modification of Brown's coloring algorithm. Communications of the ACM 26 (1983) 593-597
9. Dimacs graph coloring benchmarks, 〈http://mat.gsia.cmu.edu/COLORING02/〉. Webpage.
10. Galinier P., and Hao J.-K. Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization 3 (1999) 379-397
11. Malaguti E, Monaci M, Toth P. A metaheuristic approach for the vertex coloring problem. Technical report OR/05/3, DEIS-University of Bologna, Italy; 2005.
12. Glover F. Tabu search-part I. ORSA Journal on Computing 1 (1989) 190-205
13. Glover F. Tabu search-part II. ORSA Journal on Computing 2 (1990) 4-32
14. Hansen P. The steepest ascent mildest descent heuristic for combinatorial programming. Congress on numerical methods in combinatorial optimization. Capri, Italy (1986)
15. Glover F., and Laguna M. Tabu search (1997), Kluwer Academic Publishers, Boston
16. Hertz A., and de Werra D. Using tabu search techniques for graph coloring. Computing 39 (1987) 345-351
17. Morgenstern C. Distributed coloration neighborhood search. Discrete Mathematics and Theoretical Computer Science 26 (1996) 335-358
18. Aardal K.I., van Hoesel S.P.M., Koster A.M.C.A., Mannino C., and Sassano A. Models and solution techniques for frequency assignment problems. 4OR 1 4 (2003) 261-317
19. Brélaz D. New methods to color vertices of a graph. Communications of the Association for Computing Machinery 22 (1979) 251-256
20. Culberson JC. Iterated greedy graph coloring and the difficulty landscape. Technical report, Department of Computer Sciences, University of Alberta; 1992.
21. Laguna M., and Marti R. A GRASP for coloring sparse graphs. Computational Optimization and Applications 19 (2001) 165-178
22. Chams M., Hertz A., and de Werra D. Some experiments with simulated annealing for coloring graphs. European Journal of Operational Research 32 (1987) 260-266
23. 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. Operations Research 39 (1991) 378-406
24. Avanthay C., Hertz A., and Zufferey N. A variable neighborhood search for graph coloring. European Journal of Operational Research 151 (2003) 379-388
25. Dorne R., and Hao J.-K. A new genetic local search algorithm for graph coloring. Lecture Notes in Computer Sciences 1498 (1998) 745-754
26. Fleurent C., and Ferland J.A. Genetic and hybrid algorithms for graph coloring. Annals of Operations Research 63 (1996) 437-461
27. Hamiez J.-P., and Hao J.-K. Scatter search for graph coloring. Lecture Notes in Computer Sciences 2310 (2002) 168-179
28. Hertz A, Galinier P, Zufferey N. An adaptive memory algorithm for the graph coloring problem. Discrete Applied Mathematics 2005, accepted for publication.
29. Battiti R., and Tecchiolli G. The reactive tabu search. ORSA Journal on Computing 6 (1994) 126-140
30. Vasquez M. Arc-consistency and tabu search for the frequency assignment problem with polarization. Proceedings of CPAIOR'02. Le Croisic, France (March 2002) 359-372
31. Johnson D.S., and Trick M.A. Proceedings of the second DIMACS implementation challenge. DIMACS series in discrete mathematics and theoretical computer sciences vol. 26 (1996), American Mathematical Society, Providence, RI