The sum coloring problem is a variant of the vertex coloring problem where the target is to minimize the sum of colors used in coloring the vertices. It is NP-complete and has many applications in scheduling. In this paper, we use local search to solve the sum coloring problem. Extensive simulation results show that the proposed algorithm outperforms the existing tabu search algorithm, and is able to obtain satisfactory solution of many DIMACS benchmark instances.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.