On Hybridization of Local Search and Constraint Propagation

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.

[1]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[2]  Krzysztof R. Apt,et al.  Principles of constraint programming , 2003 .

[3]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[4]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

[5]  Peter J. Stuckey,et al.  Programming with Constraints: An Introduction , 1998 .

[6]  Thomas C. Henderson,et al.  Arc and Path Consistency Revisited , 1986, Artif. Intell..

[7]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[8]  Joxan Jaffar,et al.  Principles and Practice of Constraint Programming – CP’99 , 1999, Lecture Notes in Computer Science.

[9]  Krzysztof R. Apt,et al.  The Rough Guide to Constraint Propagation , 1999, CP.

[10]  Rina Dechter,et al.  Principles and Practice of Constraint Programming – CP 2000 , 2001, Lecture Notes in Computer Science.

[11]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[12]  Eric Monfroy,et al.  Implementing Constraint Propagation by Composition of Reductions , 2003, ICLP.

[13]  Krzysztof R. Apt,et al.  From Chaotic Iteration to Constraint Propagation , 1997, ICALP.

[14]  Principles and Practice of Constraint Programming — CP98 , 1999, Lecture Notes in Computer Science.

[15]  Narendra Jussien,et al.  Local search with constraint propagation and conflict-based heuristics , 2000, Artif. Intell..

[16]  Steven David Prestwich.  A Hybrid Search Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences , 2000, CP.

[17]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[18]  Andrea Lodi,et al.  Local Search and Constraint Programming , 2003, Handbook of Metaheuristics.

[19]  Alan K. Mackworth.  Constraint Satisfaction , 1985 .

[20]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[21]  Michel Gendreau,et al.  A View of Local Search in Constraint Programming , 1996, CP.