检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张荣欣[1] 李雪涛[1] Zhang Rongxin;Li Xuetao(School of Economics and Management,Hubei University of Automotive Technology,Shiyan 442002,China)
机构地区:[1]湖北汽车工业学院经济管理学院,湖北十堰442002
出 处:《湖北汽车工业学院学报》2024年第2期64-70,共7页Journal of Hubei University Of Automotive Technology
基 金:国家社会科学基金(23BGL219)。
摘 要:求解复杂优化问题时,灰狼优化算法存在收敛速度慢、容易陷入局部极值的缺点。针对此问题,提出了一种融合多策略改进的灰狼优化算法。首先采用混沌序列产生在解空间均匀分布的初始种群;然后结合精英反向学习机制进行最优解的搜索,引入收敛停滞监测策略,提升算法整体抗停滞能力,保持种群多样性;最后提出一种收敛因子非线性动态调整策略,提高算法的全局收敛速度和稳定性。对10个经典高维测试函数进行仿真实验,结果表明,改进算法能有效摆脱局部极值点,其全局优化性能优于标准灰狼优化算法。When solving complex optimization problems,the grey wolf optimization algorithm has the disadvantages of slow convergence speed and easy falling into local extremes.To address these issues,a grey wolf optimization algorithm that integrated multiple strategy improvements was proposed.Firstly,a chaotic sequence was used to generate an initial population that was uniformly distributed in the solution space.Then,combined with the elite reverse learning mechanism,the optimal solution was searched,and a convergence stagnation monitoring strategy was introduced to improve the overall antistagnation ability of the algorithm and maintain population diversity.Finally,a non-linear dynamic adjustment strategy for convergence factors was proposed to improve the global convergence speed and stability of the algorithm,and simulation experiments were conducted on 10 classic high-dimensional test functions.The experimental results show that the improved algorithm can effectively eliminate local extreme points,and its global optimization performance is better than the standard grey wolf optimization algorithm.
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.166