Branching Schemes and Variable Ordering Heuristics for Constraint Satisfaction Problems: Is There Something to Learn?

When solving a constraint satisfaction problem by using systematic algorithms it is needed to expand and explore a search tree to find a solution. In this work we study both binary and k-way branching schemes while they interact with various variable ordering heuristics, and how those interactions affect the cost of finding a solution to different instances. Both branching schemes have been used in previous investigations and it is not straight forward to determine the conditions that make one branching scheme better than the other. But we provide evidence that, in order to decide, variable ordering heuristics play a major role in the performance of these branching schemes. This study is intended to work as a preliminary study to develop hyper-heuristics for branching schemes in combination with variable ordering heuristics. The final part of the analysis presents a very simple naive hyper-heuristic that randomly applies binary and k-way branching as the search progresses in combination with some well known variable ordering heuristics. The scope of this paper is to explore the interactions between different variable ordering heuristics and these two branching schemes, in order to produce some relations between their performance. We expect these relations to be used in further studies as the basis for more robust hyper-heuristics that take into consideration the information gathered in this investigation.

[1]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

[2]  Eoin O'Mahony,et al.  Using Case-based Reasoning in an Algorithm Portfolio for Constraint Solving ? , 2008 .

[3]  Edward M. Reingold,et al.  Backtrack programming techniques , 1975, CACM.

[4]  Sanjay Misra,et al.  Computational Science and Its Applications – ICCSA 2012 , 2012, Lecture Notes in Computer Science.

[5]  Sanja Petrovic,et al.  Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems , 2002 .

[6]  José Manuel Ferrández,et al.  New Challenges on Bioinspired Applications - 4th International Work-conference on the Interplay Between Natural and Artificial Computation, IWINAC 2011, La Palma, Canary Islands, Spain, May 30 - June 3, 2011. Proceedings, Part II , 2011, IWINAC.

[7]  Graham Kendall,et al.  Hyper-Heuristics: An Emerging Direction in Modern Search Technology , 2003, Handbook of Metaheuristics.

[8]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

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

[10]  P. A. Geelen,et al.  Dual Viewpoint Heuristics for Binary Constraint Satisfaction Problems , 1992, ECAI.

[11]  Kostas Stergiou,et al.  Experimental Evaluation of Branching Schemes for the CSP , 2010, ArXiv.

[12]  James M. McCollum,et al.  A constraint satisfaction algorithm for microcontroller selection and pin assignment , 2010, Proceedings of the IEEE SoutheastCon 2010 (SoutheastCon).

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

[14]  David G. Mitchell,et al.  2-Way vs. d-Way Branching for CSP , 2005, CP.

[15]  Broderick Crawford,et al.  Using Autonomous Search for Generating Good Enumeration Strategy Blends in Constraint Programming , 2012, ICCSA.

[16]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[17]  Barbara M. Smith,et al.  Value Ordering for Finding All Solutions , 2005, IJCAI.

[18]  Toby Walsh,et al.  An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem , 1996, CP.

[19]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling III , 2001, Lecture Notes in Computer Science.

[20]  Stuart M. Allen,et al.  Frequency Assignment Problems: Representations and Solutions , 1997 .

[21]  Graham Kendall,et al.  A Classification of Hyper-heuristic Approaches , 2010 .

[22]  Barbara M. Smith,et al.  Sparse Constraint Graphs and Exceptionally Hard Problems , 1995, IJCAI.

[23]  Barbara M. Smith,et al.  An Empirical Investigation of Value Ordering for Finding All Solutions , 2004 .

[24]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[25]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

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

[27]  Tad Hogg,et al.  Using Deep Structure to Locate Hard Problems , 1992, AAAI.

[28]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[29]  Susan L. Epstein,et al.  LEARNING TO SUPPORT CONSTRAINT PROGRAMMERS , 2005, Comput. Intell..

[30]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[31]  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.

[32]  Graham Kendall,et al.  A Hyperheuristic Approach to Scheduling a Sales Summit , 2000, PATAT.

[33]  Kostas Stergiou,et al.  Adaptive Branching for Constraint Satisfaction Problems , 2010, ECAI.

[34]  Eugene C. Freuder,et al.  Constraint-based reasoning , 1994 .

[35]  Paul Walton Purdom,et al.  Search Rearrangement Backtracking and Polynomial Average Time , 1983, Artif. Intell..

[36]  Hugo Terashima-Marín,et al.  Learning vector quantization for variable ordering in constraint satisfaction problems , 2013, Pattern Recognit. Lett..

[37]  Ke Xu,et al.  Random constraint satisfaction: Easy generation of hard (satisfiable) instances , 2007, Artif. Intell..

[38]  Michail G. Lagoudakis,et al.  Learning to Select Branching Rules in the DPLL Procedure for Satisfiability , 2001, Electron. Notes Discret. Math..

[39]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[40]  Vincent Se-jin Park.  AN EMPIRICAL STUDY OF DIFFERENT BRANCHING STRATEGIES FOR CONSTRAINT SATISFACTION PROBLEMS , 2004 .

[41]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[42]  Graham Kendall,et al.  Exploring Hyper-heuristic Methodologies with Genetic Programming , 2009 .

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

[44]  Martin E. Dyer,et al.  Locating the Phase Transition in Binary Constraint Satisfaction Problems , 1996, Artif. Intell..

[45]  Broderick Crawford,et al.  A Hyperheuristic Approach for Dynamic Enumeration Strategy Selection in Constraint Satisfaction , 2011, IWINAC.