Mixed-integer programming model and hybrid local search genetic algorithm for human–robot collaborative disassembly line balancing problem

Abstract

ABSTRACT Human–robot collaborative technology maximises the advantages of the capabilities of humans and robots, and provides diverse operating scenarios for the remanufacturing industry. Accordingly, this paper proposes an innovative human–robot collaborative disassembly line balancing problem (HRC-DLBP). First, a mixed-integer programming (MIP) model is devised for the HRC-DLBP to minimise the number of workstations, smoothness index, and various costs. Second, a hybrid local search genetic algorithm (HLSGA) is developed to solve the proposed HRC-DLBP efficiently. According to the problem characteristics, a four-layer encoding and decoding strategy was constructed. The search mechanism of the local search operator was improved, and its search strategy was adjusted to suit the genetic algorithm structure better. Furthermore, the accuracy of the proposed MIP model and HLSGA is verified through two HRC-DLBP examples. Subsequently, three HRC-DLBP examples are used to prove that the HLSGA is superior to five other excellent algorithms. The case of the two-sided disassembly line problem reported in the literature is also solved using the HLSGA. The results are found to be significantly better than the reported outputs of the improved whale optimisation algorithm. Besides, HLSGA also outperforms the results reported in the literature in solving EOL state-oriented DLBP. Finally, the HLSGA is applied to a power battery disassembly problem, and several optimal allocation schemes are obtained.