期刊文献+

Using genetic/simulated annealing algorithm to solve disassembly sequence planning 被引量:5

Using genetic/simulated annealing algorithm to solve disassembly sequence planning
在线阅读 下载PDF
导出
摘要 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. Farther, the optimization model is provided to optimize disassembly sequence. And the solution methodology based on the genetic/simulated annealing algorithm with binaxy-tree algorithm is given. Finally, an example is analyzed in detail, and the result shows that the model is correct and efficient. 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. Farther, the optimization model is provided to optimize disassembly sequence. And the solution methodology based on the genetic/simulated annealing algorithm with binaxy-tree algorithm is given. Finally, an example is analyzed in detail, and the result shows that the model is correct and efficient.
出处 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2009年第4期906-912,共7页 系统工程与电子技术(英文版)
基金 supported by the National High Technology Research and Development Program of China(2006AA04Z427).
关键词 disassembly sequence planning disassembly hybrid graph connection matrix precedence matrix binary-tree algorithms simulated annealing algorithm genetic algorithm. disassembly sequence planning, disassembly hybrid graph, connection matrix, precedence matrix binary-tree algorithms, simulated annealing algorithm, genetic algorithm.
  • 相关文献

参考文献3

二级参考文献18

  • 1Lambert A J D. Optimal Disassembly of Complex Product[J]. Int J of Produce Research, 1997,35 (9):2509-2523.
  • 2Tang Y, Zhou Meng-chu. An Integrated Approach to Disassembly Planning and Demanufacturing Operation[J]. IEEE Trans on Robotics and Automation, 2001, 17(6):773-784.
  • 3Gao M M. Zhou M C. Fuzzy Reasoning Petri Nets for Demanufacturing Process Decision [J]. IEEE Trans on Systems, Man, Cybernetics, 2001,31 (1) : 167-172.
  • 4Gao M M, Zhou M C. Fuzzy Reasoning Petri Nets[J].IEEE Trans on Systems, Man, Cybernetics, 2003,33(5) : 314-323.
  • 5Fernandez Roberto, Zerhouni Noureddine. Modeling and Analysis of Disassembly Systems Using Continuous Petri Nets [A]. Proc of the 4th IEEE Int Symposium on Assembly and Task Planning Soft Research Park[C]. Fukuoka, 2001:2:32-237.
  • 6刘光复 刘志峰 李钢.绿色设计和绿色制造[M].北京:机械工业出版社,1999..
  • 7BOLDIN D F,ABELL T E,LUI M C M,et al.An integrate computer aid for generating and evaluating assembly sequences for mechanical products[J].IEEE Transactionons on Robotics and Automation,1991,7(1):78-94.
  • 8CHEN C L P.Neural computation for planning AND/OR precedence constraint robot assembly sequences[J].IEEE Transactionons on Robotics and Automation,1990,1:127-142.
  • 9GUPTA S M, PITIPONG V. Disassembly of products [R]. Gaithersburg, Md. , USA: Natioanl Institute of Standards and Technology, 1996.
  • 10KONGGAR E, GUPTA S M. Genetic algorithm for disassembly proeess planning [A]. Proceedings of International Society for Optical Engineering [C]. Boston, Mass. , USA: International Society for Optical Engineering, 2002.54-62.

共引文献31

同被引文献23

引证文献5

二级引证文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部