Optimal sensor placement for health monitoring of high-rise structure using adaptive monkey algorithm

Summary Optimal sensor placement is a challenging task in the design of an effective structural health monitoring system. In this paper, a novel optimal sensor placement algorithm, called adaptive monkey algorithm (AMA), to cope with the sensor placement problem for target location under constraints...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Structural control and health monitoring Jg. 22; H. 4; S. 667 - 681
Hauptverfasser: Yi, Ting-Hua, Li, Hong-Nan, Song, Gangbing, Zhang, Xu-Dong
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Pavia Blackwell Publishing Ltd 01.04.2015
John Wiley & Sons, Inc
Schlagworte:
ISSN:1545-2255, 1545-2263
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Summary Optimal sensor placement is a challenging task in the design of an effective structural health monitoring system. In this paper, a novel optimal sensor placement algorithm, called adaptive monkey algorithm (AMA), to cope with the sensor placement problem for target location under constraints of the computing efficiency and convergence stability is proposed. The dual‐structure coding method, instead of the traditional coding method, is adopted to code the solution. The adaptive operator is designed and implemented in the AMA, which provides an automatic technique for adjusting the climb process and watch–jump process of the monkey algorithm according to the observed performance while the search is ongoing. Two new somersault processes, i.e., reflection somersault process and mutation somersault process, are incorporated in the AMA to strengthen its global search ability. Numerical experiments involving two high‐rise structures have been carried out to evaluate the performance of the proposed AMA algorithm. The results demonstrated that the innovations in the AMA make it outperform the other algorithms in most cases in terms of less iterations and generating more stable optimal solutions. This algorithm can also be easily applied to other discrete optimization problems. Copyright © 2014 John Wiley & Sons, Ltd.
Bibliographie:National Natural Science Foundation - No. grant nos. 51222806 and 51121005
istex:48EA8D5BDA0CE963B6FD92C2A69AA5011097E33E
ark:/67375/WNG-G70M6866-6
Fok Ying Tong Education Foundation - No. 141072
ArticleID:STC1708
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1545-2255
1545-2263
DOI:10.1002/stc.1708