Hybrid Mean Particle Swarm Optimization Algorithm for Permutation Flow Shop Scheduling Problem
This paper presents a new hybrid mean particle swarm optimization algorithm with improved NEH heuristic approach and local search strategies by using an immune mechanism.This hybrid mean particle swarm optimization algorithm is used for permutation flow shop scheduling problems.Finally,twenty-five problems are used to test the performance of the algorithm,the experimental results show that the proposed approach is an effective and practical.
Mean particle swarm optimization Permutation flow shop scheduling NEH heuristic Immune algorithm Pairwise
Yongquan Zhou Zhengxin Huang Yanlian Du Qiaoqiao Gong
College of Mathematics and Computer Science, Guangxi University for Nationalities Nanning, Guangxi 530006, China
国际会议
重庆
英文
270-274
2010-12-11(万方平台首次上网日期,不代表论文的发表时间)