针对装备制造业中存在的装配序列规划问题,建立最小化装配次数和方向改变次数之和为目标的优化模型。针对优化模型提出具有随机性特点的初始种群启发式编码,设计粒子群算法。为避免粒子陷入局部最优,采用不同程度的局部搜索操作方式,达到增强粒子群算法局部搜索的能力。实例验证表明,该算法在解决装配序列规划问题上具有优势,求解效果较好。
For the assembly sequence planning (ASP) problem in equipment manufacturing industry, an optimization model is established in order to maximize the assembly operation times and minimize the times of changing assembly direction. A particle swarm optimization algorithm is designed to solve ASP problem where the initial swarm is generated by a heu- ristic method with randomness characteristic. The different methods of local search opera- tions are selected so that the particles cannot fall into local optimization and improve the a- bility of local search. The experimental results show that the algorithm proposed in this pa- per is efficient in solving ASP problem, and it has better solving effect.