earticle

논문검색

Research on the Product Configuration Method Based on Constraint Satisfaction Problem and Bayesian Network

초록

영어

In the context of mass customization, to address the issues about method based on Constraint Satisfaction Problem (CSP) in the field of product configuration, a combined product configuration method based on the CSP and Bayesian Network (BN) is proposed in this paper. On the basis of CSP and BN theory, a product configuration model established based on CSP and BN, and the specific method for solving was given, Including the reasoning on posterior probability by establishing the Bayesian Network model and the reasoning on Constraint Satisfaction Problem. Finally, to assemble the computer as an example, a configuration system of assembly computer product is developed so as to verify the feasibility and effectiveness.

목차

Abstract
 1. Introduction
 2. Related Concepts
  2.1 Constraint Satisfaction Problems
  2.2 Bayesian Network
 2. CSP-based Configuration Knowledge Representation with BN
  2.1 Configuring Model
  2.2 User Bayesian Network Model Construction
 3. Configuration Solution based on CSP and BN
  3.1 Configuration Solution Procedure
  3.2 Get the User's Preference
  3.3 The Solution of Five-tuple (X, D, C, Cu, Ce)
 4. Product Configuration Examples based on CSP and BN
 5. Conclusion
 Acknowledgements
 References

저자정보

  • Zhiqiang Liu College of Information Engineering, Inner Mongolia University of Technology, Hohhot, 010051, China
  • Yila Su College of Information Engineering, Inner Mongolia University of Technology, Hohhot, 010051, China
  • Huimin Li College of Information Engineering, Inner Mongolia University of Technology, Hohhot, 010051, China
  • Fei Wang College of Information Engineering, Inner Mongolia University of Technology, Hohhot, 010051, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.