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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Chiarandini, M., Stützle, T., & Larsen, K. S. (2006). Colour reassignment in tabu search for the graph set T-colouring problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4030 LNCS, pp. 162–177). Springer Verlag. https://doi.org/10.1007/11890584_13
Mendeley helps you to discover research relevant for your work.