Grey Wolf Optimization algorithm with random local optimal regulation and first-element dominance

IF 5 3区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Xuan Yanzhuang, Xuan Shibin
{"title":"Grey Wolf Optimization algorithm with random local optimal regulation and first-element dominance","authors":"Xuan Yanzhuang,&nbsp;Xuan Shibin","doi":"10.1016/j.eij.2024.100486","DOIUrl":null,"url":null,"abstract":"<div><p>Due to the classical Grey Wolf algorithm GWO does not consider the characteristics of the local information of individual in population, a novel local random optimization strategy is proposed to make up for the defect of GWO. In this method, several points in the neighborhood of the current location of each individual are selected at random in the axial direction as candidates, and the best points are selected to participate in the renewal decision of the individual. Furthermore, in our experiments, a special first-element dominance characteristic is found and can greatly improve the combination effect of global and local information. In order to ensure that all constraints are not violated in the process of constraint optimization in industrial design, the random mixed population initialization method is proposed to generate population individuals that meet the constraint requirements and contain boundary values randomly. In addition, a treatment method of shrinking in a specific direction is proposed for dealing with individuals who cross the boundary. Experimental results on several test function sets show that compared with recent improved algorithms for GWO, the proposed algorithm has obvious advantages in fitness value, convergence speed and stability.</p></div>","PeriodicalId":56010,"journal":{"name":"Egyptian Informatics Journal","volume":null,"pages":null},"PeriodicalIF":5.0000,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1110866524000495/pdfft?md5=87190373e1a25341b5285339e1360faa&pid=1-s2.0-S1110866524000495-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Egyptian Informatics Journal","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1110866524000495","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Due to the classical Grey Wolf algorithm GWO does not consider the characteristics of the local information of individual in population, a novel local random optimization strategy is proposed to make up for the defect of GWO. In this method, several points in the neighborhood of the current location of each individual are selected at random in the axial direction as candidates, and the best points are selected to participate in the renewal decision of the individual. Furthermore, in our experiments, a special first-element dominance characteristic is found and can greatly improve the combination effect of global and local information. In order to ensure that all constraints are not violated in the process of constraint optimization in industrial design, the random mixed population initialization method is proposed to generate population individuals that meet the constraint requirements and contain boundary values randomly. In addition, a treatment method of shrinking in a specific direction is proposed for dealing with individuals who cross the boundary. Experimental results on several test function sets show that compared with recent improved algorithms for GWO, the proposed algorithm has obvious advantages in fitness value, convergence speed and stability.

具有随机局部最优调节和第一要素支配作用的灰狼优化算法
由于经典灰狼算法 GWO 没有考虑种群中个体局部信息的特点,因此提出了一种新的局部随机优化策略来弥补 GWO 的缺陷。在这种方法中,在每个个体当前位置的邻域内沿轴向随机选取若干点作为候选点,并选择最佳点参与个体的更新决策。此外,在我们的实验中还发现了一种特殊的首元支配特性,可以大大提高全局信息和局部信息的结合效果。为了保证在工业设计的约束优化过程中不违反所有约束条件,提出了随机混合种群初始化方法,随机生成符合约束要求且包含边界值的种群个体。此外,还提出了一种向特定方向收缩的处理方法,用于处理越界的个体。在多个测试函数集上的实验结果表明,与近年来改进的 GWO 算法相比,所提出的算法在适配值、收敛速度和稳定性方面具有明显优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Egyptian Informatics Journal
Egyptian Informatics Journal Decision Sciences-Management Science and Operations Research
CiteScore
11.10
自引率
1.90%
发文量
59
审稿时长
110 days
期刊介绍: The Egyptian Informatics Journal is published by the Faculty of Computers and Artificial Intelligence, Cairo University. This Journal provides a forum for the state-of-the-art research and development in the fields of computing, including computer sciences, information technologies, information systems, operations research and decision support. Innovative and not-previously-published work in subjects covered by the Journal is encouraged to be submitted, whether from academic, research or commercial sources.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信