Abstract
A Fuzzy Constraint Satisfaction Problem (FCSP) is an extension of the classical CSP, a powerful tool for modeling various problems based on constraints among variables. In traditional CSPs and FCSPs, values for the variables are chosen from discrete domains. However, this is often inconvenient when one wants to express real world problems. In this paper, we propose a new model that allows the variables to have a mixture of discrete and continuous domains. We show that this model, called HDFCSP (Hybrid Domain FCSP), can be solved by a new algorithm Spread Repair, an extension of the well-known iterative improvement algorithms. Experimental results on some test problems show that the algorithm has an ability of finding practical approximate solutions with high probability in a computation time much shorter than the traditional algorithms for the discrete-domain FCSPs.
