基于Tabu搜索算法的产品族配置问题研究

Research for Configuration Problem of Product Family Based on Tabu Search Algorithm

产品族的可配置零部件之间存在约束关系,用户需要从产品族的有效配置结果中找到最满意的配置。对于配置项较多的问题,由于搜索空间很大而不能用传统方法求解。给出了按订单装配模式下产品族配置问题的数学模型,并设计了Tabu搜索算法对模型进行求解。使用了动态惩罚、频数表、多阶段搜索和优化配置池等方法改进了算法的效率。应用模型和算法对复合热载体产品进行了仿真计算,取得了比较好的效果。

The most satisfying configuration solution needs to be found from effective configuration results of product family. Traditional methods could not be applied to the problems with large amounts of configurable items because of large search space. A mathematical model for ATO configuration problems of product family was proposed and Tabu Search algorithm was designed to solve this model. Dynamic penalty, frequency list, multi-stage search and configuration pool were used to improve the algorithm. The result of simulating indicates that this method is effective.