Author： González-Velarde J.L.
Publisher： Springer Publishing Company
ISSN： 0254-5330
Source： Annals of Operations Research, Vol.117, Iss.1-4, 2002-11, pp. : 165-174
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
We present a Tabu Search (TS) method that employs a simple version of ejection chains for coloring graphs. The procedure is tested on a set of benchmark problems. Empirical results indicate that the proposed TS implementation outperforms other metaheuristic methods, including Simulated Annealing, a previous version of Tabu Search and a recent implementation of a Greedy Randomized Adaptive Search Procedure (GRASP).
Related content
Access to resources
Recommend
Coloring of Double Disk Graphs
By Du Hongwei Jia Xiaohua Li Deying Wu Weili
Journal of Global Optimization, Vol. 28, Iss. 1, 2004-01 ,pp. :
By Glover Fred
Annals of Operations Research, Vol. 149, Iss. 1, 2007-02 ,pp. :
Edge coloring of bipartite graphs with constraints
By Caragiannis I. Kaklamanis C. Persiano P.
Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. :