[an error occurred while processing this directive]

Journal of Systems Engineering and Electronics ›› 2009, Vol. 20 ›› Issue (4): 906-912.

• • 上一篇    

Using genetic/simulated annealing algorithm to solve disassembly sequence planning

  

  • 出版日期:2009-08-14 发布日期:2010-01-03

Using genetic/simulated annealing algorithm to solve disassembly sequence planning

Wu Hao & Zuo Hongfu   

  1. Coll. of Civil Aviation, Nanjing Univ. of Aeronautics and Astronautics, Nanjing 210016, P. R. China
  • Online:2009-08-14 Published:2010-01-03

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.