An Improved Fruit Fly Optimization Algorithm for Hybrid Disassembly Line Balancing Problem

Abstract

The study of the disassembly line balancing problem (DLBP) aims to schedule optimally disassembly tasks across all workstations. Since existing research mainly focuses on specific layouts of disassembly lines, which may not be suitable for multi-product scenarios, this work proposes a hybrid DLBP and a linear programming model based on AND/OR graph establishes to maximize disassembly profit in this paper. The proposed model is solved by using CPLEX and an improved fruit fly optimization algorithm in various cases, and the correctness of the model is verified. Furthermore, the convergence of the improved fruit fly optimization algorithm is compared with a genetic algorithm to validate its effectiveness.