Earticle

초록

영어

An improved algorithm of quantum particle swarm with chaos is presented to solve the problem that the traditional particle swarm algorithm is easy to fall into local optimum and converges very slowly. Through analysis the current state of particles in the iteration, to determine and deal with the particle of poor performance, and keep the normal state continue to complete the search optimal solution, which effectively inhibit premature phenomenon of the particles, and improve the overall search ability of particle swarm. At the same time, in order to improve the performance of the algorithm, introducing chaos mechanism, further enhance the search ability of particle. The experiments of benchmark function show that the improved algorithm has obvious advantages compared with the other two algorithms, it has higher stability and accuracy and faster convergence speed at the same time.

목차

Abstract
 1. Introduction
 2. The Related Problem Analysis
  2.1. Basic Particle Swarm Algorithm
  2.2. The Chaos Mechanism
  2.3. The Particle’s Performance Determine and Improve
 3. Algorithm analysis
  3.1. The Quantum Particle Swarm With Chaotic
  3.2. The Improved Algorithm
 4. Experimental Analysis
 5. Conclusion
 References

키워드

저자

• Zhang Chun-na [ School of Software, University of Science and Technology Liaoning, Anshan Liaoning 114051, China ]
• Li Yi-ran [ College of Applied Technology, University of Science and Technology Liaoning, Anshan Liaoning 114011, China ]
• Li Jun-feng [ The cold rolling plant of Ansteel co.,Ltd. Anshan Liaoning, 114021, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Hybrid Information Technology

• 간기

  격월간

• pISSN

  1738-9968

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605