A Local Search Method for Constraint Solving - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2001

A Local Search Method for Constraint Solving

Résumé

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.
Fichier non déposé

Dates et versions

hal-00668309 , version 1 (09-02-2012)

Identifiants

  • HAL Id : hal-00668309 , version 1

Citer

Philippe Codognet, Daniel Diaz. A Local Search Method for Constraint Solving. AAAI Fall Symposium "Using Uncertainty within Computation", 2001, North Falmouth, Cape Cod, United States. pp.38-46. ⟨hal-00668309⟩
94 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More