面向多产品拆解的拆解序列计划问题的模型与算法

Model and algorithm of multi-product disassembly sequence planning problems

再制造系统拆解车间在一个计划期内通常需要拆解多个产品。为实现多个产品拆解的整体最优,研究了面向多产品拆解的拆解序列计划问题,并建立了以拆解利润最大化为目标和以拆解能耗为约束的整数规划模型。结合问题特点提出了一种改进平衡优化算法对所研究问题进行求解。该算法构造了解的编码与解码方法,以提高算法的适用性;设计了邻域搜索方法,以加强算法的局部搜索能力,从而改善解的质量。通过对5个不同产品数量的算例进行求解,并与标准的平衡优化算法、改进的重力搜索算法以及遗传算法进行对比分析,验证了所提算法在解决该问题上的有效性。

In a disassembly shop of remanufacturing systems,multiple products usually need to be disassembled in a planning horizon.To achieve the global optimization of disassembling them,a multi-product disassembly sequence planning problem was studied.To depict the considered problem mathematically,an integer programming model with maximizing disassembly profit subject to disassembly energy constraints was formulated.Based on the features of the proposed problem,an enhanced equilibrium optimizer was designed to handle it.In this algorithm,encoding and decoding approaches were proposed to promote the applicability of the designed method.A neighborhood search method was presented to strengthen its exploitation ability.By conducting experiments on five instances with different number of products and via comparing it with three peer approaches including the standard equilibrium optimizer,improved gravitational search algorithm and genetic algorithm,the effectiveness of the developed method was verified.