Yet Another Local Search Method for Constraint Solving

  title={Yet Another Local Search Method for Constraint Solving},
  author={Philippe Codognet and Daniel Diaz},
We here 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… CONTINUE READING
Highly Cited
This paper has 124 citations. REVIEW CITATIONS


Publications citing this paper.

125 Citations

Citations per Year
Semantic Scholar estimates that this publication has 125 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 25 references

Solving permutation problems by ant colony optimization

  • C. Solnon
  • In proc. ECAI’2000, Berlin, Germany, Wiley,
  • 2000
Highly Influential
5 Excerpts

Computer solutions of the traveling salesman problem

  • S. Lin
  • Bell System Technical Journal, vol
  • 1965
Highly Influential
3 Excerpts

Localizer++ : an open library for local search

  • L. Michel, P. Van Hentenryck
  • Research Report, Brown University
  • 2001
3 Excerpts


  • L. Michel, P. Van Hentenryck
  • Constraints, vol. 5 no. 1&2,
  • 2000
3 Excerpts

The implementation of GNU Prolog

  • D. Diaz, P. Codognet
  • In proc. SAC’OO, 15th ACM Symposium on Applied…
  • 2000
3 Excerpts

and D

  • Z. Michalewic
  • Fogel. How to solve it: Modern Heuristics…
  • 2000
1 Excerpt

Similar Papers

Loading similar papers…