Abstract
The application of Particle Swarm Optimization (PSO) on combinatorial optimization problems is limited, and it is due to the continuous nature of PSO. In order to solve the Multiobjective Permutation Flowshop Sequencing Problem (MPFSP), a Discrete Particle Swarm Optimization (DPSO) algorithm is proposed. To obtain a well approximation of true Pareto front, the phenotype sharing function of the objective space is applied in the definition of fitness function. The effectiveness of the proposed DPSO has been analyzed using 5 problems with the objectives of minimizing the makespan and the total tardiness, and 20 benchmarks problems with the objectives of minimizing the makespan and the total flowtime. The result shows that the proposed DPSO can reach a good approximation of true Pareto front.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Srinivas, N., Deb, K.: Multiobjective optimization using nondominated sorting in genetic algorithms. Evolutionary Computation 2(3), 221–248 (1995)
Ishibuchi, H., Murata, T.: A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans. Syst. Man Cybern. C 28, 392–403 (1998)
Ishibuchi, H., Yoshida, T., Murata, T.: Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans. Evol. Comput. 7, 204–223 (2003)
Bagchi, T.P.: Multiobjective scheduling by genetic algorithms. Kluwer, Boston (1999)
Chang, P.-C., Hsieh, J.-C., Lin, S.G.: The development of gradual priority weighting approach for the multi-objective flowshop scheduling problem. Int. J. Prod. Econ. 79, 171–183 (2002)
Pasupathy, T., Rajendran, C., Suresh, R.K.: A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs. The International Journal of Advanced Manufacturing Technology 27(7-8), 804–815 (2006)
Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proc. IEEE Int’l Conf. On Neural Networks, pp. 1942–1948. IEEE Computer Society Press, Los Alamitos (1995)
Tasgetiren, M.F., et al.: Particle swarm optimization algorithm for permutation flowshop sequencing problem. In: Dorigo, M., et al. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 382–390. Springer, Heidelberg (2004)
Pan, Q.K., Tasgetiren, M.F., Liang, Y.C.: A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem with makespan criterion. In: Proceedings of the International Workshop on UK Planning and Scheduling, pp. 34–43. Special Interest Group (2005)
Reyes-Sierra, M., Coello Coello, C.A.: Multi-Objective Particle Swarm Optimizers: A Survey of the State-of-the-Art. Technical Report EVOCINV-01-2006. Evolutionary Computation Group at CINVESTAV-IPN, Mexico (2006)
Chen, G.-L., et al.: An Improved Genetic Algorithm for Multi-objective Optimization. In: ISICA’2005: Progress in Intelligent Computation and Its Applications, pp. 204–210 (2005)
Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64, 278–285 (1993)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wenzhong, G., Guolong, C., Min, H., Shuili, C. (2007). A Discrete Particle Swarm Optimization Algorithm for the Multiobjective Permutation Flowshop Sequencing Problem. In: Cao, BY. (eds) Fuzzy Information and Engineering. Advances in Soft Computing, vol 40. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71441-5_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-71441-5_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71440-8
Online ISBN: 978-3-540-71441-5
eBook Packages: EngineeringEngineering (R0)