基于改进海鸥算法的装配序列规划

Assembly Sequence Planning Based on Improved Seagull Algorithm

为提高复杂产品装配工艺的设计效率,针对装配序列规划问题,提出一种基于改进海鸥算法的求解方法。引入莱维飞行策略对算法的位置更新公式做出了改进,改善了海鸥算法容易陷入局部最优的问题。针对装配序列规划问题,从可行性、稳定性、装配方向和装配工具的连续性四个方面建立适应度函数,作为装配序列优劣的评判标准。以溢流阀的装配为例分析算法的可行性分析,结果表明改进海鸥算法在求解装配序列规划问题上具有一定的优越性。

Aiming at the problem of assembly sequence planning,the fitness function is established from four aspects:feasibility,stability,the continuity of assembly tools and assembly direction.Taking the assembly of relief valve as an example,the feasibility of the algorithm is analyzed and compared with particle swarm optimization algorithm and ant colony algorithm from the aspects of optimal fitness,average fitness and the number of iterations to reach the optimal fitness.The results show that the improved Seagull algorithm has certain advantages in solving the assembly sequence planning problem.