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 respect to state of the art algorithms.
منابع مشابه
Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملAn E cient Heuristic - Based Evolutionary Algorithm for SolvingConstraint Satisfaction ProblemsVincent
GENET and EGENET are artiicial neural networks with remarkable success in solving hard constraint satisfaction problems (CSPs) such as car se-quencing problems. (E)GENET uses the min-connict heuristic in variable updating to nd local minima, and then applies heuristic learning rule(s) to escape the local minima not representing solution(s). In this paper we describe a micro-genetic algorithm (M...
متن کاملAn E cient Heuristic-Based Evolutionary Algorithm for Solving Constraint Satisfaction Problems
GENET and EGENET are local search algorithms based on artiicial neural networks which have proved very successful in solving hard constraint satisfaction problems (CSPs). In this paper we describe a micro-genetic algorithm for solving CSPs which generalizes the (E)GENET approach. It is based on min-connict local search together with two methods for escaping local minima: population based learni...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling means assigning a value to a variable.) Solu...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997