Proposing a New Search Template for Modelling Languages

The major problem in solving combinatorial optimization problems is the huge size of the search space. To explore the search space in a reasonable time, using smart search algorithms is inevitable. One of the main difficulties in implementing search methods is the lack of a uniform, high-level template for all search paradigms. In this paper, we propose a high-level, parametric template suitable for modeling languages which covers both tree search and local search