MCOA: A Multistrategy Collaborative Enhanced Crayfish Optimization Algorithm for Engineering Design and UAV Path Planning

IF 3.7 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Yaning Xiao, Hao Cui, Ruba Abu Khurma, Abdelazim G. Hussien, Pedro A. Castillo
{"title":"MCOA: A Multistrategy Collaborative Enhanced Crayfish Optimization Algorithm for Engineering Design and UAV Path Planning","authors":"Yaning Xiao,&nbsp;Hao Cui,&nbsp;Ruba Abu Khurma,&nbsp;Abdelazim G. Hussien,&nbsp;Pedro A. Castillo","doi":"10.1155/int/5054424","DOIUrl":null,"url":null,"abstract":"<div>\n <p>The crayfish optimization algorithm (COA) is a recent bionic optimization technique that mimics the summer sheltering, foraging, and competitive behaviors of crayfish. Although COA has outperformed some classical metaheuristic (MH) algorithms in preliminary studies, it still manifests the shortcomings of falling into local optimal stagnation, slow convergence speed, and exploration–exploitation imbalance in addressing intractable optimization problems. To alleviate these limitations, this study introduces a novel modified crayfish optimization algorithm with multiple search strategies, abbreviated as MCOA. First, specular reflection learning is implemented in the initial iterations to enrich population diversity and broaden the search scope. Then, the location update equation in the exploration procedure of COA is supplanted by the expanded exploration strategy adopted from Aquila optimizer (AO), endowing the proposed algorithm with a more efficient exploration power. Subsequently, the motion characteristics inherent to Lévy flight are embedded into local exploitation to aid the search agent in converging more efficiently toward the global optimum. Finally, a vertical crossover operator is meticulously designed to prevent trapping in local optima and to balance exploration and exploitation more robustly. The proposed MCOA is compared against twelve advanced optimization algorithms and nine similar improved variants on the IEEE CEC2005, CEC2019, and CEC2022 test sets. The experimental results demonstrate the reliable optimization capability of MCOA, which separately achieves the minimum Friedman average ranking values of 1.1304, 1.7000, and 1.3333 on the three test benchmarks. In most test cases, MCOA can outperform other comparison methods regarding solution accuracy, convergence speed, and stability. The practicality of MCOA has been further corroborated through its application to seven engineering design issues and unmanned aerial vehicle (UAV) path planning tasks in complex three-dimensional environments. Our findings underscore the competitive edge and potential of MCOA for real-world engineering applications. The source code for MCOA can be accessed at https://doi.org/10.24433/CO.5400731.v1.</p>\n </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2025 1","pages":""},"PeriodicalIF":3.7000,"publicationDate":"2025-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/int/5054424","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Intelligent Systems","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1155/int/5054424","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

The crayfish optimization algorithm (COA) is a recent bionic optimization technique that mimics the summer sheltering, foraging, and competitive behaviors of crayfish. Although COA has outperformed some classical metaheuristic (MH) algorithms in preliminary studies, it still manifests the shortcomings of falling into local optimal stagnation, slow convergence speed, and exploration–exploitation imbalance in addressing intractable optimization problems. To alleviate these limitations, this study introduces a novel modified crayfish optimization algorithm with multiple search strategies, abbreviated as MCOA. First, specular reflection learning is implemented in the initial iterations to enrich population diversity and broaden the search scope. Then, the location update equation in the exploration procedure of COA is supplanted by the expanded exploration strategy adopted from Aquila optimizer (AO), endowing the proposed algorithm with a more efficient exploration power. Subsequently, the motion characteristics inherent to Lévy flight are embedded into local exploitation to aid the search agent in converging more efficiently toward the global optimum. Finally, a vertical crossover operator is meticulously designed to prevent trapping in local optima and to balance exploration and exploitation more robustly. The proposed MCOA is compared against twelve advanced optimization algorithms and nine similar improved variants on the IEEE CEC2005, CEC2019, and CEC2022 test sets. The experimental results demonstrate the reliable optimization capability of MCOA, which separately achieves the minimum Friedman average ranking values of 1.1304, 1.7000, and 1.3333 on the three test benchmarks. In most test cases, MCOA can outperform other comparison methods regarding solution accuracy, convergence speed, and stability. The practicality of MCOA has been further corroborated through its application to seven engineering design issues and unmanned aerial vehicle (UAV) path planning tasks in complex three-dimensional environments. Our findings underscore the competitive edge and potential of MCOA for real-world engineering applications. The source code for MCOA can be accessed at https://doi.org/10.24433/CO.5400731.v1.

Abstract Image

MCOA:一种用于工程设计和无人机路径规划的多策略协同增强小龙虾优化算法
小龙虾优化算法(COA)是一种模拟小龙虾夏季庇护、觅食和竞争行为的仿生优化技术。虽然COA在初步研究中已经优于一些经典的元启发式(MH)算法,但在解决棘手的优化问题时仍然存在陷入局部最优停滞、收敛速度慢、探索-开发不平衡等缺点。为了克服这些局限性,本研究引入了一种改进的多搜索策略小龙虾优化算法,简称MCOA。首先,在初始迭代中实现镜面反射学习,丰富种群多样性,扩大搜索范围。然后,用Aquila优化器(AO)的扩展勘探策略取代COA勘探过程中的位置更新方程,使算法具有更高效的勘探能力。随后,将lsamvy飞行固有的运动特性嵌入到局部开发中,以帮助搜索代理更有效地收敛到全局最优。最后,垂直交叉操作器经过精心设计,以防止陷入局部最优,并更稳健地平衡勘探和开发。在IEEE CEC2005、CEC2019和CEC2022测试集上,将提出的MCOA与12种先进的优化算法和9种类似的改进变体进行了比较。实验结果表明,MCOA具有可靠的优化能力,在三个测试基准上分别实现了最小Friedman平均排名值1.1304、1.7000和1.3333。在大多数测试用例中,MCOA在求解精度、收敛速度和稳定性方面优于其他比较方法。通过七个工程设计问题和复杂三维环境下无人机路径规划任务的应用,进一步验证了MCOA的实用性。我们的研究结果强调了MCOA在实际工程应用中的竞争优势和潜力。MCOA的源代码可以在https://doi.org/10.24433/CO.5400731.v1上访问。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Intelligent Systems
International Journal of Intelligent Systems 工程技术-计算机:人工智能
CiteScore
11.30
自引率
14.30%
发文量
304
审稿时长
9 months
期刊介绍: The International Journal of Intelligent Systems serves as a forum for individuals interested in tapping into the vast theories based on intelligent systems construction. With its peer-reviewed format, the journal explores several fascinating editorials written by today''s experts in the field. Because new developments are being introduced each day, there''s much to be learned — examination, analysis creation, information retrieval, man–computer interactions, and more. The International Journal of Intelligent Systems uses charts and illustrations to demonstrate these ground-breaking issues, and encourages readers to share their thoughts and experiences.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信