计算机应用研究2012，Vol.29Issue(6)：2028-2030,2034,4.DOI:10.3969/j.issn.1001-3695.2012.06.006
一种新的混合粒子群算法求解置换流水车间调度问题
New hybrid particle swarm optimization algorithm for permutation Flow-Shop scheduling problem
摘要
Abstract
For the problem that the PSO is easy to be trapped in local optimal, this paper put forward a hybrid PSO algorithm which combined the iG algorithm. The algorithm judged the particles' status by the change of particles' individual and global best value in continuous generations, and used destruction and construction operation of IG algorithm to mutate the relating particle and the global best position after discovering that the particle was at a standstill or the particle swarm was trapped in local optimal. The new particles being mutated were accepted according to the simulated annealing theory. The mutation of global best particle could guide the particle swarm to escape from the local best value' s limit and increase the diversity of particles , which avoided the particle' s premature stagnation. Simultaneously, the algorithm adopted cycle iterative method in order to get or approach the best result quickly. It searched the best solution step by step on the basis of stage optimization. The paper applied the hybrid PSO algorithm to the permutation Flow-Shop scheduling problem, and compared it with the other representative algorithm. The result shows that the hybrid PSO algorithm can avoid the particle' s premature stagnation effectively and the algorithm is better than other algorithms in the quality of searching the best solution.关键词
粒子群算法/迭代贪婪算法/早熟收敛/流水车间调度Key words
particle swarm optimization( PSO)/iterated greedy(IG)/premature stagnation/Flow-Shop scheduling分类
信息技术与安全科学引用本文复制引用
张其亮,陈永生..一种新的混合粒子群算法求解置换流水车间调度问题[J].计算机应用研究,2012,29(6):2028-2030,2034,4.基金项目
国家"十一五"科技支撑计划资助项目(115-04-YK-048) （115-04-YK-048）
