A Generic Framework for Local Search: Application to the Sudoku Problem
Constraint Satisfaction Problems (CSP) provide a general framework for modeling many practical applications. CSPs can be solved with complete methods or incomplete methods. Although some frameworks has been designed to formalized constraint propagation, there are only few studies of theoretical frameworks for local search. In this paper, we are concerned with the design of a generic framework to model local search as the computation of a fixed point of functions and to solve the Sudoku problem. This work allows one to simulate standard strategies used for local search, and to design easily new strategies in a uniform framework.
KeywordsLocal Search Tabu Search Constraint Satisfaction Problem Constraint Propagation Local Search Algorithm
- 2.Apt, K.: From chaotic iteration to constraint propagation. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 36–55. Springer, Heidelberg (1997)Google Scholar
- 3.Focacci, F., Laburthe, F., Lodi, A.: Local search and constraint programming. In: Handbook of Metaheuristics. Kluwer, Dordrecht (2002)Google Scholar
- 5.Hao, J.K., Dorne, R.: Empirical studies of heuristics local search for constraint solving. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol. 1118, pp. 184–208. Springer, Heidelberg (1996)Google Scholar
- 8.Régin, J.C.: A filtering algorithm for constraint of difference in csps. In: National Conference of Artificial Intelligence, pp. 362–367 (1994)Google Scholar