Skip to main content
SpringerLink
Log in

Intensification/Diversification in Decomposition Guided VNS

  • Conference paper
Book cover Hybrid Metaheuristics (HM 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7919))

Included in the following conference series:

Abstract

Tree decomposition introduced by Robertson and Seymour aims to decompose a problem into clusters constituting an acyclic graph. In a previous paper, we have introduced DGVNS (Decomposition Guided VNS) which uses the graph of clusters to manage the exploration of large neighborhoods. In this paper, we go one step further by proposing three new strategies that exploit the graph of clusters enabling a better intensification and diversification in DGVNS. Experiments performed on random instances (GRAPH) and real life instances (RLFAP, SPOT5 and tagSNP) show the appropriateness and the efficiency of our proposals.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

  2. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM. J. on Algebraic and Discrete Methods 8, 277–284 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bensana, E., Lemaître, M., Verfaillie, G.: Earth observation satellite management. Constraints 4(3), 293–299 (1999)

    Article  MATH  Google Scholar 

  4. Cabon, B., de Givry, S., Lobjois, L., Schiex, T., Warners, J.P.: Radio link frequency assignment. Constraints 4(1), 79–89 (1999)

    Article  MATH  Google Scholar 

  5. de Givry, S., Schiex, T., Verfaillie, G.: Exploiting tree decomposition and soft local consistency in weighted CSP. In: AAAI, pp. 22–27. AAAI Press (2006)

    Google Scholar 

  6. Dechter, R., Pearl, J.: Tree clustering for constraint networks. Artif. Intell. 38(3), 353–366 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  7. Carlson, C.S., et al.: Selecting a maximally informative set of single-nucleotide polymorphisms for association analyses using linkage disequilibrium. Am. J. of Hum. Genetics 74(1), 106–120 (2004)

    Article  Google Scholar 

  8. Fontaine, M., Loudni, S., Boizumault, P.: Guiding VNS with tree decomposition. In: ICTAI, pp. 505–512. IEEE (2011)

    Google Scholar 

  9. Gottlob, G., Lee, S.T., Valiant, G.: Size and treewidth bounds for conjunctive queries. In: PODS, pp. 45–54 (2009)

    Google Scholar 

  10. Gottlob, G., Miklós, Z., Schwentick, T.: Generalized hypertree decompositions: Np-hardness and tractable variants. J. ACM 56(6) (2009)

    Google Scholar 

  11. Hansen, P., Mladenovic, N., Perez-Brito, D.: Variable neighborhood decomposition search. Journal of Heuristics 7(4), 335–350 (2001)

    Article  MATH  Google Scholar 

  12. Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: IJCAI (1), pp. 607–615. Morgan Kaufmann (1995)

    Google Scholar 

  13. Koster, A.M.C.A., Bodlaender, H.L., van Hoesel, S.P.M.: Treewidth: Computational experiments. ENDM 8, 54–57 (2001)

    Google Scholar 

  14. Larrosa, J., Schiex, T.: In the quest of the best form of local consistency for Weighted CSP. In: IJCAI, pp. 239–244 (2003)

    Google Scholar 

  15. Linhares, A., Yanasse, H.H.: Search intensity versus search diversity: a false trade off? Appl. Intell. 32(3), 279–291 (2010)

    Article  Google Scholar 

  16. Loudni, S., Boizumault, P.: Combining VNS with constraint programming for solving anytime optimization problems. EJOR 191, 705–735 (2008)

    Article  MATH  Google Scholar 

  17. Marinescu, R., Dechter, R.: AND/OR branch-and-bound search for combinatorial optimization in graphical models. Artif. Intell. 173(16-17), 1457–1491 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  18. Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers and Operations Research 24, 1097–1100 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  19. Neveu, B., Trombettoni, G., Glover, F.: ID Walk: A candidate list strategy with a simple diversification device. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 423–437. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  20. Rish, I., Dechter, R.: Resolution versus search: Two strategies for SAT. J. Autom. Reasoning 24(1/2), 225–275 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  21. Robertson, N., Seymour, P.D.: Graph minors. ii. Algorithmic aspects of tree-width. J. Algorithms 7(3), 309–322 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  22. Sánchez, M., Allouche, D., de Givry, S., Schiex, T.: Russian doll search with tree decomposition. In: Boutilier, C. (ed.) IJCAI, pp. 603–608 (2009)

    Google Scholar 

  23. Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  24. Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13(3), 566–579 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  25. Terrioux, C., Jégou, P.: Hybrid backtracking bounded by tree-decomposition of constraint networks. Artificial Intelligence 146(1), 43–75 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  26. van Benthem, H.: GRAPH: Generating radiolink frequency assignment problems heuristically (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. UMR 6072 GREYC, Université de Caen Basse-Normandie, F-14032, Caen, France

    Samir Loudni, Mathieu Fontaine & Patrice Boizumault

  2. UMR 6072 GREYC, CNRS, F-14032, Caen, France

    Samir Loudni, Mathieu Fontaine & Patrice Boizumault

Authors
  1. Samir Loudni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mathieu Fontaine
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Patrice Boizumault
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universitat Politècnica de Catalunya, Omega 213 Campus Nord, Jordi Girona 1-3, 08034, Barcelona, Spain

    María J. Blesa

  2. IKERBASQUE, Basque Foundation for Science, Department of Computer Science and Artificial Intelligence, University of the Basque Country, Paseo Manuel Lardizabal 1, 20018, San Sebastian, Spain

    Christian Blum

  3. Department of Mathematics and Applications “R. Caccioppoli”, Compl. M.S.A., University of Naples Federico II, Via Cintia, 80126, Naples, Italy

    Paola Festa

  4. DISI, Università di Bologna, Campus of Cesena, Via Venezia 52, 47521, Cesena, Italy

    Andrea Roli

  5. IRIDIA CP 194/6, Université Libre de Bruxelles, Avenue Franklin D. Roosevelt 50, 1050, Bruxelles, Belgium

    Michael Sampels

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Loudni, S., Fontaine, M., Boizumault, P. (2013). Intensification/Diversification in Decomposition Guided VNS. In: Blesa, M.J., Blum, C., Festa, P., Roli, A., Sampels, M. (eds) Hybrid Metaheuristics. HM 2013. Lecture Notes in Computer Science, vol 7919. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38516-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38516-2_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38515-5

  • Online ISBN: 978-3-642-38516-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation