Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
