Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Hybrid Metaheuristics

HM 2006: Hybrid Metaheuristics pp 162–177Cite as

Colour Reassignment in Tabu Search for the Graph Set T-Colouring Problem

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4030))

Abstract

The graph set T-colouring problem (GSTCP) is a generalisation of the classical graph colouring problem and it is used to model, for example, the assignment of frequencies in mobile networks. The GSTCP asks for the assignment of sets of nonnegative integers to the vertices of a graph so that constraints on the separation of any two numbers assigned to a single vertex or to adjacent vertices are satisfied and some objective function is optimised. Among the various objective functions of interest, we focus on the minimisation of the span, that is, the difference between the largest and the smallest integers used.

In practical applications large size instances of the GSTCP are to be solved and heuristic algorithms become necessary. In this article, we propose a new hybrid procedure for the solution of the GSTCP that combines a known tabu search algorithm with an algorithm for the enumeration of all feasible re-assignments of colours to a vertex. We compare the new algorithm with the basic tabu search algorithm and for both we study possible variants. The experimental comparison, supported by statistical analysis, establishes that the new hybrid algorithm performs better on a variety of instance classes.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jensen, T.R., Toft, B.: Graph coloring problems. Wiley Interscience, New York (1995)

    MATH  Google Scholar 

  2. Hale, W.K.: Frequency assignment: Theory and applications. Proceedings of the IEEE 68, 1497–1514 (1980)

    Article  Google Scholar 

  3. Tesman, B.A.: Set T-colorings. Congressus Numerantium 77, 229–242 (1990)

    MATH  MathSciNet  Google Scholar 

  4. Roberts, F.S.: T-colorings of graphs: Recent results and open problems. Discrete Mathematics 93, 229–245 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  5. Tesman, B.A.: List T-colorings. Discrete Applied Mathematics 45, 277–289 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  6. Giaro, K., Janczewski, R., Malafiejski, M.: The complexity of the T-coloring problem for graphs with small degree. Discrete Applied Mathematics 129, 361–369 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  7. Eisenblätter, A., Grötschel, M., Koster, A.M.C.A.: Frequency assignment and ramifications of coloring. Discussiones Mathematicae Graph Theory 22, 51–88 (2002)

    MATH  MathSciNet  Google Scholar 

  8. Aardal, K.I., van Hoesel, C.P.M., Koster, A.M.C.A., Mannino, C., Sassano, A.: Models and solution techniques for the frequency assignment problem. ZIB-report 01–40, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Germany (2001)

    Google Scholar 

  9. Hoos, H., Stützle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann Publishers, San Francisco (2004)

    Google Scholar 

  10. Dorne, R., Hao, J.: Tabu search for graph coloring, T-colorings and set T-colorings. In: Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 77–92. Kluwer Academic Publishers, Dordrecht (1998)

    Google Scholar 

  11. Phan, V., Skiena, S.: Coloring graphs with a general heuristic search engine. In: Johnson, D.S., Mehrotra, A., Trick, M. (eds.) Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, Ithaca, New York, USA, pp. 92–99 (2002)

    Google Scholar 

  12. Prestwich, S.: Hybrid local search on two multicolouring models. In: International Symposium on Mathematical Programming, Copenhagen, Denmark (2003)

    Google Scholar 

  13. Lim, A., Zhu, Y., Lou, Q., Rodrigues, B.: Heuristic methods for graph coloring problems. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 933–939. Springer, Heidelberg (2006)

    Google Scholar 

  14. Culberson, J., Beacham, A., Papp, D.: Hiding our colors. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol. 976, pp. 31–42. Springer, Heidelberg (1995)

    Google Scholar 

  15. Anderson, L.G.: A simulation study of some dynamic channel assignment algorithms in a high capacity mobile telecommunications system. IEEE Transactions on Communications 21, 1294–1301 (1973)

    Article  Google Scholar 

  16. Chiarandini, M.: Stochastic Local Search Methods for Highly Constrained Combinatorial Optimisation Problems. PhD thesis, Computer Science Department, Darmstadt University of Technology, Darmstadt, Germany (2005)

    Google Scholar 

  17. Hurley, S., Smith, D.H., Thiel, S.U.: FASoft: A system for discrete channel frequency assignment. Radio Science 32, 1921–1939 (1997)

    Article  Google Scholar 

  18. Fleurent, C., Ferland, J.: Genetic and hybrid algorithms for graph coloring. Annals of Operations Research 63, 437–464 (1996)

    Article  MATH  Google Scholar 

  19. Galinier, P., Hao, J.: Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization 3, 379–397 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  20. Costa, D.: On the use of some known methods for T-colorings of graphs. Annals of Operations Research 41, 343–358 (1993)

    Article  MATH  Google Scholar 

  21. Castelino, D., Hurley, S., Stephens, N.: A tabu search algorithm for frequency assignment. Annals of Operations Research 63, 301–320 (1996)

    Article  MATH  Google Scholar 

  22. Hao, J.K., Dorne, R., Galinier, P.: Tabu search for frequency assignment in mobile radio networks. Journal of Heuristics 4, 47–62 (1998)

    Article  MATH  Google Scholar 

  23. Hao, J.K., Perrier, L.: Tabu search for the frequency assignment problem in cellular radio networks. Technical Report LGI2P, EMA-EERIE, Parc Scientifique Georges Besse, Nimes, France (1999)

    Google Scholar 

  24. Birattari, M.: The race package for R. Racing methods for the selection of the best. Technical Report TR/IRIDIA/2003-37, IRIDIA, Université Libre de Bruxelles, Brussels, Belgium (2003)

    Google Scholar 

  25. Conover, W.: Practical Nonparametric Statistics. John Wiley & Sons, New York (1999)

    Google Scholar 

  26. Chiarandini, M., Basso, D., Stützle, T.: Statistical methods for the comparison of stochastic optimizers. In: Doerner, K.F., et al. (eds.) MIC 2005: The Sixth Metaheuristics International Conference, Vienna, Austria, pp. 189–196 (2005)

    Google Scholar 

  27. Matsui, S., Tokoro, K.: Improving the performance of a genetic algorithm for minimum span frequency assignment problem with an adaptive mutation rate and a new initialization method. In: Proc. of GECCO-2001 (Genetic and Evolutionary Computation Conference), pp. 1359–1366. Morgan Kaufmann Publishers, San Francisco (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IMADA, University of Southern Denmark, Odense, Denmark

    Marco Chiarandini & Kim S. Larsen

  2. CoDe, IRIDIA, Université Libre de Bruxelles, Brussels, Belgium

    Thomas Stützle

Authors
  1. Marco Chiarandini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Stützle
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kim S. Larsen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Statistics and Computer Science, La Laguna University Spain,  

    Francisco Almeida

  2. Universitat Politècnica de Catalunya, Omega Campus Nord, Jordi Girona 1-3, 08034, Barcelona, Spain

    María J. Blesa Aguilera

  3. ALBCOM, Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Barcelona, Spain

    Christian Blum

  4. DEIOC, Universidad de La Laguna, Escuela Técnica Superior en Ingeniería Informática, Avda. Astrofísico Francisco Sánchez, s/n, 38271, La Laguna, Tenerife, Spain

    José Marcos Moreno Vega

  5. Escuela Técnica Superior en Ingeniería Informática, Universidad de La Laguna, Avda. Astrofísico Francisco Sánchez, s/n, 38271, La Laguna, Tenerife, Spain

    Melquíades Pérez Pérez

  6. DEIS, Campus of Cesena Alma Mater Studiorum, Università di Bologna, Cesena, Italy

    Andrea Roli

  7. Université Libre de Bruxelles, IRIDIA CP 194/6, Avenue Franklin D. Roosevelt 50, 1050, Bruxelles, Belgium

    Michael Sampels

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chiarandini, M., Stützle, T., Larsen, K.S. (2006). Colour Reassignment in Tabu Search for the Graph Set T-Colouring Problem. In: Almeida, F., et al. Hybrid Metaheuristics. HM 2006. Lecture Notes in Computer Science, vol 4030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11890584_13

Download citation

  • DOI: https://doi.org/10.1007/11890584_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-46384-9

  • Online ISBN: 978-3-540-46385-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation