A search space "cartography" for guiding graph coloring heuristics

Computers and Operations Research

Volumn 37, Issue 4, 2010, Pages 769-778

  Porumbel, Daniel Cosmin ^a,b   Hao, Jin Kao ^a   Kuntz, Pascale ^b  

^a UNIVERSITÉ D'ANGERS   (France)

^b INSTITUT DE RECHERCHE EN COMMUNICATIONS ET CYBERNÉTIQUE DE NANTES   (France)

Author keywords

Graph coloring; Local optima distribution; Search by learning

Indexed keywords

3-D SPACE; DISTANCE MEASURE; EXPERIMENTAL CONFIRMATION; GLOBAL OPTIMUM; GRAPH COLORING; GRAPH COLORING PROBLEM; GRAPH COLORINGS; HIGH-QUALITY SOLUTIONS; LEARNING PROCESS; LOCAL MINIMUMS; LOCAL OPTIMA DISTRIBUTION; LOCAL SEARCH ALGORITHM; SEARCH BY LEARNING; SEARCH SPACES; TREE-LIKE STRUCTURES;

LEARNING ALGORITHMS; MAPPING; MAPS; SPHERES; TABU SEARCH;

COLORING;

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

References (41)

1. Avanthay C., Hertz A., and Zufferey N. A variable neighborhood search for graph coloring. Eur J Oper Res 151 2 (2003) 379-388
2. Barnier N., and Brisset P. Graph coloring for air traffic flow management. Ann Oper Res 130 1 (2004) 163-178
3. Blöchliger I., and Zufferey N. A graph coloring heuristic using partial solutions and a reactive Tabu scheme. Comp Oper Res 35 3 (2008) 960-975
4. Brelaz D. New methods to color the vertices of a graph. Commun ACM 22 4 (1979) 251-256
5. Brown J. Chromatic scheduling and the chromatic number problem. Manage Sci 19 4 (1972) 456-463
6. Burke E.K., Elliman D.G., and Weare R.F. A university timetabling system based on graph colouring and constraint manipulation. J Res Comput Educ 27 1 (1994) 1-18
7. Chaitin GJ. Register allocation & spilling via graph coloring. In: SIGPLAN '82: proceedings of the 1982 SIGPLAN symposium on compiler construction. New York, USA: ACM; 1982. p. 98-105.
8. Chams M., Hertz A., and de Werra D. Some experiments with simulated annealing for coloring graphs. Eur J Oper Res 32 2 (1987) 260-266
9. Chiarandini M, Stützle T. An application of iterated local search to graph coloring. In: Johnson DS, Mehrotra A, Trick M, editors. Computational symposium on graph coloring and its generalizations. 2002. p. 112-25.
10. Christofides N. An algorithm for the chromatic number of a graph. Comput J 14 1 (1971) 38-39
11. Culberson J., and Gent I. Frozen development in graph coloring. Theor Comput Sci 265 (2001) 227-264
12. Culberson J, Luo F. Exploring the k-colorable landscape with iterated greedy. In: Johnson D, Trick M, editors. Cliques, coloring, and satisfiability: second DIMACS implementation challenge. DIMACS series in discrete mathematics and theoretical computer science, vol. 26. Providence, RI: American Mathematical Society; 1996. p. 345-84.
13. de Werra D. An introduction to timetabling. Eur J Oper Res 19 2 (1985) 151-162
14. Dorne R, Hao JK. A new genetic local search algorithm for graph coloring. In: PPSN 98. Lecture notes in computer science, vol. 1498. Berlin: Springer; 1998. p. 745-54.
15. Dorne R., and Hao J.K. Tabu search for graph coloring, T-colorings and set T-colorings. In: Voss S., et al. (Ed). Meta-heuristics: advances and trends in local search paradigms for optimization (1998), Kluwer Academic Publishers, Dordrecht 77-92
16. Fleurent C., and Ferland J. Genetic and hybrid algorithms for graph coloring. Ann Oper Res 63 3 (1996) 437-461
17. Galinier P., and Hao J.K. Hybrid evolutionary algorithms for graph coloring. J Combin Optim 3 4 (1999) 379-397
18. Galinier P., and Hertz A. A survey of local search methods for graph coloring. Comput Oper Res 33 9 (2006) 2547-2562
19. Galinier P., Hertz A., and Zufferey N. An adaptive memory algorithm for the k-coloring problem. Discrete Appl Math 156 2 (2008) 267-279
20. Gamache M., Hertz A., and Ouellet J. A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding. Comput Oper Res 34 8 (2007) 2384-2395
21. Glass C., and Pruegel-Bennett A. A polynomially searchable exponential neighbourhood for graph colouring. J Oper Res Soc 56 3 (2005) 324-330
22. Glover F., and Laguna M. Tabu search (1997), Springer, Berlin
23. Gusfield D. Partition-distance: a problem and class of perfect graphs arising in clustering. Inf Process Lett 82 3 (2002) 159-164
24. Hale W. Frequency assignment: theory and applications. Proc IEEE 68 12 (1980) 1497-1514
25. Hamiez J., and Hao J.K. An analysis of solution properties of the graph coloring problem. In: Resende M., et al. (Ed). Metaheuristics: computer decision-making (2004), Kluwer Academic Publishers, Dordrecht 325-346
26. Hertz A., Jaumard B., and de Aragão M. Local optima topology for the k-coloring problem. Discrete Appl Math 49 1-3 (1994) 257-280
27. Hertz A., Plumettaz A., and Zufferey N. Variable space search for graph coloring. Discrete Appl Math 156 13 (2008) 2551-2560
28. Hertz A., and Werra D. Using Tabu search techniques for graph coloring. Computing 39 4 (1987) 345-351
29. Johnson D., Aragon C., McGeoch L., and Schevon C. Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning. Oper Res 39 3 (1991) 378-406
30. Johnson D, Trick M. Cliques, coloring, and satisfiability: second DIMACS implementation challenge. In: DIMACS series in discrete mathematics and theoretical computer science, vol. 26. Providence, RI: American Mathematical Society; 1996.
31. Karp R. Reducibility among combinatorial problems. In: Miller R.E., and Thatcher J.W. (Eds). Complexity of computer computations (1972), Plenum Press, New York 85-103
32. Kruskal J. Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis. Psychometrika 29 1 (1964) 1-27
33. Leighton F. A graph coloring algorithm for large scheduling problems. J Res Natl Bur Stand 84 6 (1979) 489-503
34. Lewandowski G, Condon A. Experiments with parallel graph coloring heuristics and applications of graph coloring. In: Johnson D, Trick M, editors. Cliques, coloring, and satisfiability: second DIMACS implementation challenge. DIMACS series in discrete mathematics and theoretical computer science, vol. 26. Providence, RI: American Mathematical Society; 1996. p. 309-34.
35. Lim A, Wang F. Robust graph coloring for uncertain supply chain management. In: Proceedings of the 38th annual Hawaii international conference on system sciences-track 3, vol. 3; 2005. p. 81b.
36. Malaguti E., Monaci M., and Toth P. A metaheuristic approach for the vertex coloring problem. INFORMS J Comput 20 2 (2008) 302-316
37. Morgenstern C. Distributed coloration neighborhood search. In: Johnson D, Trick M, editors. Cliques, coloring, and satisfiability: second DIMACS implementation challenge. DIMACS series in discrete mathematics and theoretical computer science, vol. 26. Providence, RI: American Mathematical Society; 1996. p. 335-58.
38. Paquete L, Stützle T. An experimental investigation of iterated local search for coloring graphs. In: EvoWorkshops. Lecture notes in computer science, vol. 2279. Berlin: Springer; 2002. p. 121-30.
39. Porumbel DC, Hao JK, Kuntz P. An improved algorithm for computing the partition distance.Technical report, LERIA, Université d'Angers; 2008.
40. Trick MA, Yildiz H. A large neighborhood search heuristic for graph coloring. In: CPAIOR 2007. Lecture notes in computer science, vol. 4510. Berlin: Springer; 2007. p. 346-60.
41. Welsh D., and Powell M. An upper bound for the chromatic number of a graph and its application to timetabling problems. Comput J 10 1 (1967) 85-86