Skip to Main content Skip to Navigation

Neutrality in the Graph Coloring Problem

Abstract : The graph coloring problem is often investigated in the literature. Many insights about many neighboring solutions with the same fitness value are raised but as far as we know, no deep analysis of this neutrality has ever been conducted in the literature. In this paper, we quantify the neutrality of some hard instances of the graph coloring problem. This neutrality property has to be detected as it impacts the search process. Indeed, local optima may belong to plateaus that represents a barrier for local search methods. In this work, 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.
Document type :
Complete list of metadata

Cited literature [29 references]  Display  Hide  Download
Contributor : Laetitia Jourdan Connect in order to contact the contributor
Submitted on : Friday, January 25, 2013 - 2:39:31 PM
Last modification on : Thursday, January 20, 2022 - 5:27:53 PM
Long-term archiving on: : Friday, April 26, 2013 - 3:55:35 AM


Files produced by the author(s)


  • HAL Id : hal-00781001, version 1
  • ARXIV : 1301.6092


Marie-Eleonore Marmion, Aymeric Blot, Laetitia Jourdan, Clarisse Dhaenens. Neutrality in the Graph Coloring Problem. [Research Report] RR-8215, INRIA. 2013, pp.15. ⟨hal-00781001⟩



Les métriques sont temporairement indisponibles