A general approach for constraint solving by local search
P Galinier, JK Hao - Journal of Mathematical Modelling and Algorithms, 2004 - Springer
P Galinier, JK Hao
Journal of Mathematical Modelling and Algorithms, 2004•SpringerIn this paper, we present a general approach for solving constraint problems by local search.
The proposed approach is based on a set of high-level constraint primitives motivated by
constraint programming systems. These constraints constitute the basic bricks to formulate a
given combinatorial problem. A tabu search engine ensures the resolution of the problem so
formulated. Experimental results are shown to validate the proposed approach.
The proposed approach is based on a set of high-level constraint primitives motivated by
constraint programming systems. These constraints constitute the basic bricks to formulate a
given combinatorial problem. A tabu search engine ensures the resolution of the problem so
formulated. Experimental results are shown to validate the proposed approach.
Abstract
In this paper, we present a general approach for solving constraint problems by local search. The proposed approach is based on a set of high-level constraint primitives motivated by constraint programming systems. These constraints constitute the basic bricks to formulate a given combinatorial problem. A tabu search engine ensures the resolution of the problem so formulated. Experimental results are shown to validate the proposed approach.
Springer
Showing the best result for this search. See all results