Yet Another Local Search Method for Constraint Solving

We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advantage of the structure of the problem in terms of constraints and variables and can guide the search more precisely than a global cost function to optimize (such as for instance the number of violated constraints). We also use an adaptive memory in the spirit of Tabu Search in order to prevent stagnation in local minima and loops. This method is generic, can apply to a large class of constraints (e.g. linear and non-linear arithmetic constraints, symbolic constraints, etc) and naturally copes with over-constrained problems. Preliminary results on some classical CSP problems show very encouraging performances.

• Type: Conference
• Year: 2001
• Where: SAGA
• Authors: Philippe Codognet, Daniel Diaz
• Keywords: Constraint Satisfaction Problems, Control Systems, Local Search Method, Non-linear Arithmetic Constraints, SAGA 2001