International Conference on Principles and Practice of Constraint Programming

CP 2015: Principles and Practice of Constraint Programming pp 12-29

Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP

  • David Allouche
  • Simon de Givry
  • George Katsirelos
  • Thomas Schiex
  • Matthias Zytnicki
Conference paper

DOI: 10.1007/978-3-319-23219-5_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9255)
Cite this paper as:
Allouche D., de Givry S., Katsirelos G., Schiex T., Zytnicki M. (2015) Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP. In: Pesant G. (eds) Principles and Practice of Constraint Programming. CP 2015. Lecture Notes in Computer Science, vol 9255. Springer, Cham

Abstract

We propose Hybrid Best-First Search (HBFS), a search strategy for optimization problems that combines Best-First Search (BFS) and Depth-First Search (DFS). Like BFS, HBFS provides an anytime global lower bound on the optimum, while also providing anytime upper bounds, like DFS. Hence, it provides feedback on the progress of search and solution quality in the form of an optimality gap. In addition, it exhibits highly dynamic behavior that allows it to perform on par with methods like limited discrepancy search and frequent restarting in terms of quickly finding good solutions.

We also use the lower bounds reported by HBFS in problems with small treewidth, by integrating it into Backtracking with Tree Decomposition (BTD). BTD-HBFS exploits the lower bounds reported by HBFS in individual clusters to improve the anytime behavior and global pruning lower bound of BTD.

In an extensive empirical evaluation on optimization problems from a variety of application domains, we show that both HBFS and BTD-HBFS improve both anytime and overall performance compared to their counterparts.

Keywords

Combinatorial optimization Anytime algorithm Weighted constraint satisfaction problem Cost function networks Best-first search Tree decomposition 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • David Allouche
    • 1
  • Simon de Givry
    • 1
  • George Katsirelos
    • 1
  • Thomas Schiex
    • 1
  • Matthias Zytnicki
    • 1
  1. 1.MIAT, UR-875, INRACastanet TolosanFrance

Personalised recommendations