A PSO-Based Hybrid Metaheuristic for Permutation Flowshop Scheduling Problems

作者：Zhang Le^*; Wu Jinnan

来源：The Scientific World Journal, 2014, 2014: 902950.

DOI：10.1155/2014/902950

This paper investigates the permutation flowshop scheduling problem (PFSP) with the objectives of minimizing the makespan and the total flowtime and proposes a hybrid metaheuristic based on the particle swarm optimization (PSO). To enhance the exploration ability of the hybrid metaheuristic, a simulated annealing hybrid with a stochastic variable neighborhood search is incorporated. To improve the search diversification of the hybrid metaheuristic, a solution replacement strategy based on the pathrelinking is presented to replace the particles that have been trapped in local optimum. Computational results on benchmark instances show that the proposed PSO-based hybrid metaheuristic is competitive with other powerful metaheuristics in the literature.

• 出版日期2014
• 单位清华大学; 沈阳大学