具有质量增强和定向交叉功能的增强型飞蛾-火焰优化器:优化经典工程问题

IF 10.7 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Helong Yu, Jiale Quan, Yongqi Han, Ali Asghar Heidari, Huiling Chen
{"title":"具有质量增强和定向交叉功能的增强型飞蛾-火焰优化器:优化经典工程问题","authors":"Helong Yu,&nbsp;Jiale Quan,&nbsp;Yongqi Han,&nbsp;Ali Asghar Heidari,&nbsp;Huiling Chen","doi":"10.1007/s10462-024-10923-y","DOIUrl":null,"url":null,"abstract":"<div><p>As a popular meta-heuristic algorithm, the Moth-Flame Optimization (MFO) algorithm has garnered significant interest owing to its high flexibility and straightforward implementation. However, when addressing engineering constraint problems with specific parameters, MFO also exhibits limitations such as fast convergence and a tendency to converge to local optima. In order to address these challenges, this paper introduces an enhanced version of the MFO, EQDXMFO. EQDXMFO integrates a Quality Enhancement (EQ) strategy and a Directional Crossover (DX) mechanism, fortifying the algorithm’s search dynamics. Specifically, the DX mechanism is designed to augment the population’s diversity, enhancing the algorithm’s exploratory potential. Concurrently, the EQ strategy is employed to elevate the solution quality, which in turn refines the convergence precision of the algorithm. To verify the effectiveness of EQDXMFO, experiments are carried out on the test set of the IEEE CEC2017. A total of 5 classical algorithms, five excellent MFO variants, and seven state-of-the-art algorithms are selected for comparison, which confirm the significant advantages of EQDXMFO. Next, EQDXMFO is applied to five complex engineering constraint problems, demonstrating that EQDXMFO can optimize realistic problems. The comprehensive analysis shows that EQDXMFO has strong optimization capabilities and provides methods for research on other complex real-world problems.</p></div>","PeriodicalId":8449,"journal":{"name":"Artificial Intelligence Review","volume":null,"pages":null},"PeriodicalIF":10.7000,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10462-024-10923-y.pdf","citationCount":"0","resultStr":"{\"title\":\"An enhanced Moth-Flame optimizer with quality enhancement and directional crossover: optimizing classic engineering problems\",\"authors\":\"Helong Yu,&nbsp;Jiale Quan,&nbsp;Yongqi Han,&nbsp;Ali Asghar Heidari,&nbsp;Huiling Chen\",\"doi\":\"10.1007/s10462-024-10923-y\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>As a popular meta-heuristic algorithm, the Moth-Flame Optimization (MFO) algorithm has garnered significant interest owing to its high flexibility and straightforward implementation. However, when addressing engineering constraint problems with specific parameters, MFO also exhibits limitations such as fast convergence and a tendency to converge to local optima. In order to address these challenges, this paper introduces an enhanced version of the MFO, EQDXMFO. EQDXMFO integrates a Quality Enhancement (EQ) strategy and a Directional Crossover (DX) mechanism, fortifying the algorithm’s search dynamics. Specifically, the DX mechanism is designed to augment the population’s diversity, enhancing the algorithm’s exploratory potential. Concurrently, the EQ strategy is employed to elevate the solution quality, which in turn refines the convergence precision of the algorithm. To verify the effectiveness of EQDXMFO, experiments are carried out on the test set of the IEEE CEC2017. A total of 5 classical algorithms, five excellent MFO variants, and seven state-of-the-art algorithms are selected for comparison, which confirm the significant advantages of EQDXMFO. Next, EQDXMFO is applied to five complex engineering constraint problems, demonstrating that EQDXMFO can optimize realistic problems. The comprehensive analysis shows that EQDXMFO has strong optimization capabilities and provides methods for research on other complex real-world problems.</p></div>\",\"PeriodicalId\":8449,\"journal\":{\"name\":\"Artificial Intelligence Review\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":10.7000,\"publicationDate\":\"2024-09-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s10462-024-10923-y.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Artificial Intelligence Review\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s10462-024-10923-y\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Artificial Intelligence Review","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10462-024-10923-y","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

作为一种流行的元启发式算法,飞蛾-火焰优化(MFO)算法因其高度灵活性和简单易行而备受关注。然而,在解决具有特定参数的工程约束问题时,MFO 也表现出了一些局限性,如收敛速度快,容易收敛到局部最优。为了应对这些挑战,本文介绍了 MFO 的增强版 EQDXMFO。EQDXMFO 集成了质量增强(EQ)策略和定向交叉(DX)机制,强化了算法的搜索动态。具体来说,DX 机制旨在增强群体的多样性,从而提高算法的探索潜力。与此同时,EQ 策略还能提高解决方案的质量,进而提高算法的收敛精度。为了验证 EQDXMFO 的有效性,我们在 IEEE CEC2017 的测试集上进行了实验。共选取了 5 种经典算法、5 种优秀的 MFO 变体和 7 种最先进的算法进行比较,结果证实了 EQDXMFO 的显著优势。接下来,将 EQDXMFO 应用于五个复杂工程约束问题,证明 EQDXMFO 可以优化现实问题。综合分析表明,EQDXMFO 具有很强的优化能力,为其他复杂实际问题的研究提供了方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

An enhanced Moth-Flame optimizer with quality enhancement and directional crossover: optimizing classic engineering problems

An enhanced Moth-Flame optimizer with quality enhancement and directional crossover: optimizing classic engineering problems

As a popular meta-heuristic algorithm, the Moth-Flame Optimization (MFO) algorithm has garnered significant interest owing to its high flexibility and straightforward implementation. However, when addressing engineering constraint problems with specific parameters, MFO also exhibits limitations such as fast convergence and a tendency to converge to local optima. In order to address these challenges, this paper introduces an enhanced version of the MFO, EQDXMFO. EQDXMFO integrates a Quality Enhancement (EQ) strategy and a Directional Crossover (DX) mechanism, fortifying the algorithm’s search dynamics. Specifically, the DX mechanism is designed to augment the population’s diversity, enhancing the algorithm’s exploratory potential. Concurrently, the EQ strategy is employed to elevate the solution quality, which in turn refines the convergence precision of the algorithm. To verify the effectiveness of EQDXMFO, experiments are carried out on the test set of the IEEE CEC2017. A total of 5 classical algorithms, five excellent MFO variants, and seven state-of-the-art algorithms are selected for comparison, which confirm the significant advantages of EQDXMFO. Next, EQDXMFO is applied to five complex engineering constraint problems, demonstrating that EQDXMFO can optimize realistic problems. The comprehensive analysis shows that EQDXMFO has strong optimization capabilities and provides methods for research on other complex real-world problems.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Artificial Intelligence Review
Artificial Intelligence Review 工程技术-计算机:人工智能
CiteScore
22.00
自引率
3.30%
发文量
194
审稿时长
5.3 months
期刊介绍: Artificial Intelligence Review, a fully open access journal, publishes cutting-edge research in artificial intelligence and cognitive science. It features critical evaluations of applications, techniques, and algorithms, providing a platform for both researchers and application developers. The journal includes refereed survey and tutorial articles, along with reviews and commentary on significant developments in the field.
×
引用
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学术官方微信