计算机应用研究2012，Vol.29Issue(4)：1234-1236,1240,4.DOI:10.3969/j.issn.1001-3695.2012.04.009
一种求解作业车间调度的文化粒子群算法
Cultural particle swarm optimization algorithm for Job-Shop scheduling problem
摘要
Abstract
This paper proposed an algorithm for the minimization of the makespan in permutation flow shop scheduling problem (FSSP) ,which combined cultural particle swarm optimization ( CPSO). The algorithm set two kinds of spaces, population space and belief space. The population space was evolved with adaptive PSO strategy, and the belief space was evolved with update function. Particles of population space not only tracked individual extreme and global extreme to update themselves, but also exchanged with good individuals of belief space to speed up the convergence speed. The proposed algorithm was tested on different scale benchmarks and compared with the other representative algorithms. The result shows that CPSO has faster convergence speed and is better than those algorithms in not only the solution quality but also the stability.关键词
粒子群算法/文化算法/作业车间调度Key words
particle swarm optimization/ cultural algorithm/ Job-Shop scheduling分类
信息技术与安全科学引用本文复制引用
朱霞..一种求解作业车间调度的文化粒子群算法[J].计算机应用研究,2012,29(4):1234-1236,1240,4.基金项目
淮安市科技计划资助项目(SN1045) （SN1045）
淮安市科技局资助项目(HAG09052) （HAG09052）
