Earticle

초록

영어

Particle swarm optimization (PSO) is a population-based stochastic optimization that has been widely applied to a variety of problems. However, it is easily trapped into the local optima and appears premature convergence during the search process. To address these problems, we propose a new particle swarm optimization by introducing chaotic maps (tent map and logistic map) and Gaussian mutation into the PSO algorithm. On the one hand, the chaotic map is employed to initialize uniform distributed particles so as to improve the quality of the initial population, which is a simple yet very efficient method to improve the quality of initial population. On the other hand, the Gaussian mutation mechanism based on the maximal focus distance is adopted to help the algorithm escape from the local optima and make the particles proceed with searching in other regions of the solution space until the global optimal or the closer-to-optimal solutions can be found. Experimental results on two benchmark functions demonstrate the effectiveness and efficiency of the PSO algorithm proposed in this paper.

목차

Abstract
 1. Introduction
 2. Standard PSO
 3. Chaotic Maps
  3.1. Tent Map
  3.2. Logistic Map
 4. PSO with Chaotic Maps and Gaussian Mutation
 5. Experimental Results and Analysis
  5.1. Experimental Setting
  5.2. Experimental Results
 6. Conclusion and Expectation
 Acknowledgements
 References

키워드

저자

• Dongping Tian [ Institute of Computer Software, Baoji University of Arts and Sciences, Baoji, Shaanxi, 721007, China, Institute of Computational Information Science, Baoji University of Arts and Sciences, Baoji, Shaanxi, 721007, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Grid and Distributed Computing

• 간기

  격월간

• pISSN

  2005-4262

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605