Abstract
Premature convergence when solving multimodal problems is still the main limitation which affects the performance of the PSO. To avoid of premature, an improved PSO algorithm with an adaptive updating mechanism (IPSO) is proposed in this paper. When the algorithm converges to a local optimum, the updating mechanism begins to work so that the stagnated algorithm obtains energy for optimization. That is, the updating mechanism refreshes the swarm and expands the range for exploration. In this way, the algorithm can achieve a good balance between global exploration and local exploitation by the combination of the basic PSO evolution and updating mechanism. The proposed method is tested with a set of 10 standard optimization benchmark problems and the results are compared with those obtained through other 4 existing PSO algorithms. The simulation results elucidate that the proposed method produces the near global optimal solution, especially for those complex multimodal functions whose solution is difficult to be found by the other 4 algorithms. It is also observed from the comparison the IPSO is capable of producing a quality of optimal solution with faster rate.
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
Kennedy, J., Eberhart, R.: Particle Swarm Optimization. In: 4th IEEE International Conference on Neural Networks, pp. 1942–1948. IEEE Press, Piscataway (1995)
Tasgetiren, M.F., Liang, Y.C., Sevkli, M., Gencyilmaz, G.: A Particle Swarm Optimization Algorithm for Makespan and Total Flowtime Minimization in the Permutation Flowshop Sequencing Problem. European Journal of Operational Research 177, 1930–1947 (2007)
Franken, N., Engelbrecht, A.P.: Particle Swarm Optimization Approaches to Coevolve Strategies for the Iterated Prisoner’s Dilemma. IEEE Trans. Evol. Comput. 9, 562–579 (2005)
Ho, S.Y., Lin, H.S., Liauh, W.H., Ho, S.J.: OPSO: Orthogonal Particle Swarm Optimization and Its Application to Task Assignment Problems. IEEE Trans. Syst., Man, Cybern. A, Syst., Humans. 38, 288–298 (2008)
Poli, R., Kennedy, J., Blackwell, T.: Particle Swarm Optimization: An Overview. Swarm Intelligence 1, 33–57 (2007)
Ratnaweera, A., Halgamuge, S., Watson, H.: Self-Organizing Hierarchical Particle Swarm Optimizer with Time-Varying Acceleration Coefficients. IEEE Trans. Evol. Comput. 8, 240–255 (2004)
Oca, M.A.M., Stützle, T., Birattari, M., Dorigo, M.: Frankenstein’s PSO: A Composite Particle Swarm Optimization Algorithm. IEEE Trans. Evol. Comput. 13, 1120–1132 (2009)
Zhan, Z.H., Zhang, J., Li, Y., Chung, H.S.H.: Adaptive Particle Swarm Optimization. IEEE Trans. Syst., Man, Cybern. B, Cybern. 39, 1362–1380 (2009)
Chatterjee, A., Siarry, P.: Nonlinear Iinertia Weight Variation for Dynamic Adaptation in Particle Swarm Optimization. Comput. Oper. Res. 33, 85–871 (2004)
Tripathi, P.K., Bandyopadhyay, S., Pal, S.K.: Adaptive Multi-Objective Particle Swarm Optimization Algorithm. In: Proc. IEEE Congr. Evol. Comput., Singapore, pp. 228–2288 (2007)
Kennedy, J., Mendes, R.: Population Structure and Particle Swarm Performance. In: Proc. 2002 Congress Evolutionary Computation, vol. 2, pp. 1671–1676 (2002)
Lovbjerg, M., Krink, T.: Extending Particle Swarm Optimizers with Self-Organized Criticality. In: Proc. Congr. Evol. Comput., Honolulu, HI, pp. 1588–1593 (2002)
Qi, J., Pang, S.: Re-Diversified Particle Swarm Optimization. In: Li, K., Fei, M., Jia, L., Irwin, G.W. (eds.) LSMS 2010 and ICSEE 2010, Part II. LNCS, vol. 6329, pp. 30–39. Springer, Heidelberg (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Qi, J., Ding, Y. (2011). An Improved Particle Swarm Optimization with an Adaptive Updating Mechanism. In: Tan, Y., Shi, Y., Chai, Y., Wang, G. (eds) Advances in Swarm Intelligence. ICSI 2011. Lecture Notes in Computer Science, vol 6728. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21515-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-21515-5_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21514-8
Online ISBN: 978-3-642-21515-5
eBook Packages: Computer ScienceComputer Science (R0)