The Application of Ant Colony in Maintenance Combinatorial Analysis
Maintenance disassembly sequence planning is an important part of maintainability design. To tackle disassembly sequence planning problem efficiently, based on the product’s basic information and constraint relations between parts, disassembly Petri net reachable graph is presented. The problem of disassembly sequence planning is transformed into that of searching optimal paths in the graph. At the same time an ant colony optimization algorithm is presented to search the optimal solutions. Through examples verify the effectiveness of the method.
KeywordsDisassembly sequence planning Reachable graph Ant colony optimization algorithm
Unable to display preview. Download preview PDF.