IDEAS home Printed from https://ideas.repec.org/a/wsi/srlxxx/v27y2020i08ns0218625x19501944.html
   My bibliography  Save this article

Optimized Deep Learning With Opposition-Based Ant Lion Approach For Crack Identification Of Thick Beams

Author

Listed:
  • DASARIPALLE PITCHAIAH

    (Research Scholar, Andhra University, Visakhapatnam, Andhra Pradesh, India)

  • PUTTI SRINIVASA RAO

    (Professor, Department of Mechanical Engineering, Andhra University, Visakhapatnam, Andhra Pradesh, India)

Abstract

Crack identification in thick beams has improved increasing considerations from the scientific and building areas since the unpredicted structural failure may cause disastrous, catastrophic and life trouble. The goal of the present examination is to predict the unknown crack location and its depth in thick beams from the information of frequency data obtained from experimental examination. The effectiveness of the proposed strategy is approved by numerical simulations in view of experimental data for a cantilever beam, free-free beam and simply supported beam. With the improvements in delicate figuring, optimization strategies are acknowledged to be an extremely proficient instrument to offer an answer for crack identification issue. In the simulation modeling, the parameters, for example, shift; modal assurance criterion (MAC) and stiffness, are predicted by utilizing optimized deep learning neural network (ODNN) approach in view of crack location and size. To improve the weight in DLNN, the opposition-based ant lion (OAL) is used by minimizing the mean square error (MSE) rate. The result shows that the proposed model achieves the optimal performance compared with existing techniques.

Suggested Citation

  • Dasaripalle Pitchaiah & Putti Srinivasa Rao, 2020. "Optimized Deep Learning With Opposition-Based Ant Lion Approach For Crack Identification Of Thick Beams," Surface Review and Letters (SRL), World Scientific Publishing Co. Pte. Ltd., vol. 27(08), pages 1-10, August.
    • Handle: RePEc:wsi:srlxxx:v:27:y:2020:i:08:n:s0218625x19501944
    DOI: 10.1142/S0218625X19501944
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0218625X19501944
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0218625X19501944?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:wsi:srlxxx:v:27:y:2020:i:08:n:s0218625x19501944. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/srl/srl.shtml .

    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.