A dynamic constraint-directed ordered search algorithm for solving constraint satisfaction problems

Authors:
Wesley W. Chu;Patrick Ngai
Affiliations:
Computer Science Department, University of California, Los Angeles, Los Angeles, CA;Computer Science Department, University of California, Los Angeles, Los Angeles, CA
Venue:
IEA/AIE '88 Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1
Year:
1988

Citing 4
Cited 2

The complexity of some polynomial network consistency algorithms for constraint satisfaction problems

Artificial Intelligence
A Sufficient Condition for Backtrack-Free Search

Journal of the ACM (JACM)
Synthesizing constraint expressions

Communications of the ACM
Backtrack programming techniques

Communications of the ACM

Staffing a software project: A constraint satisfaction and optimization-based approach

Computers and Operations Research
Improving the performance of vector hyper-heuristics through local search

Proceedings of the 14th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many engineering problems such as Job Shop Scheduling can be categorized as constraint satisfaction problems. We propose the Dynamic Constraint-directed Ordered Search (DCOS) to solve such problems. DCOS repeatedly re-arranges the search order of the variables and eliminates its local inconsistencies by using a low order network consistency algorithm. As a result, it reduces the width of the search tree. The reduction of the width of the search tree causes the decrease in the number of backtrackings required to find the solution. We have applied DCOS to the Graph Coloring Problem and the Zebra Problem with a second order network consistency algorithm and obtained almost-backtrack-free searches for both cases.