The particle swarm optimization with division of work strategy

被引:0
作者
Dou, QS [1 ]
Zhou, CG [1 ]
机构
[1] Jilin Univ, Coll Comp Sci & Technol, Changchun 130012, Peoples R China
来源
PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7 | 2004年
关键词
evolutionary computing; particle swarm optimization; division of work; optimization;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The Particle Swarm Optimization (PSO) method was originally designed by Kennedy and Eberhart in 1995 and has been applied successfully to various optimization problems. The PSO idea is inspired by natural concepts such as fish schooling, bird flocking and human social relations. Some experimental results show that PSO has greater "global search" ability, but the "local search" ability around the optimum is not very good. This paper analyses the PSO method and presents the improved method, which is PSO with Division of Work (PSOwDOW). In order to enhance the "local search" ability of PSO we divide the particle swarm into three sub swarms and each sub swarm has a different job in PSOwDOW. Experimental results show that PSOwDOW can overcome the deficiencies in the traditional PSO and reinforce the optimizing ability of the particle swarm.
引用
收藏
页码:2290 / 2295
页数:6
相关论文
共 17 条
  • [1] Angeline P. J., 1998, Evolutionary Programming VII. 7th International Conference, EP98. Proceedings, P601, DOI 10.1007/BFb0040811
  • [2] [Anonymous], S AFRICAN COMPUTER J
  • [3] The particle swarm - Explosion, stability, and convergence in a multidimensional complex space
    Clerc, M
    Kennedy, J
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (01) : 58 - 73
  • [4] CLERC M, 2002, TRIBES PARAMETER FRE
  • [5] CLERC M, 1998, PARTICLE SWARM OPTIM
  • [6] Clerc M., 1998, SOME MATH PARTICLE S
  • [7] CLERC M, 2000, DISCRETE PARTICLE SW
  • [8] HIROTAKA, 1999, IEEE INT C INT SYST
  • [9] HU XH, 2002, COMPUTATIONAL INTELL
  • [10] Krink T., 2002, P IEEE C EV COMP CEC