• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2004 Fiscal Year Final Research Report Summary

A Study on Analyzing Phase Transition Phenomena for Constraint Satisfaction Problems

Research Project

Project/Area Number 14380134
Research Category

Grant-in-Aid for Scientific Research (B)

Allocation TypeSingle-year Grants
Section一般
Research Field 計算機科学
Research InstitutionUniversity of Tsukuba

Principal Investigator

NISHIHARA Seiichi  University of Tsukuba, Graduate School of Systems and Information Engineering, Professor, 大学院・システム情報工学研究科, 教授 (50026168)

Co-Investigator(Kenkyū-buntansha) FUKUI Yukio  University of Tsukuba, Graduate School of Systems and Information Engineering, Professor, 大学院・システム情報工学研究科, 教授 (80311596)
KATO Nobuko  Tsukuba College of Technology, Department of Information Science and Electronics, Associate Professor, 電子情報工学科, 助教授 (90279555)
Project Period (FY) 2002 – 2004
Keywordsconstraint satisfaction problem / search / phase transition / heuristics / graph coloring problem / NP-complete / computational complexity / knowledge representation
Research Abstract

The purpose of our study is to observe phase transition (PT) phenomena for constraint satisfaction problems (CSP) and analyze the factors of PTs. Based on the purpose, (1) we have proposed the method that systematically generates very hard problem instances with combinatorial complexity and (2) we have developed a constraint satisfaction system for solving real-world and large-scale problems.
In (1), using the graph 3-colorability problem (3COL) which is one of the typical CSPs, we found the original minimal unsolvable structures to generate very hard 3COL instances. By embedding one of the structures repeatedly, we can stably generated arbitrarily large 3COL instances. We demonstrated that the computational time of our generated 3COL instances is of an exponential order for some experiments using well-known efficient search algorithms and coloring programs.
In (2), we defined the search problem that decides a work schedule for rearranging office layouts as the CSP. Rearranging floor layouts includes time-consuming task, where both of planning and scheduling are solved simultaneously. We can solve the problem efficiently by unifying the constraints for requiring both of planning and scheduling.

  • Research Products

    (10 results)

All 2005 2004 2003 2002

All Journal Article (10 results)

  • [Journal Article] 資源割当てを伴う複数経路探索における対話的制約充足2005

    • Author(s)
      小野智司, 他
    • Journal Title

      日本計算工学会論文集 7

      Pages: 173-184

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] Interactive Constraint Satisfaction on Multi-path Planning with Resource Allocation (in Japanese)2005

    • Author(s)
      Ono, S., Hamada, Y., Mizuno, K., Nishihara, S., Nakayama, S.
    • Journal Title

      Transactions of JSCES Vol. 7

      Pages: 173-184

    • Description
      「研究成果報告書概要(欧文)」より
  • [Journal Article] 極小非可解構造に基づく3COLインスタンスの組織的生成2004

    • Author(s)
      水野一徳, 西原清一
    • Journal Title

      電子情報通信学会論文誌,D-I J87-D-I

      Pages: 1012-1019

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] Toward Systematic Generation of 3COL Instances Based on Minimal Unsolvable Structures (in Japanese)2004

    • Author(s)
      Mizuno, K., Nishihara, S.
    • Journal Title

      The IEICE Transactions on Information and Systems (D-I) Vol. J87-D-I, No. 11

      Pages: 1012-1019

    • Description
      「研究成果報告書概要(欧文)」より
  • [Journal Article] A Systematic Approach to Generate Very Hard 3COL Instances2003

    • Author(s)
      Mizuno, K., Nishihara, S.
    • Journal Title

      Proc. International Symp. Mathematical Programming

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] A Composition Algorithm for Very Hard 3-Colorability Instances2003

    • Author(s)
      Nishihara, S, et al.
    • Journal Title

      Proc. CP-2003

      Pages: 914-919

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] A Rearrangement System for Floor Layouts Based on Case-Based Reasoning and Constraint Satisfaction2003

    • Author(s)
      Ono, S., et al.
    • Journal Title

      Proc. IASTED AI-2003

      Pages: 363-368

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] A Composition Algorithm for Very Hard 3-Colorability Instances2003

    • Author(s)
      Nishihara, S., Mizuno, K.
    • Journal Title

      Proc. CP-2003

      Pages: 914-919

    • Description
      「研究成果報告書概要(欧文)」より
  • [Journal Article] A Rearrangement System for Floor Layouts Based on Case-Based Reasoning and Constraint Satisfaction2003

    • Author(s)
      Ono, S., Hamada, Y., Mizuno, K.., Fukui, Y., Nishihara, S.
    • Journal Title

      Proc. IASTED AI-2003

      Pages: 363-368

    • Description
      「研究成果報告書概要(欧文)」より
  • [Journal Article] Toward Ordered Generation of Exceptionally Hard Instances for Graph 3-Colorability2002

    • Author(s)
      Mizuno, K., Nishihara, S.
    • Journal Title

      Proc. COLOR'02 Symposium

      Pages: 1-8

    • Description
      「研究成果報告書概要(和文)」より

URL: 

Published: 2008-05-27  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi