Comparing CSP Algorithms Without Considering Variable Ordering Heuristics can be Misleading
نویسندگان
چکیده
Many new algorithms for solving constraint satisfaction problems have been proposed in recent years. Their performance is usually compared with some other algorithms by measuring the number of compatibility checks or the cpu time that the algorithms need for solving a predetermined set of problems. There are some studies which compare algorithms without using any variable ordering heuristics. We argue that evaluating algorithms without considering their combinations with variable ordering heuristic could produce misleading results. We advocate that algorithm-heuristic combinations should be compared instead of algorithms alone.
منابع مشابه
Using SAT Encodings to Drive CSP Value Ordering Heuristics
In this paper, we address the issue of designing from SAT new value ordering heuristics for CSP. We show that using the direct and support SAT encodings of CSP instances, such heuristics can be naturally derived from the well-known two-sided Jeroslow-Wang heuristic. These heuristics exploit the bi-directionality of constraint supports to give a more comprehensive picture in terms of domain redu...
متن کاملTwo New Lightweight Arc Consistency Algorithms
Coarse-grained arc consistency algorithms like AC-3, AC-3d, and AC-2001, are efficient when it comes to transforming a Constraint Satisfaction Problem (CSP) to its arc consistent equivalent. These algorithms repeatedly carry out revisions to remove unsupported values from the domains of the variables. The order of these revisions is determined by so-called revision ordering heuristics. In this ...
متن کاملVariable and Value Ordering Decision Matrix Hyper-heuristics: A Local Improvement Approach
Constraint Satisfaction Problems (CSP) represent an important topic of study because of their many applications in different areas of artificial intelligence and operational research. When solving a CSP, the order in which the variables are selected to be instantiated and the order of the values to be tried affect the complexity of the search. Hyper-heuristics are flexible methods that provide ...
متن کاملWordwise Algorithms and Improved Heuristics for Solving Hard Constraint Satisfaction Problems
We present two improvements for solving constraint satisfaction problems. First, we show that on problems that truly bring out the exponential complexity of CSPs, wordwise algorithms are extremely e ective. Then, based on probabilistic models of CSP algorithms, we derive new variable ordering heuristics that incorporate local information. Our experimental results show substantial gains with res...
متن کاملA Mixed Closure-CSP Method to Solve Scheduling Problems
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-based methods which interleave (sequentially) searching efforts with the application of consistency enforcing mechanisms and variable/ordering heuristics. Thus, the number of backtrackings needed to obtain a solution is...
متن کامل