考虑机组启动时限的大停电后初期恢复路径优化

电力系统发生大停电事故后，需要选择合理的恢复路径，尽快对电网中无自启动能力的机组及一些重要负荷节点进行恢复，进而实现整个系统的全面恢复。该文将系统恢复的目标网架重构和节点恢复顺序的确定统一考虑，结合经典的最短路径法与交叉粒子群算法来选择最优的恢复路径，以确定到达系统目标网架的恢复顺序。在该文算法中，考虑了机组在恢复过程中的启动时间限制，可保证尽可能多的电源点得到及时恢复，并对得到的目标系统进行潮流计算校验，对发生潮流越限的系统进行适当调整。以IEEE30节点系统和河北南网系统作为算例验证该文算法的有效性。

Optimization of Restoration Paths Considering Unit Start-up Time Requirements at Early Stage of Power System Restoration

After blackout, in order to restore the system to a normal operation of the power system, optimal restoration paths are needed to restart the generation units without self-restart capacity and restore the power supply to the important loads. In this paper, skeleton-network reconfiguration and determination of the node-restoration sequence are considered under the same framework, and the classic Dijkstra algorithm and cross particle swarm optimization are employed to choose the optimal restoration path and the node-restoration sequence. Meanwhile, time requirements for unit start-up are considered to restore the generation capacity as much as possible. The power flow constraints are checked to the skeleton networks obtained and necessary adjustments are carried out to the networks with violation of the constraints. The effectiveness of the proposed method is validated by the numerical simulation results on 30- bus system and the southern power system of Hebei province.