Guiding VNS with tree decomposition

Mathieu Fontaine (1) , Samir Loudni (1) , Patrice Boizumault (1)

1 Equipe CODAG - Laboratoire GREYC - UMR6072

Tree decomposition introduced by Robertson and Seymour aims to decompose a problem into clusters constituting an a cyclic 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 dependent 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.

Mots clés: constraint handling; pattern clustering; search problems; trees (mathematics); Constraint programming; Tree decomposition; VNS

Mathieu Fontaine, Samir Loudni, Patrice Boizumault. Guiding VNS with tree decomposition. Tools with Artificial Intelligence (ICTAI), 2011 23rd IEEE International Conference on, Nov 2011, boca raton, Floride, United States. pp.505 - 512, ⟨10.1109/ICTAI.2011.82⟩. ⟨hal-01018444⟩