基于方形邻域和随机数组的哈里斯鹰优化算法  

Harris hawk optimization algorithm based on square neighborhood and random array

作　　者：刘小龙[1] 梁彤缨[1] LIU Xiao-long;LIANG Tong-ying(School of Business Administration,South China University of Technology,Guangzhou 510640,China)

机构地区：[1]华南理工大学工商管理学院,广州510640

出　　处：《控制与决策》2022年第10期2467-2476,共10页Control and Decision

基　　金：国家社会科学基金面上项目(19BJL068)。

摘　　要：针对哈里斯鹰优化算法探索能力和开发能力不平衡的问题,通过设置一种多子群方形邻域拓扑结构引导各子群内的个体可以纵横双向随机觅食.为了避免局部最优,通过设置固定置换概率,加强各个子群个体的信息交流,使子群内个体依照随机数组与其他子群的相应个体进行置换.在子群内部,基于历史进化信息进行HHO算法中的算子选择,以更好地利用现有问题领域的信息.利用可变维度基准函数与各种智能优化算法及其改进方法进行跨文献对比,结果表明改进方法在收敛精度、寻优能力上明显高于原始算法和对比文献,且具有较好的鲁棒性,适合推广至实际的优化问题之中.Aiming at the problem of the imbalance between the exploration and development capabilities of the Harris hawk optimization algorithm(HHO),a multi-subgroup square neighborhood topology is set up to guide individuals in each subgroup to forage randomly in both directions.In order to avoid local optima,a fixed replacement probability is set to strengthen the information exchange of each subgroup individual,so that the individuals in the subgroup can be replaced with the corresponding individuals of other subgroups according to the random array.Within the subgroup,the operator selection in the HHO algorithm is performed based on historical evolution information to make better use of the information in the existing problem domain.Cross-document comparisons are made using variable-dimensional benchmark functions with various intelligent optimization algorithms and their improved methods.The results show that the improved method is significantly higher than the original algorithm and comparative literature in terms of convergence accuracy and optimization capability,and has better robustness,which is suitable for generalization to actual optimization problems.

关 键 词：哈里斯鹰优化算法 多子群结构 方形邻域 随机数组 跨种群信息交换 全局最优 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]