• 论文 •    

基于蚁群算法的单目标选择性拆卸序列规划研究

章小红,李世其,王峻峰,李勋   

  1. 1.华中科技大学 机械科学与工程学院, 湖北武汉430074; 2.北汽福田 汽车工程研究院乘用车所, 北京102206
  • 出版日期:2007-06-15 发布日期:2007-06-25

Single object selective disassembly sequence planning based on ant colony algorithm

ZHANG Xiaohong, LI Shiqi, WANG Junfeng, LI Xun   

  1. 1.School of Mechanical Science & Engineering, Huazhong University of Science & Technology, Wuhan430074, China; 2.Institute of Auto Engineering, Beiqi Foton Motor Corp, Beijing102206, China
  • Online:2007-06-15 Published:2007-06-25

摘要: 根据选择性拆卸的特点,介绍了基于混合图的选择性拆卸模型。该模型描述了零件间的接触连接关系和非接触优先关系。基于混合图模型,以单个零件为目标推理生成选择性拆卸序列解空间;然后结合蚁群算法,从所有可行序列中搜索最优或接近最优的单目标零件选择性拆卸序列。最后,通过实例说明该方法的可行性和有效性。

关键词: 蚁群算法, 混合图, 拆卸序列规划, 单目标选择拆卸

Abstract: Based on characteristics of selective disassembly, selective disassembly model based on hybrid graph was introduced. The model described contact constraints and noncontact constraints among parts. Therefore a recursive search, triggered by single object component on a hybrid graph, was implemented to generate all the possible disassembly sequences in relation to the target component. And then near optimization single object selective disassembly sequence could be generated based on ant colony algorithm. Finally, a case study was used to illustrate the feasibility and effectiveness of the proposed method.

Key words: ant colony algorithm, hybrid graph, disassembly sequence planning, single object selective disassembly

中图分类号: