A new metaheuristic optimization based on K-means clustering algorithm and its application to structural damage identification

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Knowledge-Based Systems Pub Date : 2022-09-05 DOI:10.1016/j.knosys.2022.109189
Hoang-Le Minh , Thanh Sang-To , Magd Abdel Wahab , Thanh Cuong-Le
{"title":"A new metaheuristic optimization based on K-means clustering algorithm and its application to structural damage identification","authors":"Hoang-Le Minh ,&nbsp;Thanh Sang-To ,&nbsp;Magd Abdel Wahab ,&nbsp;Thanh Cuong-Le","doi":"10.1016/j.knosys.2022.109189","DOIUrl":null,"url":null,"abstract":"<div><p><span><span>This paper develops a new metaheuristic optimization algorithm<span><span><span> named K-means Optimizer (KO) to solve a wide range of optimization problems<span> from numerical functions to real-design challenges. First, the centroid vectors of clustering regions are established at each iteration using K-means algorithm, then KO proposes two movement strategies to create a balance between the ability of exploitation and exploration. The decision on the movement strategy for exploration or exploitation at each iteration depends on a parameter that will be designed to recognize if each search agent is too long in the region visited with no self-improvement. To demonstrate the effectiveness and reliability of KO, twenty-three classical </span></span>benchmark functions<span>, CEC2005 and CEC2014 benchmark functions, are employed as a first example and compared with other algorithms. Then, three well-known engineering problems are also considered and their results are compared to the results obtained by the other algorithms. Finally, KO is applied to structural damage identification (SDI) problem of a complex 3D concrete structure including seven stories building having a 25.2 m total height. For this purpose, SAP2000 is used to solve the </span></span>finite element<span><span> (FE) model of this structure. Then, for the first time, we successfully developed a sub-program that allows two-way data exchange between SAP2000 and MATLAB through the Open </span>Application Programming Interface (OAPI) library to update the FE model. From the results, we found that KO has the best performance for the considered benchmark functions based on the Wilcoxon rank-sum test and Friedman ranking test. The results obtained in this work have proved the effectiveness and reliability of KO in solving optimization problems, especially for SDI. </span></span></span>Source codes of KO is publicly available at </span><span>http://goldensolutionrs.com/codes.html</span><svg><path></path></svg>.</p></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"251 ","pages":"Article 109189"},"PeriodicalIF":7.2000,"publicationDate":"2022-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"30","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Knowledge-Based Systems","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0950705122005913","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 30

Abstract

This paper develops a new metaheuristic optimization algorithm named K-means Optimizer (KO) to solve a wide range of optimization problems from numerical functions to real-design challenges. First, the centroid vectors of clustering regions are established at each iteration using K-means algorithm, then KO proposes two movement strategies to create a balance between the ability of exploitation and exploration. The decision on the movement strategy for exploration or exploitation at each iteration depends on a parameter that will be designed to recognize if each search agent is too long in the region visited with no self-improvement. To demonstrate the effectiveness and reliability of KO, twenty-three classical benchmark functions, CEC2005 and CEC2014 benchmark functions, are employed as a first example and compared with other algorithms. Then, three well-known engineering problems are also considered and their results are compared to the results obtained by the other algorithms. Finally, KO is applied to structural damage identification (SDI) problem of a complex 3D concrete structure including seven stories building having a 25.2 m total height. For this purpose, SAP2000 is used to solve the finite element (FE) model of this structure. Then, for the first time, we successfully developed a sub-program that allows two-way data exchange between SAP2000 and MATLAB through the Open Application Programming Interface (OAPI) library to update the FE model. From the results, we found that KO has the best performance for the considered benchmark functions based on the Wilcoxon rank-sum test and Friedman ranking test. The results obtained in this work have proved the effectiveness and reliability of KO in solving optimization problems, especially for SDI. Source codes of KO is publicly available at http://goldensolutionrs.com/codes.html.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种新的基于K-means聚类算法的元启发式优化及其在结构损伤识别中的应用
本文开发了一种新的元启发式优化算法K-means Optimizer(KO),以解决从数值函数到实际设计挑战的一系列优化问题。首先,使用K-means算法在每次迭代时建立聚类区域的质心向量,然后KO提出了两种移动策略,以在开发和探索能力之间建立平衡。在每次迭代中,关于探索或利用的移动策略的决定取决于一个参数,该参数将被设计为识别每个搜索代理在访问的区域中是否太长而没有自我完善。为了证明KO算法的有效性和可靠性,首先以CEC2005和CEC2014这23个经典的基准函数为例,并与其他算法进行了比较。然后,还考虑了三个著名的工程问题,并将它们的结果与其他算法的结果进行了比较。最后,将KO应用于复杂三维混凝土结构的结构损伤识别(SDI)问题,该问题包括总高度为25.2m的七层建筑。为此,SAP2000用于求解该结构的有限元模型。然后,我们首次成功地开发了一个子程序,该子程序允许SAP2000和MATLAB之间通过开放应用程序编程接口(OAPI)库进行双向数据交换,以更新有限元模型。从结果中,我们发现基于Wilcoxon秩和检验和Friedman秩检验,对于所考虑的基准函数,KO具有最好的性能。这项工作的结果证明了KO在解决优化问题方面的有效性和可靠性,特别是对于SDI。KO的源代码可在http://goldensolutionrs.com/codes.html.
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Knowledge-Based Systems
Knowledge-Based Systems 工程技术-计算机:人工智能
CiteScore
14.80
自引率
12.50%
发文量
1245
审稿时长
7.8 months
期刊介绍: Knowledge-Based Systems, an international and interdisciplinary journal in artificial intelligence, publishes original, innovative, and creative research results in the field. It focuses on knowledge-based and other artificial intelligence techniques-based systems. The journal aims to support human prediction and decision-making through data science and computation techniques, provide a balanced coverage of theory and practical study, and encourage the development and implementation of knowledge-based intelligence models, methods, systems, and software tools. Applications in business, government, education, engineering, and healthcare are emphasized.
期刊最新文献
Progressive de-preference task-specific processing for generalizable person re-identification GKA-GPT: Graphical knowledge aggregation for multiturn dialog generation A novel spatio-temporal feature interleaved contrast learning neural network from a robustness perspective PSNet: A non-uniform illumination correction method for underwater images based pseudo-siamese network A novel domain-private-suppress meta-recognition network based universal domain generalization for machinery fault diagnosis
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1