diversified particle swarm optimization for hybrid flowshop scheduling

The aim of this paper is to propose a new particle swarm optimization algorithm to solve a hybrid flowshop scheduling with sequencedependent setup times problem, which is of great importance in the industrial context. this algorithm is called diversified particle swarm optimization algorithm which is a generalization of particle swarm optimization algorithm and inspired by an anarchic society whose members behave anarchically to improve their situations. such anarchy lets the algorithm explore the solution space perfectly and prevent falling in the local optimum traps. besides, for the first time, for the hybrid flowshop, we proposed eight different local search algorithms and incorporate them into the algorithm in order to improve it with the help of systematic changes of the neighborhood structure within a search for minimizing the makespan. the proposed algorithm was tested and the numerical results showe that the proposed algorithm significantly outperforms other effective heuristics recently developed.