Planning of Selective Disassembly Sequence Based on Ant Colony Optimization Algorithm

To tackle selective disassembly sequence planning problem efficiently,disassembly hierarchy information graph （DHIG） based on precedence constraints is presented firstly.The problem of selective disassembly sequence planning is transformed into that of searching optimal paths in the graph.An improved ant colony optimization algorithm is presented to build the DHIG and search the optimal solutions.Finally, an example is used to verify the feasibility and calculating efficiency of the proposed method.