New methods to color the vertices of a graph
Communications of the ACM
A survey of local search methods for graph coloring
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Distributed Generalized Graph Coloring
SASO '10 Proceedings of the 2010 Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems
A wide-ranging computational comparison of high-performance graph colouring algorithms
Computers and Operations Research
An analysis of heuristics for vertex colouring
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
On local search for the generalized graph coloring problem
Operations Research Letters
Hi-index | 0.00 |
Consider a graph with nodes, weighted links and a set of colours. In the generalised graph coloring problem GGCP, one must colour each node while minimising the total weight of monochromatic links. GGCP can model a cell site assignment problem in which nodes represent cell sites and colours represent multi-service nodes MSN. The links indicate pairs of cell sites whose geographic service areas overlap; the link weight indicates the degree of overlap. The objective is, as much as possible, to assign cell sites with overlap to different MSNs. We describe a greedy randomised adaptive search procedure GRASP for GGCP. At each replication, it builds an initial solution by randomly choosing nodes, one at a time, from a candidate list and myopically assigning a colour to each chosen node. Exchange heuristics can then improve upon the initial solution. Computational experiments indicate that the heuristic provides excellent solutions in little CPU time.