A tabu search approach for the sum coloring problem

A Study of Breakout Local Search for the Minimum Sum Coloring Problem

“…Tables 2 and 3 report respectively the comparative results with these reference algorithms on the tested DIMACS and COLOR02 instances. From the results of Table 2, we observe that our BLS algorithm outperforms, for each of the tested DIMACS instance, the reference algorithms MRLF [10], TS [3], and MDSLS [6] (except on DSJC125.1 where BLS and MDSLS report the same result). However, compared to the highly effective EXSCOL algorithm [13], BLS shows a worse performance on large DIMACS instances, but is able to report a better result than EXSCOL for 4 DIMACS instances up to 250 vertices.…”

“…Moreover, the best result obtained with BLS is in each case either better or as good as that reported by HLS [4], MRLF [10] and PGA [9]. For TS, no results are reported on these instances in [3].…”

“…The time limit used by MDSLS [6] is 1 hour on a computer similar to ours. For other reference approaches [3,4,9,10], details on testing conditions are not available. Tables 2 and 3 report respectively the comparative results with these reference algorithms on the tested DIMACS and COLOR02 instances.…”

“…To further evaluate the performance of BLS, we show a comparison with the following approaches from the literature: a very recent heuristic EXSCOL [13]; a hybrid local search (HLS) [4]; a greedy algorithm (MRLF) based on the popular RLF graph coloring heuristic [10]; a parallel genetic algorithm (PGA) [9]; a tabu search algorithm (TS) [3]; and a recent local search combining ideas of variable neighborhood search and iterated local search (MDSLS) [6]. EXSCOL [13] is the current best-performing approach in the literature and is particularly effective on large graphs.…”

“…Over the past two decades, it has been studied mainly from a theoretical point of view. Only recently, several heuristics have been proposed for the practical solving of the general MSCP [3,4,6,9,10,13].…”