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 :
Reports
Liste complète des métadonnées

Cited literature [29 references]  Display  Hide  Download

https://hal.inria.fr/hal-00781001
Contributor : Laetitia Jourdan <>
Submitted on : Friday, January 25, 2013 - 2:39:31 PM
Last modification on : Thursday, February 21, 2019 - 10:52:49 AM
Document(s) archivé(s) le : Friday, April 26, 2013 - 3:55:35 AM

Files

RR-8215.pdf
Files produced by the author(s)

Identifiers

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

Citation

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⟩

Share

Metrics

Record views

431

Files downloads

501