嵌入虚拟力的人工蜂群优化覆盖策略  

STRATEGY OF OPTIMISING COVERAGE WITH VIRTUAL FORCE-EMBEDDED ARTIFICIAL BEE COLONY

作　　者：戴欢[1] 李克清[1] 张骞[1,2] 葛柳飞[1,2] 

机构地区：[1]常熟理工学院计算机科学与工程学院,江苏常熟215500 [2]中国矿业大学计算机科学与技术学院,江苏徐州221116

出　　处：《计算机应用与软件》2016年第1期102-104,共3页Computer Applications and Software

基　　金：国家自然科学基金项目(61300186);江苏省科技支撑计划项目-社发(BE2012672);江苏省高校自然科学研究面上项目(13KJB510001);科研启动项目(KYZ2013002Z);常熟市社发重点项目(CS201102)

摘　　要：蜂群算法在优化传感网感知覆盖时,直接放弃达到迭代次数而未进化的解向量,由于没有先验条件,随机生成新的解不够好,导致收敛速度变慢,无法应对具有大量移动节点的网络布局优化。针对上述问题,提出嵌入虚拟力的人工蜂群优化覆盖策略,利用节点间虚拟的作用力引导陷入退化现象的解向量,加快收敛速度,实现在高维空间的布局优化。仿真结果表明,该算法在覆盖优化效果和算法收敛速度上均优于传统的蜂群策略。When optimising sensor network sensing coverage, the artificial bee colony algorithm directly abandons the solution vector which reaches the iteration times but failed in evolution. Since there are no priori conditions, the new solution randomly generated is not good enough, this results in slow convergence and unable to cope with the network layout optimisation with a large number of mobile nodes. To address the above problems, we proposed the strategy of optimising the coverage with virtual force-embedded artificial bee colony. It uses virtual acting force between the nodes to lead the solution vector failing into degradation phenomenon and accelerates the convergence rate, realises the layout optimisation in high-dimensional space. Simulation results show that the proposed algorithm is better than the traditional artificial bee colony strategy in coverage optimisation effect and the convergence rate of the algorithm.

关 键 词：动态部署 虚拟力 人工蜂群算法 移动节点 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]