Disassembly sequence planning of steam turbines for virtual maintenance

作者：Haitao, Zhu; Liang, Cong

来源：Key Engineering Materials, 2014, 572(1): 335-339.

DOI：10.4028/www.scientific.net/KEM.572.335

• Ant colony algorithms
• Comprehensive costs
• Disassembly sequence
• Disassembly sequence planning
• Gaussian map
• Sequence optimization
• Spherical algorithms
• Virtual maintenances

Abstract: Disassembly Sequence planning is the important module of virtual maintenance. Its foundational task is to test the disassemblability of parts, find out all the feasible disassembly sequences of targeted parts and search for the near-optimal disassembly sequence. In the paper, the spherical algorithm is used to test the disassemblability of parts. And then the disassembly direction of parts is determined by rules which are the simplified version of Gaussian map approach. Thus the near-optimal disassembly sequence is found out by optimizing all feasible disassembly sequences of targeted parts by ant colony algorithm. The simulation result of the sequence optimization proves to be the same with manual calculation considering comprehensive cost of the change of disassembly tools and disassembly directions. The set of approaches can be reference for disassembly sequence planning of large-scale mechanical products.

• 出版日期2014
• 单位哈尔滨工程大学