论文标题

基于图理论的分布式网格恢复

Distributed Grid restoration based on graph theory

论文作者

Sinha, Ayush, Chakrabarti, Sourin, Vyas, O. P.

论文摘要

随着智能网格作为跨区域分配的主要手段的出现,提高其对故障和不幸的韧性的重要性正在增加。分配系统的可靠性取决于其对攻击的容忍度以及发生攻击后的恢复效率。本文提出了一种独特的方法,可以使冒犯者在攻击下恢复智能电网,或者是由于与主发电机和分布式发电机(DGS)的最佳岛屿通过自然灾害所致,以最大程度地减少所需的载荷量,并同时通过图形理论最大程度地减少开关操作数量。在第一阶段计算需要脱掉的最小负载,然后选择需要省负载以实现这种配置的节点,然后最终得出实现配置所需的切换操作的顺序。针对标准IEEE 37-BUS和1069-BUS网格系统进行了测试,以及最小负载以及测序步骤,以实现最佳配置和实现此类配置的时间,这表明了该方法与现有方法相比的有效性。此外,可以轻松地修改所提出的算法,以合并由于网格的任何操作配置而可能出现的任何其他约束。

With the emergence of smart grids as the primary means of distribution across wide areas, the importance of improving its resilience to faults and mishaps is increasing. The reliability of a distribution system depends upon its tolerance to attacks and the efficiency of restoration after an attack occurs. This paper proposes a unique approach to the restoration of smart grids under attack by impostors or due to natural calamities via optimal islanding of the grid with primary generators and distributed generators(DGs) into sub-grids minimizing the amount of load shed which needs to be incurred and at the same time minimizing the number of switching operations via graph theory. The minimum load which needs to be shed is computed in the first stage followed by selecting the nodes whose load needs to be shed to achieve such a configuration and then finally deriving the sequence of switching operations required to achieve the configuration. The proposed method is tested against standard IEEE 37-bus and a 1069-bus grid system and the minimum load shed along with the sequencing steps to optimal configuration and time to achieve such a configuration are presented which demonstrates the effectiveness of the method when compared to the existing methods in the field. Moreover, the proposed algorithm can be easily modified to incorporate any other constraints which might arise due to any operational configuration of the grid.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源