Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Hybrid Metaheuristics

HM 2014: Hybrid Metaheuristics pp 100–114Cite as

Cooperative Parallel Decomposition Guided VNS for Solving Weighted CSP

  • Conference paper

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

Abstract

Tree decomposition introduced by Robertson and Seymour aims to decompose a problem into clusters constituting an acyclic graph. Recently, Fontaine et al. [8] introduced DGVNS (Decomposition Guided VNS) that uses the graph of clusters provided by a tree decomposition to manage the exploration of large neighborhoods. However, for large scale problems, the performance of DGVNS may decrease significantly due to the large number of clusters to be considered sequentially. To overcome this shortcoming we propose CPDGVNS (Cooperative Parallel DGVNS) in which the clusters are explored in parallel through an asynchronous master-slave architecture. Experiments performed on real life instances show the appropriateness and the efficiency of our approach.

This is a preview of subscription content, 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   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  3. 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 

  4. Crainic, T.G., Gendreau, M., Hansen, P., Mladenovic, N.: Cooperative parallel variable neighborhood search for the p-median. Journal of Heuristics 10(3), 293–314 (2004)

    Article  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. Artificial Intelligence 38(3), 353–366 (1989)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  8. Fontaine, M., Loudni, S., Boizumault, P.: Exploiting tree decomposition for guiding neighborhoods exploration for VNS. RAIRO Operations Research 47(2), 91–123 (2013)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  11. 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 

  12. Loudni, S., Boizumault, P.: Combining VNS with constraint programming for solving anytime optimization problems. European Journal of Operational Research 191, 705–735 (2008)

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  15. Pearl, J.: Probabilistic inference in intelligent systems. In: Networks of Plausible Inference. Morgan Kaufmann (1998)

    Google Scholar 

  16. Rish, I., Dechter, R.: Resolution versus search: Two strategies for SAT. Journal of Automated Reasoning 24(1/2), 225–275 (2000)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  18. 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 

  19. Sánchez, M., de Givry, S., Schiex, T.: Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques. Constraints 13(1-2), 130–154 (2008)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire LITIO, Université d’Oran, BP 1524, El-M’Naouer, 31000, Oran, Algeria

    Abdelkader Ouali, Lakhdar Loukil & Yahia Lebbah

  2. CNRS, UMR 6072 GREYC, University of Caen, 14032, Caen, France

    Samir Loudni & Patrice Boizumault

Authors
  1. Abdelkader Ouali
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Samir Loudni
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lakhdar Loukil
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Patrice Boizumault
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Yahia Lebbah
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Jordi Girona 1-3, edif. Omega, 08034, Barcelona, Spain

    Maria J. Blesa

  2. Dept. of Computer Science, IKERBASQUE and University of the Basque Country, Paseo Manuel Lardizabal 1, 20018, Donostia, Spain

    Christian Blum

  3. Dept. of Business and Informatics, University of Hamburg, Institute of Information Systems, Von-Melle-Park 5, 20146, Hamburg, Germany

    Stefan Voß

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Ouali, A., Loudni, S., Loukil, L., Boizumault, P., Lebbah, Y. (2014). Cooperative Parallel Decomposition Guided VNS for Solving Weighted CSP. In: Blesa, M.J., Blum, C., Voß, S. (eds) Hybrid Metaheuristics. HM 2014. Lecture Notes in Computer Science, vol 8457. Springer, Cham. https://doi.org/10.1007/978-3-319-07644-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07644-7_8

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07643-0

  • Online ISBN: 978-3-319-07644-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation