Hybrid domain fuzzy constraint satisfaction problems and spread-repair algorithms

The present paper propose a new type fuzzy CSP (constraint satisfaction problem) that have a mixture of discrete and continuous domains, and spread-repair algorithm. In traditional CSP and fuzzy CSP, values for the variables are chosen from the discrete domains. However, this is often inconvenient when one wants to express real world problems. We show that this model, called HDFCSP (hybrid domain fuzzy CSP), can be solved by spread-repair, an extension of the well known iterative improvement algorithms. Experimental results on some test problems show that the algorithm actually has an ability of finding partial approximate solutions with high probability in a computation time much shorter than the traditional, discrete-domain FCSP.