A Theoretical Framework for Local Search Techniques

E. Monfroy; F. Saubion; B. Crawford; C. Castro

doi:10.1109/CSE.2008.40

A Theoretical Framework for Local Search Techniques

Monfroy, E., Saubion, F., Crawford, B., Castro, C.

Source

2008 11th IEEE International Conference on Computational Science and Engineering > 335 - 342

Abstract

In the paper we describe a theoretical framework to model local search as the computation of a fixed point of functions. There are only few studies of theoretical frameworks for local search, this work allows one to simulate standard strategies used for local search and to easily design new strategies in a uniform framework. The use of this framework is illustrated through the description of Tabu search and random walk methods for solving different instances of Sudoku problem.