基于蚁群算法的产品拆卸序列规划方法  

Product Disassembly Sequence Planning Based on Ant Colony Optimization

作　　者：章小红[1] 李世其[1] 王峻峰[1] 

机构地区：[1]华中科技大学机械科学与工程学院,武汉430074

出　　处：《计算机辅助设计与图形学学报》2007年第3期387-391,397,共6页Journal of Computer-Aided Design & Computer Graphics

基　　金：湖北省自然科学基金(2006ABA090);国防基础科研项目(B1420060173)

摘　　要：拆卸是回收的前提,为了得到最大的回收效益,对拆卸序列进行规划,得到最优的拆卸序列.根据拆卸的特点构建适合计算和优化的产品拆卸混合图模型,该模型描述了零部件之间的连接关系和优先关系.然后通过几何推理方法产生所有可行的拆卸序列,建立目标函数并构建适合拆卸序列规划的蚁群算法:设计了满足连接关系和优先关系的可拆卸零件搜索空间,得到最优或接近最优的拆卸序列.最后通过实例验证了该方法的实用性和可行性.Disassembly is a precondition of recovery, disassembly sequence planning is to win the most of profits and obtain the optimization disassembly sequence. Product disassembly hybrid graph model which describes the mating contact and non-contact priority relationships among constituting components, is established based on the characteristic of disassembly. All the feasible disassembly sequence is inferred through geometry inference method. We constitute the target function and construct the ant colony algorithm which suit disassembly sequence planning, design the search space which satisfy contact relationships and non-contact priority relationships is to obtain the optimization or near optimization disassembly sequence. Finally, a case is illustrated the effectiveness and validity of the strategy.

关 键 词：蚁群算法 混合图 拆卸序列规划 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]