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

立即免费体验

基于元启发式方法的桁架尺寸优化设计:连通银行系统。

Truss sizing optimum design using a metaheuristic approach: Connected banking system.

作者信息

Nemati Mehrdad, Zandi Yousef, Sabouri Jamshid

机构信息

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

出版信息

Heliyon. 2024 Oct 16;10(20):e39308. doi: 10.1016/j.heliyon.2024.e39308. eCollection 2024 Oct 30.

DOI:10.1016/j.heliyon.2024.e39308
PMID:39498059
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC11532830/
Abstract

Several methods have been used to solve structural optimum design problems since the creation of a need for light weight design of structures and there is still no single method for solving the optimum design problems in structural engineering field that is capable of providing efficient solutions to all of the structural optimum design problems. Therefore, there are several proposed and utilized methods to deal with optimum design issues and problems, that sometimes give promising results and sometimes the solutions are quite unacceptable. This issue with metaheuristic algorithms, which are suitable approaches to solve these set of problems, is quite usual and is supported by the "No Free Lunch theorem". Researchers try harder than the past to propose methods capable of presenting robust and optimal solutions in a wider range of structural optimum design problems, so that to find an algorithm that can cover a wider range of structural optimization problems and obtain a better optimum design. Truss structures are one of these problems which have extremely complex search spaces to conduct search procedures by metaheuristic algorithms. This paper proposes a method for optimum design of truss sizing problems. The presented method is used against 6 well-known benchmark truss structures (10 bar, 17 bar, 18 bar, 25 bar, 72 bar and 120 bar) and its results are compared with some of the available studies in the literature. The performance of the presented algorithm can be considered as very acceptable.

摘要

自从出现对结构轻量化设计的需求以来,已经使用了多种方法来解决结构优化设计问题,并且在结构工程领域中仍然没有一种单一的方法能够为所有结构优化设计问题提供高效的解决方案。因此,有几种被提出和使用的方法来处理优化设计问题,这些方法有时能给出有前景的结果,有时其解决方案却相当不可接受。对于元启发式算法(这是解决这类问题的合适方法)而言,这种情况很常见,并且得到了“没有免费午餐定理”的支持。研究人员比以往更加努力地提出能够在更广泛的结构优化设计问题中给出稳健且最优解的方法,以便找到一种能够涵盖更广泛结构优化问题并获得更好优化设计的算法。桁架结构就是这类问题之一,其具有极其复杂的搜索空间,难以通过元启发式算法进行搜索。本文提出了一种桁架尺寸优化设计的方法。所提出的方法应用于6个著名的基准桁架结构(10杆、17杆、18杆、25杆、72杆和120杆),并将其结果与文献中的一些现有研究进行了比较。所提出算法的性能可以被认为是非常令人满意的。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/68dc6aca2c6a/gr32.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/466dd6c88cc8/gr1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/8887d330d84a/gr2.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/140f5d11c52e/gr3.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/ecc6ec70b5e7/gr4.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/9a66d1f70466/gr5.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/e14b0226878f/gr6.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/d2b9eb88486c/gr7.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/04911a5872f6/gr8.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/2ee69aa6c7e1/gr9.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/a01dc031aa5e/gr10.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/f3019d172c65/gr11.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/ae6b506cc291/gr12.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/7ebbd1de0dc9/gr13.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/52dcbef7c6e9/gr14.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/c77dc5a64eeb/gr15.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/edce4b9f2eca/gr16.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/693b7eac6ab5/gr17.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/3aa0b8da9b27/gr18.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/003771816014/gr19.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/e587b3cdcbd8/gr20.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/fa5b79d7b00d/gr21.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/c489544b936c/gr22.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/20a00f9879a7/gr23.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/491ea9f07893/gr24.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/c86acbe41d70/gr25.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/cbfa53eac7bf/gr26.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/9448b72b86e0/gr27.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/d352641457ed/gr28.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/c42a88cc6324/gr29.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/6fcb614a3524/gr30.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/6a7528701f51/gr31.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/68dc6aca2c6a/gr32.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/466dd6c88cc8/gr1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/8887d330d84a/gr2.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/140f5d11c52e/gr3.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/ecc6ec70b5e7/gr4.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/9a66d1f70466/gr5.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/e14b0226878f/gr6.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/d2b9eb88486c/gr7.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/04911a5872f6/gr8.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/2ee69aa6c7e1/gr9.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/a01dc031aa5e/gr10.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/f3019d172c65/gr11.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/ae6b506cc291/gr12.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/7ebbd1de0dc9/gr13.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/52dcbef7c6e9/gr14.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/c77dc5a64eeb/gr15.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/edce4b9f2eca/gr16.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/693b7eac6ab5/gr17.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/3aa0b8da9b27/gr18.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/003771816014/gr19.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/e587b3cdcbd8/gr20.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/fa5b79d7b00d/gr21.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/c489544b936c/gr22.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/20a00f9879a7/gr23.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/491ea9f07893/gr24.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/c86acbe41d70/gr25.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/cbfa53eac7bf/gr26.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/9448b72b86e0/gr27.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/d352641457ed/gr28.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/c42a88cc6324/gr29.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/6fcb614a3524/gr30.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/6a7528701f51/gr31.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/80c7/11532830/68dc6aca2c6a/gr32.jpg

相似文献

1
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.
2
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.
3
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.
4
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.
5
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.
6
Sizing and Topology Optimization of Trusses Using Genetic Algorithm.基于遗传算法的桁架尺寸与拓扑优化
Materials (Basel). 2021 Feb 3;14(4):715. doi: 10.3390/ma14040715.
7
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.
8
A new human-based metaheuristic algorithm for solving optimization problems based on preschool education.一种基于学前教育的新的人类启发式元启发式算法,用于解决优化问题。
Sci Rep. 2023 Dec 6;13(1):21472. doi: 10.1038/s41598-023-48462-1.
9
An improved nutcracker optimization algorithm for discrete and continuous optimization problems: Design, comprehensive analysis, and engineering applications.一种用于离散和连续优化问题的改进型胡桃夹子优化算法:设计、综合分析及工程应用
Heliyon. 2024 Aug 22;10(17):e36678. doi: 10.1016/j.heliyon.2024.e36678. eCollection 2024 Sep 15.
10
An Improved Moth-Flame Optimization Algorithm with Adaptation Mechanism to Solve Numerical and Mechanical Engineering Problems.一种具有自适应机制的改进蛾火优化算法,用于解决数值和机械工程问题。
Entropy (Basel). 2021 Dec 6;23(12):1637. doi: 10.3390/e23121637.

本文引用的文献

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.
2
Multi-objective liver cancer algorithm: A novel algorithm for solving engineering design problems.多目标肝癌算法:一种解决工程设计问题的新算法。
Heliyon. 2024 Mar 2;10(5):e26665. doi: 10.1016/j.heliyon.2024.e26665. eCollection 2024 Mar 15.
3
Multi-objective exponential distribution optimizer (MOEDO): a novel math-inspired multi-objective algorithm for global optimization and real-world engineering design problems.
多目标指数分布优化器(MOEDO):一种受数学启发的新型多目标算法,用于全局优化和实际工程设计问题。
Sci Rep. 2024 Jan 20;14(1):1816. doi: 10.1038/s41598-024-52083-7.
4
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.