王世君, 夏革非, 陈广宇, 李磐旎, 吴乃月. 一种考虑线损最优的配电网新能源聚类规划方法[J]. 电网与清洁能源, 2021, 37(2): 132-138.
引用本文: 王世君, 夏革非, 陈广宇, 李磐旎, 吴乃月. 一种考虑线损最优的配电网新能源聚类规划方法[J]. 电网与清洁能源, 2021, 37(2): 132-138.
WANG Shijun, XIA Gefei, CHEN Guangyu, LI Panni, WU Naiyue. A Distributed Generation Planning Method for Distribution Network Based on k-medoid Clustering[J]. Power system and Clean Energy, 2021, 37(2): 132-138.
Citation: WANG Shijun, XIA Gefei, CHEN Guangyu, LI Panni, WU Naiyue. A Distributed Generation Planning Method for Distribution Network Based on k-medoid Clustering[J]. Power system and Clean Energy, 2021, 37(2): 132-138.

一种考虑线损最优的配电网新能源聚类规划方法

A Distributed Generation Planning Method for Distribution Network Based on k-medoid Clustering

  • 摘要: 当前以风电、光伏为代表的分布式电源在配电网中的占比越来越大,其对电网规划的合理性及可靠性也提出了较高要求。该文提出一种基于k-medoid聚类的配电网分布式发电规划方法,采用轮廓系数法确定最优的聚类个数,以配电网线损最优为优化目标,以配电网线损灵敏度因子作为聚类特性指标,得到分布式发电最优规划位置;并提出基于节点有功变化的部分线损计算策略以获得分布式发电的最优规划容量。最后,以IEEE33节点系统作为测试系统进行了分析。结果表明,所提方法不仅具有较高的计算效率,同时能够一次性给出多个特征指标下的综合最优接入方案,具有较强的实用性。

     

    Abstract: As the proportion of distributed generation represented by wind power and photovoltaic power in the distribution network keeps increasing, there are higher requirements for the rationality and reliability of power grid planning. This paper proposes a distributed generation planning method based on k-medoid clustering. The optimal planning location of distributed generation is obtained by taking the optimal line loss of distribution network as the optimization objective,and the grid loss sensitivity factor and node voltage level as clustering characteristic indexes. The optimal planning capacity of the multiple distributed generation is obtained using partial line loss calculation strategy based on branch current variation. Finally,an IEEE 33 bus system is used as the test system. The results show that the proposed method not only has high computational efficiency,but also can give the comprehensive optimal access scheme under multiple characteristic indexes at one time,thus it has strong practicability.

     

/

返回文章
返回