Applying constraint satisfaction approach to solve product configuration problems with cardinality-based configuration rules
Applying constraint satisfaction approach to solve product configuration problems with cardinality-based configuration rules
复制标题
DOI：
10.1007/s10845-011-0544-2
复制
发表时间：
2011-06
影响因子：
8.3
通讯作者：
D. Yang;M. Dong
中科院分区：
文献类型：
--
作者：
D. Yang;M. Dong
本文解决了以基于基数的配置规则为特征的产品配置问题。提出了包括 FI 和 EI 规则在内的新颖配置规则，以澄清遇到产品基数和层次结构时包含规则的语义。然后，提出了配置图来可视化产品配置问题中的结构规则和配置规则。详细阐述了一种编码方法，将配置图转换为 CSP（约束满足问题）。因此，现有的CSP求解器，即JCL（Java Constraint Library），被用来实现具有基数相关配置规则的产品配置问题的配置系统。本文通篇使用总线配置的案例研究来说明所提出方法的有效性。
In this paper, the product configuration problems that are characterized by cardinality-based configuration rules are dealt with. Novel configuration rules includingFIandEIrules are presented to clarify the semantics of inclusion rules when cardinalities and hierarchies of products are encountered. Then, a configuration graph is proposed to visualize structural rules and configuration rules in product configuration problem. An encoding approach is elaborated to transform the configuration graph as a CSP (Constraint Satisfaction Problem). As a consequence, existing CSP solver, i.e. JCL (Java Constraint Library), is employed to implement the configuration system for product configuration problem with cardinality-related configuration rules. A case study of a bus configuration is used throughout this paper to illustrate the effectiveness of the presented approach.