A Modified Tabu Thresholding Approach for the Generalised Restricted Vertex Colouring Problem

We present a modification of the Tabu Thresholding (TT) approach and apply it to the solution of the generalised restricted vertex colouring problem. Both the bounded and unbounded cases are treated. In our algorithms, the basic TT elements are supplemented with an evaluation function that depends on the best solution obtained so far, together with a mechanism which reinforces the aggressive search in the improving phase, and new diversification strategies which depend on the state of the search. The procedure is illustrated through the solution of the problem of minimising the number of workers in a heterogeneous workforce.

[1]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[2]  Marek Kubale,et al.  A generalized implicit enumeration algorithm for graph coloring , 1985, CACM.

[3]  Jonathan S. Turner,et al.  Almost All k-Colorable Graphs are Easy to Color , 1988, J. Algorithms.

[4]  Marek Kubale.  Some results concerning the complexity of restricted colorings of graphs , 1992, Discret. Appl. Math..

[5]  Sydney C. K. Chu,et al.  Efficient bounds on a branch and bound algorithm for graph colouration , 1991 .

[6]  John Tartar,et al.  Graph coloring conditions for the existence of solutions to the timetable problem , 1974, CACM.

[7]  P. Hansen,et al.  Complete-Link Cluster Analysis by Graph Coloring , 1978 .

[8]  D. Werra,et al.  Some experiments with simulated annealing for coloring graphs , 1987 .

[9]  J. R. Brown.  Chromatic Scheduling and the Chromatic Number Problem , 1972 .

[10]  Ronald C. Read,et al.  Graph theory and computing , 1972 .

[11]  David C. Wood,et al.  A technique for colouring a graph applicable to large scale timetabling problems , 1969, Computer/law journal.

[12]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[13]  D. de Werra,et al.  An introduction to timetabling , 1985 .

[14]  Frank Thomson Leighton,et al.  A Graph Coloring Algorithm for Large Scheduling Problems. , 1979, Journal of research of the National Bureau of Standards.

[15]  Chung C. Wang,et al.  An Algorithm for the Chromatic Number of a Graph , 1974, JACM.

[16]  E. Kay,et al.  Graph Theory. An Algorithmic Approach , 1975 .

[17]  Ronald D. Dutton,et al.  A New Graph Colouring Algorithm , 1981, Comput. J..

[18]  D. J. A. Welsh,et al.  An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..

[19]  David W. Matula,et al.  GRAPH COLORING ALGORITHMS , 1972 .

[20]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[21]  Frank Harary,et al.  Graph Theory , 2016 .

[22]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.