基于图论的含分布式电源配电网供电恢复动态规划方法

A dynamic programming method based on graph theory for restoration of distribution system with DGs

研究基于计划孤岛划分的配电网故障恢复策略,分析了含DG配电网的故障恢复流程。通过对现有计划孤岛划分算法的比较和研究,针对复杂配电网闭环设计、开环运行的特点,详细研究了计划孤岛划分的目标、原则和算法。根据在线划分思想提出了基于最小生成树和动态规划算法的分布式电源孤岛划分方法,该方法能够处理含环网结构的复杂配电网,保证计划孤岛的稳定运行以及和上层电网的快速并网。最后讨论了该算法的数据结构、参数设定以及数学变化等问题,并通过实例验证了该方法的可行性。

A strategy based on intentional islanding for using DGs in the distribution network restoration service in the context of smart distribution network is presented and the restoration procedure of distribution network with DGs is also enunciated. Through comparison and research of existing distribution system islanding algorithms, the objective, principle and algorithm of intentional islanding are studied in detail based on the closed-loop design and open-loop operation characteristics of complex distribution network. An algorithm based on minimum spanning tree and dynamic programming method is proposed, which can adapt to complex distribution network with the structure containing rings and ensure the restoration of important loads to the maximum extent. Using this method, it can ensure stable operation of islanding and quick synchronization with the upper power grid. The data structure, parameter setting and mathematical representations of the algorithm are introduced. Case analysis on typical islanding confirms the feasibility of this method.