Tabu Search with Simple Ejection Chains for Coloring Graphs

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). Key Words: Graph coloring, metaheuristics, tabu search, ejection chains. 

• Type: Journal
• Year: 2002
• Where: ANOR
• Authors: José Luis González Velarde, Manuel Laguna
• Keywords: ANOR 2002, Ejection Chains, Greedy Randomized Adaptive Search Procedure, Tabu Search