IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/1964165.html
   My bibliography  Save this article

Reliability Evaluation of Bridges Based on Nonprobabilistic Response Surface Limit Method

Author

Listed:
  • Xuyong Chen
  • Qian Chen
  • Xiaoya Bian
  • Jianping Fan

Abstract

Due to many uncertainties in nonprobabilistic reliability assessment of bridges, the limit state function is generally unknown. The traditional nonprobabilistic response surface method is a lengthy and oscillating iteration process and leads to difficultly solving the nonprobabilistic reliability index. This article proposes a nonprobabilistic response surface limit method based on the interval model. The intention of this method is to solve the upper and lower limits of the nonprobabilistic reliability index and to narrow the range of the nonprobabilistic reliability index. If the range of the reliability index reduces to an acceptable accuracy, the solution will be considered convergent, and the nonprobabilistic reliability index will be obtained. The case study indicates that using the proposed method can avoid oscillating iteration process, make iteration process stable and convergent, reduce iteration steps significantly, and improve computational efficiency and precision significantly compared with the traditional nonprobabilistic response surface method. Finally, the nonprobabilistic reliability evaluation process of bridge will be built through evaluating the reliability of one PC continuous rigid frame bridge with three spans using the proposed method, which appears to be more simple and reliable when lack of samples and parameters in the bridge nonprobabilistic reliability evaluation is present.

Suggested Citation

  • Xuyong Chen & Qian Chen & Xiaoya Bian & Jianping Fan, 2017. "Reliability Evaluation of Bridges Based on Nonprobabilistic Response Surface Limit Method," Mathematical Problems in Engineering, Hindawi, vol. 2017, pages 1-10, December.
  • Handle: RePEc:hin:jnlmpe:1964165
    DOI: 10.1155/2017/1964165
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2017/1964165.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2017/1964165.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2017/1964165?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:hin:jnlmpe:1964165. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.