Particle swarm optimization algorithm based on dynamic memory strategy

ABSTRACT

This paper mainly studies the influence of memory on individual performance in particle swarm system. Based on the observation of social phenomenon from the perspective of social psychology, the concept of individual memory contribution is defined and several measurement methods to determine the level of effect of individual memory on its behavior are discussed. A dynamic memory particle swarm optimization algorithm is implemented by dynamically assigning appropriate weight to each individual's memory according to the selected metrics values. Numerical experiment results on benchmark optimization function set show that the proposed scheme can effectively adjust the weight of individual memory according to different optimization problems adaptively. Numerical results also demonstrate that dynamic memory is an effective improvement strategy for preventing premature convergence in particle swarm optimization algorithm.

REFERENCES

• 1: C. N. Bendtsen and T. Krink. Dynamic memory model for non-stationary optimization. In Proceedings of the IEEE Congress on Evolutionary Computation, pages 145--150. IEEE, May 2002.
• 2: A. Chatterjee , P. Siarry, Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimization, Computers and Operations Research, v.33 n.3, p.859-871, March 2006 [doi>10.1016/j.cor.2004.08.012]
• 3: M. Clerc. Discrete particle swarm optimization. In New Optimization Techniques in Engineering, pages 1942--1948. IEEE, March 2004.
• 4: M. Clerc and J. Kennedy. The particle swarm--explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation, 6(1):58--73, 2002.
• 5: A. EI-Gallad, M. EI-Hawary, A. Sallam, and A. Kalas. Enhancing the particle swarm optimizer via proper parameters selection. In Proceedings of Canadian Conference on Electrical and Computer Engineering, pages 792--797. IEEE, August 2002.
• 6: H. Y. Fan. A modification to particle swarm optimization algorithm. Engineering Computations, 19(7-8):970--989, 2002.
• 7: Xiaohui Hu , R. Eberhart, Multiobjective optimization using dynamic neighborhood particle swarm optimization, Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress, p.1677-1681, May 12-17, 2002
• 8: Xiaohui Hu , R. C. Eberhart, Adaptive particle swarm optimization: detection and response to dynamic systems, Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress, p.1666-1670, May 12-17, 2002
• 9: J. Kennedy and R. C. Eberhart. Particle swarm optimization. In Proceeding of the 1995 IEEE International Conference on Neural Networks, pages 1942--1948. IEEE, November 1995.
• 10: B. Latane. The psychology of social impact. American Psychologist, 36(4):343--356, 1981.
• 11: R. Mendes, J. Kennedy, and J. Neves. The fully informed particle swarm: Simple, maybe better. IEEE Transactions on Evolutionary Computation, 8(3):204--210, 2004.
• 12: K. E. Parsopoulos , M. N. Vrahatis, Recent approaches to global optimization problems through Particle Swarm Optimization, Natural Computing: an international journal, v.1 n.2-3, p.235-306, June 2002 [doi>10.1023/A:1016568309421]
• 13: Y. Shi and R. C. Eberhart. A modified particle swarm optimizer. In Proceedings of the IEEE Congress on Evolutionary Computation, pages 69--73. IEEE, May 1998.
• 14: Ioan Cristian Trelea, The particle swarm optimization algorithm: convergence analysis and parameter selection, Information Processing Letters, v.85 n.6, p.317-325, 31 March 2003 [doi>10.1016/S0020-0190(02)00447-7]

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.8 Problem Solving, Control Methods, and Search
          Subjects: Heuristic methods

General Terms:
Algorithms

Keywords:
dynamic memory strategy, individual memory weight, particle swarm optimization