分散搜索算法求解复杂产品协同优化分配问题

SCATTER SEARCH ALGORITHM FOR COLLABORATIVE OPTIMAL ALLOCATION OF COMPLEX PRODUCT

研究了网络化制造环境下复杂产品的协同优化分配问题.考虑网络联盟企业的生产能力约束和复杂产品的交货期约束,加入满足装配要求的公差约束,以最大化公差和最小化制造费用、运输费用以及质量损失费用为目标,建立了该问题的两阶段数学规划模型.结合问题解的特点,把两阶段模型整合成一个非线性混合整数规划模型,提出了针对问题特点的分散搜索算法.该算法采用启发式方法随机产生初始解,开发了适合问题特点的子集产生、合并和改进以及参考集更新等多种改进机制实现对该问题的有效求解.对小规模实例进行分析,验证了加入公差约束的必要性,同时仿真分析了15组不同规模的实例,与遗传算法的结果进行比较,验证了该模型与算法的合理性和有效性.

A task assignment for complex product collaborative manufacturing is studied in networked manufacturing environment. The production capacity of al- liance manufacturers and the due date of complex product are considered; the toler- ance allocation which can achieve the assembly request is added. Two mathematical programming models of the problem are proposed respectively with the objective of maximizing the tolerance and minimizing the production costs, transportation costs and quality loss costs. Based on the characteristic of the solutions to the problem, the two stage model is integrated to a whole model. A scatter search approacl^for the problem is developed, which generates the initial solution by heuristic random methods, and develops subset generation method, solution combination method and improvement method and the reference set update method by the characteristic of the problem. The analysis results for small-sized instances prove the necessity of tolerance constraint, and fifteen instances at different sizes were calculated by the algorithm and the results were compared with the results by genetic algorithm, the simulation results show the rationalization and the effectiveness of the model and the algorithm.