关键词: 多产品拆解, 能耗约束, 拆解序列计划, 改进平衡优化算法

Abstract: 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.

Key words: multiple product disassembly, energy consumption constraints, disassembly sequence planning, enhanced equilibrium optimization algorithm