Local search with constraint propagation and conflict-based heuristics

Narendra Jussien (1) , Olivier Lhomme (2)

1 TASC - Theory, Algorithms and Systems for Constraints
2 ILOG SA [Gentilly]

In this paper, we introduce a new solving algorithm for Constraint Satisfaction Problems (CSP). It performs an overall local search helped with a domain filtering technique to prune the search space. Conflicts detected during filtering are used to guide the search. First experiments with a tabu version of the algorithm have shown good results on hard instances of open shop scheduling problems. It competes well with the best highly specialized algorithms.

Domaines: Intelligence artificielle [cs.AI]; Recherche opérationnelle [math.OC]

Narendra Jussien, Olivier Lhomme. Local search with constraint propagation and conflict-based heuristics. Artificial Intelligence, 2002, 139 (1), pp.21-45. ⟨hal-00312750⟩