Hybridization of local search and constraint programming techniques for solving Constraint Satisfaction Problems is generally restricted to some kind of master-slave combinations for specific classes of problems. In this paper we propose a theoretical model based on K.R. Apt's chaotic iterations for hybridization of local search and constraint propagation. Hybrid resolution can be achieved as the computation of a fixpoint of some specific reduction functions. Our framework opens up new and finer possibilities for hybridization/combination strategies. We also present some combinations of techniques such as tabu search, node and bound consistencies. Some experimental results show the interest of our model to design such hybridization. © Springer-Verlag 2004.
CITATION STYLE
Monfroy, E., Saubion, F., & Lambert, T. (2004). On hybridization of local search and constraint propagation. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3132, 299–313. https://doi.org/10.1007/978-3-540-27775-0_21
Mendeley helps you to discover research relevant for your work.