Experimental studies of variable selection strategies based on constraint weights

Variable ordering heuristics that sample information before or during search in order to inform subsequent decisions have shown better performance and greater robustness than standard heuristics. One such strategy, the ''weighted degree heuristic,'' is based on weighting constraints according to their involvement in failure during search. A more recent approach uses ''random probing'' with restarting to gain information less subject to sampling bias. To date, these approaches have not been carefully analysed experimentally. In the present work, several important findings are presented, including a better delineation of the class of events that is sampled, an analysis of the importance of informed choices at the beginning of search, and a demonstration that random probing identifies sources of global contention effectively even when these are not clearly demarcated. These experiments show how empirical analysis can clarify subtle issues in the analysis of heuristic procedures for difficult search problems.

[1]  Christian Bessiere,et al.  MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems , 1996, CP.

[2]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[3]  Richard J. Wallace Analysis of Heuristic Synergies , 2005, CSCLP.

[4]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[5]  Roberto Rossi,et al.  Cost-Based Filtering for Stochastic Inventory Control , 2006, CSCLP.

[6]  Bart Selman,et al.  Backdoors To Typical Case Complexity , 2003, IJCAI.

[7]  J. Christopher Beck,et al.  Trying Again to Fail-First , 2004, CSCLP.

[8]  Peter van Beek,et al.  Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings , 2005, CP.

[9]  Richard J. Wallace,et al.  Heuristic Policy Analysis and Efficiency Assessment in Constraint Satisfaction Search , 2006, 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06).

[10]  Lakhdar Sais,et al.  Boosting Systematic Search by Weighting Constraints , 2004, ECAI.

[11]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[12]  Richard Wallace Factor Analytic Studies of CSP Heuristics , 2005, CP.

[13]  Barbara M. Smith,et al.  Trying Harder to Fail First , 1998, ECAI.

[14]  J. Christopher Beck,et al.  Variable Ordering Heuristics Show Promise , 2004, CP.

[15]  Richard J. Wallace,et al.  Sampling Strategies and Variable Selection in Weighted Degree Heuristics , 2007, CP.

[16]  R. Wallace,et al.  Learning from Failure in Constraint Satisfaction Search , 2006 .

[17]  Richard J. Wallace,et al.  Learning to Identify Global Bottlenecks in Constraint Satisfaction Search , 2007, FLAIRS.