基于自适应粒子群的产品再制造拆卸规划  

Product remanufacture disassembly planning based on adaptive particle swarm optimization algorithm

作　　者：徐进[1] 张树有[1] 费少梅[1] 

机构地区：[1]浙江大学机械工程学系,浙江杭州310027

出　　处：《浙江大学学报（工学版）》2011年第10期1746-1752,共7页Journal of Zhejiang University：Engineering Science

基　　金：国家"973"重点基础研究发展规划资助项目(2011CB706506);浙江省科技计划资助项目(2010C31085);教育部博士点基金资助项目(200803350031);浙江省自然科学基金重点资助项目(Z1080339)

摘　　要：采用干涉矩阵和拆卸深度矩阵建立拆卸模型,给出可行拆卸序列生成方法,产生了拆卸可行域.设计一种自适应粒子群算法,该算法基于锯齿波提出惯性权重因子周期线性衰减,实现全局与局部搜索的平衡,给出适应变异策略,避免陷入局部最优解.针对拆卸序列规划问题,使用拆卸序列可行链表对粒子编码,构建区段拆卸序列,应用到粒子变异和基于浮动窗口的粒子更新中,保证每次迭代后粒子序列的可行性,避免对不可行序列的判断,提高了求解效率.通过一个典型实例,验证了该方法的有效性.Depth matrix and disassembly interference matrix were presented to establish disassembly model. A method of generating feasible disassembly sequence was proposed to produce the feasible region of disassembly. An adaptive particle swarm optimization was presented. The inertia weight with cyclical linear attenuation strategy based on saw-tooth wave was designed to strike a balance between global and local searching ability, and adaptive mutation was utilized to avoid falling into local optimal solution. The algorithm used feasible disassembly sequence list to get particle code in order to solve the disassembly sequence planning problem. A strategy of generating section feasible disassembly sequence was used in particle mutation and particle updated based on floating window. Then the feasibility of particle sequence list after every iteration was guaranteed to avoid judging the feasibility of particle, and the efficiency of the algorithm was improved. The effectiveness of the algorithm was proved by a typical example.

关 键 词：再制造 拆卸序列规划 粒子群优化 拆卸求解 

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