In this paper, we address the incomplete resolution of the Constraint Satisfaction Problem. In this purpose, we present a new meta-heuristic based on local search and constraint programming techniques. This meta-heuristic combines some filtering techniques and constraint propagation process used by complete methods in order to guide the search and to escape from local optima. Experiments are performed over two types of problems random CSP and MI-FAP Radio Link Frequency Assignment Problem (RLFAP), which is real application. Obtained results, on these problems, compared to the state of the art methods, revealed the effectiveness of our meta-heuristic in term of quality of solution.
展开▼
