IDEAS home Printed from https://ideas.repec.org/a/sae/risrel/v239y2025i1p55-67.html
   My bibliography  Save this article

Bearing remaining useful life prediction with an improved CNN-LSTM network using an artificial gorilla troop optimization algorithm

Author

Listed:
  • Yonghua Li
  • Zhe Chen
  • Chaoqun Hu
  • Xing Zhao

Abstract

To address the problem of reliance on a priori knowledge and difficult hyperparameter selection in feature fusion. The effect of different convolutional kernel sizes and filters on feature fusion is investigated firstly, based on which an artificial Gorilla Troops Optimizer (GTO) enhanced Convolutional Long-Short Term Memory Neural Network (CNN-LSTM) method for bearing lifetime prediction is suggested. The GTO algorithm was used to optimize hyperparameters such as the convolutional kernel size of CNN-LSTM, filters and pooling layer size, batch size, number of hidden layer neurons, and rate of learning with the goal of minimizing the mean squared error of the remaining useful life (RUL) prediction. From the optimized CNN-LSTM network analyze the monitored performance degradation data, construct health indicators (HI) reflecting bearing degradation, and build the remaining bearing life prediction model. Typical life cycle data has been used for the validation of the proposed method. The results indicate that the health indicators have better trending and robustness, and leading to smaller errors in life prediction outcomes.

Suggested Citation

  • Yonghua Li & Zhe Chen & Chaoqun Hu & Xing Zhao, 2025. "Bearing remaining useful life prediction with an improved CNN-LSTM network using an artificial gorilla troop optimization algorithm," Journal of Risk and Reliability, , vol. 239(1), pages 55-67, February.
  • Handle: RePEc:sae:risrel:v:239:y:2025:i:1:p:55-67
    DOI: 10.1177/1748006X231222397
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1748006X231222397
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1748006X231222397?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
    ---><---

    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:risrel:v:239:y:2025:i:1:p:55-67. 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.