• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

基于拟对偶学习和维度搜索策略的改进型闪电附着程序优化。

An Enhanced Lightning Attachment Procedure Optimization with Quasi-Opposition-Based Learning and Dimensional Search Strategies.

机构信息

School of Civil Engineering, Guangzhou University, Guangzhou, China.

出版信息

Comput Intell Neurosci. 2019 Aug 1;2019:1589303. doi: 10.1155/2019/1589303. eCollection 2019.

DOI:10.1155/2019/1589303
PMID:31467516
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC6701370/
Abstract

Lightning attachment procedure optimization (LAPO) is a new global optimization algorithm inspired by the attachment procedure of lightning in nature. However, similar to other metaheuristic algorithms, LAPO also has its own disadvantages. To obtain better global searching ability, an enhanced version of LAPO called ELAPO has been proposed in this paper. A quasi-opposition-based learning strategy is incorporated to improve both exploration and exploitation abilities by considering an estimate and its opposite simultaneously. Moreover, a dimensional search enhancement strategy is proposed to intensify the exploitation ability of the algorithm. 32 benchmark functions including unimodal, multimodal, and CEC 2014 functions are utilized to test the effectiveness of the proposed algorithm. Numerical results indicate that ELAPO can provide better or competitive performance compared with the basic LAPO and other five state-of-the-art optimization algorithms.

摘要

Lightning 附着过程优化 (LAPO) 是一种新的全局优化算法,灵感来自自然界中 lightning 的附着过程。然而,与其他启发式算法类似,LAPO 也有其自身的缺点。为了获得更好的全局搜索能力,本文提出了 LAPO 的增强版本 ELAPO。通过同时考虑估计值及其相反数,引入准反对称学习策略来提高算法的探索和开发能力。此外,还提出了维度搜索增强策略来增强算法的开发能力。本文使用 32 个基准函数(包括单峰、多峰和 CEC 2014 函数)来测试所提出算法的有效性。数值结果表明,ELAPO 可以提供比基本 LAPO 和其他五种最先进的优化算法更好或具有竞争力的性能。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d1df/6701370/9fbb931a39fa/CIN2019-1589303.alg.002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d1df/6701370/6e47b2662c23/CIN2019-1589303.001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d1df/6701370/a3f52c9ea219/CIN2019-1589303.002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d1df/6701370/c8ea1f7a183f/CIN2019-1589303.003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d1df/6701370/6d7afe8f5e4e/CIN2019-1589303.004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d1df/6701370/51cc490fe8b9/CIN2019-1589303.005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d1df/6701370/4b5f13f1ea43/CIN2019-1589303.006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d1df/6701370/3a328e743426/CIN2019-1589303.007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d1df/6701370/e91dbfec429b/CIN2019-1589303.alg.001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d1df/6701370/9fbb931a39fa/CIN2019-1589303.alg.002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d1df/6701370/6e47b2662c23/CIN2019-1589303.001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d1df/6701370/a3f52c9ea219/CIN2019-1589303.002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d1df/6701370/c8ea1f7a183f/CIN2019-1589303.003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d1df/6701370/6d7afe8f5e4e/CIN2019-1589303.004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d1df/6701370/51cc490fe8b9/CIN2019-1589303.005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d1df/6701370/4b5f13f1ea43/CIN2019-1589303.006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d1df/6701370/3a328e743426/CIN2019-1589303.007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d1df/6701370/e91dbfec429b/CIN2019-1589303.alg.001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d1df/6701370/9fbb931a39fa/CIN2019-1589303.alg.002.jpg

相似文献

1
An Enhanced Lightning Attachment Procedure Optimization with Quasi-Opposition-Based Learning and Dimensional Search Strategies.基于拟对偶学习和维度搜索策略的改进型闪电附着程序优化。
Comput Intell Neurosci. 2019 Aug 1;2019:1589303. doi: 10.1155/2019/1589303. eCollection 2019.
2
A Hybrid SSA and SMA with Mutation Opposition-Based Learning for Constrained Engineering Problems.基于突变反对学习的混合 SSA 和 SMA 算法求解约束工程问题。
Comput Intell Neurosci. 2021 Sep 7;2021:6379469. doi: 10.1155/2021/6379469. eCollection 2021.
3
A new human-inspired metaheuristic algorithm for solving optimization problems based on mimicking sewing training.一种新的基于模仿缝纫训练的解决优化问题的类人启发式元启发式算法。
Sci Rep. 2022 Oct 17;12(1):17387. doi: 10.1038/s41598-022-22458-9.
4
A new bio-inspired metaheuristic algorithm for solving optimization problems based on walruses behavior.一种基于海象行为的新的仿生元启发式算法,用于解决优化问题。
Sci Rep. 2023 May 31;13(1):8775. doi: 10.1038/s41598-023-35863-5.
5
A Modified Reptile Search Algorithm for Numerical Optimization Problems.一种用于数值优化问题的改进型 reptile 搜索算法。
Comput Intell Neurosci. 2022 Oct 10;2022:9752003. doi: 10.1155/2022/9752003. eCollection 2022.
6
A Modified Slime Mould Algorithm for Global Optimization.一种改进的用于全局优化的粘菌算法。
Comput Intell Neurosci. 2021 Nov 24;2021:2298215. doi: 10.1155/2021/2298215. eCollection 2021.
7
Mother optimization algorithm: a new human-based metaheuristic approach for solving engineering optimization.母亲优化算法:一种基于人类的新元启发式方法,用于解决工程优化问题。
Sci Rep. 2023 Jun 26;13(1):10312. doi: 10.1038/s41598-023-37537-8.
8
Pelican Optimization Algorithm: A Novel Nature-Inspired Algorithm for Engineering Applications.鹈鹕优化算法:一种新颖的受自然启发的工程应用算法。
Sensors (Basel). 2022 Jan 23;22(3):855. doi: 10.3390/s22030855.
9
Development and applications of an intelligent crow search algorithm based on opposition based learning.基于对分学习的智能乌鸦搜索算法的发展与应用。
ISA Trans. 2020 Apr;99:210-230. doi: 10.1016/j.isatra.2019.09.004. Epub 2019 Sep 6.
10
Rank-driven salp swarm algorithm with orthogonal opposition-based learning for global optimization.基于正交反向学习的秩驱动樽海鞘群算法用于全局优化
Appl Intell (Dordr). 2022;52(7):7922-7964. doi: 10.1007/s10489-021-02776-7. Epub 2021 Oct 15.

引用本文的文献

1
A Modified Reptile Search Algorithm for Numerical Optimization Problems.一种用于数值优化问题的改进型 reptile 搜索算法。
Comput Intell Neurosci. 2022 Oct 10;2022:9752003. doi: 10.1155/2022/9752003. eCollection 2022.

本文引用的文献

1
Firefly Mating Algorithm for Continuous Optimization Problems.用于连续优化问题的萤火虫交配算法。
Comput Intell Neurosci. 2017;2017:8034573. doi: 10.1155/2017/8034573. Epub 2017 Jul 20.
2
A Novel Particle Swarm Optimization Algorithm for Global Optimization.一种用于全局优化的新型粒子群优化算法。
Comput Intell Neurosci. 2016;2016:9482073. doi: 10.1155/2016/9482073. Epub 2016 Jan 21.
3
Adaptive Grouping Cloud Model Shuffled Frog Leaping Algorithm for Solving Continuous Optimization Problems.用于求解连续优化问题的自适应分组云模型洗牌蛙跳算法
Comput Intell Neurosci. 2016;2016:5675349. doi: 10.1155/2016/5675349. Epub 2015 Dec 27.