title: An effective PSO-based memetic algorithm for flow shop scheduling.
abstract: This paper proposes an effective particle swarm optimization (PSO)-based memetic algorithm (MA) for the permutation flow shop scheduling problem (PFSSP) with the objective to minimize the maximum completion time, which is a typical non-deterministic polynomial-time (NP) hard combinatorial optimization problem. In the proposed PSO-based MA (PSOMA), both PSO-based searching operators and some special local searching operators are designed to balance the exploration and exploitation abilities. In particular, the PSOMA applies the evolutionary searching mechanism of PSO, which is characterized by individual improvement, population cooperation, and competition to effectively perform exploration. On the other hand, the PSOMA utilizes several adaptive local searches to perform exploitation. First, to make PSO suitable for solving PFSSP, a ranked-order value rule based on random key representation is presented to convert the continuous position values of particles to job permutations. Second, to generate an initial swarm with certain quality and diversity, the famous Nawaz-Enscore-Ham (NEH) heuristic is incorporated into the initialization of population. Third, to balance the exploration and exploitation abilities, after the standard PSO-based searching operation, a new local search technique named NEH_1 insertion is probabilistically applied to some good particles selected by using a roulette wheel mechanism with a specified probability. Fourth, to enrich the searching behaviors and to avoid premature convergence, a simulated annealing (SA)-based local search with multiple different neighborhoods is designed and incorporated into the PSOMA. Meanwhile, an effective adaptive meta-Lamarckian learning strategy is employed to decide which neighborhood to be used in SA-based local search. Finally, to further enhance the exploitation ability, a pairwise-based local search is applied after the SA-based search. Simulation results based on benchmarks demonstrate the effectiveness of the PSOMA. Additionally, the effects of some parameters on optimization performances are also discussed.
authors.affiliation: Institute of Process Control, Department of Automation, Tsinghua University, Beijing 100084, China. liub01@mails.tsinghua.edu.cn
authors.forename: Bo
authors.initials: B
authors.lastname: Liu
authors.forename: Ling
authors.initials: L
authors.lastname: Wang
authors.forename: Yi-Hui
authors.initials: YH
authors.lastname: Jin
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D032701:Biomimetics; D003198:Computer Simulation; D007221:Industry / Q000379:methods*; D008962:Models, Theoretical; D010934:Planning Techniques; D012984:Software; D013598:Systems Theory; D017132:Workplace