Multi-Objective Optimization for a Partial Disassembly Line Balancing Problem Considering Profit and Carbon Emission

Disassembly lines are widely utilized to disassemble end-of-life products. Most of the research focuses on the complete disassembly of obsolete products. However, there is a lack of studies on profit and on carbon emission saved. Hence, this study considers the multi-objective partial disassembly line balancing problem with AND/OR precedence relations to optimize profit, saved carbon emission and line balance simultaneously. Firstly, a multi-objective mixed-integer programming model is formulated, which could optimally solve the small number of instances with a single objective. Meanwhile, an improved multi-objective artificial bee colony algorithm is developed to generate a set of high-quality Pareto solutions. This algorithm utilizes two-layer encoding of the task permutation vector and the number of selected parts, and develops two-phase decoding to handle the precedence relation constraint and cycle time constraint. In addition, the modified employed bee phase utilizes the neighborhood operation, and the onlooker phase utilizes the crossover operator to achieve a diverse population. The modified scout phase selects a solution from the Pareto front to replace the abandoned individual to obtain a new high-quality solution. To test the performance of the proposed algorithm, the algorithm is compared with the multi-objective simulated annealing algorithm, the original multi-objective artificial bee colony algorithm and the well-known fast non-dominated genetic algorithm. The comparative study demonstrates that the proposed improvements enhance the performance of the method presented, and the proposed methodology outperforms all the compared algorithms.