Advertisement

An Improved Particle Swarm Optimization Algorithm Based on Two Sub-swarms

  • Zhihui Yu
  • Wenhuan Wu
  • Lieyang Wu
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 169)

Abstract

In order to improve performance of particle swarm optimization algorithm (PSO) in global optimization, the reason of premature convergence of the PSO is analyzed, and a new particle swarm optimization based on two sub-swarms (TSS-PSO) is proposed in this paper. The particle swarm is divided into two identical sub-swarms, that is, the first sub-swarm adopts basic PSO model to evolve, whereas the second sub-swarm iterates adopts the cognition only model. In order to enhance the diversity and improve the convergence of the PSO, the worst fitness of the first sub-swarm is exchanged with the best fitness of the second sub-swarm in each iterate for increasing the information exchange between the particles. Compared with other two sub-swarms algorithms, the idea of this algorithm is readily comprehended, and its program is easy to be realized. The experimental results display that the convergence of TSS-PSO evidently gets the advantage of basic particle swarm optimization, as well as its competence of finding the global optimal solution is better than the basic PSO.

Keywords

Particle Swarm Optimization Precocity Converges Global Optimization Sub-Swarm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kennedy, J., Eberhart, R.: Particle Swarm Optimization. In: Proceedings of IEEE Int’1 Conf. on Neural Networks, pp. 1942–1948. IEEE Service Center, Piscataway (1995)Google Scholar
  2. 2.
    Eberhart, R., Kennedy, J.: A New Optimizer Using Particle Swarm Theory. In: Proceedings of the 6th International Symposium on Micro Machine and Human Science, pp. 39–43. IEEE Service Center, Piscataway (1995)Google Scholar
  3. 3.
    Shi, Y., Eberhart, R.: A modified particle swarm optimizer. In: Proceedings of IEEE World Congress on Computational Intelligence, pp. 69–73. IEEE Press, New York (1998)Google Scholar
  4. 4.
    Shi, Y., Eberhart, R.: Fuzzy Adaptive Particle Swarm Optimization. In: Proceedings of the Congress on Evolutionary Computation, pp. 101–106. IEEE Press, Seoul (2001)Google Scholar
  5. 5.
    Van den Bergh, F.: An Analysis of Particle Swarm Optimizers. PhD thesis. Department of Computer Science. University of Pretoria, South Africa (2002)Google Scholar
  6. 6.
    Chen, G.-C., Yu, J.-S.: Two sub-swarms particle swarm optimization algorithm and its application. Control Theory & Applications 24(2), 294–298 (2007) (in Chinese)Google Scholar
  7. 7.
    Eberhart, R., Shi, Y.: Particle Swarm Optimization: Developments, applications and resources. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2001), pp. 81–84. IEEE Service Center, Piscataway (2001)Google Scholar
  8. 8.
    Kennedy, J.: Small Worlds and Mega-Minds: Effects of Neighborhood Topology on Particle Swarm Performance. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 1931–1938. IEEE Press, New York (1999)Google Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.School of Mathematics and Computer ScienceShangrao Normal UniversityShangraoChina
  2. 2.School of Computer Science and TechnologyZhoukou Normal UniversityZhoukouChina
  3. 3.Jiangxi Highway Network Management CenterNanchangChina

Personalised recommendations