计算机科学 ›› 2013, Vol. 40 ›› Issue (Z11): 125-130.

• 智能控制与优化 • 上一篇    下一篇

基于多点速度向量和自适应速度值的离散二进制粒子群算法改进

沈佳杰,江红,王肃   

  1. 华东师范大学信息科学技术学院 上海200241;华东师范大学信息科学技术学院 上海200241;华东师范大学信息科学技术学院 上海200241
  • 出版日期:2018-11-16 发布日期:2018-11-16
  • 基金资助:
    本文受国家863基金项目(2013AA01A211)资助

Improved Binary Particle Swarm Optimization Algorithm Based on Multi Velocity Vector and Adaptive Speed Value

SHEN Jia-jie,JIANG Hong and WANG Su   

  • Online:2018-11-16 Published:2018-11-16

摘要: 针对标准的离散二进制粒子群算法在高维环境下迭代速度慢和易早熟的缺点,通过引入多点速度向量和自适应的速度计算方法,提出一个多点基于速度向量和自适应速度值的改进的自适应离散二进制粒子群算法,通过理论推导改进的离散粒子运算法可有效提高离散差分进化算法对于复杂问题先的全局最优值搜索能力和离散粒子群算法对于复杂优化问题的收敛速度。实验验证了理论推导的结果。

关键词: 离散问题优化,粒子群算法,多点速度向量,自适应速度值

Abstract: Aiming to easy to prematurity and low iteration speed problem of the standard binary particle swarm optimization (BPSO) algorithm in high dimension environment,using the the multi velocity vector and adaptive speed value,an improved discrete binary particles swarm optimization based on multi velocity vector and adaptive speed value was proposed.Though theoretical derivation,the correctness of improved discrete particle swarm optimization algorithm was proofed.The correctness of the theoretical derivation was verified by the experiment.

Key words: Discrete problem optimization,Particle swarm optimization,Multi velocity vector,Adaptive speed value

[1] Kennedy J,Eberhart R C.Particle swarm optimization[C]∥Proceedings of IEEE International Conference on Neural Networks.Piscataway New Jersey:Institute of Electrical and Electronics Engineers,Inc.1995:1942-1948
[2] 张顶学,关治洪,刘新芝.一种动态改变惯性权重的自适应粒子群算法 [J].控制与决策,2008,23(11):1253-1257
[3] 王丽,王晓凯.一种非线性改变惯性权重的粒子群算法 [J].计算机工程与应用,2007,43(4):47-48
[4] 段晓东,高红霞,刘向东,等.一种基于种群熵的自适应粒子群算法[J].计算机工程,2007,33(18):222-223
[5] 王俊伟,汪定伟.一种带有梯度加速的粒子群算法[J].控制与决策,2004,19(11):1298-1300
[6] Kennedy J,Eberhart R C.A discrete binary version of the particle swarm algorithm[C]∥Proceedings of the IEEE International Conference on Systems,Man and Cybernetics.Orlando:IEEE Inc,1997:4104-4108
[7] 钟一文,蔡荣英.求解二次分配问题的离散粒子群优化算法[J].自动化学报,2007,33(8):871-874
[8] 潘全科,王凌,赵保华.解决零空闲流水线调度问题的离散粒子群算法[J].控制与决策,2008,23(2):190-194
[9] 魏明,靳文舟.求解车辆路径问题的离散粒子群算法[J].计算机科学,2010,37(4):187-191
[10] 孙晓雅,林焰.一种新的离散粒子群算法在指派问题中的应用[J].计算机应用研究,2009,26(11):4091-4093
[11] 郭文忠,陈国龙.一种求解多目标最小生成树问题的有效离散粒子群优化算法[J].模式识别与人工智能,2009,22(4):597-604
[12] 张长胜,孙吉贵,欧阳丹彤.一种自适应离散粒子群算法及其应用研究[J].电子学报,2009,37(2):299-304
[13] Clerc,Maurice.Discrete particle swarm optimization,illustrated by the traveling salesman problem[M].New optimization techniques in engineering.Berlin Heidelberg:Springer,2004:219-239
[14] 胡中华,赵敏.引入侦查子群的蚁群算法求解0/1背包问题[J].贵州师范大学学报:自然科学版,2009,27(3):82-88
[15] Parsopoulos K E,Vrahatis M N.Recent approaches to global optimization problems through particle swarm optimization[J].Natural computing,2002,1(2/3):235-306
[16] Salman A,Ahmad I,Al-Madani S.Particle swarm optimization for task assignment problem[J].Microprocessors and Microsystems,2002,26(8):363-371

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!