基于粒子群算法的U型装配线平衡问题研究

摘要

The paper proposed an improved particle swarm optimization algorithm which minimized the number of stations for a given cycle time in the type 1 of the U-shaped Assembly Line Balancing Problem (UALBP-1). Because particle swarm algorithm cannot be directly used to solve the combinatorial optimization problem of discrete space, the article solved it by particle swarm algorithm based on priority which choosed task throughing the size of the weight of the task. And the paper illustrated the method of updating velocity and location of particle. Finally, the proposed algorithm was testing and compared with literature test question, and the result showed the effectiveness of the proposed algorithms.%针对给定节拍最小化工作站数的第一类U型装配线平衡问题,提出了一种改进的粒子群算法.由于粒子群算法不能直接用于求解离散空间的组合优化问题,故文章采用基于优先权的粒子群算法来求解,通过对任务赋以的权重的大小来选择任务,并具体说明了粒子速度和位置的更新.最后,对大量测试问题集进行了验证,说明了算法的有效性.