Robotic disassembly line balancing problem: A mathematical model and ant colony optimization approach

The use of robots is significantly increasing day by day in manufacturing systems, and especially improving the efficiency of the lines. Robots can be used to complete disassembly tasks, and each of the robots can need different operation times to perform the tasks. In this paper, the balancing of the robotic disassembly line problem has been studied to develop efficient solution techniques. Firstly, a mixed-integer linear mathematical model is proposed to determine and solve the problem optimally. A case study from literature is addressed to assess and show the efficiency and effectiveness of the model to minimize cycle time. Secondly, a heuristic algorithm based on ant colony optimization is also proposed to discover a solution for especially the large-size test problems due to the complexity of the problem. The performance of the proposed heuristic algorithm is verified and compared with the different heuristic on data sets. The computational results indicate that the proposed mathematical model and the algorithms are promising for the small and large-size test problems, respectively. Finally, it should be stated that robots have great potential to use in the area of disassembly line and useful solutions provide according to test results.