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

Short-Term Wind Speed Forecasting Based on Ensemble Online Sequential Extreme Learning Machine and Bayesian Optimization

Author

Listed:
  • Jicheng Quan
  • Li Shang

Abstract

Short-term wind speed forecasting is crucial to the utilization of wind energy, and it has been employed widely in turbine regulation, electricity market clearing, and preload sharing. However, the wind speed has inherent fluctuation, and accurate wind speed prediction is challenging. This paper aims to propose a hybrid forecasting approach of short-term wind speed based on a novel signal processing algorithm, a wrapper-based feature selection method, the state-of-art optimization algorithm, ensemble learning, and an efficient artificial neural network. Variational mode decomposition (VMD) is employed to decompose the original wind time-series into sublayer modes. The binary bat algorithm (BBA) is used to complete the feature selection. Bayesian optimization (BO) fine-tuned online sequential extreme learning machine (OSELM) is proposed to forecast the low-frequency sublayers of VMD. Bagging-based ensemble OSELM is proposed to forecast high-frequency sublayers of VMD. Two experiments were conducted on 10 min datasets from the National Renewable Energy Laboratory (NREL). The performances of the proposed model were compared with various representative models. The experimental results indicate that the proposed model has better accuracy than the comparison models. Among the thirteen models, the proposed VMD-BBA-EnsOSELM model can obtain the best prediction accuracy, and the mean absolute percent error (MAPE) is always less than 0.09.

Suggested Citation

  • Jicheng Quan & Li Shang, 2020. "Short-Term Wind Speed Forecasting Based on Ensemble Online Sequential Extreme Learning Machine and Bayesian Optimization," Mathematical Problems in Engineering, Hindawi, vol. 2020, pages 1-13, November.
  • Handle: RePEc:hin:jnlmpe:7212368
    DOI: 10.1155/2020/7212368
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2020/7212368.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2020/7212368.xml
    Download Restriction: no

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