首页> 外文会议>International Conference on Recent Developments in Control, Automation and Power Engineering >A generalized bus dependency matrix based centrality measures for reactive power compensation
【24h】

A generalized bus dependency matrix based centrality measures for reactive power compensation

机译:基于广义总线依赖矩阵的无功补偿集中度度量

获取原文

摘要

Introduction of deregulation in electricity market and addition of more renewable energy generation plants in distribution end have made electrical power system vulnerable. Increased loads and generation increases the load of individual lines and hence congestion management is required. “Centrality” is the fundamental concept in network and it is based on complex graph theory. “Electrical centrality measures” are used for vulnerability analysis of electrical networks and other issues like analysis of blackouts etc. Voltage control and reactive power management are two important aspects of power system on which reliability of electrical transmission network depends. In this paper, a graph theory based bus dependency matrix is proposed which is used to find out electrical closeness centrality and electrical betweenness centrality for any generalized electrical network in which shortest path between two buses may consist multiple intermediate buses. The proposed algorithm starts with power flow results and the shortest path is searched by using Johnson's algorithm and impedance is used as weights of the paths. The applicability of proposed algorithm is demonstrated for finding centrality indices of different test systems and then centrality index is used as an for managing reactive power at different buses for minimizing losses.
机译:电力市场放宽管制,配电端增加了更多可再生能源发电厂,使电力系统变得脆弱。增加的负荷和发电量会增加单个线路的负荷,因此需要进行拥塞管理。 “中心性”是网络中的基本概念,它基于复杂图论。 “电气集中度度量”用于电网的脆弱性分析以及诸如停电分析之类的其他问题。电压控制和无功功率管理是输电网络可靠性所依赖的电力系统的两个重要方面。在本文中,提出了一种基于图论的总线相关性矩阵,该矩阵用于找出其中两个总线之间的最短路径可能包含多个中间总线的任何广义电网的电气接近性中心和电气中间性中心性。所提出的算法从潮流结果开始,并使用约翰逊算法搜索最短路径,并将阻抗用作路径的权重。证明了所提出算法的适用性,可以找到不同测试系统的集中度指标,然后将集中度指标用作管理不同总线上的无功功率以最小化损耗的方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号