Abstract
In this paper, a generic tabu search is presented for three coloring problems: graph coloring, T-colorings and set T-colorings. This algorithm integrates important features such as greedy initialization, solution re-generation, dynamic tabu tenure, incremental evaluation of solutions and constraint handling techniques. Empirical comparisons show that this algorithm approaches the best coloring algorithms and outperforms some hybrid algorithms on a wide range of benchmarks. Experiments on large random instances of T-colorings and set T-colorings show encouraging results.
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 vertices of a graph. Communications of ACM, 22:251–256, 1979.
D.J. Castelino, S. Hurley, and N.M. Stephens. A tabu search algorithm for frequency assignment. Annals of Operations Research, 63:301–320, 1996.
M. Chams, A. Hertz, and D. De Werra. Some experiments with simulated annealing for coloring graphs. European Journal of Operational Research, 32:260–266, 1987.
D. Costa. On the use of some known methods for T-colorings of graphs. Annals of Operations Research, 41:343–358, 1993.
D. Costa, A. Hertz, and O. Dubuis. Embedding of a sequential procedure within an evolutionary algorithm for coloring problems in graphs. Journal of Heuristics, 1:105–128, 1995.
R. Dorne and J.K. Hao. A new genetic local search algorithm for graph coloring. To appear in the Proceedings of PPSN’98, Lecture Notes in Computer Science, 1998.
R. Dorne and J.K. Hao. Constraint handling in evolutionary search: A case study of the frequency assignment. In Intl. Conf. on Parallel Problem Solving From Nature, volume 1141 of Lectures Notes in Computer Science, pp 801–810, Berlin, Germany, 1996.
M. Duque-Anton, D. Kunz, and B. Rüber. Channel assignment for cellular radio using simulated annealing. IEEE Transactions on Vehicular Technology, 42:14–21, 1993.
C. Fleurent and J.A. Ferland. Genetic and hybrid algorithms for graph coloring. Annals of Operations Research, 63:437–461, 1995.
C. Fleurent and J. A. Ferland. Object-Oriented Implementation of Heuristic Search Methods for Graph Coloring, Maximum Clique, and Satisfiability. Volume 26 of Discrete Mathematics and Theoretical Computer Science, pp 619–652. American Mathematical Society, 1996.
A. Gamst. Some lower bounds for a class of frequency assignment problems. IEEE Transactions on Vehicular Technology, 35:8–14, 1986.
A. Gamst. A ressource allocation technique for FDMA systems. Alta Frequenza, 57(2):89–96, 1988.
W.K. Hale. Frequency assignment: Theory and applications. IEEE Transactions on Vehicular Technology, 68(12):1497–1514, 1980.
J.K. Hao, R. Dorne, and P. Galinier. Tabu search for frequency assignment in mobile radio networks. Journal of Heuristics, 4:47–62, 1998.
A. Hertz and D. De Werra. Using tabu search techniques for graph coloring. Computing, 39:345–351, 1987.
S. Hurley and D.H. Smith. Bounds for the frequency assignment problem. Discrete Mathematics, 167–168:571–582, 1997.
M. Jiang. Méthodes heuristiques pour le problème du T-coloriage avec intervalles. RAIRO Operational Research, 32:75–99, 1997.
D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon. Optimization by simulated annealing: An experimental evaluation; part II, graph coloring and number partitioning. Operations Research, 39:378–406, 1991.
A. Johri and D.W. Matula. Probabilistic bounds and heuristic algorithms for coloring large random graphs. Technical Report 82-CSE-06, Southern Methodist University, Department of Computing Science, Dallas, 1982.
D. Kunz. Channel assignment for cellular radio using neural networks. IEEE Transactions on Vehicular Technology, 40:188–193, 1991.
W.K. Lai and G.G. Coghill. Channel assignment through evolutionary optimization. IEEE Transactions on Vehicular Technology, 45:91–95, 1996.
R. A. Leese. Tiling methods for channel assignment in radio communication networks. Zeitschrift für Angewandte Mathematik und Mechanik, 76:303–306, 1996.
F.T. Leighton. A graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau Standard, 84:79–100, 1979.
C. Morgenstern. Distributed Coloration Neighborhood Search. Volume 26 of Discrete Mathematics and Theoretical Computer Science, pp 335–358. American Mathematical Society, 1996.
C.H. Papadimitriou and K. Steiglitz. Combinatorial optimization — algorithms and complexity. Prentice Hall, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Dorne, R., Hao, JK. (1999). Tabu Search for Graph Coloring, T-Colorings and Set T-Colorings. In: Voß, S., Martello, S., Osman, I.H., Roucairol, C. (eds) Meta-Heuristics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5775-3_6
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5775-3_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7646-0
Online ISBN: 978-1-4615-5775-3
eBook Packages: Springer Book Archive