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

•A novel mathematical model is developed.•The model is tested on the test problems.•Interval search ant colony algorithm is developed.•The results are compared with random search, improved ACO and GA•The proposed algorithm outperforms other algorithms. The use of robots is significantly increasing d...

Full description

Saved in:
Bibliographic Details
Published inApplied Mathematical Modelling Vol. 86; pp. 335 - 348
Main Authors Çil, Zeynel Abidin, Mete, Suleyman, Serin, Faruk
Format Journal Article
LanguageEnglish
Published New York Elsevier Inc 01.10.2020
Elsevier BV
Subjects
Algorithms
Ant colony optimization
Balancing
Cycle time
Disassembly
Disassembly tasks
Dismantling
Heuristic
Heuristic methods
Line balancing
Mathematical model
Mathematical models
Mixed integer
Robotic
Robots
Mathematical model
Robotic
Line balancing
Disassembly
Heuristic
Online AccessGet full text

Cover

More Information
Summary:•A novel mathematical model is developed.•The model is tested on the test problems.•Interval search ant colony algorithm is developed.•The results are compared with random search, improved ACO and GA•The proposed algorithm outperforms other algorithms. 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.
ISSN:0307-904X
1088-8691
0307-904X
DOI:10.1016/j.apm.2020.05.006