HUSCAP logo Hokkaido Univ. logo

Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >


Files in This Item:
sudoy2005jsai-final.pdf768.84 kBPDFView/Open
Please use this identifier to cite or link to this item:

Title: 系統的/局所的探索の協調によるファジィ制約充足問題の近似解法
Other Titles: Combining Systematic and Local Search for Approximately Solving Fuzzy Constraint Satisfaction Problems
Authors: 須藤, 康裕1 Browse this author
栗原, 正仁2 Browse this author
Authors(alt): Sudo, Yasuhiro1
Kurihara, Masahito2
Keywords: constraint satisfaction
iterative improvement
Issue Date: 2006
Publisher: 人工知能学会
Journal Title: 人工知能学会論文誌
Volume: 21
Issue: 1
Start Page: 20
End Page: 27
Publisher DOI: 10.1527/tjsai.21.20
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. Basically, the algorithms for solving CSPs are classified into two categories: the systematic search (complete methods based on search trees) and the local search (approximate methods based on iterative improvement). Both have merits and demerits. Recently, much attention has been paid to hybrid methods for integrating both merits to solve CSPs efficiently, but no such attempt has been made so far for solving FCSPs. In this paper, we present a hybrid, approximate method for solving FCSPs. The method, called the Spread-Repair-Shrink (SRS) algorithm, combines a systematic search with the Spread-Repair (SR) algorithm, a local search method recently developed by the authors. The SRS algorithm spreads (or expands) and shrinks a set of search trees in order to repair constraints locally until, finally, the satisfaction degree of the worst constraints (which are the roots of the trees) is improved. We empirically show that SRS outperforms the SR algorithm as well as the well-known methods such as Forward Checking and Fuzzy GENET, when the size of the problems is sufficiently large.
Type: article (author version)
Appears in Collections:情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)

Submitter: 栗原 正仁

Export metadata:

OAI-PMH ( junii2 , jpcoar_1.0 )

MathJax is now OFF:


 - Hokkaido University