Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Brélaz, New Methods to Color the Vertices of a Graph, Comunications of the ACM, 22 (1979).
J. Brown, Chromatic Scheduling and the Chromatic Number Problem, Management Science, 19 (1972).
M. Chams, A. Hertz and D. de Werra, Some Experiments with Simulated Annealing for Coloring Graphs, European Journal of Operational Research, 32 (1987).
N. Christofides, Graph Theory. An Algorithmic Approach, (Academic Press, 1975).
S. Chu, Efficient Bounds on a Branch and Bound Algorithm for Graph Colouration, International Journal of Mathematical Education Science Technology, 22 (1991).
D. de Werra, An Introduction to Timetabling, European Journal of Operational Research, 19 (1985).
D. de Werra, Heuristics for Graphs Colorings, Computing, 7 (1990).
R. Dutton and. R. Brigham, A New Graph Colouring Algorithm, The Computer Journal, 24 (1981).
F. Glover, Future Paths for Integer Programming and Links to Artificial Intelligence, Computers and Operations Research, 13 (1986).
F. Glover, Simple Tabu Thresholding in Optimization, Working Paper, School of Business, University of Colorado, Boulder (1992).
P.L. Hammer and S. Rudeanu, Boolean Methods in Operations Research, (Springer-Verlag, 1968).
P. Hansen and M. Delattre, Complete-Link Cluster Analysis by Graph Coloring, Journal of the America Statistical Association, 73 (1978).
A. Hertz and D. de Werra, Using Tabu Search Techniques for Graphs Colorings, Computing, 39 (1987).
D. Johnson et al., Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and number partitioning, Operations Research, 39 (1991).
S. Korman, The Graph Colouring Problem, in: Combinatorial Optimization, ed. N. Christofides et al. (John Wiley & Sons, 1979).
M. Kubale, Some Results Concerning the Complexity of Restricted Colorings of Graphs, Discrete Appied Mathematics, 36 (1992).
M. Kubale and Jackowski, A Generalized Implicit Enumetation Algorithm for Graph Coloring, Comunications of the ACM, 28 (1985).
F. Leighton, A Graph Coloring Algorithm for Large Scheduling Problems, Journal of Research of the Bureau of Standards, 84 (1979).
D.W. Matula, G. Marble and J.D. Isaacson, Graph Coloring Algorithms, in: Graph Theory and Computing, ed. R. C. Read (Academic Press, New York, 1972).
N. Metha, The Applications of a Graph Coloring Method to an Examination Scheduling Problem, Interfaces, 11 (1981).
Th. Mohr, Parallel Tabu Search Algorithms for the Graph Coloring Problem, Working Paper, ORWP 88/11, Ecole Polytechnique Fédérale de Lausanne (1988).
G. Neufeld and J. Tartar, Graph Coloring Conditions for the Existence of Solutions to the Timetable Problem, Comunications of the ACM, 17 (1974).
M.S. Quintanilla, Técnicas Exactas y Heurísticas para la Asignación de una Plantilla de Trabajadoes a una Planificación Establecida, P.h.D.Thesis, Departamento de Estadística e Investigación Operativa, Universidad de Valencia, Spain (1994).
J. Turner, Almost All k-Coloreable Graphs Are Easy to Color, Journal of Algorithms, 9 (1988).
C.C. Wang, An Algorithm for the Chromatic Number of a Graph, Journal of A.C.M, 21 (1974).
D.J.A. Welsh and M.B. Powel, An Upper Bound on the Chromatic Number of a Graph and its Applications to Timetabling Problem, Computer Journal, 10 (1967).
D.C. Wood, A Technique for Coloring of a Graph Applicable to Large Scale Timetabling Problems, Computer Journal, 12 (1969).
A. Zykov, On Some Properties of Linear Complexes, Amer. Math. Soc, Translation, 79 (1952).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Valls, V., Pérez, M.Á., Quintanilla, M.S. (1996). A Modified Tabu Thresholding Approach for the Generalised Restricted Vertex Colouring Problem. In: Osman, I.H., Kelly, J.P. (eds) Meta-Heuristics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1361-8_32
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1361-8_32
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8587-8
Online ISBN: 978-1-4613-1361-8
eBook Packages: Springer Book Archive