Heuristics for the bandwidth colouring problem (Q537987)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Heuristics for the bandwidth colouring problem |
scientific article |
Statements
Heuristics for the bandwidth colouring problem (English)
0 references
23 May 2011
0 references
Summary: The bandwidth colouring problem consists of assigning a colour to each vertex of a graph, so that the absolute value of the difference between the colours of adjacent vertices is at least the value of the weight of the associated edge. This problem generalises the classical vertex colouring problem and different heuristics have recently been proposed to obtain high quality solutions. In this paper we describe both memory-based and memory-less methods to solve the bandwidth colouring problem. In particular we propose new constructive and improvement methods based on tabu search and GRASP. Comparison of our results with previously reported instances and existing heuristics indicate that the methods we propose are competitive and require short computational times. Our findings also disclose that memory appears to play a more important role during improvement phases of search than during constructive phases.
0 references
graph colouring
0 references
tabu search
0 references
greedy randomised adaptive search procedures
0 references
GRASP
0 references