Heuristic methods for graph coloring problems

Authors:
A. Lim;Y. Zhu;Q. Lou;B. Rodrigues
Affiliations:
Hong Kong Univ of Sci & Tech, Clear Water Bay, Kowloon, Hong Kong;Hong Kong Univ of Sci & Tech, Clear Water Bay, Kowloon, Hong Kong;National Univ of Singapore, Singapore;Singapore Management Univ, Singapore
Venue:
Proceedings of the 2005 ACM symposium on Applied computing
Year:
2005

Citing 6
Cited 6

Using tabu search techniques for graph coloring

Computing
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
“Squeaky Wheel” optimization

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
New methods to color the vertices of a graph

Communications of the ACM
Tabu Search

Tabu Search
Genetic Search For Fixed Channel Assignment Problem With Limited Bandwidth

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference

An agent-based algorithm for generalized graph colorings

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Stochastic Local Search Algorithms for Graph Set T-colouring and Frequency Assignment

Constraints
Heuristics for the bandwidth colouring problem

International Journal of Metaheuristics
On a reduction of the interval coloring problem to a series of bandwidth coloring problems

Journal of Scheduling
Colour reassignment in tabu search for the graph set t-colouring problem

HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
Multistart Iterated Tabu Search for Bandwidth Coloring Problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work, the Graph Coloring Problem and its generalizations - the Bandwidth Coloring Problem, the Multicoloring Problem and the Bandwidth Multicoloring Problem - are studied. A Squeaky Wheel Optimization with Tabu Search heuristic is developed and experiments using benchmark geometric test cases show that the algorithm performs well for these problems and achieves results for the Bandwidth Multicoloring Problem which improve on results obtained by other researchers.