A Novel Immune-PSO Algorithm for Job Shop Scheduling
The job shop scheduling problem (JSSP) is one of the most difficult problems, as it is classified as an NP-complete one. Particle Swarm Optimization, a nature-inspired evolutionary algorithm, has been successful in solving a wide range of real-value optimization problems. However, little attempts have been made to extend it to discrete problems. In this paper, a new particle swarm optimization method based on the clonal selection algorithm is proposed to avoid premature convergence and guarantee the diversity of the population. Experimental results indicate that the proposed algorithm is highly competitive, being able to produce better solutions than GA and CLONALG in several cases, and is a viable alternative for solving efficiently job shop scheduling problem.
Artificial immune system Clonal selection algorithm PSO Job shop scheduling problem
HONG Lu YANG Jing
Department of Electronic Engineering,Huaihai Institute of Technology,Lianyungang,China College of Electric Engineering,Guizhou University,Guiyang,China
国际会议
2010 International Conference on Material and Manufacturing Technology(2010材料与制造技术国际会议 ICMMT2010)
重庆
英文
261-265
2010-09-17(万方平台首次上网日期,不代表论文的发表时间)