Using genetic/simulated annealing algorithm to solve disassembly sequence planning |
| |
Authors: | Wu Hao Zuo Hongfu |
| |
Affiliation: | Coll.of Civil Aviation,Nanjing Univ.of Aeronautics and Astronautics,Nanjing 210016,P.R.China |
| |
Abstract: | Disassembly sequence planning (DSP) plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassembly sequence planning problems efficiently, a product disassembly hybrid graph model, which describes the connection, non-connection and precedence relationships between the product parts, is established based on the characteristic of disassembly. Further, the optimization model is provided to optimize disassembly sequence. And the solution methodology based on the genetic/simulated annealing algorithm with binary-tree algorithm is given. Finally, an example is analyzed in detail, and the result shows that the model is correct and efficient. |
| |
Keywords: | disassembly sequence planning disassembly hybrid graph connection matrix precedence matrix binary-tree algorithms simulated annealing algorithm genetic algorithm |
本文献已被 维普 万方数据 等数据库收录! |
| 点击此处可从《系统工程与电子技术(英文版)》浏览原始摘要信息 |
|
点击此处可从《系统工程与电子技术(英文版)》下载免费的PDF全文 |
|