earticle

논문검색

Improved PSO based on the Uniform Search Strategy

원문정보

초록

영어

Particle Swarm Optimization (PSO) algorithm is a new optimization approach, which has been widely used to solve various and complex optimization problems. However, there are still some imperfections, such as premature convergence and low accuracy. To address such defects, an improved PSO is proposed in this paper. The improved PSO algorithm introduces a uniform search strategy that makes particles proceed alternately between basic movement and uniform search movement, which can ensure sufficient search over the entire space as well as the convergence of particles. Meanwhile, the learning object of the particle swarm is no longer a single particle, which is helpful to prevent particles from being trapped in local optima. The experimental results on the typical functions demonstrate that the improved algorithm has good performance in terms of precision and convergence when compared with other variants of PSO.

목차

Abstract
 1. Introduction
 2. Basic PSO Algorithm
 3. Improved PSO based on Uniform Search Strategy
  3.1. Uniform Search Strategy
  3.2. The Uniform Search PSO
  3.3. Algorithm Steps of USPSO
 4. Experimental Results and Analysis
  4.1. Comparisons on Solution Accuracy and Stability
  4.2. Comparisons on the Convergence Speed and Reliability
 5. Conclusions
 Acknowledgement
 References

저자정보

  • Jianmin Zhu School of Mechanical Engineering, University of Shanghai for Science and Technology, shanghai 200093, China
  • Youfa Xu School of Mechanical Engineering, University of Shanghai for Science and Technology, shanghai 200093, China
  • Tongchao Zhang School of Mechanical Engineering, University of Shanghai for Science and Technology, shanghai 200093, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.