Optimization of parallel disassembly line balancing problem with different operators between workstations

A mixed integer programming model was constructed for parallel disassembly line balancing problem aiming at the problem that the task definition of each disassembly line is unclear and the mathematical models are conceptual models in the existing parallel disassembly line. The difference of operators between workstations was considered. The number of workstations, the number of robots, disassembly cost and idle time balancing index were minimized. An improved brain storm optimization algorithm was proposed. A feasible disassembly sequence was constructed through double-layer coding, and the original operation was discretized. A mutation and crossover mode was designed corresponding to the generation mechanism of a single individual and two individuals. The operation strategy of four-point crossover was designed in order to increase the diversity of population individuals. Pareto solution set and crowding distance were introduced to screen non-inferior solutions of multi-objectives aiming at the multiplicity of optimization objectives. CPLEX and LINGO were used to solve the exact solution of small-scale examples. The correctness of the model and the effectiveness of the algorithm were verified compared with the results of the algorithm. The algorithm was applied to solve P25 classic examples and compared with the results of many existing literatures. The superiority of the algorithm was verified. The proposed model and algorithm were applied to the parallel disassembly line of TV and refrigerator, and the advantages of the proposed algorithm were verified by different comparative experiments. © 2021, Zhejiang University Press. All right reserved.