An Improved Cooperative PSO Algorithm for Job-shop Scheduling Problem

摘要：

　　The Cooperative Particle Swarm Optimization(CPSO)is a variant of the original PSO.It divides the solution vector into sub-vectors.Aiming to the stagnation problem of CPSO,this paper presents an improved cooperative particle swarm optimization algorithm(ICPSO).In order to retain the diversity of the swarm,it employs a comprehensive learning strategy to determine the position and velocity of each particle.It adds a factor of selection probability and discourages premature convergence to some extent.Through standard job-shop scheduling problem test,we demonstrate that the improved CPSO algorithm has an improvement in performance over the traditional CPSO.It has not only quicker speed of convergence but also less makespan.

关键词： Particle Swarm Optimization (PSO) Job-shop Scheduling Problem Cooperative Optimization Clustering algorithm

作者: Yuyan Zheng Jianhua Qu Lin Wang

作者单位: School of Management Science and Engineering,Shandong Normal University,Jinan,China

会议类型: 国际会议

会议名称: The 9th International Conference on Pervasive Computing and Application(ICPCA 2014)(第九届全国普适计算学术会议、第九届全国人机交互联合学术会议)

会议地点: 南昌

会议语种:英文

页码: 1-13

在线出版日期: 2013-09-26（万方平台首次上网日期，不代表论文的发表时间）