2012 | OriginalPaper | Buchkapitel
The Application of Ant Colony in Maintenance Combinatorial Analysis
verfasst von : Xia Jian
Erschienen in: Emerging Computation and Information teChnologies for Education
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.