A memetic algorithm for the minimum sum coloring problem
Résumé
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]
Fichier principal
A_memetic_algorithm_for_minimum_sum_coloring_problem.pdf (118.98 Ko)
Télécharger le fichier
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...