A Hybrid Discrete Particle Swarm Optimization Algorithm to Solve Flow Shop Scheduling Problems

Abstract

This paper presents a method of applying particle swarm optimization (PSO) algorithm to a flow shop scheduling problem. Permutation encoding of job indices is used to represent particles. One particle of the initial swarm is generated using NEH heuristic (M. Nawaz, Jr., 1995) and the remaining particles are generated randomly. A continuous swap mechanism is used to improve the performance of the discrete particle swarm optimization (DPSO) algorithm. Performance of the proposed algorithm is evaluated using the benchmark flow shop scheduling problems given by Taillard (1993). The computational results show that the hybrid approach is more effective

5 Figures and Tables

Cite this paper

@article{Chandrasekaran2006AHD, title={A Hybrid Discrete Particle Swarm Optimization Algorithm to Solve Flow Shop Scheduling Problems}, author={S. Chandrasekaran and S. G. Ponnambalam and R. K. Suresh and N. Vijayakumar}, journal={2006 IEEE Conference on Cybernetics and Intelligent Systems}, year={2006}, pages={1-6} }