Disassembly sequence planning based on ant colony optimization algorithm

Disassembly precedence restriction matrix (DPRM) is constructed to describe the Disassembly precedence relation between components of mechanical products. Based on this disassembly matrix, feasible and reasonable transition range which satisfied precedence restriction relation can be derived correctly and completely. Then ant colony optimization (ACO) algorithm is applied to generate geometric feasible and optimal disassembly sequences. In this paper, ACO algorithm is improved on the state-transition rule and local- and global-updating rules aiming to the characteristics of disassembly sequence planning (DSP). Cases are given to show the effectiveness of the proposed approach.