Similar articles

Abstract: particle swarm optimization (PSO), like other evolutionary algorithms is a population-based stochastic algorithm inspired from the metaphor of social interaction in birds, insects, wasps, etc. It has been used for finding promising solutions in complex search space through the interaction of particles in a swarm. It is a well recognized fact that the performance of evolutionary algorithms to a great extent depends on the choice of appropriate strategy/operating parameters like population size, crossover rate, mutation rate, crossover operator, etc. Generally, these parameters are selected through hit and trial process, which is very unsystematic and requires rigorous experimentation. This paper proposes a systematic based on taguchi method reasoning scheme for rapidly identifying the strategy parameters for the PSO algorithm. The taguchi method is a robust design approach using fractional factorial design to study a large number of parameters with small number of experiments. Computer simulations have been performed on two benchmark functions—Rosenbrock function and Griewank function—to validate the approach.

[1] Bagchi, T.P., 1993. Taguchi Methods Explained—Practical Steps to Robust Design. Prentice Hall of India.

[2] Eberhart, R.C., Kennedy, J., 1995. A New Optimizer Using Particle Swarm Theory. Proceedings of IEEE the 6th Symposium on Micro Machine and Human Centre, p.39-43.

[3] Eberhart, R.C., Shi, Y., 2001. Particle Swarm Optimization: Developments, Applications and Resources. Proceedings of IEEE Congress on Evolutionary Computation, Seoul, Korea, p.81-86.

[4] Kennedy, J., Eberhart, R.C., 1995. Particle Swarm Optimization. Proceedings of IEEE Conference on Neural Networks. Perth, Australia, p.1942-1948.

[5] Kennedy, J., Eberhart, R.C., 2001. Swarm Intelligence. Morgan Kaufmann.

[6] Parsopoulos, K.E., Vrahatis, M.N., 2002. Recent approaches to global optimization problems through particle swarm optimization. Natural Computing, 1(2-3):235-306.

[7] Ross, P.J., 1996. Taguchi Techniques for Quality Engineering. McGraw Hill.

[8] Scheffe, H., 1999. The Analysis of Variance. Wiley Interscience Publication, John Wiley and Sons.

[9] Shi, Y., Eberhart, R.C., 1998. A Modified Particle Swarm Optimizer. Proceedings of IEEE International Conference on Evolutionary Computation, p.69-73.

[10] Shi, Y., Eberhart, R.C., 1999. Empirical Study of Particle Swarm Optimization. Proceedings of Congress on Evolutionary Computation, p.1945-1950.

[11] Shi, Y., Eberhart, R.C., 2001. Fuzzy Adaptive Particle Swarm Optimization. Proceedings of Congress on Evolutionary Computation, p.101-106.

[12] Taguchi, G., Chowdhury, S., Wu, Y., 2005. Taguchi Quality Engineering Handbook. John Wiley and Sons.

[13] Turner, J.R., Thayer, J.F., 2001. Introduction of Analysis of Variance—Design, Analysis and Interpretation. Sage Publications.

[14] Xie, X.F., Zhang, W.J., Yang, Z.L., 2002. Adaptive Particle Swarm Optimization on Individual Level. International Conference on Signal Processing (ICSP 2002), p.1215-1218.