Disassembly Line Balancing Using Quantum Evolutionary Algorithm for Multi-product Parallel Lines

Parallel layouts are an effective choice to disassemble multiple products such that each product has their own dedicated line. Such layout has the advantage of resource sharing, effective floor space utilization, simple design, and uncomplicated flow of products. Disassembly line balancing problem (DLBP) is proven to be NP-Hard and the additional constraints of resource sharing and parallel setup further increase the problem complexity. This makes evolutionary algorithm (EA) a better choice for solving such problems. Therefore, in this study a mathematical model is formulated for the parallel disassembly line balancing problem (PDLBP) allowing resource sharing among directly opposite stations on adjacent lines only, with the objective of maximization of profit. The resulting problem is then solved using Quantum Evolutionary Algorithm (QEA). The proposed solution approach effectively utilizes the stochastic solution representation of QEA. The application of the proposed strategy is demonstrated with the help of numerical example of two real life products. Results show that the novel strategy is able to consistently find good quality solutions in reasonable amount of time.