Skip to main content
SpringerLink
Log in

Spread-Repair Algorithm for Solving Extended Fuzzy Constraint Satisfaction Problems

  • Conference paper
Book cover Soft Computing as Transdisciplinary Science and Technology

Part of the book series: Advances in Soft Computing ((AINSC,volume 29))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dechter R (2003) Constraint Processing. Morgan Kaufmann

    Google Scholar 

  2. Ruttkay Zs (1994) Fuzzy constraint satisfaction. Proceedngs of 3rd IEEE Intern. Conf. on Fuzzy Systems, 3:1263–1268

    Article  Google Scholar 

  3. Meseguer P, Larrosa J (1997) Solving fuzzy constraint satisfaction problems. Proceedings of 6th IEEE Intern. Conf. on Fuzzy Systems, 3:1233–1238

    Article  Google Scholar 

  4. 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

    Google Scholar 

  5. Wong J.H.Y and Leung H (1998) Extending GENET to Solve Fuzzy Constraint Satisfaction Problems. AAAI Constraint Satisfaction Problems, 380–385

    Google Scholar 

  6. 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

    Article  MATH  MathSciNet  Google Scholar 

  7. Hogg E, Bernardo A, Huberman C, Williams (1996) Phase transitions and search problems. Artificial Intelligence, 81:Issues 1–2:1–15

    Article  MathSciNet  Google Scholar 

  8. Marathe M.V, Breu h, Hunt B, Ravi S.S, Rosenkrantz D.J (1995) Simple Heuristics for Unit Disk Graph. networks, 25:59–68

    Article  MATH  MathSciNet  Google Scholar 

  9. Brent R.P (1973) Algorithms for minimization without derivatives. Prentice-Hall, Inc, 195

    Google Scholar 

  10. 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

    Google Scholar 

  11. Fox M.S (1987) Constraint-Directed Search: A Case Study of Job-Shop Scheduling. Morgan Kaufmann, San Mateo, CA

    MATH  Google Scholar 

  12. Takefuji Y (1992) Newral Network Parallel Processing. Kluwer Academic Publishers

    Google Scholar 

  13. Sudo Y, Kurihara M, Mitamura T (2004) Hybrid Domain Fuzzy Constraint Satisfaction Problems and Spread-Repair Algorithms. SICE Annual Conference 2004, Sapporo

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Engeneering, Hokkaido University, Sapporo, 060-8628, Japan

    Yasuhiro Sudo

  2. Graduate School of Information Science and Technology, Hokkaido University, Sapporo, 060-0814, Japan

    Masahito Kurihara

  3. Department of Infomation Design, Hokkaido Institute of Technology, Sapporo, 006-8585, Japan

    Tamotsu Mitamura

Authors
  1. Yasuhiro Sudo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Masahito Kurihara
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tamotsu Mitamura
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, Oklahoma State University, North Greenwood Avenue 700, 74106, Tulsa, USA

    Ajith Abraham

  2. Dept. of Computer Science and Systems Engineering, Muroran Institute of Technology, Mizumoto-cho 27-1, 050-8585, Muroran, Hokkaido, Japan

    Yasuhiko Dote

  3. Dept. of Computational Science and Engineering, Nagoya University, Furo-cho, Chikusa-ku, 464-8601, Nagoya, Aichi-ken, Japan

    Takeshi Furuhashi

  4. Institut für Sicherheits-/Prüftechnik, Fraunhofer IPK Berlin, Pascalstr. 8-9, 10587, Berlin, Germany

    Mario Köppen

  5. Division of Complex Systems Technology Graduate School of Engineering, University of Hokkaido, N-13, W-8 060 KITA-KU, Sapporo, Japan

    Azuma Ohuchi

  6. PRESTO Japan Science & Technology Corp. GSSM, University of Tsukuba, 3-29-1 Otsuka, Bunkyo-ku, 12-0012, Tokyo, Japan

    Yukio Ohsawa

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation