• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

一种受连通银行系统启发的新型元启发式算法在桁架尺寸和布局优化设计问题及优化问题中的应用。

Application of a novel metaheuristic algorithm inspired by connected banking system in truss size and layout optimum design problems and optimization problems.

作者信息

Nemati Mehrdad, Zandi Yousef, Sabouri Jamshid

机构信息

Department of Civil Engineering, Tabriz Branch, Islamic Azad University, Tabriz, Iran.

出版信息

Sci Rep. 2024 Nov 9;14(1):27345. doi: 10.1038/s41598-024-79316-z.

DOI:10.1038/s41598-024-79316-z
PMID:39521934
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC11550480/
Abstract

Optimum design of truss structures can be a challenging and difficult field of study specially if an optimum design problem is comprised of continuous and discrete decision variables such as in truss size and layout optimization problems. Usually metaheuristic approaches are selected to solve these kind of problems and there are many different metaheuristic methods that have been used in dealing with truss optimization problems, which provide optimum solutions for those problems. However, among these various proposed metaheuristics, it is very seldom to face and find a method that is based on technologies such as computer networks. This paper aims to utilize a metaheuristic algorithm which is based on some principals of connected banking systems, which is called the Connected Banking System Optimizer(CBSO) algorithm. The performance of the CBSO is tested against three benchmark truss size/layout optimum design problems namely 15, 18 and 25 bar truss structures. Besides the truss size/layout problems, CEC-BC-2017 test functions with ten dimensions and also three other constrained optimum design problems are also investigated to examine the performance of the CBSO in dealing with these standard unconstrained and constrained test functions. The results of the CBSO optimum designs are presented and compared with some of the available studies in the literature. Statistical analyses are done to have a fair evaluation of the CBSO algorithm's efficiency and its ability in dealing with the benchmark truss size/layout optimization problems. The CBSO outperforms its rivals and presents lighter weight truss structures. There is no need for configuration of extra parameters in the CBSO algorithm when solving the examined benchmark truss structures, which makes it a robust parameter-free optimization algorithm.

摘要

桁架结构的优化设计可能是一个具有挑战性且困难的研究领域,特别是当一个优化设计问题由连续和离散的决策变量组成时,例如在桁架尺寸和布局优化问题中。通常会选择元启发式方法来解决这类问题,并且有许多不同的元启发式方法已被用于处理桁架优化问题,这些方法为这些问题提供了最优解。然而,在这些各种提出的元启发式方法中,很少遇到并找到一种基于计算机网络等技术的方法。本文旨在利用一种基于连接银行系统的一些原理的元启发式算法,即连接银行系统优化器(CBSO)算法。针对三个基准桁架尺寸/布局优化设计问题,即15杆、18杆和25杆桁架结构,对CBSO的性能进行了测试。除了桁架尺寸/布局问题外,还研究了具有十个维度的CEC - BC - 2017测试函数以及其他三个约束优化设计问题,以检验CBSO在处理这些标准无约束和约束测试函数方面的性能。给出了CBSO优化设计的结果,并与文献中的一些现有研究进行了比较。进行了统计分析,以公平评估CBSO算法的效率及其处理基准桁架尺寸/布局优化问题的能力。CBSO优于其竞争对手,并给出了更轻重量的桁架结构。在求解所研究的基准桁架结构时,CBSO算法无需配置额外的参数,这使其成为一种强大的无参数优化算法。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/54519a45f3ed/41598_2024_79316_Fig14_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/533362eae2c8/41598_2024_79316_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/59f8cd365eb4/41598_2024_79316_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/811cbc0c3312/41598_2024_79316_Fig3_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/39d4ea551e67/41598_2024_79316_Fig4_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/77fbfba45411/41598_2024_79316_Fig5_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/d759eb4f071c/41598_2024_79316_Fig6_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/80ac34c85c4d/41598_2024_79316_Fig7_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/7590c1d99c8a/41598_2024_79316_Fig8_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/833be7c3363b/41598_2024_79316_Fig9_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/9ef37d3ea1d9/41598_2024_79316_Fig10_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/051abce57542/41598_2024_79316_Fig11_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/3899ea8bcacc/41598_2024_79316_Fig12_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/de2beeac38ab/41598_2024_79316_Fig13_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/54519a45f3ed/41598_2024_79316_Fig14_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/533362eae2c8/41598_2024_79316_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/59f8cd365eb4/41598_2024_79316_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/811cbc0c3312/41598_2024_79316_Fig3_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/39d4ea551e67/41598_2024_79316_Fig4_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/77fbfba45411/41598_2024_79316_Fig5_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/d759eb4f071c/41598_2024_79316_Fig6_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/80ac34c85c4d/41598_2024_79316_Fig7_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/7590c1d99c8a/41598_2024_79316_Fig8_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/833be7c3363b/41598_2024_79316_Fig9_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/9ef37d3ea1d9/41598_2024_79316_Fig10_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/051abce57542/41598_2024_79316_Fig11_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/3899ea8bcacc/41598_2024_79316_Fig12_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/de2beeac38ab/41598_2024_79316_Fig13_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8b12/11550480/54519a45f3ed/41598_2024_79316_Fig14_HTML.jpg

相似文献

1
Application of a novel metaheuristic algorithm inspired by connected banking system in truss size and layout optimum design problems and optimization problems.一种受连通银行系统启发的新型元启发式算法在桁架尺寸和布局优化设计问题及优化问题中的应用。
Sci Rep. 2024 Nov 9;14(1):27345. doi: 10.1038/s41598-024-79316-z.
2
Truss sizing optimum design using a metaheuristic approach: Connected banking system.基于元启发式方法的桁架尺寸优化设计:连通银行系统。
Heliyon. 2024 Oct 16;10(20):e39308. doi: 10.1016/j.heliyon.2024.e39308. eCollection 2024 Oct 30.
3
Bobcat Optimization Algorithm: an effective bio-inspired metaheuristic algorithm for solving supply chain optimization problems.山猫优化算法:一种用于解决供应链优化问题的有效的受生物启发的元启发式算法。
Sci Rep. 2024 Aug 29;14(1):20099. doi: 10.1038/s41598-024-70497-1.
4
Shape and size optimization of truss structures by Chaos game optimization considering frequency constraints.考虑频率约束的混沌游戏优化的桁架结构形状和尺寸优化。
J Adv Res. 2022 Nov;41:89-100. doi: 10.1016/j.jare.2022.01.002. Epub 2022 Jan 6.
5
Application of a novel metaheuristic algorithm inspired by stadium spectators in global optimization problems.一种受体育场观众启发的新型元启发式算法在全局优化问题中的应用。
Sci Rep. 2024 Feb 6;14(1):3078. doi: 10.1038/s41598-024-53602-2.
6
A novel metaheuristic algorithm inspired by COVID-19 for real-parameter optimization.一种受新冠病毒启发的用于实参数优化的新型元启发式算法。
Neural Comput Appl. 2023;35(14):10147-10196. doi: 10.1007/s00521-023-08229-1. Epub 2023 Mar 9.
7
A novel chaotic transient search optimization algorithm for global optimization, real-world engineering problems and feature selection.一种用于全局优化、实际工程问题和特征选择的新型混沌瞬态搜索优化算法。
PeerJ Comput Sci. 2023 Aug 22;9:e1526. doi: 10.7717/peerj-cs.1526. eCollection 2023.
8
Lyrebird Optimization Algorithm: A New Bio-Inspired Metaheuristic Algorithm for Solving Optimization Problems.琴鸟优化算法:一种用于解决优化问题的新型生物启发式元启发式算法。
Biomimetics (Basel). 2023 Oct 23;8(6):507. doi: 10.3390/biomimetics8060507.
9
Kookaburra Optimization Algorithm: A New Bio-Inspired Metaheuristic Algorithm for Solving Optimization Problems.笑翠鸟优化算法:一种用于解决优化问题的新型生物启发式元启发式算法。
Biomimetics (Basel). 2023 Oct 1;8(6):470. doi: 10.3390/biomimetics8060470.
10
A New Human-Based Metaheuristic Algorithm for Solving Optimization Problems Based on Technical and Vocational Education and Training.一种基于技术和职业教育培训的新型基于人类的元启发式算法,用于解决优化问题。
Biomimetics (Basel). 2023 Oct 23;8(6):508. doi: 10.3390/biomimetics8060508.

引用本文的文献

1
DRIME: A Distributed Data-Guided RIME Algorithm for Numerical Optimization Problems.DRIME:一种用于数值优化问题的分布式数据引导RIME算法。
Biomimetics (Basel). 2025 Sep 3;10(9):589. doi: 10.3390/biomimetics10090589.
2
A Novel Black Widow Optimization Algorithm Based on Lagrange Interpolation Operator for ResNet18.一种基于拉格朗日插值算子的用于ResNet18的新型黑寡妇优化算法。
Biomimetics (Basel). 2025 Jun 3;10(6):361. doi: 10.3390/biomimetics10060361.

本文引用的文献

1
Optimal truss design with MOHO: A multi-objective optimization perspective.基于 MOHO 的最优桁架设计:多目标优化视角。
PLoS One. 2024 Aug 19;19(8):e0308474. doi: 10.1371/journal.pone.0308474. eCollection 2024.