IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v9y2013i12p361594.html
   My bibliography  Save this article

Optimal Sensor Placement for Stay Cable Damage Identification of Cable-Stayed Bridge under Uncertainty

Author

Listed:
  • Li-Qun Hou
  • Xue-Feng Zhao
  • Rui-Cong Han

Abstract

Large cable-stayed bridges utilize hundreds of stay cables. Thus, placing a sensor on every stay cable of bridges for stay cable damage identification (SCDI) is costly and, in most cases, not necessary. Optimal sensor placement is a significant and critical issue for SCDI. This paper proposes the criteria for sensor quantity and location optimization for SCDI on the basis of the concept of damage identification reliability index ( DIRI ) under uncertainty. Random elimination (RE) algorithm and heuristic random elimination (HRE) algorithm are proposed to solve the sensor quantity optimization calculation problem. Multistage global optimization (MGO) algorithm is also proposed to solve the sensor location optimization calculation problem. A case study is conducted to evaluate and verify the criteria and algorithms. Results indicate that the HRE algorithm can provide better solution with less elapsed time than the RE algorithm can in some cases, and the MGO algorithm can meet the multistage criterion for sensor location optimization and give a satisfying optimized solution. Theoretical analysis and case study results confirm that the criteria are reasonable and suitable for optimal sensor placement for SCDI. The proposed algorithms are effective and efficient for practical optimization calculation.

Suggested Citation

  • Li-Qun Hou & Xue-Feng Zhao & Rui-Cong Han, 2013. "Optimal Sensor Placement for Stay Cable Damage Identification of Cable-Stayed Bridge under Uncertainty," International Journal of Distributed Sensor Networks, , vol. 9(12), pages 361594-3615, December.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:12:p:361594
    DOI: 10.1155/2013/361594
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/361594
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/361594?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:9:y:2013:i:12:p:361594. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.