An Immune Particle Swarm Optimization Algorithm for Solving Permutation Flowshop Problem

Article Preview

Abstract:

To solve the permutation flowshop problem more effectively, a novel artificial immune particle swarm optimization (PSO) algorithm has been proposed. The new algorithm combined the biology immune system theory with particle swarm algorithm by the following phases. Firstly, the scheduling objective and constrain condition were served as antibodies while solutions was served as antigens. Secondly, the particles were encoded as workpiece processing sequence. Furthermore, a concentration selection strategy was adopted to maintain the particle diversity. Finally, comparing with genetic algorithm and PSO, case results showed that immune PSO algorithm not only optimized results and convergence velocity but also had a small fluctuation.

You might also be interested in these eBooks

Info:

Periodical:

Key Engineering Materials (Volumes 419-420)

Pages:

133-136

Citation:

Online since:

October 2009

Export:

Price:

[1] B. Jarboui and S. Ibrabim: Computers & Industrial. Vol. 54 (2008), p.526.

Google Scholar

[2] E. Tailland: European Journal of Operational Research. Vol. 47 (1990), p.65.

Google Scholar

[3] X.F. Xie: Control and Decision. Vol. 18 (2003), p.129.

Google Scholar

[4] L. Wang: Shop Scheduling with Genetic Algorithms (Tsinghua University Press, Beijing 2003).

Google Scholar

[5] R.B. Xiao and P.B. Cao: Engineering Immune Computing (Science Press, Beijing 2007).

Google Scholar