Embedding a novel objective function in a two-phased local search for robust vertex coloring

European Journal of Operational Research

Volumn 189, Issue 3, 2008, Pages 1358-1380

  Caramia, Massimiliano ^a   Dell'Olmo, Paolo ^b  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Benchmarks; Biased random sampling; Local search; Vertex coloring

Indexed keywords

ALGORITHMS; BENCHMARKING; PROBABILITY DISTRIBUTIONS; ROBUST CONTROL; SCHEDULING;

BIASED RANDOM SAMPLING; DETERMINISTIC LOCAL SEARCH; VERTEX COLORING;

FUNCTION EVALUATION;

EID: 40849145453     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.01.063     Document Type: Article

References (46)

1. Bianco L., Caramia M., and Dell'Olmo P. Solving a preemptive scheduling problem using coloring technique. In: Weglarz J. (Ed). Project Scheduling Recent Models, Algorithms and Applications (1998), Kluwer Academic Publishers
2. Blazewicz J., Ecker K.H., Pesch E., Schmidt G., and Weglarz J. Scheduling Computer and Manufacturing Processes (1996), Springer
3. Brelaz D. New methods to color the vertices of a graph. Communications of the ACM 22 (1979) 251-256
4. Brown J.R. Chromatic scheduling and the chromatic number problem. Management Science 19 (1972) 456-463
5. Caramia M., and Dell'Olmo P. A fast and simple local search for graph coloring, proc. of the 3-rd workshop on algorithm engineering (WAE'99). Lecture Notes in Computer Science 1668 (1999) 319-333
6. Caramia M., and Dell'Olmo P. Constraint propagation in graph coloring. Journal of Heuristics 8 (2002) 83-107
7. Caramia M., and Dell'Olmo P. Iterative coloring extension of a maximum clique. Naval Research Logistics 48 (2001) 518-550
8. Caramia M., Dell'Olmo P., and Italiano G.F. CHECKCOL: Improved local search for graph coloring. Journal of Discrete Algorithms 4 (2006) 277-298
9. Chams M., Hertz A., and de Werra D. Some experiments with simulated annealing for coloring graphs. EJOR 32 (1987) 260-266
10. M. Chiarandini, Stochastic local search methods for highly constrained combinatorial optimization problems, PhD thesis, FG Intellektik, FB Informatik, TU Darmstadt, (2005).
11. M. Chiarandini, I. Dumitrescu, T. Stüzle, Stochastic local search algorithms for the graph colouring problem, AIDA-05-03 report, Darmstadt, 2005.
12. Christofides N. Graph theory: An Algorithmic Approach (1975), Academic Press, London
13. Coffman E.G. An introduction to combinatorial models of dynamic storage allocation. SIAM Review 25 (1983) 311-325
14. Coloring the Queen Graphs, http://www.cs.concordia.ca/chvatal/queengraphs.html.
15. J. Culberson, A. Beacham, D. Papp, Hiding our colors, in: Proceedings of the CP'95 Workshop on Studying and Solving Really Hard Problems, Cassis, France, 1995, pp. 31-42.
16. Dailey D.P. Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete. Discrete Mathematics 30 (1980) 289-293
17. De Werra D. An introduction to timetabling. European Journal of Operational Research 19 (1985) 151-162
18. C. Desrosiers, P. Galinier, A. Hertz, Efficient algorithms for finding critical subgraphs, technical report G-2004-31, Les Cahiers du GERAD, (2004).
19. I.M. Diaz, P. Zabala, A branch and cut algorithm for graph coloring, in: Proceedings of the Computational Symposium on Graph Coloring and its Generalization, Ithaca, New York, September 2002 http://mat.gsia.cmu.edu/COLOR02.
20. DIMACS ftp site for benchmark graphs:ftp://dimacs.rutgers.edu/pub/challenge/graph/benchmarks/color/.
21. DIMACS ftp site for benchmark machines:ftp://dimacs.rutgers.edu/pub/challenge/graph/benchmarks/volume/machine.
22. Eiben A.E., Van Der Hauw J.K., and Van Hemert J.I. Graph coloring with adaptive evolutionary algorithms. Journal of Heuristics 4 (1998) 25-46
23. Fleurent C., and Ferland J.A. Genetic and hybrid algorithms for graph coloring. Annals of Operations Research 63 (1995) 437-461
24. Fleurent C., and Ferland J.A. Object-oriented implementation of heuristic search methods for graph coloring, maximum clique and satisfiability. In: Johnson D.S., and Trick M.A. (Eds). DIMACS Series on Discrete Mathematics and Theoretical Computer Science vol. 26 (1996), AMS 619-652
25. P. Galiner, A. Hertz, N. Zufferey, An adaptive memory algorithm for the k-colouring problem, technical report G-2003-35, Les Cahiers du GERAD, (2003).
26. Galinier P., and Hao J.K. Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization 3 4 (1999) 379-397
27. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman & Company
28. Garey M.R., and Johnson D.S. The complexity of near-optimal graph coloring. Journal of the ACM 23 (1976) 43-49
29. Garey M.R., Johnson D.S., and Stockmeyer L. Some simplified NP-complete graph problems. Theoretical Chemistry Accounts 1 (1976) 237-267
30. Hermann F., and Hertz A. Finding the chromatic number by means of critical graphs. ACM Journal of Experimental Algorithms 7 10 (2002) 1-9
31. Hertz A., and de Werra D. Using tabu search techniques for graph coloring. Computing 39 (1987) 345-351
32. Johnson D.J., 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
33. Kannan S., and Proebsting T. Register allocation in structured programs. Journal of Algorithms 29 (1998) 223-237
34. Krawczyk H., and Kubale M. An approximation algorithm for diagnostic test scheduling in multicomputer systems. IEEE Transactions and Computation C-34 (1985) 869-872
35. Kubale M., and Jackowski B. A generalized implicit enumeration algorithm for graph coloring. Communications of the ACM 28 (1985) 412-418
36. Leighton F.T. Journal of Research of the National Bureau of Standards 84 (1979) 489-505
37. Lewandowski G. Experiments with parallel graph coloring heuristics. In: Johnson D.S., and Trick M.A. (Eds). DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 26 (1996), AMS
38. Lourenço H.R., Martin O., and Stützle T. Iterated local search. In: Glover F., and Kochenberger G. (Eds). Handbook of Metaheuristics (2002), Kluwer Academic Publishers, USA 321-353
39. C. Lund, M. Yannakakis, On the hardness of approximating minimization problems, in: Proc. 25th Annual ACM Symp. on Theory of Computing, (1993) 286-293 (Full version in J. ACM, 41 (5) (1994) 960-981).
40. Mehrotra A., and Trick M.A. A column generation approach for graph coloring. INFORMS Journal on Computing 8 (1996) 344-354
41. Morgenstern C. Distributed coloration neighborhood search. Discrete Mathematics and Theoretical Computer Science vol. 26 (1996), AMS pp. 335-358
42. Mycielski J. Sur le coloriage des graphes. Colloquim Mathematiques 3 (1955) 161-162
43. Sager T.J., and Lin S. A pruning procedure for exact graph coloring. ORSA Journal on Computing 3 (1993) 226-230
44. Sewell E.C. An improved algorithm for exact graph coloring. In: Johnson D.S., and Trick M.A. (Eds). DIMACS Series in Computer Mathematics and Theoretical Computer Science vol.26 (1996), AMS 359-373
45. A. Van Gelder, Another look at graph coloring via propositional satisfiability, in: Proceedings of the Computational Symposium on Graph Coloring and its Generalization, Ithaca, New York, September 2002 http://mat.gsia.cmu.edu/COLOR02.
46. C. Voudouris, Guided local search for combinatorial optimization problems, PhD thesis, University of Essex, Department of Computer Science, Colchester, UK, 1997.