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 local search methods that use large neighborhoods like VNS. We propose DGVNS (Decomposition Guided VNS) which uses the graph of clusters in order to build neighborhood structures enabling better diversification and intensification. Second, we introduce tightness dependent tree decomposition which allows to take advantage of both the structure of the problem and the constraints tightness. Third, experiments performed on random instances (GRAPH) and real life instances (CELAR, SPOT5 and tagSNP) show the appropriateness and the efficiency of our approach. Moreover, we study and discuss the influence of the width of the tree decomposition on our approach and the relevance of removing clusters with very few proper variables from the tree decomposition.

Keywords: variable neighborhood search, tree decomposition, maximum cardinality search, cost functions netwok, constraint propagation

@article{RO_2013__47_2_91_0, author = {Fontaine, Mathieu and Loudni, Samir and Boizumault, Patrice}, title = {Exploiting {Tree} {Decomposition} for {Guiding} {Neighborhoods} {Exploration} for {VNS}}, journal = {RAIRO - Operations Research - Recherche Op\'erationnelle}, pages = {91--123}, publisher = {EDP-Sciences}, volume = {47}, number = {2}, year = {2013}, doi = {10.1051/ro/2013030}, mrnumber = {3055154}, zbl = {1267.68211}, language = {en}, url = {http://archive.numdam.org/articles/10.1051/ro/2013030/} }

TY - JOUR AU - Fontaine, Mathieu AU - Loudni, Samir AU - Boizumault, Patrice TI - Exploiting Tree Decomposition for Guiding Neighborhoods Exploration for VNS JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2013 SP - 91 EP - 123 VL - 47 IS - 2 PB - EDP-Sciences UR - http://archive.numdam.org/articles/10.1051/ro/2013030/ DO - 10.1051/ro/2013030 LA - en ID - RO_2013__47_2_91_0 ER -

%0 Journal Article %A Fontaine, Mathieu %A Loudni, Samir %A Boizumault, Patrice %T Exploiting Tree Decomposition for Guiding Neighborhoods Exploration for VNS %J RAIRO - Operations Research - Recherche Opérationnelle %D 2013 %P 91-123 %V 47 %N 2 %I EDP-Sciences %U http://archive.numdam.org/articles/10.1051/ro/2013030/ %R 10.1051/ro/2013030 %G en %F RO_2013__47_2_91_0

Fontaine, Mathieu; Loudni, Samir; Boizumault, Patrice. Exploiting Tree Decomposition for Guiding Neighborhoods Exploration for VNS. RAIRO - Operations Research - Recherche Opérationnelle, Volume 47 (2013) no. 2, pp. 91-123. doi : 10.1051/ro/2013030. http://archive.numdam.org/articles/10.1051/ro/2013030/

[1] http://www-sop.inria.fr/coprin/neveu/incop/presentation-incop.html.

[2] Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods 8 (1987) 277-284. | MR | Zbl

, and ,[3] Weighted and unweighted maximum clique algorithms with upper bounds from fractional colorings. Algorithmica 15 (1996) 397-412. | MR | Zbl

and ,[4] Earth observation satellite management. Constraints 4 (1999) 293-299. | Zbl

, and ,[5] Exact and approximate methods for the daily management of an earth observation satellite, in Proc. of the 4th International Symposium on Space Mission Operations and Ground Data Systems (SpaceOps-9-) (1996).

, , , and ,[6] IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009 (2009).

, editor.[7] Radio link frequency assignment. Constraints 4 (1999) 79-89. | Zbl

, , , and ,[8] Using haplotype blocks to map human complex trait loci. Trends Genetics 19 (2003) 135-140.

and ,[9] Soft arc consistency revisited. Artif. Intell. 174 (2010) 449-478. | MR | Zbl

, , , , and ,[10] Existential arc consistency: Getting closer to full arc consistency in weighted CSPs. IJCAI (2005) 84-89.

, , and ,[11] Exploiting tree decomposition and soft local consistency in weighted CSP. AAAI Press (2006) 22-27.

, and ,[12] Simon. de Givry, Rapport d'habilitation à diriger les recherches. INRA UBIA Toulouse (2011).

[13] Tree clustering for constraint networks. Artif. Intell. 38 (1989) 353-366. | MR | Zbl

and ,[14] Selecting a maximally informative set of single-nucleotide polymorphisms for association analyses using linkage disequilibrium. Am. J. Hum. Genet. 74 (2004) 106-120.

et al.[15] Guiding VNS with tree decomposition. ICTAI. IEEE (2011) 505-512.

, and ,[16] The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory Ser. B 16 (1974) 47-56. | MR | Zbl

,[17] Size and treewidth bounds for conjunctive queries, in edited by Jan Paredaens and Jianwen Su. PODS ACM (2009) 45-54. | Zbl

, and ,[18] Generalized hypertree decompositions: Np-hardness and tractable variants. J. ACM 56 (2009). | MR

, and ,[19] Tractable database design through bounded treewidth, in PODS, edited by Stijn Vansummeren. ACM (2006) 124-133.

, and ,[20] Variable neighborhood decomposition search. J. Heuristics 7 (2001) 335-350. | Zbl

, and ,[21] Limited discrepancy search, in IJCAI (1). Morgan Kaufmann (1995) 607-615.

and ,[22] Computing and exploiting tree-decompositions for solving constraint networks, in CP, edited by Peter van Beek. Springer. Lect. Notes Comput. Sci. 3709 (2005) 777-781.

, and ,[23] Strategies and heuristics for exploiting tree-decompositions of constraint networks, in Inference methods based on graphical structures of knowledge (WIGSK'06) (2006) 13-18.

, and ,[24] Exploiting decomposition on constraint problems with high tree-width, in Boutilier [6] 525-531.

and ,[25] Treewidth: Computational experiments. Electr. Notes Discrete Math. 8 (2001) 54-57. | MR | Zbl

, and ,[26] In the quest of the best form of local consistency for weighted CSP, in IJCAI (2003) 239-244.

and ,[27] Solving weighted CSP by maintaining arc consistency. Artif. Intell. 159 (2004) 1-26. | MR | Zbl

and ,[28] Combining VNS with constraint programming for solving anytime optimization problems. EJOR 191 (2008) 705-735. | Zbl

and ,[29] AND/OR branch-and-bound search for combinatorial optimization in graphical models. Artif. Intell. 173 (2009) 1457-1491. | MR | Zbl

and ,[30] Variable neighborhood search. Comput. Oper. Res. 24 (1997) 1097-1100. | MR | Zbl

and .[31] ID Walk: A candidate list strategy with a simple diversification device. in Wallace [45] 423-437. | Zbl

, and ,[32] Optimization, approximation and complexity classes. J. Comput. Syst. Sci. 43 (1991) 425-440. | MR | Zbl

and ,[33] Probabilistic inference in intelligent systems, in Networks of Plausible Inference. Morgan Kaufmann (1998). | MR

,[34] Propagation guided large neighborhood search, in Wallace [45] 468-481. | Zbl

, and ,[35] An efficient comprehensive search algorithm for tagsnp selection using linkage disequilibrium criteria. Bioinformatics 22 (2006) 220-225.

, and ,[36] Resolution versus search: Two strategies for sat. J. Autom. Reason. 24 (2000) 225-275. | MR | Zbl

and ,[37] Graph minors. ii. algorithmic aspects of tree-width. J. Algorithms 7 (1986) 309-322. | MR | Zbl

and ,[38] Russian doll search with tree decomposition, in Boutilier [6] 603-608.

, , and ,[39] Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques. Constraints 13 (2008) 130-154. | MR | Zbl

, and ,[40] An algorithm for optimal winner determination in combinatorial auctions, in IJCAI'99 (1999) 342-347. | Zbl

,[41] Using constraint programming and local search methods to solve vehicle routing problems, in CP, edited by M.J. Maher and J.-F. Puget. Springer. Lect. Notes Comput. Sci. 1520 (1998) 417-431.

,[42] Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13 (1984) 566-579. | MR | Zbl

and .[43] Hybrid backtracking bounded by tree-decomposition of constraint networks. Artif. Intell. 146 (2003) 43-75. | MR | Zbl

and ,[44] GRAPH: Generating radiolink frequency assignment problems heuristically. Master Thesis, Delft Univ. Technol, The Netherlands (1995).

,[45] Principles and Practice of Constraint Programming - CP 2004, 10th International Conference, CP 2004, Toronto, Canada, September 27 - October 1, 2004, Proceedings. Springer. Lect. Notes Comput. Sci. 3258 (2004).

, editor.*Cited by Sources: *