• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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 improved tangent search algorithm.

作者信息

Pachung Probhat, Bansal Jagdish Chand

机构信息

South Asian University, New Delhi, India.

出版信息

MethodsX. 2022 Sep 3;9:101839. doi: 10.1016/j.mex.2022.101839. eCollection 2022.

DOI:10.1016/j.mex.2022.101839
PMID:36160108
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC9489808/
Abstract

The Tangent Search Algorithm (TSA) is a newly developed population-based meta-heuristic algorithm to solve complex optimization problems. It is based on the tangent function, which steers the given solution towards more promising regions of the search space. Though TSA has performed well for many optimization problems, the experimental analyses show that it suffers from the low exploration ability and slow convergence rate. This article proposes an improved TSA algorithm (iTSA). Using two concepts, 'Fitness Weighted Search Strategy' (FWSS) and 'Opposition Based learning' (OBL), iTSA is better in terms of exploration while maintaining the high convergence rate of TSA.•Fitness weighted search strategy (FWSS) is used to increase the exploration ability of TSA.•Opposition based learning (OBL) is used to increase the convergence speed of TSA.•Together, OBL and FWSS into iTSA outperformed the classical TSA and other considered state-of-the-art algorithms. The performance of the proposed iTSA is validated on two sets of test functions: CEC14 benchmark functions and a set of 21 well-known classical benchmark functions. The obtained results are compared with those obtained from the basic TSA and other considered state-of-the-art algorithms.

摘要

切线搜索算法(TSA)是一种新开发的基于种群的元启发式算法,用于解决复杂的优化问题。它基于正切函数,该函数将给定的解导向搜索空间中更有希望的区域。尽管TSA在许多优化问题上表现良好,但实验分析表明它存在探索能力低和收敛速度慢的问题。本文提出了一种改进的TSA算法(iTSA)。通过使用“适应度加权搜索策略”(FWSS)和“基于对立的学习”(OBL)这两个概念,iTSA在探索方面表现更好,同时保持了TSA的高收敛率。

  • 适应度加权搜索策略(FWSS)用于提高TSA的探索能力。

  • 基于对立的学习(OBL)用于提高TSA的收敛速度。

  • 综合起来,将OBL和FWSS应用于iTSA的性能优于经典TSA和其他考虑的先进算法。所提出的iTSA的性能在两组测试函数上得到了验证:CEC14基准函数和一组21个著名的经典基准函数。将获得的结果与从基本TSA和其他考虑的先进算法获得的结果进行了比较。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/caf3/9489808/3fa0ce7a903a/gr6.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/caf3/9489808/90c1484eb837/ga1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/caf3/9489808/11de4db4fa82/gr7.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/caf3/9489808/885279fc37f0/gr8.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/caf3/9489808/b9e987e8001e/gr9.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/caf3/9489808/e45a9be498c9/gr1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/caf3/9489808/93ffd467966b/gr2.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/caf3/9489808/1d3a14582cf1/gr3.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/caf3/9489808/583d8cbdee7e/gr4.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/caf3/9489808/27579f515203/gr5.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/caf3/9489808/3fa0ce7a903a/gr6.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/caf3/9489808/90c1484eb837/ga1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/caf3/9489808/11de4db4fa82/gr7.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/caf3/9489808/885279fc37f0/gr8.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/caf3/9489808/b9e987e8001e/gr9.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/caf3/9489808/e45a9be498c9/gr1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/caf3/9489808/93ffd467966b/gr2.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/caf3/9489808/1d3a14582cf1/gr3.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/caf3/9489808/583d8cbdee7e/gr4.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/caf3/9489808/27579f515203/gr5.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/caf3/9489808/3fa0ce7a903a/gr6.jpg

相似文献

1
An improved tangent search algorithm.一种改进的切线搜索算法。
MethodsX. 2022 Sep 3;9:101839. doi: 10.1016/j.mex.2022.101839. eCollection 2022.
2
An improved hybrid Aquila Optimizer and Harris Hawks Optimization for global optimization.一种改进的混合翠鸟优化算法和哈里斯鹰优化算法的全局优化方法。
Math Biosci Eng. 2021 Aug 24;18(6):7076-7109. doi: 10.3934/mbe.2021352.
3
An Improved Search and Rescue Algorithm for Global Optimization and Blood Cell Image Segmentation.一种用于全局优化和血细胞图像分割的改进搜索与救援算法。
Diagnostics (Basel). 2023 Apr 15;13(8):1422. doi: 10.3390/diagnostics13081422.
4
A new hybrid method based on Aquila optimizer and tangent search algorithm for global optimization.一种基于天鹰座优化器和切线搜索算法的用于全局优化的新型混合方法。
J Ambient Intell Humaniz Comput. 2023;14(6):8045-8065. doi: 10.1007/s12652-022-04347-1. Epub 2022 Aug 8.
5
A novel multi-strategy ameliorated quasi-oppositional chaotic tunicate swarm algorithm for global optimization and constrained engineering applications.一种用于全局优化和约束工程应用的新型多策略改进准对立混沌海鞘群算法。
Heliyon. 2024 May 9;10(10):e30757. doi: 10.1016/j.heliyon.2024.e30757. eCollection 2024 May 30.
6
IHAOAVOA: An improved hybrid aquila optimizer and African vultures optimization algorithm for global optimization problems.IHAOAVOA:一种改进的混合鹰狮优化算法和非洲秃鹫优化算法,用于解决全局优化问题。
Math Biosci Eng. 2022 Aug 1;19(11):10963-11017. doi: 10.3934/mbe.2022512.
7
Adaptive harmony search algorithm utilizing differential evolution and opposition-based learning.自适应和声搜索算法利用差分进化和基于对演的学习。
Math Biosci Eng. 2021 May 17;18(4):4226-4246. doi: 10.3934/mbe.2021212.
8
An enhanced aquila optimization algorithm with velocity-aided global search mechanism and adaptive opposition-based learning.一种具有速度辅助全局搜索机制和自适应反向学习的增强型天鹰优化算法。
Math Biosci Eng. 2023 Feb 1;20(4):6422-6467. doi: 10.3934/mbe.2023278.
9
MSHHOTSA: A variant of tunicate swarm algorithm combining multi-strategy mechanism and hybrid Harris optimization.MSHHOTSA:一种结合多策略机制和混合 Harris 优化的被囊动物群算法变体。
PLoS One. 2023 Aug 11;18(8):e0290117. doi: 10.1371/journal.pone.0290117. eCollection 2023.
10
Fast random opposition-based learning Aquila optimization algorithm.基于快速随机反向学习的天鹰座优化算法
Heliyon. 2024 Feb 15;10(4):e26187. doi: 10.1016/j.heliyon.2024.e26187. eCollection 2024 Feb 29.

引用本文的文献

1
Many‑objective meta-heuristic methods for solving constrained truss optimisation problems: A comparative analysis.用于解决约束桁架优化问题的多目标元启发式方法:比较分析。
MethodsX. 2023 Apr 18;10:102181. doi: 10.1016/j.mex.2023.102181. eCollection 2023.

本文引用的文献

1
INNA: An improved neural network algorithm for solving reliability optimization problems.INNA:一种用于解决可靠性优化问题的改进神经网络算法。
Neural Comput Appl. 2022;34(23):20865-20898. doi: 10.1007/s00521-022-07565-y. Epub 2022 Aug 1.