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

On the Training Algorithms for Artificial Neural Network in Predicting the Shear Strength of Deep Beams

Author

Listed:
  • Thuy-Anh Nguyen
  • Hai-Bang Ly
  • Hai-Van Thi Mai
  • Van Quan Tran
  • Zhen Zhang

Abstract

This study aims to predict the shear strength of reinforced concrete (RC) deep beams based on artificial neural network (ANN) using four training algorithms, namely, Levenberg–Marquardt (ANN-LM), quasi-Newton method (ANN-QN), conjugate gradient (ANN-CG), and gradient descent (ANN-GD). A database containing 106 results of RC deep beam shear strength tests is collected and used to investigate the performance of the four proposed algorithms. The ANN training phase uses 70% of data, randomly taken from the collected dataset, whereas the remaining 30% of data are used for the algorithms’ evaluation process. The ANN structure consists of an input layer with 9 neurons corresponding to 9 input parameters, a hidden layer of 10 neurons, and an output layer with 1 neuron representing the shear strength of RC deep beams. The performance evaluation of the models is performed using statistical criteria, including the correlation coefficient (R), root mean square error (RMSE), mean absolute error (MAE), and mean absolute percentage error (MAPE). The results show that the ANN-CG model has the best prediction performance with R = 0.992, RMSE = 14.02, MAE = 14.24, and MAPE = 6.84. The results of this study show that the ANN-CG model can accurately predict the shear strength of RC deep beams, representing a promising and useful alternative design solution for structural engineers.

Suggested Citation

  • Thuy-Anh Nguyen & Hai-Bang Ly & Hai-Van Thi Mai & Van Quan Tran & Zhen Zhang, 2021. "On the Training Algorithms for Artificial Neural Network in Predicting the Shear Strength of Deep Beams," Complexity, Hindawi, vol. 2021, pages 1-18, May.
  • Handle: RePEc:hin:complx:5548988
    DOI: 10.1155/2021/5548988
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/5548988.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/5548988.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/5548988?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:complx:5548988. 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.