基于量子行为粒子群算法的装配序列优化方法

摘要

Aiming at the problem of a mass of assembly sequence w hich is infeasible in the process of assembly sequence planning ,this paper proposes an optimizing method of assembly sequence planning based on quantum‐behavior particle swarm algorithm .The method defines the position and speed of particles in the sorting space as w ell as relevant logical operations .It is used to establish the compre‐hensive evaluation function on the basis of the characteristics of ASP ,the geometric feasibility of as‐sembly sequence ,the stability and polymerization stability of assembly operations and the number of assembly redirection .The quantization of particles makes the particles spread to the entire particle space ,which can overcome the shortcomings of local convergence .The analysis and comparison show that the optimizing method is useful for the assembly sequence planning of complicated products .%针对装配序列规划（ASP）过程中产生的大量不可行的装配序列问题，提出了一种基于量子行为粒子群算法（QPSO）的装配序列优化方法。该算法根据ASP特点，在排序空间定义了粒子的位置和速度以及相关的逻辑运算，并基于装配序列的几何可行性、装配操作的稳定性、装配操作的聚合性以及装配重定向次数构建了综合评价函数，然后将粒子进行量子化，使粒子能遍历到整个粒子空间以搜索全局最优解，克服了一般算法局部收敛的缺点。实例分析对比表明：该算法是一种能解决复杂产品装配序列规划优化问题的有效方法。