Multi-neighborhood Parallel Greedy Search Algorithm for Human-robot Collaborative Multi-product Hybrid Disassembly Line Balancing Problem

With the development of science and technology, a large number of electronic products have been discarded and become waste products. To obtain economic benefits and protect the environment, disassembly lines are designed to disassemble valuable parts from waste products. This paper proposes a mathematical model for the human-robot collaborative multiproduct hybrid disassembly line balancing problem with the disassembly revenue being the objective. A hybrid line combines a single-row line and a U-shaped line. We use the multi-neighborhood parallel greedy search algorithm to solve the model. Based on the algorithm, an alternate neighborhood search scheme consisting of different actions is designed. Some real-world cases are used to examine the feasibility of the proposed algorithm. The experimental results show that the multi-neighborhood parallel greedy search algorithm can solve the multi-product hybrid disassembly line balancing problem effectively.