On Hybridization of Local Search and Constraint Propagation [chapter]

Eric Monfroy, Frédéric Saubion, Tony Lambert
2004 Lecture Notes in Computer Science  
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
more » ... 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.
doi:10.1007/978-3-540-27775-0_21 fatcat:vs52zp4qfzag7heczi62cqhucm