检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:莫艳红 聂慧[1] 刘振丙[1] 杨辉华 MO Yan-hong;NIE Hui;LIU Zhen-bing;YANG Hui hua(Guilin University of Electronic Technology, Guilin 541004,China;Beijing University of Posts and Telecommunications, Beijing 100876, China)
机构地区:[1]桂林电子科技大学,广西桂林541004 [2]北京邮电大学,北京100876
出 处:《微电子学与计算机》2019年第4期78-83,共6页Microelectronics & Computer
基 金:国家自然科学基金(21365008;61105004)
摘 要:针对灰狼优化算法在求解比较复杂的非线性优化问题时容易早熟收敛,陷入局部极值以及进化后期精度低的情况,在原始的灰狼优化算法(GWO)引入了一种属于随机游动的莱维飞行,提出了一种基于莱维飞行的灰狼优化算法(LGWO).在头狼位置进行更新时,利用莱维飞行对头狼进行全局搜索,防止狼群丧失多样性,易陷入局部最优解.通过仿真,与经典的布谷鸟搜索算法和粒子群算法等群智能算法进行对比,结果表明基于莱维飞行的灰狼优化算法能够有效地提高解的精度并加快收敛速度,寻优效果更优.The grey wolf optimization algorithm(GWO) has some demerits on solving more complex nonlinear optimization problems, such as relapsing into local extremum, slow convergence velocity and low convergence precision in the late evolutionary. this paper proposed a kind GWO algorithm based on levy flight(LGWO) via introducing of levy flight that is random walk. When updating the wolf’s position, levy flight was used to conduct a global search on the wolf to prevent the wolves from losing diversity and easily falling into a local optimal solution. Through simulation, compared with the classic cuckoo search algorithm、particle swarm optimization algorithm and other group intelligence algorithms, the results show that the grey wolf optimization algorithm based on levy flight can effectively improve the accuracy of the solution and convergence speed, and the optimization effect is better.
分 类 号:TP301[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28