首页 > 最新文献

Archives of Computational Methods in Engineering最新文献

英文 中文
“Advancements in Microstrip Patch Antenna Design Using Nature-Inspired Metaheuristic Optimization Algorithms: A Systematic Review” 采用自然启发的元启发式优化算法的微带贴片天线设计进展:系统综述
IF 12.1 2区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-03-29 DOI: 10.1007/s11831-025-10254-3
Pravin Ghewari, Vinod Patil

Research on Microstrip Patch Antennas (MPAs) has significantly increased in recent years, due to their compact design, ease of fabrication, and cost-effectiveness. However, certain aspects of MPAs, such as narrow bandwidth, low gain, and suboptimal polarization purity still need improvement. It is crucial to optimize the performance parameters of MPAs, including bandwidth and gain while maintaining a compact form factor. Although traditional optimization techniques have been employed to address these challenges, they often struggle to achieve global optima and effectively manage multiple design variables. To address these limitations, nature-inspired metaheuristic optimization algorithms have emerged as a popular alternative. This comprehensive review examines recent research on applying optimization algorithms in MPA design, discussing their advantages, drawbacks, and effectiveness in addressing MPA design challenges. The review covers widely used algorithms such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Differential Evolution (DE), Artificial Bee Colony (ABC) optimization, Bacterial Foraging Optimization (BFO), and Ant Colony Optimization (ACO). Additionally, it explores the potential of novel metaheuristic algorithms, including Cuckoo Search (CS), Firefly Algorithm (FA), Grey Wolf Optimization (GWO), Bat Algorithm (BA), and Invasive Weed Optimization (IWO) to enhance MPA performance. This study summarizes the impact of various optimization methods on key performance metrics of MPAs, including bandwidth, return loss, gain, radiation efficiency, and miniaturization. It synthesizes findings from previously published research, emphasizing the growing need for multi-objective and hybrid optimization techniques in MPA design. These optimization techniques facilitate the development of high-performance, compact antenna solutions for a wide range of wireless communication applications while ensuring computational efficiency. Furthermore, the paper suggests several intriguing avenues for future research in MPA optimization.

近年来,微带贴片天线(MPAs)的研究因其设计紧凑、易于制造和成本效益而显著增加。然而,MPAs的某些方面,如窄带宽、低增益和次优极化纯度仍然需要改进。优化MPAs的性能参数至关重要,包括带宽和增益,同时保持紧凑的外形。虽然传统的优化技术已经被用来解决这些挑战,但它们往往难以实现全局优化和有效地管理多个设计变量。为了解决这些限制,自然启发的元启发式优化算法已经成为一种流行的替代方案。本文全面回顾了在MPA设计中应用优化算法的最新研究,讨论了它们在解决MPA设计挑战方面的优点、缺点和有效性。综述了遗传算法(GA)、粒子群优化(PSO)、差分进化(DE)、人工蜂群优化(ABC)、细菌觅食优化(BFO)和蚁群优化(ACO)等应用广泛的算法。此外,本文还探讨了布谷鸟搜索(CS)、萤火虫算法(FA)、灰狼优化(GWO)、蝙蝠算法(BA)和入侵杂草优化(IWO)等新型元启发式算法提高MPA性能的潜力。本研究总结了各种优化方法对MPAs关键性能指标的影响,包括带宽、回波损耗、增益、辐射效率和小型化。它综合了先前发表的研究结果,强调了MPA设计中对多目标和混合优化技术的日益增长的需求。这些优化技术促进了高性能、紧凑型天线解决方案的发展,适用于广泛的无线通信应用,同时确保了计算效率。此外,本文还提出了未来MPA优化研究的几个有趣方向。
{"title":"“Advancements in Microstrip Patch Antenna Design Using Nature-Inspired Metaheuristic Optimization Algorithms: A Systematic Review”","authors":"Pravin Ghewari,&nbsp;Vinod Patil","doi":"10.1007/s11831-025-10254-3","DOIUrl":"10.1007/s11831-025-10254-3","url":null,"abstract":"<div><p>Research on Microstrip Patch Antennas (MPAs) has significantly increased in recent years, due to their compact design, ease of fabrication, and cost-effectiveness. However, certain aspects of MPAs, such as narrow bandwidth, low gain, and suboptimal polarization purity still need improvement. It is crucial to optimize the performance parameters of MPAs, including bandwidth and gain while maintaining a compact form factor. Although traditional optimization techniques have been employed to address these challenges, they often struggle to achieve global optima and effectively manage multiple design variables. To address these limitations, nature-inspired metaheuristic optimization algorithms have emerged as a popular alternative. This comprehensive review examines recent research on applying optimization algorithms in MPA design, discussing their advantages, drawbacks, and effectiveness in addressing MPA design challenges. The review covers widely used algorithms such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Differential Evolution (DE), Artificial Bee Colony (ABC) optimization, Bacterial Foraging Optimization (BFO), and Ant Colony Optimization (ACO). Additionally, it explores the potential of novel metaheuristic algorithms, including Cuckoo Search (CS), Firefly Algorithm (FA), Grey Wolf Optimization (GWO), Bat Algorithm (BA), and Invasive Weed Optimization (IWO) to enhance MPA performance. This study summarizes the impact of various optimization methods on key performance metrics of MPAs, including bandwidth, return loss, gain, radiation efficiency, and miniaturization. It synthesizes findings from previously published research, emphasizing the growing need for multi-objective and hybrid optimization techniques in MPA design. These optimization techniques facilitate the development of high-performance, compact antenna solutions for a wide range of wireless communication applications while ensuring computational efficiency. Furthermore, the paper suggests several intriguing avenues for future research in MPA optimization.</p></div>","PeriodicalId":55473,"journal":{"name":"Archives of Computational Methods in Engineering","volume":"32 6","pages":"3687 - 3732"},"PeriodicalIF":12.1,"publicationDate":"2025-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145170894","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Hybrid Machine Learning Models for Discharge Coefficient Prediction in Hydrofoil-Crested Stepped Spillways 水翼顶梯级溢洪道流量系数预测的混合机器学习模型
IF 12.1 2区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-03-27 DOI: 10.1007/s11831-025-10274-z
Ehsan Afaridegan, Nosratollah Amanian, Mohammad Reza Goodarzi

Accurately estimating the discharge coefficient (Cd) in spillways remains a complex challenge, critical to hydraulic engineering. Recent advancements suggest that hybrid Machine Learning (ML) models offer significant potential for improving Cd predictions. This study explores the application of four novel hybrid ML models to estimate Cd in Hydrofoil-Crested Stepped Spillways (HCSSs): Light Gradient Boosting Machine with Pelican Optimization Algorithm (LightGBM-POA), Neural Gradient Boosting with Osprey Optimization Algorithm (NGBoost-OOA), Tabular Neural Network with Moth Flame Optimization (TabNet-MFO), and Support Vector Regression with Improved Whale Optimization Algorithm (SVR-IWOA). Outlier detection was performed using the Isolation Forest algorithm, and dimensional analysis identified the hydrofoil formation index (t) and the ratio of upstream flow depth to total spillway height (yup/P) as the most influential parameters for Cd estimation. The parameters were validated through ANOVA, while SHapley Additive exPlanations (SHAP) and Explainable Boosting Machine (EBM) quantified their contributions to Cd modeling, highlighting the dominant influence of t. Data normalization employed the StandardScaler method, with the dataset split into training (75%; 342 records) and testing (25%; 115 records) subsets. Model performance was assessed using metrics such as R², RMSE, SI, WMAPE, and sMAPE, and further evaluated using Taylor diagrams and a performance index (PI). During training stage, NGBoost-OOA achieved the highest accuracy, followed by LightGBM-POA, TabNet-MFO, and SVR-IWOA, with centered root mean square error (E’) values of 0.0057, 0.0064, 0.0067, and 0.0068, and PI scores of 165.5, 165.17, 123.25, and 123.25, respectively. In testing stage, TabNet-MFO and SVR-IWOA outperformed the other models, achieving equal E′ values of 0.0060 and PI scores of 165.34, ranking first. NGBoost-OOA and LightGBM-POA ranked third and fourth, respectively. These findings demonstrate the potential of hybrid ML models in accurately predicting Cd for complex hydraulic structures like HCSSs, offering valuable insights for future engineering applications.

准确估算溢洪道泄洪系数(Cd)一直是一项复杂的挑战,对水利工程至关重要。最近的进展表明,混合机器学习(ML)模型为改进Cd预测提供了巨大的潜力。本研究探讨了四种新型混合ML模型在水翼顶阶梯溢洪道Cd估计中的应用:鹈鹕优化算法的光梯度增压机(lightgbf - poa)、鱼鹰优化算法的神经梯度增压(NGBoost-OOA)、蛾焰优化的表格神经网络(TabNet-MFO)和改进鲸鱼优化算法的支持向量回归(SVR-IWOA)。采用隔离森林算法进行离群值检测,通过量纲分析发现,水翼形成指数(t)和上游水流深度与溢洪道总高度之比(yup/P)是影响Cd估计的最重要参数。参数通过方差分析进行验证,而SHapley Additive exPlanations (SHAP)和Explainable Boosting Machine (EBM)量化了它们对Cd建模的贡献,突出了t的主要影响。数据归一化采用StandardScaler方法,将数据集分为训练子集(75%;342条记录)和测试子集(25%;115条记录)。使用R²、RMSE、SI、WMAPE和sMAPE等指标评估模型性能,并使用泰勒图和性能指数(PI)进一步评估模型性能。在训练阶段,NGBoost-OOA的准确率最高,其次是LightGBM-POA、TabNet-MFO和SVR-IWOA,其中心均方根误差(E ')值分别为0.0057、0.0064、0.0067和0.0068,PI得分分别为165.5、165.17、123.25和123.25。在测试阶段,TabNet-MFO和SVR-IWOA的表现优于其他模型,E′值均为0.0060,PI得分为165.34,排名第一。NGBoost-OOA和LightGBM-POA分别排名第三和第四。这些发现证明了混合ML模型在准确预测复杂水工结构(如hcss)的Cd方面的潜力,为未来的工程应用提供了有价值的见解。
{"title":"Hybrid Machine Learning Models for Discharge Coefficient Prediction in Hydrofoil-Crested Stepped Spillways","authors":"Ehsan Afaridegan,&nbsp;Nosratollah Amanian,&nbsp;Mohammad Reza Goodarzi","doi":"10.1007/s11831-025-10274-z","DOIUrl":"10.1007/s11831-025-10274-z","url":null,"abstract":"<div><p>Accurately estimating the discharge coefficient (<i>C</i><sub><i>d</i></sub>) in spillways remains a complex challenge, critical to hydraulic engineering. Recent advancements suggest that hybrid Machine Learning (ML) models offer significant potential for improving <i>C</i><sub><i>d</i></sub> predictions. This study explores the application of four novel hybrid ML models to estimate <i>C</i><sub><i>d</i></sub> in Hydrofoil-Crested Stepped Spillways (HCSSs): Light Gradient Boosting Machine with Pelican Optimization Algorithm (LightGBM-POA), Neural Gradient Boosting with Osprey Optimization Algorithm (NGBoost-OOA), Tabular Neural Network with Moth Flame Optimization (TabNet-MFO), and Support Vector Regression with Improved Whale Optimization Algorithm (SVR-IWOA). Outlier detection was performed using the Isolation Forest algorithm, and dimensional analysis identified the hydrofoil formation index (<i>t</i>) and the ratio of upstream flow depth to total spillway height (<i>y</i><sub><i>up</i></sub>/<i>P</i>) as the most influential parameters for <i>C</i><sub><i>d</i></sub> estimation. The parameters were validated through ANOVA, while SHapley Additive exPlanations (SHAP) and Explainable Boosting Machine (EBM) quantified their contributions to <i>C</i><sub><i>d</i></sub> modeling, highlighting the dominant influence of <i>t</i>. Data normalization employed the StandardScaler method, with the dataset split into training (75%; 342 records) and testing (25%; 115 records) subsets. Model performance was assessed using metrics such as <i>R</i>², RMSE, SI, WMAPE, and sMAPE, and further evaluated using Taylor diagrams and a performance index (PI). During training stage, NGBoost-OOA achieved the highest accuracy, followed by LightGBM-POA, TabNet-MFO, and SVR-IWOA, with centered root mean square error (<i>E’</i>) values of 0.0057, 0.0064, 0.0067, and 0.0068, and PI scores of 165.5, 165.17, 123.25, and 123.25, respectively. In testing stage, TabNet-MFO and SVR-IWOA outperformed the other models, achieving equal <i>E′</i> values of 0.0060 and PI scores of 165.34, ranking first. NGBoost-OOA and LightGBM-POA ranked third and fourth, respectively. These findings demonstrate the potential of hybrid ML models in accurately predicting <i>C</i><sub><i>d</i></sub> for complex hydraulic structures like HCSSs, offering valuable insights for future engineering applications.</p></div>","PeriodicalId":55473,"journal":{"name":"Archives of Computational Methods in Engineering","volume":"32 7","pages":"4413 - 4445"},"PeriodicalIF":12.1,"publicationDate":"2025-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145248198","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Recent Advances and Applications of the Multi-verse Optimiser Algorithm: A Survey from 2020 to 2024 多元宇宙优化器算法的最新进展与应用:2020 - 2024年综述
IF 12.1 2区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-03-26 DOI: 10.1007/s11831-025-10277-w
Julakha Jahan Jui, M. M. Imran Molla, Mohd Ashraf Ahmad, Imali T. Hettiarachchi

The multi-verse optimiser (MVO) algorithm, inspired by the metaphor of multiple universes and their interactions, has emerged as a promising metaheuristic optimisation technique. This review paper provides an in-depth analysis of the MVO algorithm and its progression throughout the years, with a particular focus on developments from 2020 to 2024. We begin by elucidating the fundamental principles and components of MVO, highlighting its unique characteristics and historical context. Subsequently, we delve into recent advancements, modifications, and hybridisation of MVO with other optimisation methods, illustrating how these innovations have enhanced its performance and applicability. Our survey encompasses a broad range of publications that have employed MVO and its variants, examining its efficacy across diverse problem domains. We discuss empirical studies that benchmark MVO against other optimisation algorithms, providing insights into its strengths and limitations. Furthermore, we address prevalent criticisms and challenges faced by MVO, along with potential avenues for improvement and resolution. Real-world applications of MVO across various fields are showcased, emphasising its impact and utility in solving complex optimisation problems. We analyse how MVO has been adapted to tackle specific challenges in engineering, finance, logistics, and beyond. Finally, we outline prospective research directions aimed at refining the efficiency and effectiveness of the MVO algorithm, including avenues for exploring novel hybridisation and theoretical enhancements. This review is a significant resource for scholars and practitioners aiming to comprehend the latest developments, applications, and prospects of the MVO algorithm.

多宇宙优化器(MVO)算法受到多个宇宙及其相互作用的隐喻的启发,已成为一种有前途的元启发式优化技术。本文对MVO算法及其多年来的发展进行了深入分析,并特别关注了2020年至2024年的发展。我们首先阐述了MVO的基本原理和组成部分,突出了其独特的特点和历史背景。随后,我们深入研究了MVO与其他优化方法的最新进展,修改和混合,说明了这些创新如何增强其性能和适用性。我们的调查涵盖了广泛的出版物,这些出版物采用了MVO及其变体,检查了其在不同问题领域的有效性。我们讨论了对MVO与其他优化算法进行基准测试的实证研究,提供了对其优势和局限性的见解。此外,我们还讨论了MVO面临的普遍批评和挑战,以及改进和解决的潜在途径。展示了MVO在各个领域的实际应用,强调了其在解决复杂优化问题方面的影响和效用。我们分析了MVO如何适应工程、金融、物流等方面的具体挑战。最后,我们概述了未来的研究方向,旨在提高MVO算法的效率和有效性,包括探索新型杂交和理论增强的途径。这篇综述对于旨在了解MVO算法的最新发展、应用和前景的学者和实践者来说是一个重要的资源。
{"title":"Recent Advances and Applications of the Multi-verse Optimiser Algorithm: A Survey from 2020 to 2024","authors":"Julakha Jahan Jui,&nbsp;M. M. Imran Molla,&nbsp;Mohd Ashraf Ahmad,&nbsp;Imali T. Hettiarachchi","doi":"10.1007/s11831-025-10277-w","DOIUrl":"10.1007/s11831-025-10277-w","url":null,"abstract":"<div><p>The multi-verse optimiser (MVO) algorithm, inspired by the metaphor of multiple universes and their interactions, has emerged as a promising metaheuristic optimisation technique. This review paper provides an in-depth analysis of the MVO algorithm and its progression throughout the years, with a particular focus on developments from 2020 to 2024. We begin by elucidating the fundamental principles and components of MVO, highlighting its unique characteristics and historical context. Subsequently, we delve into recent advancements, modifications, and hybridisation of MVO with other optimisation methods, illustrating how these innovations have enhanced its performance and applicability. Our survey encompasses a broad range of publications that have employed MVO and its variants, examining its efficacy across diverse problem domains. We discuss empirical studies that benchmark MVO against other optimisation algorithms, providing insights into its strengths and limitations. Furthermore, we address prevalent criticisms and challenges faced by MVO, along with potential avenues for improvement and resolution. Real-world applications of MVO across various fields are showcased, emphasising its impact and utility in solving complex optimisation problems. We analyse how MVO has been adapted to tackle specific challenges in engineering, finance, logistics, and beyond. Finally, we outline prospective research directions aimed at refining the efficiency and effectiveness of the MVO algorithm, including avenues for exploring novel hybridisation and theoretical enhancements. This review is a significant resource for scholars and practitioners aiming to comprehend the latest developments, applications, and prospects of the MVO algorithm.</p></div>","PeriodicalId":55473,"journal":{"name":"Archives of Computational Methods in Engineering","volume":"32 7","pages":"4491 - 4524"},"PeriodicalIF":12.1,"publicationDate":"2025-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145248357","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Symmetric and Comparative Study of Decision Making in Intuitionistic Multi-objective Optimization Environment: Past, Present and Future 直觉型多目标优化环境下决策的对称比较研究:过去、现在和未来
IF 12.1 2区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-03-25 DOI: 10.1007/s11831-025-10243-6
Pinki, Rakesh Kumar, Wattana Viriyasitavat, Assadaporn Sapsomboon, Gaurav Dhiman, Reem Alshahrani, Suhare Solaiman, Rashmi Choudhary, Protyay Dey, R. Sivaranjani

In this article, we look at how intuitionistic fuzzy programming (IFP) for MOO works in several real-life situations. Problems in the real world frequently have non-linear properties, in contrast to the majority of MOO research, which has traditionally relied on linear assignment functions in an intuitionistic setting. To tackle this, our research takes into account non-linear functions such as hyperbolic, parabolic, exponential, and s-curved functions. These functions handle the constraints caused by convexity and concavity in certain areas of the domain, as well as the impact of the functions' slopes. We then investigate 25 potential hybrid scenarios involving various membership and non-membership functions in IFP methods. Evaluating how these hybrid scenarios affect IFP's ability to handle the complexity of MOO is our main goal. By evaluating how various scenarios perform, we attempt to determine the best setups and comprehend their advantages and disadvantages. The results of our quantitative evaluations and practical implementations shed light on multi-objective optimization in real-world settings, which is useful for practitioners and decision makers. To further illustrate the real-world consequences of different IFP approaches, we offer an engaging case study in the agricultural sector. This study not only consolidates current knowledge but also provides practical assistance for achieving optimal results in diverse situations, enhancing our grasp of optimization strategies based on IFP.

在本文中,我们将研究面向MOO的直觉模糊规划(IFP)如何在几种实际情况下工作。与大多数MOO研究不同,现实世界中的问题通常具有非线性特性,而MOO研究传统上依赖于直觉设置中的线性分配函数。为了解决这个问题,我们的研究考虑了非线性函数,如双曲函数、抛物线函数、指数函数和s曲线函数。这些函数处理由域的某些区域的凹凸性引起的约束,以及函数斜率的影响。然后,我们研究了IFP方法中涉及各种隶属和非隶属函数的25种潜在混合场景。评估这些混合场景如何影响IFP处理MOO复杂性的能力是我们的主要目标。通过评估各种场景的执行情况,我们试图确定最佳设置并了解其优点和缺点。我们的定量评估和实际实施的结果揭示了现实环境中的多目标优化,这对从业者和决策者很有用。为了进一步说明不同IFP方法的现实后果,我们在农业部门提供了一个引人入胜的案例研究。本研究不仅巩固了现有的知识,而且为在不同情况下获得最优结果提供了实际的帮助,增强了我们对基于IFP的优化策略的掌握。
{"title":"A Symmetric and Comparative Study of Decision Making in Intuitionistic Multi-objective Optimization Environment: Past, Present and Future","authors":"Pinki,&nbsp;Rakesh Kumar,&nbsp;Wattana Viriyasitavat,&nbsp;Assadaporn Sapsomboon,&nbsp;Gaurav Dhiman,&nbsp;Reem Alshahrani,&nbsp;Suhare Solaiman,&nbsp;Rashmi Choudhary,&nbsp;Protyay Dey,&nbsp;R. Sivaranjani","doi":"10.1007/s11831-025-10243-6","DOIUrl":"10.1007/s11831-025-10243-6","url":null,"abstract":"<div><p>In this article, we look at how intuitionistic fuzzy programming (IFP) for MOO works in several real-life situations. Problems in the real world frequently have non-linear properties, in contrast to the majority of MOO research, which has traditionally relied on linear assignment functions in an intuitionistic setting. To tackle this, our research takes into account non-linear functions such as hyperbolic, parabolic, exponential, and s-curved functions. These functions handle the constraints caused by convexity and concavity in certain areas of the domain, as well as the impact of the functions' slopes. We then investigate 25 potential hybrid scenarios involving various membership and non-membership functions in IFP methods. Evaluating how these hybrid scenarios affect IFP's ability to handle the complexity of MOO is our main goal. By evaluating how various scenarios perform, we attempt to determine the best setups and comprehend their advantages and disadvantages. The results of our quantitative evaluations and practical implementations shed light on multi-objective optimization in real-world settings, which is useful for practitioners and decision makers. To further illustrate the real-world consequences of different IFP approaches, we offer an engaging case study in the agricultural sector. This study not only consolidates current knowledge but also provides practical assistance for achieving optimal results in diverse situations, enhancing our grasp of optimization strategies based on IFP.</p></div>","PeriodicalId":55473,"journal":{"name":"Archives of Computational Methods in Engineering","volume":"32 6","pages":"3375 - 3413"},"PeriodicalIF":12.1,"publicationDate":"2025-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145168806","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Comparative Review of FEM Like Techniques Applied to the Linear Analysis of Molecular Structures 类有限元技术在分子结构线性分析中的应用比较综述
IF 12.1 2区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-03-23 DOI: 10.1007/s11831-025-10272-1
Andrés Fernández-San Miguel, Luis Ramírez, Iván Couceiro, Fermín Navarrina

In this study, a historical review of the Finite Element Method (FEM) and Molecular Dynamics (MD), widely used at the macro and nanoscale respectively is presented, emphasizing the actual parallelisms between their development and applications. After this historical introduction, where certain similarities between both methods are pointed out, different FEM-like methods are analyzed and compared as for first order analysis of structures at the nanoscale. Firstly, the Structural Mechanics (SM) approach is analyzed, where it is assumed that the use of Euler Bernoulli beam elements is equivalent to working directly from the force field. On the other hand, the Molecular Element Method (MEM), which provides the stiffness matrices directly from the potentials, is analyzed. Several analytical static cases are studied for the validation and comparison of both methods. Finally, it is shown that, other branch of methods such as Elastic Network Models (ENM) can be viewed as a particular sub-case of the MEM, or as truss-type finite elements. As an example, the analysis of SARS-CoV2 spikes vibrations is included, comparing with both experimental results and continuous models.

本文对分别在宏观和纳米尺度上广泛应用的有限元法(FEM)和分子动力学(MD)进行了历史回顾,强调了它们的发展和应用之间的实际并行性。在此历史介绍之后,指出了两种方法之间的某些相似之处,分析和比较了不同的类有限元方法在纳米尺度上对结构的一阶分析。首先,分析了结构力学(SM)方法,其中假设欧拉-伯努利梁单元的使用等同于直接从力场出发。另一方面,分析了分子单元法(MEM),该方法直接从电位中获得刚度矩阵。通过几个静态分析案例对两种方法进行了验证和比较。最后表明,其他分支的方法,如弹性网络模型(ENM)可以看作是MEM的一个特定的子情况,或作为桁架型有限元。以SARS-CoV2的峰值振动为例,与实验结果和连续模型进行了比较。
{"title":"A Comparative Review of FEM Like Techniques Applied to the Linear Analysis of Molecular Structures","authors":"Andrés Fernández-San Miguel,&nbsp;Luis Ramírez,&nbsp;Iván Couceiro,&nbsp;Fermín Navarrina","doi":"10.1007/s11831-025-10272-1","DOIUrl":"10.1007/s11831-025-10272-1","url":null,"abstract":"<div><p>In this study, a historical review of the Finite Element Method (FEM) and Molecular Dynamics (MD), widely used at the macro and nanoscale respectively is presented, emphasizing the actual parallelisms between their development and applications. After this historical introduction, where certain similarities between both methods are pointed out, different FEM-like methods are analyzed and compared as for first order analysis of structures at the nanoscale. Firstly, the Structural Mechanics (SM) approach is analyzed, where it is assumed that the use of Euler Bernoulli beam elements is equivalent to working directly from the force field. On the other hand, the Molecular Element Method (MEM), which provides the stiffness matrices directly from the potentials, is analyzed. Several analytical static cases are studied for the validation and comparison of both methods. Finally, it is shown that, other branch of methods such as Elastic Network Models (ENM) can be viewed as a particular sub-case of the MEM, or as truss-type finite elements. As an example, the analysis of SARS-CoV2 spikes vibrations is included, comparing with both experimental results and continuous models.</p></div>","PeriodicalId":55473,"journal":{"name":"Archives of Computational Methods in Engineering","volume":"32 7","pages":"4447 - 4474"},"PeriodicalIF":12.1,"publicationDate":"2025-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11831-025-10272-1.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145248244","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Machine Learning-based Model for Groundwater Quality Prediction: A Comprehensive Review and Future Time–Cost Effective Modelling Vision 基于机器学习的地下水质量预测模型:一个全面的回顾和未来的时间-成本效益建模愿景
IF 12.1 2区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-03-19 DOI: 10.1007/s11831-025-10248-1
Farhan ‘Ammar Fardush Sham, Ahmed El-Shafie, Wan Zurina Binti Wan Jaafar, S. Adarsh, Ali Najah Ahmed

Towards a better groundwater management, developing a prediction model for groundwater quality is of utmost importance. The conventional method of measuring groundwater quality data often associated with errors due to the lengthy duration of investigation of the parameters as well as the tremendous effort and time involved in gathering and analysing the samples. The expense associated with determining the parameters’ values via laboratory testing is substantial. There has been a notable increase in machine learning (ML) application for modelling groundwater quality as of recent, evidenced by a wealth of studies reporting impressive results. This paper provides an extensive examination of 91 relevant articles picked from the Web of Science and PubMed, from 2015 to 2024. The focus of the review revolves on significant ML algorithms, including artificial neural networks (ANN), random forest (RF), support vector machines (SVM), hybrid models, and other algorithms that have demonstrated efficacy in predicting groundwater quality, such as k-nearest neighbours and extreme gradient boosting (XGBoost). Critical modelling concepts such as data splitting, utilized parameters, performance metrics, and study areas were addressed, emphasizing optimal practices for effective groundwater quality prediction with ML.

为了更好地管理地下水,建立地下水水质预测模型至关重要。传统的地下水水质数据测量方法由于参数调查时间长,采集和分析样品需要耗费大量的精力和时间,因而常常存在误差。通过实验室测试确定参数值的相关费用是相当可观的。最近,机器学习(ML)在模拟地下水质量方面的应用有了显著的增加,大量的研究报告了令人印象深刻的结果。本文提供了从2015年到2024年从Web of Science和PubMed中挑选的91篇相关文章的广泛检查。回顾的重点是重要的机器学习算法,包括人工神经网络(ANN)、随机森林(RF)、支持向量机(SVM)、混合模型和其他在预测地下水质量方面已经证明有效的算法,如k近邻和极端梯度增强(XGBoost)。讨论了关键的建模概念,如数据分割、使用的参数、性能指标和研究领域,强调了使用ML进行有效地下水质量预测的最佳实践。
{"title":"Machine Learning-based Model for Groundwater Quality Prediction: A Comprehensive Review and Future Time–Cost Effective Modelling Vision","authors":"Farhan ‘Ammar Fardush Sham,&nbsp;Ahmed El-Shafie,&nbsp;Wan Zurina Binti Wan Jaafar,&nbsp;S. Adarsh,&nbsp;Ali Najah Ahmed","doi":"10.1007/s11831-025-10248-1","DOIUrl":"10.1007/s11831-025-10248-1","url":null,"abstract":"<div><p>Towards a better groundwater management, developing a prediction model for groundwater quality is of utmost importance. The conventional method of measuring groundwater quality data often associated with errors due to the lengthy duration of investigation of the parameters as well as the tremendous effort and time involved in gathering and analysing the samples. The expense associated with determining the parameters’ values via laboratory testing is substantial. There has been a notable increase in machine learning (ML) application for modelling groundwater quality as of recent, evidenced by a wealth of studies reporting impressive results. This paper provides an extensive examination of 91 relevant articles picked from the Web of Science and PubMed, from 2015 to 2024. The focus of the review revolves on significant ML algorithms, including artificial neural networks (ANN), random forest (RF), support vector machines (SVM), hybrid models, and other algorithms that have demonstrated efficacy in predicting groundwater quality, such as k-nearest neighbours and extreme gradient boosting (XGBoost). Critical modelling concepts such as data splitting, utilized parameters, performance metrics, and study areas were addressed, emphasizing optimal practices for effective groundwater quality prediction with ML.</p></div>","PeriodicalId":55473,"journal":{"name":"Archives of Computational Methods in Engineering","volume":"32 6","pages":"3593 - 3608"},"PeriodicalIF":12.1,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145167256","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Artificial Bee Colony Algorithm: A Comprehensive Survey of Variants, Modifications, Applications, Developments, and Opportunities 人工蜂群算法:变种、修改、应用、发展和机会的综合调查
IF 12.1 2区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-03-19 DOI: 10.1007/s11831-025-10269-w
Ashraf Osman Ibrahim, Elsadig Mohammed Elbushra Elfadel, Ibrahim Abaker Targio Hashem, Hassan Jamil Syed, Moh Arfian Ismail, Ahmed Hamza Osman, Ali Ahmed

Meta-heuristic algorithms aim to achieve near-optimal solutions to complex optimization problems by taking inspiration from nature. The last three decades have seen an increased focus on the use of meta-heuristics in optimization, with the direct result that a great number of new meta-heuristics have been created to tackle challenging real-world situations in various sectors. Swarm intelligence is one of the most important families of bio-inspired algorithms and the artificial bee colony (ABC) algorithm is a prominent member. This paper presents a comprehensive survey of the ABC algorithm and describes its variants, modifications, applications, and developments. The primary purpose of this survey is to provide a complete analysis of the current developments in the ABC algorithm which will include improvements, variations, hybridizations, multi-objectives, and its applications in a variety of domains. This research presents the results of several studies that have been carried out to improve the ABC algorithm’s performance in various fields using different methodologies. Finally, we discuss the future opportunities and challenges for ABC algorithm research, including potential areas for further development and the need for rigorous testing and benchmarking. We conclude that the ABC algorithm is a promising and versatile optimization algorithm that has the potential to be applied to a wide range of real-world problems.

元启发式算法旨在通过从自然中获得灵感来实现复杂优化问题的接近最优解。在过去的三十年中,人们越来越关注在优化中使用元启发式方法,直接的结果是创建了大量新的元启发式方法来解决各种领域中具有挑战性的现实情况。群体智能是仿生算法的重要分支之一,人工蜂群算法是其中的重要一员。本文介绍了ABC算法的全面调查,并描述了它的变体、修改、应用和发展。本调查的主要目的是对ABC算法的当前发展进行完整的分析,包括改进、变化、杂交、多目标及其在各种领域的应用。本研究提出了几项研究的结果,这些研究使用不同的方法来提高ABC算法在各个领域的性能。最后,我们讨论了ABC算法研究的未来机遇和挑战,包括进一步发展的潜在领域以及严格测试和基准测试的必要性。我们得出结论,ABC算法是一种有前途的通用优化算法,具有应用于广泛的现实问题的潜力。
{"title":"The Artificial Bee Colony Algorithm: A Comprehensive Survey of Variants, Modifications, Applications, Developments, and Opportunities","authors":"Ashraf Osman Ibrahim,&nbsp;Elsadig Mohammed Elbushra Elfadel,&nbsp;Ibrahim Abaker Targio Hashem,&nbsp;Hassan Jamil Syed,&nbsp;Moh Arfian Ismail,&nbsp;Ahmed Hamza Osman,&nbsp;Ali Ahmed","doi":"10.1007/s11831-025-10269-w","DOIUrl":"10.1007/s11831-025-10269-w","url":null,"abstract":"<div><p>Meta-heuristic algorithms aim to achieve near-optimal solutions to complex optimization problems by taking inspiration from nature. The last three decades have seen an increased focus on the use of meta-heuristics in optimization, with the direct result that a great number of new meta-heuristics have been created to tackle challenging real-world situations in various sectors. Swarm intelligence is one of the most important families of bio-inspired algorithms and the artificial bee colony (ABC) algorithm is a prominent member. This paper presents a comprehensive survey of the ABC algorithm and describes its variants, modifications, applications, and developments. The primary purpose of this survey is to provide a complete analysis of the current developments in the ABC algorithm which will include improvements, variations, hybridizations, multi-objectives, and its applications in a variety of domains. This research presents the results of several studies that have been carried out to improve the ABC algorithm’s performance in various fields using different methodologies. Finally, we discuss the future opportunities and challenges for ABC algorithm research, including potential areas for further development and the need for rigorous testing and benchmarking. We conclude that the ABC algorithm is a promising and versatile optimization algorithm that has the potential to be applied to a wide range of real-world problems.</p></div>","PeriodicalId":55473,"journal":{"name":"Archives of Computational Methods in Engineering","volume":"32 6","pages":"3499 - 3533"},"PeriodicalIF":12.1,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145166631","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A comprehensive review on step-based skin cancer detection using machine learning and deep learning methods 使用机器学习和深度学习方法的基于步骤的皮肤癌检测的综合综述
IF 12.1 2区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-03-19 DOI: 10.1007/s11831-025-10275-y
Neetu Verma,  Ranvijay, Dharmendra Kumar Yadav

Skin cancer is one of the most frequent and deadly form of cancer. Essentially, it is an abnormal growth of skin cells that primarily occurs after contaminated hands with the sun. These days, it also appears on skin surfaces that are not exposed to sunlight. Skin cancer is smoothly curable only if it is diagnosed in its initial days. There are some prominent types of skin cancer named as melanoma, squamous cell carcinoma, basal cell carcinoma, and many others. Many machine learning and deep learning methods have been developed to interpret medical images, specifically those of skin lesions, it is difficult and tiresome to analyze these to find cancer manually. Computer-aided diagnosis systems have two essential procedures: classification and segmentation of lesions. These two procedures improve the quality of features retrieved from medical images. An overview of some methods used to diagnose skin cancer is provided to identify the most efficient preprocessing, segmentation, feature extraction, and classification of medical images. Various research methods for specific skin cancer classification are also explored in this study. A further hurdle to creating an optimal diagnosis algorithm is the absence of a dataset on skin cancer. In order to assist researchers in developing useful algorithms that rapidly and accurately diagnose skin cancer, the study offers to provide a current overview of the proposed solutions to the issues in skin cancer detection. We gathered the results in tabular form after analyzing the efficiency of the most recent research based on a variety of factors, including techniques, and the performance of the applied datasets. We have discussed the current Deep Learning and Machine Learning techniques for detecting skin cancer along with their limitations. Along with outlining the various assessment metrics, we have also discussed the research gaps and challenges, such as imbalanced datasets, intra-class variance, inter-class similarity, etc., in skin cancer detection. The survey demonstrates its superiority over various other surveys currently in use.

皮肤癌是最常见、最致命的癌症之一。从本质上讲,这是一种皮肤细胞的异常生长,主要发生在双手被太阳污染后。如今,它也出现在没有暴露在阳光下的皮肤表面。皮肤癌只有在最初几天被诊断出来才能顺利治愈。有一些突出的皮肤癌类型,如黑色素瘤、鳞状细胞癌、基底细胞癌等。已经开发了许多机器学习和深度学习方法来解释医学图像,特别是那些皮肤病变的图像,通过人工分析这些图像来发现癌症是困难和令人厌倦的。计算机辅助诊断系统有两个基本步骤:病变的分类和分割。这两种方法提高了医学图像特征检索的质量。概述了一些用于诊断皮肤癌的方法,以确定最有效的医学图像预处理、分割、特征提取和分类。本研究还探索了多种皮肤癌特异性分类的研究方法。创建最佳诊断算法的另一个障碍是缺乏皮肤癌的数据集。为了帮助研究人员开发快速准确诊断皮肤癌的有用算法,本研究提供了皮肤癌检测问题的建议解决方案的当前概述。在分析了基于各种因素(包括技术)和应用数据集的性能的最新研究的效率之后,我们以表格形式收集了结果。我们讨论了目前用于检测皮肤癌的深度学习和机器学习技术及其局限性。除了概述各种评估指标外,我们还讨论了皮肤癌检测中的研究差距和挑战,例如数据集不平衡,类内方差,类间相似性等。该调查显示了它比目前使用的各种其他调查的优越性。
{"title":"A comprehensive review on step-based skin cancer detection using machine learning and deep learning methods","authors":"Neetu Verma,&nbsp; Ranvijay,&nbsp;Dharmendra Kumar Yadav","doi":"10.1007/s11831-025-10275-y","DOIUrl":"10.1007/s11831-025-10275-y","url":null,"abstract":"<div><p>Skin cancer is one of the most frequent and deadly form of cancer. Essentially, it is an abnormal growth of skin cells that primarily occurs after contaminated hands with the sun. These days, it also appears on skin surfaces that are not exposed to sunlight. Skin cancer is smoothly curable only if it is diagnosed in its initial days. There are some prominent types of skin cancer named as melanoma, squamous cell carcinoma, basal cell carcinoma, and many others. Many machine learning and deep learning methods have been developed to interpret medical images, specifically those of skin lesions, it is difficult and tiresome to analyze these to find cancer manually. Computer-aided diagnosis systems have two essential procedures: classification and segmentation of lesions. These two procedures improve the quality of features retrieved from medical images. An overview of some methods used to diagnose skin cancer is provided to identify the most efficient preprocessing, segmentation, feature extraction, and classification of medical images. Various research methods for specific skin cancer classification are also explored in this study. A further hurdle to creating an optimal diagnosis algorithm is the absence of a dataset on skin cancer. In order to assist researchers in developing useful algorithms that rapidly and accurately diagnose skin cancer, the study offers to provide a current overview of the proposed solutions to the issues in skin cancer detection. We gathered the results in tabular form after analyzing the efficiency of the most recent research based on a variety of factors, including techniques, and the performance of the applied datasets. We have discussed the current Deep Learning and Machine Learning techniques for detecting skin cancer along with their limitations. Along with outlining the various assessment metrics, we have also discussed the research gaps and challenges, such as imbalanced datasets, intra-class variance, inter-class similarity, etc., in skin cancer detection. The survey demonstrates its superiority over various other surveys currently in use.</p></div>","PeriodicalId":55473,"journal":{"name":"Archives of Computational Methods in Engineering","volume":"32 7","pages":"4359 - 4412"},"PeriodicalIF":12.1,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145248367","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Evolution of Swarm Intelligence: A Systematic Review of Particle Swarm and Ant Colony Optimization Approaches in Modern Research 群体智能的进化:现代研究中粒子群和蚁群优化方法的系统综述
IF 12.1 2区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-03-18 DOI: 10.1007/s11831-025-10247-2
Rahul Priyadarshi, Ravi Ranjan Kumar

In order to solve complex optimization problems, swarm intelligence (SI) techniques that draw inspiration from the collective behavior of fish schools, ant foraging, and bird flocking are gaining popularity. Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO) are two widely recognized techniques in the fields of metaheuristics. This article provides a comprehensive examination of PSO and ACO, assessing their fundamental concepts, working mechanisms, algorithmic variations, and an extensive range of applications. We thoroughly compare the advantages and disadvantages of PSO and ACO, and examine their respective successes and failures in various scenarios. These approaches have demonstrated their effectiveness in practical scenarios, as evidenced by various case studies. This paper explores innovative advancements, ongoing challenges that require resolution, and thrilling new avenues for future research in swarm intelligence-based optimization. This paves the way for further advancements in this swiftly evolving domain.

为了解决复杂的优化问题,从鱼群、蚂蚁觅食和鸟群的集体行为中汲取灵感的群体智能(SI)技术越来越受欢迎。粒子群优化算法(PSO)和蚁群优化算法(ACO)是元启发式算法中得到广泛认可的两种算法。本文全面介绍了粒子群算法和蚁群算法,评估了它们的基本概念、工作机制、算法变化和广泛的应用范围。我们全面比较了粒子群算法和蚁群算法的优缺点,并考察了它们各自在不同场景下的成功和失败。正如各种案例研究所证明的那样,这些方法在实际场景中已经证明了它们的有效性。本文探讨了基于群体智能优化的创新进展,需要解决的持续挑战,以及未来研究的激动人心的新途径。这为这个快速发展的领域的进一步发展铺平了道路。
{"title":"Evolution of Swarm Intelligence: A Systematic Review of Particle Swarm and Ant Colony Optimization Approaches in Modern Research","authors":"Rahul Priyadarshi,&nbsp;Ravi Ranjan Kumar","doi":"10.1007/s11831-025-10247-2","DOIUrl":"10.1007/s11831-025-10247-2","url":null,"abstract":"<div><p>In order to solve complex optimization problems, swarm intelligence (SI) techniques that draw inspiration from the collective behavior of fish schools, ant foraging, and bird flocking are gaining popularity. Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO) are two widely recognized techniques in the fields of metaheuristics. This article provides a comprehensive examination of PSO and ACO, assessing their fundamental concepts, working mechanisms, algorithmic variations, and an extensive range of applications. We thoroughly compare the advantages and disadvantages of PSO and ACO, and examine their respective successes and failures in various scenarios. These approaches have demonstrated their effectiveness in practical scenarios, as evidenced by various case studies. This paper explores innovative advancements, ongoing challenges that require resolution, and thrilling new avenues for future research in swarm intelligence-based optimization. This paves the way for further advancements in this swiftly evolving domain.</p></div>","PeriodicalId":55473,"journal":{"name":"Archives of Computational Methods in Engineering","volume":"32 6","pages":"3609 - 3650"},"PeriodicalIF":12.1,"publicationDate":"2025-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145166222","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Artificial Intelligence-Aided Design (AIAD) for Structures and Engineering: A State-of-the-Art Review and Future Perspectives 结构与工程中的人工智能辅助设计(AIAD):最新进展与未来展望
IF 12.1 2区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-03-18 DOI: 10.1007/s11831-025-10264-1
Yu Ao, Shaofan Li, Huiling Duan

Even with the state-of-the-art technology of computer-aided design and topology optimization, the present structural design still faces the challenges of high dimensionality, multi-objectivity, and multi-constraints, making it knowledge/experience-demanding, labor-intensive, and difficult to achieve or simply lack of global optimality. Structural designers are still searching for new ways to cost-effectively to achieve a possible global optimality in a given structure design, in particular, we are looking for decreasing design knowledge/experience-requirements and reducing design labor and time. In recent years, Artificial Intelligence (AI) technology, characterized by the large language model (LLM) of Machine Learning (ML), for instance Deep Learning (DL), has developed rapidly, fostering the integration of AI technology in structural engineering design and giving rise to the concept and notion of Artificial Intelligence-Aided Design (AIAD). The emergence of AIAD has greatly alleviated the challenges faced by structural design, showing great promise in extrapolative and innovative design concept generation, enhancing efficiency while simplifying the workflow, reducing the design cycle time and cost, and achieving a truly global optimal design. In this article, we present a state-of-the-art overview of applying AIAD to enhance structural design, summarizing the current applications of AIAD in related fields: marine and naval architecture structures, aerospace structures, automotive structures, civil infrastructure structures, topological optimization structure designs, and composite micro-structure design. In addition to discussing of the AIAD application to structural design, the article discusses its current challenges, current development focus, and future perspectives.

即使采用计算机辅助设计和拓扑优化技术,目前的结构设计仍然面临着高维、多目标、多约束的挑战,要求知识/经验,劳动密集,难以达到或根本缺乏全局最优性。结构设计师仍在寻找新的方法,以经济有效地实现给定结构设计的可能的全局最优性,特别是,我们正在寻找减少设计知识/经验要求,减少设计劳动和时间。近年来,以深度学习(DL)等机器学习(ML)的大语言模型(LLM)为特征的人工智能(AI)技术发展迅速,促进了人工智能技术在结构工程设计中的融合,并产生了人工智能辅助设计(AIAD)的概念和概念。AIAD的出现极大地缓解了结构设计面临的挑战,在外推和创新设计概念生成、提高效率的同时简化工作流程、减少设计周期时间和成本、实现真正意义上的全局优化设计方面展现了巨大的前景。本文综述了AIAD在结构设计中的应用现状,总结了AIAD在船舶结构、航空航天结构、汽车结构、民用基础设施结构、拓扑优化结构设计和复合材料微结构设计等领域的应用现状。本文除了讨论AIAD在结构设计中的应用外,还讨论了AIAD目前面临的挑战、当前的发展重点和未来的展望。
{"title":"Artificial Intelligence-Aided Design (AIAD) for Structures and Engineering: A State-of-the-Art Review and Future Perspectives","authors":"Yu Ao,&nbsp;Shaofan Li,&nbsp;Huiling Duan","doi":"10.1007/s11831-025-10264-1","DOIUrl":"10.1007/s11831-025-10264-1","url":null,"abstract":"<div><p>Even with the state-of-the-art technology of computer-aided design and topology optimization, the present structural design still faces the challenges of high dimensionality, multi-objectivity, and multi-constraints, making it knowledge/experience-demanding, labor-intensive, and difficult to achieve or simply lack of global optimality. Structural designers are still searching for new ways to cost-effectively to achieve a possible global optimality in a given structure design, in particular, we are looking for decreasing design knowledge/experience-requirements and reducing design labor and time. In recent years, Artificial Intelligence (AI) technology, characterized by the large language model (LLM) of Machine Learning (ML), for instance Deep Learning (DL), has developed rapidly, fostering the integration of AI technology in structural engineering design and giving rise to the concept and notion of Artificial Intelligence-Aided Design (AIAD). The emergence of AIAD has greatly alleviated the challenges faced by structural design, showing great promise in extrapolative and innovative design concept generation, enhancing efficiency while simplifying the workflow, reducing the design cycle time and cost, and achieving a truly global optimal design. In this article, we present a state-of-the-art overview of applying AIAD to enhance structural design, summarizing the current applications of AIAD in related fields: marine and naval architecture structures, aerospace structures, automotive structures, civil infrastructure structures, topological optimization structure designs, and composite micro-structure design. In addition to discussing of the AIAD application to structural design, the article discusses its current challenges, current development focus, and future perspectives.</p></div>","PeriodicalId":55473,"journal":{"name":"Archives of Computational Methods in Engineering","volume":"32 7","pages":"4197 - 4224"},"PeriodicalIF":12.1,"publicationDate":"2025-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11831-025-10264-1.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145248203","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Archives of Computational Methods in Engineering
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1