Annals of Operations Research

, Volume 41, Issue 4, pp 343–358 | Cite as

On the use of some known methods forT-colorings of graphs

  • Daniel Costa
Various Applications

Abstract

A generalization of the classical graph coloring model is studied in this paper. The problem we are interested in is a variant of the generalT-coloring problem related in the literature. We want to color the vertices of a graph in such a way that the two colors assigned to two adjacent verticesi andj differ by at least ij , wheret ij is a fixed coefficient associated to the edge [i, j]. The goal is to minimize the length of the spectrum of colors used. We present here the results produced by well-known heuristics (tabu search and simulated annealing) applied to the considered problem. The results are compared with optimal colorings obtained by a branch-and-bound algorithm.

Keywords

Graph coloring frequency assignment heuristic procedure tabu search simulated annealing branch and bound 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    D. Abramson, Constructing school timetables using simulated annealing: sequential and parallel algorithms, Manag. Sci. 37(1991)98–113.Google Scholar
  2. [2]
    D. Brélaz, New methods to color the vertices of a graph, Commun. ACM 22(1979)251–256.Google Scholar
  3. [3]
    R.E. Burkard and F. Rendl, A thermodynamically motivated simulation procedure for combinatorial optimization problems, Eur. J. Oper. Res. 17(1984)169–174.Google Scholar
  4. [4]
    M. Cangalovic and J. Schreuder, Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths, Eur. J. Oper. Res. 51(1991)248–258.Google Scholar
  5. [5]
    M. Chams, A. Hertz and D. de Werra, Some experiments with simulated annealing for coloring graphs, Eur. J. Oper. Res. 32(1987)260–266.Google Scholar
  6. [6]
    D. Costa, A tabu search algorithm for computing an operational timetable, Eur. J. Oper. Res. (1993), to appear.Google Scholar
  7. [7]
    M. Cozzens and F.S. Roberts,T-colorings of graphs and the channel assignment problem, Congr. Numer. 35(1982)191–208.Google Scholar
  8. [8]
    M. Cozzens and D. Wang, The general channel assignment problem, Congr. Numer. 41(1984)115–129.Google Scholar
  9. [9]
    D. de Werra and A. Hertz, Consecutive colorings of graphs, Zeits. Oper. Res. 32(1988)1–8.Google Scholar
  10. [10]
    D. de Werra and A. Hertz, Tabu search techniques: a tutorial and an application to neural networks, OR Spektrum 11(1989)131–141.Google Scholar
  11. [11]
    D. de Werra and Y. Gay, Chromatic scheduling and frequency assignment, Discr. Appl. Math. (1993), to appear.Google Scholar
  12. [12]
    D. Dubois and D. de Werra, EPCOT: an efficient procedure for coloring optimally with tabu search, to appear in Comput. Math. Appl.Google Scholar
  13. [13]
    F. Glover, Tabu search Part I, ORSA J. Comput. 1(1989)190–206.Google Scholar
  14. [14]
    F. Glover, Tabu search Part II, ORSA J. Comput. 2(1990)4–32.Google Scholar
  15. [15]
    W.K. Hale, Frequency assignment: Theory and applications, Proc. IEEE 68(1980)1497–1514.Google Scholar
  16. [16]
    A. Hertz and D. de Werra, Using search techniques for graph coloring, Computing 39(1987)345–351.Google Scholar
  17. [17]
    A. Hertz and D. de Werra, The tabu search metaheuristic: how we used it, Ann. Math. Art. Int. 1(1990)111–121.Google Scholar
  18. [18]
    M. Kubale and B. Jackowski, A generalized implicit enumeration algorithm for graph coloring, Commun. ACM 28(1985)412–418.Google Scholar
  19. [19]
    J. Peemöller, A correction to Brélaz's modification of Brown's coloring algorithm, Commun. ACM 26(1983)595–597.Google Scholar
  20. [20]
    A. Raychaudhuri, Intersection assignments,T-coloring and powers of graphs, Ph.D. Thesis, Rutgers University (1985).Google Scholar
  21. [21]
    F.S. Roberts, From garbage to rainbows: generalizations of graph coloring and their applications, RUTCOR Research Report 36-88, Rutgers University (1988).Google Scholar
  22. [22]
    F. Semet and E. Taillard, Solving real-life vehicle routing problems efficiently using taboo search, Ann. Oper. Res. (1993), this volume.Google Scholar
  23. [23]
    B.A. Tesman,T-colorings, listT-colorings and setT-colorings of graphs, Ph.D. Thesis, Rutgers University (1989).Google Scholar

Copyright information

© J.C. Baltzer AG, Science Publishers 1993

Authors and Affiliations

  • Daniel Costa
    • 1
    • 2
  1. 1.School of Computing ScienceSimon Fraser UniversityBurnabyCanada
  2. 2.Département de MathématiquesEcole Polytechnique Fédérale de LausanneLausanneSwitzerland

Personalised recommendations