A hybrid algorithm for the sum coloring problem

摘要

In this work, we study the sum coloring graphs problem (MSCP), which is a variant of the graph coloring one. The purpose of (MSCP) is to affect natural numbers (colors) at each vertex, and to minimize the sum of colors. We present afterwards an hybrid algorithm based on heuristic given by the improved algorithm of F. Glover [1] and metaheuristic ant colony optimization (ACO).