Abstract To reduce waste during disassembly production and improve disassembly efficiency, this study investigates a type of partial parallel disassembly line applicable for the simultaneous disassembly of different products. A multi-objective mathematical model for a partial parallel disassembly line balancing problem is built considering four optimisation goals, namely, the minimisation of the cycle time, number of workstations, idle index, and quantity of disassembly resources. In addition, a novel multi-objective hybrid group neighbourhood search algorithm is proposed. First, a certain set of neighbourhood individuals (from the current population of individuals) is generated via neighbourhood search mechanisms based on optimal embedding and exchange operations. Then, a Pareto filtering process is performed on a mixed population composed of the individuals of the current population and all neighbourhoods. Subsequently, the current population individuals are renewed based on the mixed population. To prevent the algorithm from falling into a local optimum and to enhance the algorithm’s global search performance, we conduct a local search strategy based on a simulated annealing operation on the newly generated population individuals. The effectiveness and superiority of the proposed algorithm are proven by solving two complete disassembly line balancing problems at different scales and a partial disassembly line balancing problem, and also by comparison with several algorithms investigated in existing literature. Finally, the proposed model and algorithm are applied to a partial parallel disassembly line designed for the simultaneous disassembly of two types of waste products in a household appliance disassembly enterprise. The results of the partial parallel disassembly line are compared with those of an initial single-product straight disassembly line, and the comparison results show that the solution results of the optimisation goals for the partial parallel disassembly line are more superior than those of the initial single-product straight disassembly line.

中文翻译：

---

使用混合组邻域搜索算法的多目标部分并行拆卸线平衡问题

摘要 为减少拆解生产过程中的浪费，提高拆解效率，研究了一种适用于不同产品同时拆解的局部平行拆解线。考虑循环时间最小化、工作站数量最小化、空闲指标最小化、拆装资源量最小化四个优化目标，建立了部分并行拆装线平衡问题的多目标数学模型。此外，提出了一种新的多目标混合群邻域搜索算法。首先，通过基于最优嵌入和交换操作的邻域搜索机制生成一组特定的邻域个体（来自当前的个体群体）。然后，对由当前种群的个体和所有邻域的个体组成的混合种群进行帕累托过滤过程。随后，基于混合种群更新当前种群个体。为了防止算法陷入局部最优，提高算法的全局搜索性能，我们在新生成的种群个体上进行了基于模拟退火操作的局部搜索策略。通过解决两个不同规模的完全拆装线平衡问题和一个部分拆装线平衡问题，并与现有文献中研究的几种算法进行比较，证明了所提出算法的有效性和优越性。最后，将所提出的模型和算法应用于某家电拆解企业为同时拆解两种废旧产品而设计的部分并行拆解线。将部分平行拆装线的结果与初始单品直拆线的结果进行对比，对比结果表明，部分平行拆装线的优化目标求解结果优于初始单品直拆线的求解结果。 -产品直拆线。