par Marmion, Marie-Eléonore 
;Blot, Aymeric;Jourdan, Laetitia;Dhaenens, Clarisse
Référence Lecture notes in computer science, 7997 LNCS, page (125-130)
Publication Publié, 2013
;Blot, Aymeric;Jourdan, Laetitia;Dhaenens, ClarisseRéférence Lecture notes in computer science, 7997 LNCS, page (125-130)
Publication Publié, 2013
Article révisé par les pairs
| Résumé : | In this paper, the neutrality of some hard instances of the graph coloring problem (GCP) is quantified. This neutrality property has to be detected as it impacts the search process. Indeed, local optima may belong to plateaus that represent a barrier for local search methods. Then, we also aim at pointing out the interest of exploiting neutrality during the search. Therefore, a generic local search dedicated to neutral problems, NILS, is performed on several hard instances. © 2013 Springer-Verlag. |
