Particle Swarm Optimisation with Enhanced Memory Particles

  • Ian Broderick
  • Enda Howley
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8667)


Particle swarm optimisation (PSO) is a general purpose optimisation algorithm in which a population of particles are attracted to their past success and the success of other particles. This paper introduces a new variant of the PSO algorithm, PSO with Enhanced Memory Particles, where the cognitive influence is enhanced by having particles remember multiple previous successes. The additional positions introduce diversity which aids exploration. Balancing the need for exploitation with this additional diversity is achieved through the use of a small memory and by using Roulette selection to select a single position from memory to use when calculating particles’ velocities. The research shows that PSO EMP performs better than the Standard PSO in most cases and does not perform significantly worse in any case.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948. IEEE Press (November/December 1995)Google Scholar
  2. 2.
    Bratton, D., Kennedy, J.: Defining a standard for particle swarm optimization. In: IEEE Swarm Intelligence Symposium, pp. 120–127 (April 2007)Google Scholar
  3. 3.
    Mendes, R., Kennedy, J., Neves, J.: The fully informed particle swarm: simpler, maybe better. IEEE Transactions on Evolutionary Computation 8(3), 204–210 (2004)CrossRefGoogle Scholar
  4. 4.
    Jordan, J., Helwig, S., Wanka, R.: Social interaction in particle swarm optimization, the ranked fips, and adaptive multi-swarms. In: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation (GECCO 2008), pp. 49–56. ACM, New York (2008)CrossRefGoogle Scholar
  5. 5.
    Suganthan, P.N., et al.: Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. Technical report, Nanyang Technological University, Singapore and KanGAL Report Number 2005005 (2005)Google Scholar
  6. 6.
    Kennedy, J., Mendes, R.: Population structure and particle swarm performance. In: Proceedings of the 2002 Congress on Evolutionary Computation (CEC 2002), pp. 1671–1676. IEEE Computer Society, Washington, DC (2002)Google Scholar
  7. 7.
    Yin, P.-Y., Glover, F., Laguna, M., Zhu, J.-X.: Cyber Swarm Algorithms – Improving particle swarm optimization using adaptive memory strategies. European Journal of Operational Research 201, 377–389 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Hu, X.H., Eberhart, R.C., Shi, Y.H.: Particle swarm with extended memory for multi-objective optimization. In: Proceedings of the IEEE Swarm Intelligence Symposium (SIS 2003), pp. 193–197 (2003)Google Scholar
  9. 9.
    Zhou, C., Zhang, G.-A., Zhou, H.: Extended Individual Memory Based Multi-objective Particle Swarm Optimization. In: International Conference on Future Computer and Communication (ICFCC), Wuhan, pp. 390–394 (2010)Google Scholar
  10. 10.
    Sivaraj, R., Ravichandran, T.: A review of selection methods in genetic algorithm. Int. J. Eng. Sci. Tech. 3, 3792 (2011)Google Scholar
  11. 11.
    Clerc, M., Kennedy, J.: The particle swarm: explosion stability and convergence in a multi-dimensional complex space. IEEE Trans. Evolution. Comput. 6(1), 58–73 (2002)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Ian Broderick
    • 1
  • Enda Howley
    • 1
  1. 1.Discipline of Information TechnologyNational University of IrelandGalwayIreland

Personalised recommendations