IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v14y2022i17p10779-d901248.html
   My bibliography  Save this article

Short-Term Interval Prediction of Wind Power Based on KELM and a Universal Tabu Search Algorithm

Author

Listed:
  • Qiang Zhou

    (College of Electrical Engineering, Zhejiang University, Hangzhou 310027, China
    Gansu Key Laboratory of Renewable Energy Integration Operation and Control, State Grid Gansu Electric Power Research Institute, Lanzhou 730070, China)

  • Yanhong Ma

    (Gansu Key Laboratory of Renewable Energy Integration Operation and Control, State Grid Gansu Electric Power Corporation, Lanzhou 730070, China)

  • Qingquan Lv

    (Gansu Key Laboratory of Renewable Energy Integration Operation and Control, State Grid Gansu Electric Power Corporation, Lanzhou 730070, China)

  • Ruixiao Zhang

    (Gansu Key Laboratory of Renewable Energy Integration Operation and Control, State Grid Gansu Electric Power Research Institute, Lanzhou 730070, China)

  • Wei Wang

    (College of Electrical Engineering, Zhejiang University, Hangzhou 310027, China)

  • Shiyou Yang

    (College of Electrical Engineering, Zhejiang University, Hangzhou 310027, China)

Abstract

Installed wind power has significantly grown in recent years to synchronize with the ever-increasing demand for environment-friendly and renewable energy. However, wind energy has significant uncertainty or random futures, and will give rise to destructive effects on the safety operations of the power system. In this respect, an accurate and reliable wind power prediction is of great significance for improving the power system stability and optimizing the dispatch plan. Compared with traditionally deterministic point forecast techniques, probabilistic forecasting approaches can provide more stochastic information to quantify the random characteristics of wind power and to estimate its impacts on the power system. Moreover, the interval of the output power is a key stochastic information on wind power. In general, an interval prediction needs to compromise the calibration and the average width of the predicted interval. To find the best combination of these two metrics, a methodology based on a kernel extreme learning machine (KELM) and an improved universal tabu search algorithm is proposed. In the proposed methodology, to eliminate the inherent randomness on the weights between the input and hidden lays in the commonly used extreme learning machine, a radial-basis-function-based kernel extreme learning machine is proposed, and an improved tabu search method is introduced to optically compromise the calibration and the average width of the predicted interval to overcome the deficiency of existing algorithms, such as the insufficient global search ability of a particle swarm optimization. A prototype wind farm is utilized as a case study to verify the efficiency and advantage of the proposed methodology.

Suggested Citation

  • Qiang Zhou & Yanhong Ma & Qingquan Lv & Ruixiao Zhang & Wei Wang & Shiyou Yang, 2022. "Short-Term Interval Prediction of Wind Power Based on KELM and a Universal Tabu Search Algorithm," Sustainability, MDPI, vol. 14(17), pages 1-12, August.
  • Handle: RePEc:gam:jsusta:v:14:y:2022:i:17:p:10779-:d:901248
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/14/17/10779/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/14/17/10779/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Wei Wang & Shiyou Yang & Yankun Yang, 2022. "An Improved Data-Efficiency Algorithm Based on Combining Isolation Forest and Mean Shift for Anomaly Data Filtering in Wind Power Curve," Energies, MDPI, vol. 15(13), pages 1-12, July.
    2. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    3. Álvaro Lorca & X. Andy Sun & Eugene Litvinov & Tongxin Zheng, 2016. "Multistage Adaptive Robust Optimization for the Unit Commitment Problem," Operations Research, INFORMS, vol. 64(1), pages 32-51, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wen-Chang Tsai & Chih-Ming Hong & Chia-Sheng Tu & Whei-Min Lin & Chiung-Hsing Chen, 2023. "A Review of Modern Wind Power Generation Forecasting Technologies," Sustainability, MDPI, vol. 15(14), pages 1-40, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Marianov, Vladimir & Serra, Daniel & ReVelle, Charles, 1999. "Location of hubs in a competitive environment," European Journal of Operational Research, Elsevier, vol. 114(2), pages 363-371, April.
    2. Chiara Gruden & Irena Ištoka Otković & Matjaž Šraml, 2020. "Neural Networks Applied to Microsimulation: A Prediction Model for Pedestrian Crossing Time," Sustainability, MDPI, vol. 12(13), pages 1-22, July.
    3. Chou, Jui-Sheng & Truong, Dinh-Nhat, 2021. "A novel metaheuristic optimizer inspired by behavior of jellyfish in ocean," Applied Mathematics and Computation, Elsevier, vol. 389(C).
    4. Thibaud Deguilhem & Juliette Schlegel & Jean-Philippe Berrou & Ousmane Djibo & Alain Piveteau, 2024. "Too many options: How to identify coalitions in a policy network?," Post-Print hal-04689665, HAL.
    5. Anurag Agarwal, 2009. "Theoretical insights into the augmented-neural-network approach for combinatorial optimization," Annals of Operations Research, Springer, vol. 168(1), pages 101-117, April.
    6. Helena Ramalhinho-Lourenço & Olivier C. Martin & Thomas Stützle, 2000. "Iterated local search," Economics Working Papers 513, Department of Economics and Business, Universitat Pompeu Fabra.
    7. Marti, Rafael, 1998. "A tabu search algorithm for the bipartite drawing problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 558-569, April.
    8. Mohammad Javad Feizollahi & Igor Averbakh, 2014. "The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 321-335, May.
    9. Gauvin, Charles & Delage, Erick & Gendreau, Michel, 2017. "Decision rule approximations for the risk averse reservoir management problem," European Journal of Operational Research, Elsevier, vol. 261(1), pages 317-336.
    10. Nha Vo‐Thanh & Hans‐Peter Piepho, 2023. "Generating designs for comparative experiments with two blocking factors," Biometrics, The International Biometric Society, vol. 79(4), pages 3574-3585, December.
    11. Zhang, Gaohang & Li, Fengting & Wang, Sen & Yin, Chunya, 2023. "Robust low-carbon energy and reserve scheduling considering operational risk and flexibility improvement," Energy, Elsevier, vol. 284(C).
    12. Сластников С.А., 2014. "Применение Метаэвристических Алгоритмов Для Задачи Маршрутизации Транспорта," Журнал Экономика и математические методы (ЭММ), Центральный Экономико-Математический Институт (ЦЭМИ), vol. 50(1), pages 117-126, январь.
    13. Hanafi, Said & Freville, Arnaud, 1998. "An efficient tabu search approach for the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 659-675, April.
    14. Grolimund, Stephan & Ganascia, Jean-Gabriel, 1997. "Driving Tabu Search with case-based reasoning," European Journal of Operational Research, Elsevier, vol. 103(2), pages 326-338, December.
    15. repec:dar:wpaper:62383 is not listed on IDEAS
    16. Minghe Sun, 2007. "A Primogenitary Linked Quad Tree Approach for Solution Storage and Retrieval in Heuristic Binary Optimization," Working Papers 0009, College of Business, University of Texas at San Antonio.
    17. Bolte, Andreas & Thonemann, Ulrich Wilhelm, 1996. "Optimizing simulated annealing schedules with genetic programming," European Journal of Operational Research, Elsevier, vol. 92(2), pages 402-416, July.
    18. Jack Brimberg & Pierre Hansen & Nenad Mladenović & Eric D. Taillard, 2000. "Improvements and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem," Operations Research, INFORMS, vol. 48(3), pages 444-460, June.
    19. Deng, Ye & Wu, Jun & Tan, Yue-jin, 2016. "Optimal attack strategy of complex networks based on tabu search," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 442(C), pages 74-81.
    20. Guigues, Vincent & Juditsky, Anatoli & Nemirovski, Arkadi, 2021. "Constant Depth Decision Rules for multistage optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 295(1), pages 223-232.
    21. Drexl, Andreas & Haase, Knut, 1996. "Fast approximation methods for sales force deployment," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 411, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    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:gam:jsusta:v:14:y:2022:i:17:p:10779-:d:901248. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.