计算机科学 ›› 2010, Vol. 37 ›› Issue (6): 268-270.

• 人工智能 • 上一篇    下一篇

基于Arnold映射的改进粒子群算法

王峻慧   

  1. (重庆师范大学管理学院 重庆400047)
  • 出版日期:2018-12-01 发布日期:2018-12-01

Improved Particle Swarm Algorithm Based on Arnold Map

WANG Jun-hui   

  • Online:2018-12-01 Published:2018-12-01

摘要: 粒子群算法是一种广受关注的启发式全局最优搜索算法。在分析现有的一些改进算法的基础上,提出了一种利用Arnold混沌映射和单维度扰动项的改进粒子群算法。算法通过改善单个粒子的搜索活力来增强粒子群的全局最优搜索能力。仿真测试表明,该算法能够较好地保持种群的多样性,粒子群优化性能有较大提高。

关键词: 粒子群优化,Arnold映射,单维度扰动

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

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!