A Search Space "Cartography" for Guiding Graph Coloring Heuristics - LINA-DUKE Accéder directement au contenu
Article Dans Une Revue Computers and Operations Research Année : 2009

A Search Space "Cartography" for Guiding Graph Coloring Heuristics

Résumé

We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, we introduce the following clustering hypothesis: the high quality solutions are not randomly scattered in the search space, but rather grouped in clusters within spheres of specific diameter. We first provide intuitive evidence for this hypothesis by presenting a projection of a large set of local minima in the 3D space. An experimental confirmation is also presented: we introduce two algorithms that exploit the hypothesis by guiding an underlying Tabu Search (TS) process. The first algorithm (TS-Div) uses a learning process to guide the basic TS process toward as-yet-unvisited spheres. The second algorithm (TS-Int) makes deep investigations within a bounded region by organizing it as a tree-like structure of connected spheres. We experimentally demonstrate that if such a region contains a global optimum, TS-Int does not fail in eventually finding it. This pair of algorithms significantly outperforms the underlying basic TS algorithm; it can even improve some of the best-known solutions ever reported in the literature (e.g. for dsjc1000.9).
Fichier principal
Vignette du fichier
paperDist.pdf (293.14 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00421673 , version 1 (02-10-2009)

Identifiants

Citer

Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz. A Search Space "Cartography" for Guiding Graph Coloring Heuristics. Computers and Operations Research, 2009, 37 (4), pp.769-778. ⟨10.1016/j.cor.2009.06.024⟩. ⟨hal-00421673⟩
172 Consultations
289 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More