摘要
依据产品的可配置性,提出基于非二元约束的逻辑产品模型,给出基于动态变量序的一类配置求解算法。采用仿真实验比较各种算法的求解效率,指出各算法在不同配置约束密度下快速求解配置问题时的适用范围。基于逻辑产品模型,依据配置问题实际性质,采用相应配置求解算法,能够更快地生成符合客户要求的产品配置方案。
Complying with product configurability, a logical product model based on non-binary constraint is built. Based on dynamic variable ordering, several configuration-solving methods are proposed. The solving efficiency of different methods is analyzed by the simulation results and the application conditions of the methods for solving configuration problem under different configuration constraint density are given. Based on the logical product model, a valid product configuration can be generated rapidly by applying appropriate solving method in accordance with the character of the configuration problem.
出处
《计算机工程》
CAS
CSCD
北大核心
2008年第7期205-208,共4页
Computer Engineering
基金
国家自然科学基金资助项目(70671037)
高等学校博士学科点专项科研基金资助项目(20050532005)
关键词
大规模定制
逻辑产品模型
产品配置
非二元约束满足问题
mass customization
logical product model
product configuration
non-binary constraint satisfaction problem
