An improved multi-objective evolutionary algorithm for multiple-target asynchronous parallel selective disassembly sequence planning

Abstract

The product’s service life has been shortened rapidly along with the development of modern technologies and human esthetic evolutions, resulting in a great number of end-of-life (EOL) products. Disassembling renewable parts from EOL products for remanufacturing is of great significance to save resources and protect the environment. The existing studies on selective disassembly sequence planning (SDSP) largely focus on the sequential disassembly planning, which is inefficient especially for complex products because it is a linear process where only one component can be removed at a time. Thus, this work focuses on parallel SDSP and further proposes a multiple-target asynchronous parallel selective DSP (APSDSP) with the objectives of minimizing disassembly time and maximizing disassembly profit simultaneously. In APSDSP, operators can remove multiple components simultaneously as long as disassembly constraints are not violated, and without synchronization requirement between operators. The feasible disassembly sequence and disassembly direction sequence are generated by a space interference matrix method (SIMM) to meet the actual disassembly environment. Based on SIMM, an improved multi-objective evolutionary algorithm based on multiple neighborhood search strategy is developed to create the pareto frontier of the problem. Finally, two cases study are presented to validate the effectiveness of the proposed methodology. It gives enterprises new insights to reduce disassembly time and improve disassembly profit.