TY - GEN

T1 - Hybrid Particle Swarm Optimization with parameter selection approaches to solve Flow Shop Scheduling Problem

AU - Zhang, Xue Feng

AU - An, Xuanye

AU - Koshimura, Miyuki

AU - Fujita, Hiroshi

AU - Hasegawa, Ryuzo

PY - 2011/12/1

Y1 - 2011/12/1

N2 - A Hybrid Particle Swarm Optimization (HPSO) with parameter selection approaches is proposed to solve Flow Shop Scheduling Problem (FSSP) with the objective of minimizing makespan. The HPSO integrates the basic structure of a Particle Swarm Optimization (PSO) together with features borrowed from the fields of Tabu Search (TS), Simulated Annealing (SA). The algorithm works from a population of candidate schedules and generates new populations of neighbor and cooling schedules by applying suitable small perturbation schemes. Furthermore, PSO is very sensitive to efficient parameter setting such that modifying a single parameter may cause a considerable change in the result. Another two classes of new adaptive selection of value for inertia weight and acceleration coefficients are introduced into it. Extensive experiments on different scale benchmarks validate the effectiveness of our approaches, compared with other well-established methods. The experimental results show that new upper bounds of some unsolved problems and better solutions in a relatively reasonable time. In addition, proposed algorithms converge to stopping criteria significantly faster.

AB - A Hybrid Particle Swarm Optimization (HPSO) with parameter selection approaches is proposed to solve Flow Shop Scheduling Problem (FSSP) with the objective of minimizing makespan. The HPSO integrates the basic structure of a Particle Swarm Optimization (PSO) together with features borrowed from the fields of Tabu Search (TS), Simulated Annealing (SA). The algorithm works from a population of candidate schedules and generates new populations of neighbor and cooling schedules by applying suitable small perturbation schemes. Furthermore, PSO is very sensitive to efficient parameter setting such that modifying a single parameter may cause a considerable change in the result. Another two classes of new adaptive selection of value for inertia weight and acceleration coefficients are introduced into it. Extensive experiments on different scale benchmarks validate the effectiveness of our approaches, compared with other well-established methods. The experimental results show that new upper bounds of some unsolved problems and better solutions in a relatively reasonable time. In addition, proposed algorithms converge to stopping criteria significantly faster.

UR - http://www.scopus.com/inward/record.url?scp=84859945897&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84859945897&partnerID=8YFLogxK

U2 - 10.1109/CIS.2011.6169128

DO - 10.1109/CIS.2011.6169128

M3 - Conference contribution

AN - SCOPUS:84859945897

SN - 9781467306874

T3 - Proceedings of 2011, 10th IEEE International Conference on Cybernetic Intelligent Systems, CIS 2011

SP - 13

EP - 19

BT - Proceedings of 2011, 10th IEEE International Conference on Cybernetic Intelligent Systems, CIS 2011

T2 - 2011 10th IEEE International Conference on Cybernetic Intelligent Systems, CIS 2011

Y2 - 1 September 2011 through 2 September 2011

ER -