Exploitation de la décomposition arborescente pour guider la recherche VNS - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Exploitation de la décomposition arborescente pour guider la recherche VNS

Abstract

Tree decomposition introduced by Robertson and Seymour aims to decompose a problem into clusters constituting an acyclic graph. There are works exploiting tree decomposition for complete search methods. In this paper, we show how tree decomposition can be used to efficiently guide the exploration of local search methods that use large neighborhoods like VNS. We introduce tightness dependant tree decomposition which allows to take advantage of both the structure of the problem and the constraints tightness. Experiments performed on random instances (GRAPH) and real life instances (CELAR and SPOT5) show the appropriateness and the efficiency of our approach.
Fichier principal
Vignette du fichier
jfpc2012_submission_10.pdf (354.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00810146 , version 1 (26-04-2013)

Identifiers

  • HAL Id : hal-00810146 , version 1

Cite

Mathieu Fontaine, Samir Loudni, Patrice Boizumault. Exploitation de la décomposition arborescente pour guider la recherche VNS. JFPC 2012, May 2012, toulouse, France. ⟨hal-00810146⟩
141 View
86 Download

Share

Gmail Facebook X LinkedIn More