期刊文献+

Disassembly sequence planning using component-joint graph and ant colony optimization

Disassembly sequence planning using component-joint graph and ant colony optimization
下载PDF
导出
摘要 Disassembly sequence planning is an important step of mechanical maintenance. This article presents an integrated study about the generation and optimizing algorithm of the disassembly sequence. Mechanical products are divided into two categories of components and connectors. The article uses component-joint graph to represent assembly constraints, including the incidence constraints are represented by incidence matrix and the interference constraints are represented by interference constraints. The inspiring factor and pheromone matrix are calculated according to assembly constraints. Then the ant generates its own disassembly sequences one by one and updates the inspiring factor and pheromone matrix. After all iterations, the best disassembly sequence planning of components and connectors are given. Finally, an application instance of the disassembly sequence of the jack is presented to illustrate the validity of this method. Disassembly sequence planning is an important step of mechanical maintenance. This article presents an integrated study about the generation and optimizing algorithm of the disassembly sequence. Mechanical products are divided into two categories of components and connectors. The article uses component-joint graph to represent assembly constraints, including the incidence constraints are represented by incidence matrix and the interference constraints are represented by interference constraints. The inspiring factor and pheromone matrix are calculated according to assembly constraints. Then the ant generates its own disassembly sequences one by one and updates the inspiring factor and pheromone matrix. After all iterations, the best disassembly sequence planning of components and connectors are given. Finally, an application instance of the disassembly sequence of the jack is presented to illustrate the validity of this method.
出处 《Computer Aided Drafting,Design and Manufacturing》 2016年第1期54-57,共4页 计算机辅助绘图设计与制造(英文版)
关键词 disassembly sequence planning component-joint graph ant colony algorithms disassembly sequence planning component-joint graph ant colony algorithms
  • 相关文献

参考文献11

  • 1Zhang H C, Kuo T C. A graph-based approach to disassembly model for end-of-life product recycling [C]// Nineteenth IEEE/CPMT Proceedings of 1996 Electronics Manufacturing Technology Symposium. Piscataway: IEEE, 1996: 247-254. 被引量:1
  • 2Kuo T C. Disassembly sequence and cost analysis for electromechanical products [J]. Robotics and Computer Integrated Manufacturing, 2000, 16(1): 43 -54. 被引量:1
  • 3Chung C, Peng Q J. An integrated approach to selective-disassembly sequence planning [J]. Robotics and Computer Integrated Manufacturing, 2005, 21 (4): 475-485. 被引量:1
  • 4Li J R, Khoo L P, Tor S B. An object-oriented intelligent disassembly sequence planner for maintenance [J]. Computers in Industry, 2005, 56(7): 699-718. 被引量:1
  • 5Li J R, Khoo L P, Tot S G. Generation of possible multiple components disassembly sequence formaintenance using a disassembly constraint graph [J]. International Journal of Production Economics, 2006, 102(1): 51-65. 被引量:1
  • 6Lambert A J D. Exact methods in optimum disassembly sequence search for problems subject to sequence dependent costs [J]. The international Journal of Management Science, 2006, 34(6): 538-549. 被引量:1
  • 7Lambert A J D. Optimizing disassembly processes subjected to sequence-dependent cost [J]. Computers & Operations Research, 2007, 34(2): 536-551. 被引量:1
  • 8Moore K E, Gungor A, Gupta S M. Petri net approach to disassembly process planning for products with complex AND/OR precedence relationships [J]. European Journal of Operational Research, 2001, 135(2): 428-449. 被引量:1
  • 9Moore K E, Askiner G, Surendra M. A Petri net approach to disassembly process planning [J]. Computers and Industrial Engineering, 1998, 35(1): 165-168. 被引量:1
  • 10陆中,孙有朝.面向维修性设计的民机产品拆卸序列规划方法[J].航空学报,2010,31(1):143-150. 被引量:4

二级参考文献11

  • 1王波,王宁生.基于遗传算法与Tabu搜索的拆卸序列优化算法[J].重庆大学学报(自然科学版),2006,29(3):23-27. 被引量:6
  • 2章小红,李世其,王峻峰.基于蚁群算法的产品拆卸序列规划方法[J].计算机辅助设计与图形学学报,2007,19(3):387-391. 被引量:23
  • 3Zhang H C, Kuo T C. A graph-based approach to disas sembly model for end of life procluct recycling[C]//Nine teenth IEEE/CPMT Proceedings of 1996 Electronics Manu facturing Technology Symposium. 1996: 247-254. 被引量:1
  • 4Kuo T C. Disassembly sequence and cost analysis for electromechanieal products[J]. Robotics and Computer Inte grated Manufacturing, 2000, 16(1): 43-51. 被引量:1
  • 5Chung C, Peng Q J. An integrated approach to selective disassembly sequence planning[J]. Robotics and Compu ter Integrated Manufaeturing, 2005. 21(4): 475-485. 被引量:1
  • 6Li J R, Khoo L P, Tor S B. An object-oriented intelligent disassembly sequence planner for maintenance[J]. Corn puters in Industry, 2005, 56(7): 699-718. 被引量:1
  • 7Li J R, Khoo L P, Tor S B. Generation of possible multiple components disassembly sequence for maintenance u sing a disassembly constraint graph [J]. lnternationa Journal of Production Economics, 2006, 102(1):51-65. 被引量:1
  • 8Lambert A J D. Exact methods in optimum disassembly sequence search for problems subject to sequence dependent costs[J]. The international Journal of Management Science, 2006, 34(6): 538-549. 被引量:1
  • 9Lambert A J D. Optimizing disassembly processes subjected to sequence-dependent cost[J]. Computers &Opera tions Research, 2007, 34(2): 536-551. 被引量:1
  • 10Moore K E, Gungor A, Gupta S M. Petri net approach to disassembly process planning for products with complex AND/OR precedence relationships[J]. European Journal of Operational Research, 2001, 135(2) :428-449. 被引量:1

共引文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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