首页 | 本学科首页   官方微博 | 高级检索  
     

多阶段动态扰动和动态惯性权重的布谷鸟算法
引用本文:张珍珍,贺兴时,于青林,杨新社.多阶段动态扰动和动态惯性权重的布谷鸟算法[J].计算机工程与应用,2022,58(1):79-88.
作者姓名:张珍珍  贺兴时  于青林  杨新社
作者单位:1.西安工程大学 理学院,西安 710600 2.汤普森大学 数学与统计系,哥伦比亚 甘露 V2C0C8 3.密德萨斯大学 科学与技术学院,伦敦 NW4 4BT
基金项目:国家自然科学基金(12001417);陕西省智慧医疗评价指标体系构建及评价模型研究项目(2019KPM141)。
摘    要:针对布谷鸟仿生智能优化算法存在着的易陷入局部最优、求解精度低以及收敛速度慢等问题,提出了基于多阶段动态扰动和动态惯性权重的布谷鸟搜索算法(MACS)。利用多阶段动态扰动策略对布谷鸟算法的全局位置的最优鸟巢位置根据方差可调的正态随机分布进行扰动,有利于增加种群的多样性和鸟窝位置的灵活性,提高算法全局搜索能力。在局部位置处引入动态惯性权重,使得算法有效克服易陷入局部最优的缺陷,提高局部寻优搜索能力。引入了动态切换概率p]代替固定概率,可以动态平衡全局搜索和局部搜索。通过与4种算法相比和11个测试函数的仿真结果表明:改进布谷鸟算法(MACS)的寻优性能明显提高,收敛速度更快,求解精度更高,具有更强的全局搜索能力和跳出局部最优能力。

关 键 词:布谷鸟算法  多阶段动态扰动  动态惯性权重  自适应  

Cuckoo Algorithm for Multi-stage Dynamic Disturbance and Dynamic Inertia Weight
ZHANG Zhenzhen,HE Xingshi,YU Qinglin,YANG Xinshe.Cuckoo Algorithm for Multi-stage Dynamic Disturbance and Dynamic Inertia Weight[J].Computer Engineering and Applications,2022,58(1):79-88.
Authors:ZHANG Zhenzhen  HE Xingshi  YU Qinglin  YANG Xinshe
Affiliation:1.School of Science, Xi’an Polytechnic University, Xi’an 710600, China 2.Department of Mathematics and Statistics, Thompson Rivers University, Kamloops, British Columbia V2C0C8, Canada 3.School of Science and Technology, Middlesex University, London NW4 4BT, UK
Abstract:The bionic intelligent optimization algorithm of cuckoo bird is prone to fall into the problems of low local optimal solution accuracy and slow convergence speed, This paper presents a cuckoo search algorithm based on multi-stage dynamic disturbance and dynamic inertia weight(MACS). Firstly, the multi-stage dynamic disturbance strategy is used to disturb the optimal nest position of the global position of cuckoo algorithm according to the normal random distribution with adjustable variance. It is beneficial to increase the diversity of the population and the flexibility of the nest location, and improve the global searching ability of the algorithm. Secondly, the dynamic inertia weight is introduced in the local position, which makes the algorithm overcome the defect of falling into the local optimum effectively and improve the local optimization search ability. Finally, dynamic switching probability p] is introduced instead of fixed probability, which can dynamically balance global searching and local searching. This paper compares with 4 algorithms and 11 test functions. The simulation results show that the improved cuckoo algorithm(MACS) has better optimization performance, faster convergence speed, higher solution accuracy, stronger global searching ability and jumping out of local optimal ability.
Keywords:cuckoo algorithm  multi-stage dynamic disturbance  dynamic inertia weight  self-adaption
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号