节点文献

考虑恢复序列的电力系统黑启动分区研究

Research of Power System Black-Start Network Partitioning Considering Recovery Sequence

【作者】 马慧远

【导师】 顾雪平;

【作者基本信息】 华北电力大学 , 电力系统及其自动化, 2011, 硕士

【摘要】 电力系统大停电后的黑启动过程是一个非常复杂的操作过程,合理的黑启动方案在电力系统大停电后的快速恢复过程中发挥着重要作用。通过将大系统划分成几个子系统同时启动,在完成各个子系统的主网架恢复后,进行各个子系统间的并列,可以加快系统恢复的进程。本文对黑启动的系统分区问题进行了研究,在考虑机组启动时间限制的基础上将电力系统分区问题和各子系统内恢复序列的确定问题通过搜索最短路径的办法同时解决。此外,采用最优潮流算法解决了负荷恢复序列问题。本文介绍了电力系统黑启动过程中为机组或变电站节点寻找最短路径的方法。依次搜索目标节点与系统已恢复部分中所有节点之间的最短路径,并从中选择出时间操作权值最小的路径作为目标节点的恢复路径,使系统恢复所用的时间最短。在本文的分区方法中,应用Floyd算法为机组和变电站节点选择最短的恢复路径。对机组的启动特性进行了分析和整理,以恢复时间最短、机组在时限内得到恢复的数目最多并且各分区规模和恢复时间相当为目标,设计了一种自动搜索黑启动分区方案并同时得到其恢复序列的优化算法。根据机组的三个启动时间限制,将整个系统恢复分为三个阶段,每个阶段都按照相应的恢复时限的紧迫程度将机组或变电站进行排序,依次搜索待恢复节点到各个已恢复区域的最短路径,确定机组分区。本算法从机组的启动时限出发,保证了最短时间内使最多的机组在启动时限内恢复,更加适用于电力系统实际,可提高系统恢复的效率。在各子系统的骨架子网恢复完成后,选择合适的并网线路对各骨架子网进行并列形成整个系统的骨架网络。然后,根据负荷重要性及系统的一些约束条件进行负荷恢复,采用最优潮流算法得到完整的并行恢复序列。采用IEEE118节点系统为算例,验证了本文分区恢复算法的有效性,并以IEEE30节点系统为算例,对负荷恢复算法进行了验证。

【Abstract】 Black-start restoration of a power system after a complete blackout is a very complicated operating process. Reasonable black-start schemes play a major role to the fast restoration of power system after blackout. Partitioning the whole system into several subsystems which are restored in parallel can speed up the restoration process. Black-start network partitioning problem has been researched in this thesis. The problems of system partitioning and the restoration sequence determination of the subsystems are solved in one time by searching the shortest restoring paths. In addition, the load restoration problem is solved by the optimal power flow algorithm. This thesis introduced how to choose the shortest recover paths of units and substations. According to the method, and Floyd algorithm which is used for searching the shortest distance and path between any two nodes in the graph is introduced to choose the recover path for the nodes in power system.Through analyzing and summarizing the start-up characteristics of the units, an optimization approach of network partitioning and the restoration sequence determination for black-start is proposed in the thesis. The optimization target is to restore as many generating units as possible in the shortest time and to balance the restoration times of the subsystems. Based on the three start-up time limits of thermal units, the whole restoration process is divided into three stages. In each stage, the units or substations are ordered according to the corresponding start-up time limit and the shortest restoring paths to the restored area are searched one by one by the Floyd algorithm, then the subsystem in which a unit belongs to can be determined. Through considering the unit’s start-up time limits and minimizing the restoration time in the network reconfiguration, the number of the units restarted successfully within the start-up time limits is maximized, so the speed and efficiency of the system restoration can be significantly improved.After completing the reconfiguration of all the skeleton sub-networks, the subsystems are reconnected into the complete skeleton network of the original power system. Then, the loads are restored according to the importance of the loads and the operating constraints of the system.The IEEE 118 bus system is employed as an example to verify the validity of the proposed network partitioning approach, and the IEEE 30 bus system is used to verify the load recovery algorithm.

节点文献中: 

本文链接的文献网络图示:

本文的引文网络