Parallel disassembly sequence planning using improved ant colony algorithm

摘要

Disassembly is one of the most crucial links in the product life cycle. Disassembly sequence planning (DSP) is a combination of optimization problem and has been studied by many researchers. Asynchronous parallel disassembly planning (APDP) eliminates the requirement that manipulators must start and stop their tasks in the working process. In this paper, a new asynchronous parallel disassembly sequence planning method is proposed, which to deal with the problems of highly time-dependent on asynchronous parallel disassembly mode. The disassembly time model has been divided into execution time and preparation time. The former represents the time consumes by removing a part, and the latter means the time consumes on the disassembly tool preparation while the disassembly position switch. The disassembly matrix and the disassembly work area collision matrix are also utilized to avoid infeasible sequences. Based on the max-min ant system, a waiting strategy is proposed to solve asynchronous parallel disassembly sequence planning problem. To further shorten disassembly process, a time overlap strategy is developed to take advantage of waiting time. Finally, a bevel gear reducer is utilized as an example to discuss and analysis the value of key parameters, as well as the effectiveness of the algorithm and strategies proposed in the paper.