WSEAS Transactions on Systems and Control
Print ISSN: 1991-8763, E-ISSN: 2224-2856
Volume 16, 2017
An Immune Particle Swarm Optimization Method for Permutation Flow Shop Scheduling Problem
Authors: , ,
Abstract: Permutation Flow Shop Scheduling Problem (PFSP) is a complex combinatorial optimization problem with strong engineering background. To solve the PFSP with makespan criterions, an immune particle swarm optimization (IPSO) algorithm was proposed. The initial solution of the algorithm is generated by the famous heuristic NEH algorithm, it was used to initialize the particle of global extreme values. Then we add a Dynamic Disturbance Term (DDT) in the velocity updating formulation of the particle, it used to prevent optimizing course from trapping the local minimum. Density and Immune Selection mechanism of Immune algorithm (IA) are used in the iterative process to select the optimal particle through the choice probability equation. The vaccination and memory operation to guide the global optimization process. At last, computational results show that the IPSO algorithm is effective robust and has a high performance.
Search Articles
Keywords: Permutation Flow Shop Scheduling, Particle Swarm Optimization Algorithm, Immune Algorithm, Makespan
Pages: 139-147
WSEAS Transactions on Systems and Control, ISSN / E-ISSN: 1991-8763 / 2224-2856, Volume 16, 2017, Art. #14