Summary
In this paper, we propose a new type of FCSPs called hybrid domain FCSPs that have a mixture of discrete and continuous domains. To solve this type of problems, we present an algorithm called Spread-Repair based on the framework of iterative improvement. Experimental results on some test problems show that the algorithm has an ability of finding local approximate solutions with high probability in a computation time much shorter than the traditional, discrete-domain FCSP.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Dechter R (2003) Constraint Processing. Morgan Kaufmann
Ruttkay Zs (1994) Fuzzy constraint satisfaction. Proceedngs of 3rd IEEE Intern. Conf. on Fuzzy Systems, 3:1263–1268
Meseguer P, Larrosa J (1997) Solving fuzzy constraint satisfaction problems. Proceedings of 6th IEEE Intern. Conf. on Fuzzy Systems, 3:1233–1238
Kanada Y (1995) Fuzzy Constraint Satisfaction Using CCM-A Local Information Based Computation Model. Proceedings of 4th IEEE Intern. Conf. on Fuzzy Systems, 4:2319–2326
Wong J.H.Y and Leung H (1998) Extending GENET to Solve Fuzzy Constraint Satisfaction Problems. AAAI Constraint Satisfaction Problems, 380–385
Minton S, Johnston M.D, Philips A.B, Laird, P (1992) Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58:161–205
Hogg E, Bernardo A, Huberman C, Williams (1996) Phase transitions and search problems. Artificial Intelligence, 81:Issues 1–2:1–15
Marathe M.V, Breu h, Hunt B, Ravi S.S, Rosenkrantz D.J (1995) Simple Heuristics for Unit Disk Graph. networks, 25:59–68
Brent R.P (1973) Algorithms for minimization without derivatives. Prentice-Hall, Inc, 195
Adorf H.M, Johnston M.D (1990) A discrete stochastic neural networks algorithm for constraint satisfaction problems. Proceedings International Joint Conference on Newral Networks, CA
Fox M.S (1987) Constraint-Directed Search: A Case Study of Job-Shop Scheduling. Morgan Kaufmann, San Mateo, CA
Takefuji Y (1992) Newral Network Parallel Processing. Kluwer Academic Publishers
Sudo Y, Kurihara M, Mitamura T (2004) Hybrid Domain Fuzzy Constraint Satisfaction Problems and Spread-Repair Algorithms. SICE Annual Conference 2004, Sapporo
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sudo, Y., Kurihara, M., Mitamura, T. (2005). Spread-Repair Algorithm for Solving Extended Fuzzy Constraint Satisfaction Problems. In: Abraham, A., Dote, Y., Furuhashi, T., Köppen, M., Ohuchi, A., Ohsawa, Y. (eds) Soft Computing as Transdisciplinary Science and Technology. Advances in Soft Computing, vol 29. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32391-0_95
Download citation
DOI: https://doi.org/10.1007/3-540-32391-0_95
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25055-5
Online ISBN: 978-3-540-32391-4
eBook Packages: EngineeringEngineering (R0)