改进粒子群算法的装配序列规划方法  

Assembly Sequence Planning Based on Improved Particle Swarm Optimization Algorithm

作　　者：于宏[1] 水丽[1] 

机构地区：[1]沈阳理工大学机械工程学院,辽宁沈阳110159

出　　处：《沈阳理工大学学报》2015年第4期29-33,89,共6页Journal of Shenyang Ligong University

摘　　要：针对装配序列规划问题的特点,重新定义应用于连续空间优化的粒子群算法的各种相关操作,并对粒子群算法的更新公式及粒子优化进行改进,提出面向装配序列规划问题的改进型离散粒子群算法。构建邻接矩阵、干涉矩阵和支撑矩阵,描述零部件之间的装配关系。建立包括可行性、重定向性、稳定性、连续性和聚合性为评价指标的适应函数,实现多目标优化。以安全阀装配序列规划实例验证了改进粒子群装配序列优化算法的有效性。Aiming at the problem of assembly sequence planning, all the relevant operations of particle swarm algorithm which is always applied to optimize in continuous space were redefined, and the improved particle swarm algorithm was proposed by improving the Update formula of particle swarm algorithm and particle optimization. The adjacency matrix, interference matrix and supporting matrix are constructed to describe the assembly relationship of assembly parts. To obtain optimal assembly sequence, five criterions including geometric feasibility, redirection, stability, continuity and aggregation are weighted combined in fitness. An safety valve assembly application case demonstrates the availability of the im- proved particle swarm algorithm

关 键 词：装配序列规划 粒子群算法 多目标优化 

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