怒江电网黑启动网架重构阶段最优路径研究

Research on Optimal Path of Black Start Grid Reconfiguration Stage of Nujiang Power Grid

摘要: 本文采用Dijkstra算法对怒江电网黑启动过程中的网架重构阶段进行路径寻优建立目标网架。将怒江电网划分为泸水区域、贡山区域、福贡区域、兰坪区域共4个黑启动子系统，分别建立目标网架。以黑启动过程中各地区电网开关站、网络枢纽变电站以及水电站为节点，以各地区开关站、网络枢纽变电站以及水电站间连接线路为边，综合考虑黑启动过程中重要负荷，支路参数等情况，给每一条边赋权值，最后求出指定起始节点到终点的最短路径并标示出该最短路径。通过Dijkstra算法为黑启动网络重构寻找最优路径，减少黑启动时间，网架重构阶段的主要任务是给失电厂站送电并建立一个稳定的网架结构，为下一阶段全面恢复负荷打下坚实基础对黑启动整个过程具有重要意义。

Abstract: In this paper, Dijkstra algorithm is used to establish the target network for path optimization in the grid reconstruction stage during the black start process of Nujiang Power Grid. The Nujiang Power Grid is divided into four black start subsystems in the Lushui area, the Gongshan area, the Fugong area and the Lanping area, and the target grids are respectively established. Taking the power grid switch station, network hub substation and hydropower station as the nodes in the black start process, the connection line between the switch stations, network hub substations and hydropower stations in each area is taken as the side. Considering the important loads and branch parameters in the black-start process, the weighting values of each edge are given, and finally find the shortest path from the specified starting node to the end point and mark the shortest path. The Dijkstra algorithm is used to find the optimal path for the black start network reconstruction and reduce the black start time. The main task of the grid reconstruction phase is to send power to the power plant and establish a stable grid structure, and restore the load for the next stage. It is important to lay a solid foundation for the whole process of black start.