Method and system for optimizing starting sequence of power generators

Abstract

The invention provides a method and a system for optimizing a starting sequence of power generators. The method comprises the steps as follows: determining father node information of nodes in shortest weighted paths and weight values of the shortest weighted paths; determining comprehensive priority indexes of target power generators respectively according to the weight values and the starting capacity and the climbing rates of the target power generators; taking the target power generator with the minimal comprehensive priority index as a starting target; determining the shortest weighted path of the starting target through the father node information; solving a system comprising the starting target and the shortest weighted path corresponding to the starting target as well as an electric network by the primal-dual interior point optimal power flow; judging if the optimal power flow of the system is converged; and if so, incorporating the starting target and the shortest weighted path corresponding to the starting target into the electric network. According to the method, the optimal power transmission path is prevented from being repeatedly acquired, and the efficiency of acquiring the starting sequence of the power generators after blackout is greatly improved.

Description

technical field [0001] The invention relates to the field of electric power technology, in particular to a method and system for optimizing a generator starting sequence. Background technique [0002] The generator starting sequence optimization method after a blackout is generally based on the Dijkstra algorithm. The Dijkstra algorithm is a typical single-source shortest path algorithm based on network topology and branch weights. It is used to calculate a node to The shortest weighted path to all other nodes. However, at present, the general practice of the optimization method for generator starting sequence after a major blackout using the Dijkstra algorithm as the path search algorithm is: first select the target area to be started; then screen the unstarted generators in the area to determine the target Generator; then call the Dijkstra algorithm to search for the optimal power transmission path of the target generator, and verify the power transmission scheme: when th...

AI Technical Summary

Problems solved by technology

[0003] Due to the large number of generators that need to be started after a blackout, the number of times Dijkstra’s algorithm needs to be called is correspondingly large, which greatly reduces the efficiency of determining the starting sequence of generators; and the selection of target generators and the optimal delivery The selection of electrical paths is independent, which will also cause the selected target generator and the optimal power transmission path to be not optimal, or after expanding the target area or backtracking, no feasible solution may still be found, which also greatly Reduced efficiency of determining generator start sequence

Images