摘要

In order to realize automation and intelligence of product disassembly process in a virtual maintenance environment, an improved max-min ant system based methodology for product disassembly sequence planning was proposed. The feasibility graph for product disassembly process was defined and the mathematic model of product disassembly sequence planning problem was set up. Thus, the problem of product disassembly sequence planning was transformed into the problem of searching optimal path on a feasibility graph. Moreover, an improved max-min ant system based on the strategy of sorting elite ants was presented and the flowchart of the improved algorithm was designed. Finally, by simulation examples, the robustness and outperforming others of the improved algorithm were verified.