Computer Science ›› 2010, Vol. 37 ›› Issue (6): 268-270.
Previous Articles Next Articles
WANG Jun-hui
Online:
Published:
Abstract: Particle swarm optimization is one of the heuristic global optimization algorithms, which has attracted vast attendons of researchers. Based on the analysis of the current improved algorithm, one improved algorithm was proposed in this paper, which employs Arnold chaotic map and one dimension disturbance term to improve the particle swarm algorithm. In the proposed algorithm, the researching ability of global optimization of particle swarm is enhanced through the improving of single particle. The simulation results show that the algorithm can keep the populations diversity better, and the performance of the particle swarm is increased notably.
Key words: Particle swarm optimization, Arnold map, One dimension disturbance
WANG Jun-hui. Improved Particle Swarm Algorithm Based on Arnold Map[J].Computer Science, 2010, 37(6): 268-270.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2010/V37/I6/268
Cited