郑州大学学报（理学版）2026，Vol.58Issue(3)：33-40,8.DOI:10.13705/j.issn.1671-6841.2024174
融合多策略的哈里斯鹰优化算法求解Steiner树问题
Multi-strategy Harris Hawks Optimization Algorithm for Solving Steiner Tree Problems
摘要
Abstract
To address the issues of uneven population distribution,imbalanced exploration and exploita-tion phases,and susceptibility to local optima in the traditional Harris hawks optimization algorithm when solving the Steiner tree problem of graph(GSTP),an improved Harris hawks optimization algorithm in-corporating multiple strategies was proposed.Firstly,the algorithm was discretized using an S-shaped transfer function,and a Logistic-Sine hybrid chaotic mapping was introduced to optimize the population initialization process.Secondly,a dynamic adaptive weight strategy was designed to enhance the nonlin-ear expression of prey escape energy,thereby further balancing exploration and exploitation behaviors.Finally,adaptive Gaussian-Cauchy mixed mutation perturbation was applied to the optimal individuals during the later iterations to prevent the population from prematurely converging to local optima.Experi-ments were conducted on multiple GSTP instances,and the results showed that the proposed algorithm achieved higher solution accuracy and faster convergence speed.关键词
Steiner树问题/哈里斯鹰优化算法/Logistic-Sine混合混沌映射/自适应逃逸能量/高斯—柯西变异算子Key words
Steiner tree problem/Harris hawks optimization algorithm/Logistic-Sine hybrid chaotic mapping/adaptive escape energy/Gaussian-Cauchy mutation operator分类
信息技术与安全科学引用本文复制引用
王晓峰,王军霞,彭庆媛,华盈盈,何飞,唐傲..融合多策略的哈里斯鹰优化算法求解Steiner树问题[J].郑州大学学报（理学版）,2026,58(3):33-40,8.基金项目
国家自然科学基金项目(62062001) （62062001）
宁夏青年拔尖人才项目(2021) （2021）
宁夏自然科学基金项目(2024AAC03165) （2024AAC03165）
