An Improved Hunter-prey Optimization Algorithm and Its Application*

Mingxin Fu, Qiang Liu
{"title":"An Improved Hunter-prey Optimization Algorithm and Its Application*","authors":"Mingxin Fu, Qiang Liu","doi":"10.1109/ICNSC55942.2022.10004114","DOIUrl":null,"url":null,"abstract":"Hunter-prey optimization (HPO) algorithm is a new optimization algorithm proposed to simulate the behavior of leopards, lions and other predators in hunting deer and antelope. In order to solve the problems such as insufficient global optimization capability of HPO, easy to fall into local optimization, and low optimization accuracy, an improved Hunter-prey optimization (IHPO) algorithm is proposed. Firstly, Tent chaotic map is used to generate the initial population and increase the diversity of individuals, Secondly, in order to balance the ability of global search in the early stage and local search in the late stage, the enhanced sine cosine algorithm (ESCA) is integrated to adaptively select the population location update mode according to the conversion probability, Finally, Cauchy mutation strategy is adopted in the later stage of iteration to disturb the population position and enhance the ability of the algorithm to jump out of precocity. The simulation results of benchmark functions show that IHPO algorithm has better convergence accuracy and convergence speed. The effectiveness of the improved algorithm is further verified by the simulation experiment of pipe routing examples","PeriodicalId":230499,"journal":{"name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNSC55942.2022.10004114","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Hunter-prey optimization (HPO) algorithm is a new optimization algorithm proposed to simulate the behavior of leopards, lions and other predators in hunting deer and antelope. In order to solve the problems such as insufficient global optimization capability of HPO, easy to fall into local optimization, and low optimization accuracy, an improved Hunter-prey optimization (IHPO) algorithm is proposed. Firstly, Tent chaotic map is used to generate the initial population and increase the diversity of individuals, Secondly, in order to balance the ability of global search in the early stage and local search in the late stage, the enhanced sine cosine algorithm (ESCA) is integrated to adaptively select the population location update mode according to the conversion probability, Finally, Cauchy mutation strategy is adopted in the later stage of iteration to disturb the population position and enhance the ability of the algorithm to jump out of precocity. The simulation results of benchmark functions show that IHPO algorithm has better convergence accuracy and convergence speed. The effectiveness of the improved algorithm is further verified by the simulation experiment of pipe routing examples
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种改进的猎-猎物优化算法及其应用*
猎食优化算法(HPO)是为了模拟豹、狮子等捕食者在猎取鹿、羚羊时的行为而提出的一种新的优化算法。针对HPO算法全局优化能力不足、易陷入局部优化、优化精度低等问题,提出了一种改进的猎人-猎物优化算法。首先,利用Tent混沌映射生成初始种群,增加个体的多样性;其次,为了平衡前期的全局搜索能力和后期的局部搜索能力,结合增强正弦余弦算法(ESCA),根据转换概率自适应选择种群位置更新方式;在迭代后期采用柯西突变策略干扰种群位置,增强算法跳出早熟的能力。基准函数的仿真结果表明,IHPO算法具有较好的收敛精度和收敛速度。通过管道路由实例的仿真实验,进一步验证了改进算法的有效性
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
High-dimensional Feature Selection in Classification: A Length-Adaptive Evolutionary Approach SFME: Score Fusion from Multiple Experts for Long-tailed Recognition Attention and Cost-Sensitive Graph Neural Network for Imbalanced Node Classification Conditioning Customers' Product Reviews for Accurate Classification Performance Constraint Programming for Modeling and Solving a Hybrid Flow Shop Scheduling Problem
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1