A memetic algorithm for the minimum sum coloring problem

Kaoutar Sghiouer (1) , Yu Li (2) , Corinne Lucet (2) , Aziz Moukrim (1)

1 Heudiasyc - Heuristique et Diagnostic des Systèmes Complexes [Compiègne]
2 MIS - Modélisation, Information et Systèmes - UR UPJV 4290

In this study a simple hybrid genetic algorithm using a procedure dedicated to the minimum sum coloring problem (MSCP) is proposed. This algorithm combines an original crossover based on the union of independent sets proposed in the literature and local search techniques dedicated to the minimum sum coloring problem for mutation. We call this hybrid method a memetic algorithm for the MSCP.

Domaines: Recherche opérationnelle [math.OC]

Kaoutar Sghiouer, Yu Li, Corinne Lucet, Aziz Moukrim. A memetic algorithm for the minimum sum coloring problem. Conférence Internationale en Recherche Opérationnelle (CIRO'2010), May 2010, Marrakech, Morocco. pp.KS. ⟨hal-00533488⟩