基于改进人工蜂群算法的产品拆卸序列规划  

Product Disassembly Sequence Planning Based on Improved Artificial Bee Colony Algorithm

作　　者：宋守许[1] 张文胜[1] 张雷[1] 

机构地区：[1]合肥工业大学,合肥230009

出　　处：《中国机械工程》2016年第17期2384-2390,共7页China Mechanical Engineering

基　　金：国家自然科学基金资助项目(51575152)

摘　　要：为了提高复杂产品拆卸序列规划效率,提出了一种改进的人工蜂群算法用于此类问题求解。通过拆卸混合图表达产品零部件之间的连接关系和优先约束关系,并推导出可行拆卸序列的约束表达式,建立拆卸序列规划数学模型和适应度计算公式。对初始种群进行了优先约束规划,提出一种可行度算法用于蜂群对蜜源的搜寻与选择。定义了自适应选择参数、动态平衡可行度与适应度算法的优先配比,以实现复杂产品拆卸序列规划的快速求解。最后以内啮合齿轮泵为实例,利用所提方法进行了拆卸序列规划求解,通过分析实验结果,并对比传统人工蜂群算法,证明了该方法的可行性和高效性。To improve the disassembly sequence planning rate of complex products,an improved artificial bee colony algorithm was proposed,which was used to find the answers in the process of disassembly sequence planning.Based on the disassembly hybrid graph model,the connection relationships and disassembly priority relationships were expressed,and the constraint expression of disassembly sequence was obtained.The mathematical model and fitness equation of the disassembly sequence planning were constructed.The initial population was given the priority of constraint algorithm.A feasible algorithm for searching and selecting source nectar was put forward.In order to quickly get the disassembly sequence planning of complex products,an adaptive selection parameter was defined to balance the feasibility and fitness algorithm. Finally,compared with a typical artificial bee colony algorithm,an internal gear pump was studied as an instance to demonstrate the feasibly and efficiency of the method presented.

关 键 词：复杂产品 拆卸序列规划 人工蜂群算法 约束优化 

分 类 号：TH122[机械工程—机械设计及理论]