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

An Improved Self-Organizing Migration Algorithm for Short-Term Load Forecasting with LSTM Structure Optimization

Author

Listed:
  • Xiaofeng Rong
  • Hanghang Zhou
  • Zijian Cao
  • Chang Wang
  • Linjuan Fan
  • Junwei Ma

Abstract

Establishing an accurate and robust short-term load forecasting (STLF) model for a power system in safe operation and rational dispatching is both required and beneficial. Although deep long short-term memory (LSTM) networks have been widely used in load forecasting applications, it still has some problems to optimize, such as unstable network performance and long optimization time. This study proposes an adaptive step size self-organizing migration algorithm (AS-SOMA) to improve the predictive performance of LSTM. First, an optimization model for LSTM prediction is developed, which divides the LSTM structure seeking into two stages. One is the optimization of the number of hidden layer layers, and the other optimizes the number of neurons, time step, learning rate, epochs, and batch size. Then, a logistic chaotic mapping and an adaptive step size method were proposed to overcome slow convergence problems and stacking into local optimum of SOMA. Comparison experiments with SOMA, PSO, CPSO, LSOMA, and OSMA on test function sets show the advantages of the improved algorithm. Finally, the AS-SOMA-LSTM network prediction model is used to solve the STLF problem to verify the effectiveness of the proposed algorithm. Simulation experiments show that the AS-SOMA exhibits higher accuracy and convergence speed on the standard test function set and has strong prediction ability in STLF application with LSTM.

Suggested Citation

  • Xiaofeng Rong & Hanghang Zhou & Zijian Cao & Chang Wang & Linjuan Fan & Junwei Ma, 2022. "An Improved Self-Organizing Migration Algorithm for Short-Term Load Forecasting with LSTM Structure Optimization," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-18, December.
  • Handle: RePEc:hin:jnlmpe:6811401
    DOI: 10.1155/2022/6811401
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2022/6811401.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2022/6811401.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/6811401?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:6811401. 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.