Constraint satisfaction using a hybrid evolutionary hill-climbing algorithm that performs opportunistic arc and path revision
James Bowen, Gerry Vernon Dozier · National Conference on Artificial Intelligence · 1996
This paper introduces a hybrid evolutionary hill-climbing algorithm that quickly solves Constraint. Satisfaction Problems (CSPs). This hyhrid uses opportunistic arc and path revision in an interleaved fashion to reduce the size of the search space and to realize when to quit if a CSP is based on an inconsistent constraint network. This hybrid outperforms a well known hill-climbing algorithm, the Iterative Descent Method on a test suite of 750 randomly generated CSPs.