Solving strategies using a hybridization model for local search and constraint propagation

Authors:
Tony Lambert;Eric Monfroy;Frédéric Saubion
Affiliations:
Université de Nantes, France;Universidad Técnica Federico, Valparaíso, Chile;LERIA, Université de Angers, France
Venue:
Proceedings of the 2005 ACM symposium on Applied computing
Year:
2005

Citing 5
Cited 2

Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
Tabu Search

Tabu Search
Local search with constraint propagation and conflict-based heuristics

Artificial Intelligence
From Chaotic Iteration to Constraint Propagation

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Principles of Constraint Programming

Principles of Constraint Programming

Invited contribution: hybrid CSP solving

FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Solving the balanced academic curriculum problem with an hybridization of genetic algorithm and constraint propagation

ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 study combination strategies at a finer hybridization grain, based on a theoretical model for hybridization of local search and constraint propagation. In this framework, hybrid resolution can be achieved as the computation of a fixpoint of some specific reduction functions. Some experimental results show the interest of the model to design such hybridizations.