Wind Power Scenario Reduction Based on Improved K-means Clustering and SBR Algorithm

被引:0
|
作者
Zhao, Shuqiang [1 ]
Yao, Jinming [1 ]
Li, Zhiwei [1 ]
机构
[1] State Key Laboratory of Alternate Electrical Power System With Renewable Energy Sources, North China Electric Power University, Baoding,071003, China
来源
关键词
Reduction - Wind power - Gaussian distribution;
D O I
10.13335/j.1000-3673.pst.2020.2013
中图分类号
学科分类号
摘要
The scenario method is important in the adaptation of the optimal dispatch of the power system with a high proportion of wind power. As a research hotspot of scenario analysis methods, the significance of scenario reduction is to describe a large number of complex scenario features with a small number of representative scenarios to achieve the purpose of reducing computational complexity. Aiming at the wind power output, a scenario reduction method based on the combination of the improved K-means clustering and the Simultaneous Backward Reduction (SBR) is proposed. Firstly, the original scenarios are quickly classified based on the improved K-means clustering algorithm. Secondly, the SBR algorithm considering Kantorovich distance is used to reduce the scenario sets in each cluster. Finally, an empirical analysis is carried out using the actual data from a certain province in Northwest China. The effectiveness and superiority of the proposed scenario reduction method are verified with the Brier Score (BS) indicator and the Gaussian mixture model of wind power fluctuations. © 2021, Power System Technology Press. All right reserved.
引用
收藏
页码:3947 / 3954
相关论文
共 50 条
  • [1] Research on k-means Clustering Algorithm An Improved k-means Clustering Algorithm
    Shi Na
    Liu Xumin
    Guan Yong
    [J]. 2010 THIRD INTERNATIONAL SYMPOSIUM ON INTELLIGENT INFORMATION TECHNOLOGY AND SECURITY INFORMATICS (IITSI 2010), 2010, : 63 - 67
  • [2] Clustering of Typical Wind Power Scenarios Based on K-Means Clustering Algorithm and Improved Artificial Bee Colony Algorithm
    Yao, Gang
    Wu, Yang
    Huang, Xiaoxu
    Ma, Qinfeng
    Du, Jiang
    [J]. IEEE ACCESS, 2022, 10 : 98752 - 98760
  • [3] An Improved K-means Clustering Algorithm
    Wang Yintong
    Li Wanlong
    Gao Rujia
    [J]. 2012 WORLD AUTOMATION CONGRESS (WAC), 2012,
  • [4] Improved K-means clustering algorithm
    Zhang, Zhe
    Zhang, Junxi
    Xue, Huifeng
    [J]. CISP 2008: FIRST INTERNATIONAL CONGRESS ON IMAGE AND SIGNAL PROCESSING, VOL 5, PROCEEDINGS, 2008, : 169 - 172
  • [5] A Clustering K-means Algorithm Based on Improved PSO Algorithm
    Tan, Long
    [J]. 2015 FIFTH INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS AND NETWORK TECHNOLOGIES (CSNT2015), 2015, : 940 - 944
  • [6] Improved Algorithm for the k-means Clustering
    Zhang, Sheng
    Wang, Shouqiang
    [J]. PROCEEDINGS OF THE 10TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA 2012), 2012, : 4717 - 4720
  • [7] An Improved K-means Clustering Algorithm Based on Dissimilarity
    Wang Shunye
    [J]. PROCEEDINGS 2013 INTERNATIONAL CONFERENCE ON MECHATRONIC SCIENCES, ELECTRIC ENGINEERING AND COMPUTER (MEC), 2013, : 2629 - 2633
  • [8] Improved PBFT Algorithm Based on K-Means Clustering for Emergency Scenario Swarm Robotic Systems
    Sun, Yi
    Fan, Ying
    [J]. IEEE ACCESS, 2023, 11 : 121753 - 121765
  • [9] A Nonuniform Clustering Routing Algorithm Based on an Improved K-Means Algorithm
    Tang, Xinliang
    Zhang, Man
    Yu, Pingping
    Liu, Wei
    Cao, Ning
    Xu, Yunfeng
    [J]. CMC-COMPUTERS MATERIALS & CONTINUA, 2020, 64 (03): : 1725 - 1739
  • [10] Improved rough K-means clustering algorithm based on firefly algorithm
    Ye, Tingyu
    Ye, Jun
    Wang, Lei
    [J]. INTERNATIONAL JOURNAL OF COMPUTING SCIENCE AND MATHEMATICS, 2023, 17 (01) : 1 - 12