A method and system for optimizing power outage restoration scheme in a single area of a transmission network

Abstract

The present invention discloses a method and system for optimizing a power outage restoration plan for a single zone of a transmission network. The present invention constructs a power outage restoration tree of a certain depth based on a given power outage scenario in a single zone of the transmission network, calculates the net benefit per unit electricity of each power outage restoration plan in the power outage restoration tree, and optimizes the power outage restoration plan for the single zone of the transmission network according to the net benefit per unit electricity.

Description

Technical Field

[0001] The present invention relates to an optimization method and system for a single-area power outage restoration scheme in a transmission network, belonging to the technical field of power system restoration. Background Art

[0002] Modern society is increasingly dependent on electricity supply, and the consequences of major power outages are becoming increasingly serious. Once a power outage occurs, the system power supply must be restored safely and quickly. Restoration control is an important component of the power grid's safety and stability defenses. Its purpose is to quickly, safely, and economically restore power after a power outage, reduce power outage losses, and avoid the risk of new instability introduced by restoration measures. Current research on restoration decisions for single-sector transmission networks generally focuses on specific restoration stages, optimizing unit restoration, grid restoration, and load restoration separately, and rarely analyzes and makes decisions as a whole. To address the above issues, there is an urgent need for a power outage restoration solution optimization method that can flexibly respond to various power outage scenarios in a single sector of the transmission network. Summary of the Invention

[0003] The present invention provides a method and system for optimizing a power outage restoration scheme for a single zone of a transmission network, which solves the problems disclosed in the background technology.

[0004] In order to solve the above technical problems, the technical solution adopted by the present invention is:

[0005] A method for optimizing a power outage restoration plan for a single zone of a transmission network, comprising:

[0006] According to a given power outage scenario of the transmission network, a sequence of targets to be restored and a restoration path for each target to be restored are obtained under the given power outage scenario;

[0007] Based on a given power outage scenario, the sequence of targets to be restored under the given power outage scenario, and the recovery paths for each target to be restored, a power outage recovery tree is constructed, and the expected recovery benefits, security risks, and expected recovery costs of each recovery path in the power outage recovery tree are evaluated. Each node in the power outage recovery tree is a power outage scenario; the root node is the given power outage scenario; and the child nodes are new power outage scenarios generated based on the parent node and the recovery paths under the parent node.

[0008] Calculate the net benefit per unit of electricity for each power outage restoration plan in the power outage restoration tree based on the expected restoration benefit, safety risk, and expected restoration cost. The power outage restoration plan includes the associated nodes in the power outage restoration tree and the deduced restoration paths between the associated nodes.

[0009] According to the unit electricity net benefit index of each power outage restoration plan in the power outage restoration tree, the optimized power outage restoration plan is obtained.

[0010] Based on a given power outage scenario, the sequence of targets to be restored under the given power outage scenario, and the recovery paths for each target to be restored, a power outage recovery tree is constructed. The expected recovery benefit, security risk, and expected recovery cost of each recovery path in the power outage recovery tree are evaluated, including:

[0011] Take the given power outage scenario as the root node, and obtain no more than the preset number N according to the sequence of targets to be restored and the recovery path of each target to be restored under the given power outage scenario. w The next layer of child nodes is selected and the expected recovery benefit, security risk and expected recovery cost of the recovery path between the parent node and the child node are evaluated;

[0012] For each child node, obtain the sequence of targets to be restored and the recovery path of each target to be restored under the child node, and obtain no more than the preset number N according to the sequence of targets to be restored and the recovery path of each target to be restored under the child node. w The next layer of child nodes is calculated, and the expected recovery benefit, security risk and expected recovery cost of the recovery path between the parent node and the child node are evaluated. This step is repeated until there is no next layer of child nodes or the node level reaches the threshold N. D , obtain the power outage recovery tree.

[0013] Obtain the sequence of targets to be restored and the recovery path for each target to be restored, including:

[0014] According to the power outage scenario, obtain the units and buses to be restored in the power outage scenario;

[0015] Evaluate the estimated restoration benefits of the units and busbars to be restored;

[0016] Sort the units and buses to be restored based on the estimated restoration benefits, and construct a target sequence for restoration in the power outage scenario.

[0017] According to the sequence of targets to be restored, the recovery path of each target to be restored is obtained.

[0018] The formula for evaluating the estimated restoration benefits of the units to be restored and the busbars to be restored is:

[0019]

[0020]

[0021] Among them, I G is the estimated recovery benefit of the unit to be restored, I B is the estimated restoration benefit of the busbar to be restored, β G is the unit recovery benefit conversion coefficient, I G,L is the estimated value of the load recovery benefit generated after the unit is restored and connected to the grid, C G is the cost of restoring the unit, η sysis the system recovery demand satisfaction rate, β B is the busbar recovery benefit conversion coefficient, I B,L is the estimated value of the load recovery benefit of the busbar, C B The cost of restoring the busbar load.

[0022] Before evaluating the estimated restoration benefits of the units to be restored, the steps of screening the units to be restored are also included, including:

[0023] Eliminate the units to be restored that do not meet the spinning reserve constraints and transient frequency constraints, as well as the units to be restored that cannot be hot-started or cold-started.

[0024] According to the sequence of targets to be restored and the recovery path of each target to be restored, obtain no more than the preset number N w The next layer of child nodes is selected and the expected recovery benefit, security risk, and expected recovery cost of the recovery path between the parent node and the child node are evaluated, including:

[0025] 1) Recovery path r,h The recovery operation in the process is security verified and sampled to generate a deterministic recovery process; among them, the recovery path path r,h is the hth recovery path of the rth target to be restored, r = 1, h = 1;

[0026] 2) Evaluate the unit recovery benefits, load recovery benefits, safety control costs, and recovery costs of the deterministic recovery process;

[0027] 3) Based on the unit recovery benefit, load recovery benefit, safety control cost, and recovery cost of the deterministic recovery process, evaluate the expected recovery benefit, safety risk, and expected recovery cost of the hth recovery path;

[0028] 4) Generate a child node based on the parent node and the h-th recovery path, h = h + 1;

[0029] 5) If the number of generated child nodes is less than the preset number N w And r is less than N O , go to 6), otherwise end the child node acquisition process; where N O The number of elements in the target sequence to be restored;

[0030] 6) If h is less than or equal to N path,r , then restore the path path r,h Perform security verification and sampling simulation on the recovery operation in , generate a deterministic recovery process, and go to 2); where N path,r The number of recovery paths for the rth target to be restored;

[0031] If h is greater than N path,r, then r=r+1, h=1, for the recovery path path r,h Perform security verification and sampling simulation on the recovery operations in , generate a deterministic recovery process, and go to 2).

[0032] The load recovery benefit formula for evaluating the deterministic recovery process is:

[0033]

[0034] Among them, I L,r,h,i is the load recovery benefit of the i-th deterministic recovery process, t r,h,i is the end time of the i-th deterministic recovery process, t e is the preset evaluation end time, α L,r,h,i (t) is the unit recovery benefit of the load restored in the i-th deterministic recovery process at time t, ΔP L,r,h,i (t) is the capacity of the load restored at time t in the i-th deterministic recovery process;

[0035] The formula for evaluating the security control cost of the deterministic recovery process is:

[0036]

[0037] Among them, E r,h,i is the security control cost of the i-th deterministic recovery process, N F is the total number of failures in the ith deterministic recovery process, e r,h,i,j is the optimal safety control cost after the jth failure in the i-th deterministic recovery process;

[0038] The recovery cost formula for evaluating the deterministic recovery process is:

[0039]

[0040] Among them, C r,h,i is the recovery cost of the i-th deterministic recovery process, μ L,r,h,i (t) is the unit electricity cost of the load restored in the i-th deterministic recovery process at time t, C PC,r,h,i is the preventive control cost of the i-th deterministic recovery process.

[0041] The expected recovery benefit formula for evaluating the recovery path is:

[0042]

[0043] Among them, I r,h is the expected restoration benefit of the h-th restoration path, N P is the number of deterministic recovery processes of the h-th recovery path, I G,r,h,iis the unit recovery benefit of the i-th deterministic recovery process, I L,r,h,i is the load recovery benefit of the i-th deterministic recovery process;

[0044] The formula for evaluating the security risk of the recovery path is:

[0045]

[0046] Among them, R r,h is the security risk of the h-th recovery path, E r,h,i is the security control cost of the i-th deterministic recovery process;

[0047] The expected recovery cost formula for evaluating the recovery path is:

[0048]

[0049] Among them, C r,h is the expected restoration cost of the h-th restoration path, C r,h,i is the recovery cost of the i-th deterministic recovery process.

[0050] The formula for calculating the net benefit per unit of electricity for each power outage restoration scheme in the power outage restoration tree is:

[0051]

[0052] Among them, γ is the net benefit index per unit electricity of the power outage restoration plan in the power outage restoration tree, N M is the number of node levels in the power outage recovery tree, I k is the expected recovery benefit of the k-th level recovery path, R k is the security risk of the k-th level recovery path, C k is the expected recovery cost of the k-th level recovery path, W k The power required for the k-th level recovery solution.

[0053] Based on the net benefit per unit of electricity of each power outage restoration plan in the power outage restoration tree, the optimized power outage restoration plan is obtained, including:

[0054] According to the unit electricity net benefit index of each power outage restoration plan in the power outage restoration tree, the power outage restoration plan with the largest unit electricity net benefit index is selected as the optimized power outage restoration plan.

[0055] A system for optimizing a power outage restoration plan for a single zone of a transmission network, comprising:

[0056] Given power outage scenario information acquisition module: according to the given power outage scenario of the transmission network, obtain the sequence of targets to be restored and the restoration path of each target to be restored under the given power outage scenario;

[0057] Power outage recovery tree construction module: Based on a given power outage scenario, the sequence of targets to be restored under the given power outage scenario, and the recovery paths of each target to be restored, a power outage recovery tree is constructed, and the expected recovery benefits, security risks, and expected recovery costs of each recovery path in the power outage recovery tree are evaluated. The nodes in the power outage recovery tree are all power outage scenarios; the root node is the given power outage scenario; and the child nodes are new power outage scenarios generated based on the parent node and the recovery paths under the parent node.

[0058] Index calculation module: Calculates the net benefit per unit of electricity for each power outage restoration plan in the power outage restoration tree based on expected restoration benefits, security risks, and expected restoration costs. A power outage restoration plan includes associated nodes in the power outage restoration tree and the deduced restoration paths between them.

[0059] Optimization plan acquisition module: obtains the optimized power outage restoration plan according to the unit power net benefit index of each power outage restoration plan in the power outage restoration tree.

[0060] Power outage recovery tree building modules, including:

[0061] The child node acquisition module of the root node: takes the given power outage scenario as the root node, and obtains no more than a preset number N of child nodes according to the sequence of targets to be restored and the recovery path of each target to be restored under the given power outage scenario. w The next layer of child nodes is selected and the expected recovery benefit, security risk and expected recovery cost of the recovery path between the parent node and the child node are evaluated;

[0062] The remaining sub-node acquisition module: for each sub-node, obtain the sequence of targets to be restored and the recovery path of each target to be restored under the sub-node, and obtain no more than the preset number N according to the sequence of targets to be restored and the recovery path of each target to be restored under the sub-node. w The next layer of child nodes is calculated, and the expected recovery benefit, security risk and expected recovery cost of the recovery path between the parent node and the child node are evaluated. This step is repeated until there is no next layer of child nodes or the node level reaches the threshold N. D , obtain the power outage recovery tree.

[0063] A computer-readable storage medium stores one or more programs, wherein the one or more programs include instructions that, when executed by a computing device, cause the computing device to perform a method for optimizing a power outage restoration solution.

[0064] A computing device includes one or more processors, one or more memories, and one or more programs, wherein the one or more programs are stored in the one or more memories and are configured to be executed by the one or more processors, and the one or more programs include instructions for executing an optimization method for a power outage recovery solution.

[0065] The beneficial effects achieved by the present invention are as follows: Based on a given power outage scenario in a single partition of the transmission network, the present invention constructs a power outage recovery tree of a certain depth, calculates the net benefit per unit electricity of each power outage recovery plan in the power outage recovery tree, and optimizes the power outage recovery plan in the single partition of the transmission network according to the net benefit per unit electricity. BRIEF DESCRIPTION OF THE DRAWINGS

[0066] Figure 1 A process for optimizing a method for outage restoration plans in a single section of a transmission network;

[0067] Figure 2 Restoring tree structures for power outages;

[0068] Figure 3 The detailed process of the optimization method for the power outage restoration plan of a single zone in the transmission network is presented. DETAILED DESCRIPTION

[0069] The present invention will be further described below in conjunction with the accompanying drawings. The following embodiments are only used to more clearly illustrate the technical solutions of the present invention and are not intended to limit the scope of protection of the present invention.

[0070] like Figure 1 As shown, a method for optimizing a power outage restoration plan for a single zone of a transmission network includes the following steps:

[0071] Step 1: According to a given power outage scenario of the transmission network, a sequence of targets to be restored and a restoration path for each target to be restored under the given power outage scenario are obtained;

[0072] Step 2: Based on the given power outage scenario, the sequence of targets to be restored under the given power outage scenario, and the recovery paths of each target to be restored, a power outage recovery tree is constructed, and the expected recovery benefits, security risks, and expected recovery costs of each recovery path in the power outage recovery tree are evaluated. Each node in the power outage recovery tree is a power outage scenario; the root node is the given power outage scenario; and the child nodes are new power outage scenarios generated based on the parent node and the recovery paths under the parent node.

[0073] Step 3: Calculate the net benefit per unit of electricity for each power outage restoration plan in the power outage restoration tree based on the expected restoration benefit, security risk, and expected restoration cost. The power outage restoration plan includes associated nodes in the power outage restoration tree and deduced restoration paths between the associated nodes.

[0074] Step 4: Obtain an optimized power outage restoration plan based on the unit power net benefit index of each power outage restoration plan in the power outage restoration tree.

[0075] The above method is based on a given power outage scenario in a single zone of the transmission network. It constructs a power outage restoration tree of a certain depth, calculates the net benefit per unit electricity of each power outage restoration scheme in the power outage restoration tree, and optimizes the power outage restoration scheme in the single zone of the transmission network based on the net benefit per unit electricity.

[0076] The above given scenario is determined according to the actual situation, such as the current actual power outage scenario. Based on the given scenario, the sequence of targets to be restored and the recovery path of each target to be restored under the given power outage scenario can be obtained. The specific process can be:

[0077] 11) Based on the power outage scenario and the operating status of the transmission network before the power outage, obtain the units to be restored and the buses to be restored in the power outage scenario;

[0078] 12) Eliminate the units to be restored that do not meet the spinning reserve constraints and transient frequency constraints, as well as the units to be restored that cannot be hot-started or cold-started, and use the following formula to evaluate the estimated restoration benefits of the units to be restored and the bus to be restored;

[0079]

[0080]

[0081] Among them, I G is the estimated recovery benefit of the unit to be restored, I B is the estimated restoration benefit of the busbar to be restored, β G is the unit recovery benefit conversion coefficient, 0<β G ≤1, indicating the delayed effect of the recovery process after the unit is connected to the grid on the revenue, I G,L is the estimated value of the load recovery benefit generated after the unit is restored and connected to the grid, C G is the cost of restoring the unit, η sys is the system recovery demand satisfaction rate, that is, the ratio of the sum of the spinning reserve capacity, the capacity of the units being restored, and the capacity of the units planned to be restored to the load to be restored, β B is the busbar recovery benefit conversion coefficient, 0<β B ≤1, I B,L is the estimated value of the load restoration benefit of the busbar, that is, the maximum restoration benefit that can be generated by assuming that all available power is used to restore the loads within the busbar itself and its surrounding power supply range, C B Cost of restoring the load on the busbar;

[0082] 13) Sort the units to be restored and the buses to be restored in descending order according to the estimated restoration benefits, and construct a target sequence for restoration under the power outage scenario;

[0083] 14) According to the sequence of targets to be restored, a restoration path for each target to be restored is obtained.

[0084] Based on a given power outage scenario, the sequence of targets to be restored under the given power outage scenario, and the recovery paths for each target to be restored, a power outage recovery tree can be constructed. The expected recovery benefit, security risk, and expected recovery cost of each recovery path in the tree can be evaluated. The specific process can be as follows:

[0085] 21) Take the given power outage scenario as the root node, and obtain no more than a preset number N according to the sequence of targets to be restored and the recovery path of each target to be restored under the given power outage scenario. w The next layer of child nodes is selected and the expected recovery benefit, security risk and expected recovery cost of the recovery path between the parent node and the child node are evaluated;

[0086] 22) For each child node, obtain the sequence of targets to be restored and the recovery path of each target to be restored under the child node, and obtain no more than a preset number N according to the sequence of targets to be restored and the recovery path of each target to be restored under the child node. w The next layer of child nodes is calculated, and the expected recovery benefit, security risk and expected recovery cost of the recovery path between the parent node and the child node are evaluated. This step is repeated until there is no next layer of child nodes or the node level reaches the threshold N. D , obtaining a power outage restoration tree; wherein, the method for obtaining a sequence of targets to be restored and a restoration path for each target to be restored is consistent with the method for obtaining in a given scenario.

[0087] like Figure 2 As shown in the figure, in the constructed power outage recovery tree, the nodes are all power outage scenarios, the root node is a given power outage scenario; the child nodes are new power outage scenarios generated based on the parent node and the recovery path under the parent node. The associated nodes in the power outage recovery tree and the deduced recovery paths between the associated nodes constitute the power outage recovery plan. Each power outage recovery plan includes multiple recovery stages, and the number of recovery stages is not greater than the node level limit N. D .

[0088] According to the sequence of targets to be restored and the recovery path of each target to be restored, a number not greater than the preset number N is obtained. w The next layer of child nodes is selected and the expected recovery benefit, security risk and expected recovery cost of the recovery path between the parent node and the child node are evaluated. The specific process can be:

[0089] 221) Recovery path path r,h The recovery operation in the process is security verified and sampled to generate a deterministic recovery process; among them, the recovery path path r,h is the hth recovery path of the rth target to be restored, r = 1, h = 1;

[0090] 222) Evaluate the unit recovery benefits, load recovery benefits, safety control costs, and recovery costs of the deterministic recovery process;

[0091] Among them, the formula for evaluating the unit recovery benefit of the deterministic recovery process is the same as I G The formula is consistent;

[0092] The load recovery benefit formula for evaluating the deterministic recovery process can be:

[0093]

[0094] Among them, I L,r,h,i is the load recovery benefit of the i-th deterministic recovery process, t r,h,i is the end time of the i-th deterministic recovery process, t e is the preset evaluation end time, α L,r,h,i (t) is the unit recovery benefit of the load restored in the i-th deterministic recovery process at time t, ΔP L,r,h,i (t) is the capacity of the load restored at time t in the i-th deterministic recovery process;

[0095] The formula for evaluating the security control cost of the deterministic recovery process can be:

[0096]

[0097] Among them, E r,h,i is the security control cost of the i-th deterministic recovery process, N F is the total number of failures in the ith deterministic recovery process, e r,h,i,j is the optimal safety control cost after the jth failure in the i-th deterministic recovery process;

[0098] The recovery cost formula for evaluating the deterministic recovery process can be:

[0099]

[0100] Among them, C r,h,i is the recovery cost of the i-th deterministic recovery process, μ L,r,h,i (t) is the unit electricity cost of the load restored in the i-th deterministic recovery process at time t, C PC,r,h,i is the preventive control cost of the i-th deterministic recovery process;

[0101] 223) Evaluate the expected recovery benefit, safety risk and expected recovery cost of the hth recovery path based on the unit recovery benefit, load recovery benefit, safety control cost and recovery cost of the deterministic recovery process;

[0102] The expected recovery benefit formula for evaluating the recovery path can be:

[0103]

[0104] Among them, I r,h is the expected restoration benefit of the h-th restoration path, N P is the number of deterministic recovery processes of the h-th recovery path, I G,r,h,iis the unit recovery benefit of the i-th deterministic recovery process, I L,r,h,i is the load recovery benefit of the i-th deterministic recovery process;

[0105] The formula for evaluating the security risk of the recovery path is:

[0106]

[0107] Among them, R r,h is the security risk of the hth recovery path;

[0108] The expected recovery cost formula for evaluating the recovery path is:

[0109]

[0110] Among them, C r,h is the expected restoration cost of the h-th restoration path;

[0111] 224) Generate a child node based on the parent node and the h-th recovery path, h=h+1;

[0112] 225) If the number of generated child nodes is less than the preset number N w And r is less than N O , go to 226), otherwise end the child node acquisition process; wherein, N O The number of elements in the target sequence to be restored;

[0113] 226) If h is less than or equal to N path,r , then restore the path path r,h Perform security verification and sampling simulation on the recovery operation in , generate a deterministic recovery process, and go to 222); wherein, N path,r The number of recovery paths for the rth target to be restored;

[0114] If h is greater than N path,r , then r=r+1, h=1, for the recovery path path r,h Perform security verification and sampling simulation on the recovery operation in to generate a deterministic recovery process, and go to 222).

[0115] Build as Figure 2 After the power outage restoration tree is constructed, and the expected restoration benefit, security risk, and expected restoration cost of the restoration path are obtained during the construction process, the following formula can be used to calculate the net benefit per unit electricity of each power outage restoration scheme;

[0116]

[0117] Among them, γ is the net benefit index per unit electricity of the power outage restoration plan in the power outage restoration tree, N Mis the number of node levels in the power outage recovery tree, I k is the expected recovery benefit of the k-th level recovery path, R k is the security risk of the k-th level recovery path, C k is the expected recovery cost of the k-th level recovery path, W k The power required for the k-th level recovery solution.

[0118] According to the unit power net benefit index of each power outage restoration plan in the power outage restoration tree, the power outage restoration plan with the largest unit power net benefit index is selected as the optimized power outage restoration plan, that is, the optimal power outage restoration plan.

[0119] The detailed process of the above method is as follows Figure 3 As shown, taking the current power outage scenario S0 as a given scenario, the specific process includes:

[0120] S1) The operation status of the transmission network before the power outage and the current power outage scenario are respectively recorded as S a and S0, store S0 in the scene set Ω S , and record Ω S The number of elements N S =1, record the recovery stage number k corresponding to S0 as 0, and store k in the power outage scenario recovery stage number set Ω K , note Ω K The number of elements N K =1, the limit of searching different recovery solutions under S0 is N w , the limit of the number of recovery stages is N D .

[0121] S2) from Ω S Extract the mth power outage scenario S from m =Ω S (m), m=1,2,...,N S , generate power outage scenario S m The set of units to be restored Ω G and busbar set to be restored Ω B , based on the power outage scenario S m , filter out Ω G The units to be restored that do not meet the spinning reserve constraints and transient frequency constraints, as well as the units to be restored that cannot be hot started or cold started, are evaluated separately for Ω G and Ω B The estimated recovery benefits of each element in Ω G and Ω B Merge into a target sequence to be restored Ω O And sort the elements in descending order according to the estimated recovery benefits; record Ω O The number of elements in is N O , set the power outage scene Sm The number of recovery solutions generated is set to 0.

[0122] S3) If Ω O If it is not empty, extract the rth target to be restored O from it r =Ω O (r), r=1,2,...,N O , based on the power outage scenario S m , search and generate the target to be restored O r The recovery path set Ω Path,r , note Ω Path,r The number of elements in is N Path,r , then go to S4), otherwise, go to step S9).

[0123] S4) If Ω Path,r If it is not empty, extract the hth recovery path Path from it r,h =Ω Path,r (h), h=1,2,...,N Path,r , the number of sampling simulations for this path is limited to N P , go to S5), otherwise, go to S8).

[0124] S5) Take the power outage scene S new =S m , based on the power outage scenario S new , for the recovery path Path r,h The recovery operations in the process are verified and sampled one by one to generate the i-th (i=1,2,...,N P ) deterministic recovery process, and deduce and update S accordingly new ,Finally, evaluate the unit recovery benefit, load recovery benefit, safety control cost, and recovery cost of the ,i,th deterministic recovery process, set i=i+1, and go to S6).

[0125] When generating a deterministic recovery process, take into account the recovery path Path r,h Contains several recovery operations that need to be performed in sequence. First, the recovery path Path r,h The zth (z=1,2,...) recovery operation in the process is safety checked. If the operation fails the safety check, the optimal preventive control measures and costs that make the operation pass the check are optimized, and the power outage scenario S is updated according to the preventive control measures. new , then, based on the latest power outage scenario S new , for the recovery path Path r,h The result of the z-th recovery operation is sampled. If the sampling indicates that the operation is successful, the power outage scenario S is updated based on the operation result. newIf the sampling is an operation failure, the optimal emergency or corrective control measures and costs after the operation failure are generated, and the power outage scenario S is updated based on the operation results and the corresponding emergency or corrective control measures. new Then, set z = z + 1 and repeat the above security verification and sampling simulation process until the path Path is restored. r,h The deterministic recovery process simulation generation ends.

[0126] S6) If i≤N P , then go to S5), otherwise, evaluate the recovery path Path r,h The expected recovery benefits, safety risks and expected recovery costs are calculated and the process goes to S7).

[0127] S7) Take the power outage scene S new =S m , according to the recovery path Path r,h For power outage scenario S new Perform the simulation update and then change the power outage scenario S new Save the scene set Ω S At the end of S =N S +1, change the power outage scene to S new Corresponding recovery stage number Ω K (m)+1 is stored in the recovery phase sequence number set Ω K At the end of K =N K +1, finally, set h = h + 1, l = l + 1, if h ≤ N Path,r And l<N W , then go to S4), otherwise, go to S8).

[0128] S8) Set r = r + 1, if r ≤ N O And l<N W , then go to S3), otherwise, go to S9).

[0129] S9) Set m=m+1, if m≤N S And Ω K (m)<N D , then go to S2), otherwise, go to S10).

[0130] S10) Based on the power outage restoration tree generated by the above process, the net benefit per unit electricity of each power outage restoration plan in the power outage restoration tree is calculated to obtain an optimized power outage restoration plan.

[0131] Based on the same technical solution, the present invention also discloses a software system of the above method, namely, an optimization system for a power outage restoration plan for a single zone of a transmission network, comprising:

[0132] Given power outage scenario information acquisition module: According to the given power outage scenario of the transmission network, the module obtains the sequence of targets to be restored and the restoration path of each target to be restored under the given power outage scenario.

[0133] Power outage recovery tree construction module: Based on a given power outage scenario, the sequence of targets to be restored under the given power outage scenario, and the recovery path of each target to be restored, a power outage recovery tree is constructed, and the expected recovery benefit, security risk, and expected recovery cost of each recovery path in the power outage recovery tree are evaluated; among them, the nodes in the power outage recovery tree are all power outage scenarios; the root node is the given power outage scenario; the child nodes are new power outage scenarios generated based on the parent node and the recovery path under the parent node.

[0134] Power outage recovery tree building modules, including:

[0135] The child node acquisition module of the root node: takes the given power outage scenario as the root node, and obtains no more than a preset number N of child nodes according to the sequence of targets to be restored and the recovery path of each target to be restored under the given power outage scenario. w The next layer of child nodes is selected and the expected recovery benefit, security risk and expected recovery cost of the recovery path between the parent node and the child node are evaluated;

[0136] The remaining sub-node acquisition module: for each sub-node, obtain the sequence of targets to be restored and the recovery path of each target to be restored under the sub-node, and obtain no more than the preset number N according to the sequence of targets to be restored and the recovery path of each target to be restored under the sub-node. w The next layer of child nodes is calculated, and the expected recovery benefit, security risk and expected recovery cost of the recovery path between the parent node and the child node are evaluated. This step is repeated until there is no next layer of child nodes or the node level reaches the threshold N. D , obtain the power outage recovery tree.

[0137] Index calculation module: Calculates the net benefit per unit electricity of each power outage restoration plan in the power outage restoration tree based on the expected restoration benefit, safety risk, and expected restoration cost. The power outage restoration plan includes the associated nodes in the power outage restoration tree and the deduced restoration paths between the associated nodes.

[0138] Optimization plan acquisition module: obtains the optimized power outage restoration plan according to the unit power net benefit index of each power outage restoration plan in the power outage restoration tree.

[0139] Based on the same technical solution, the present invention also discloses a computer-readable storage medium storing one or more programs, wherein the one or more programs include instructions, which, when executed by a computing device, enable the computing device to perform an optimization method for a power outage recovery solution.

[0140] Based on the same technical solution, the present invention also discloses a computing device comprising one or more processors, one or more memories, and one or more programs, wherein the one or more programs are stored in the one or more memories and are configured to be executed by the one or more processors, and the one or more programs include instructions for an optimization method for executing a power outage recovery plan.

[0141] It will be understood by those skilled in the art that embodiments of the present invention may be provided as methods, systems, or computer program products. Thus, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware. Furthermore, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to magnetic disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0142] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowcharts and / or block diagrams, as well as combinations of processes and / or blocks in the flowcharts and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowcharts and / or block diagrams. Figure 1 a process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0143] These computer program instructions may also be stored in a computer readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 a process or multiple processes and / or boxes Figure 1 The function specified in one or more boxes.

[0144] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operational steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing the instructions executed on the computer or other programmable device for implementing the process. Figure 1 a process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.

[0145] The above are merely embodiments of the present invention and are not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present invention are included in the scope of the claims of the present invention to be approved.

Claims

1. A method for optimizing a power outage restoration plan for a single zone of a transmission network, characterized in that: include: According to a given power outage scenario of the transmission network, a sequence of targets to be restored and a restoration path for each target to be restored are obtained under the given power outage scenario; Based on a given power outage scenario, the sequence of targets to be restored under the given power outage scenario, and the recovery paths for each target to be restored, a power outage recovery tree is constructed, and the expected recovery benefits, security risks, and expected recovery costs of each recovery path in the power outage recovery tree are evaluated. Each node in the power outage recovery tree is a power outage scenario; the root node is the given power outage scenario; and the child nodes are new power outage scenarios generated based on the parent node and the recovery paths under the parent node. Calculate the net benefit per unit of electricity for each power outage restoration plan in the power outage restoration tree based on the expected restoration benefit, safety risk, and expected restoration cost. The power outage restoration plan includes the associated nodes in the power outage restoration tree and the deduced restoration paths between the associated nodes. According to the net benefit per unit of electricity of each power outage restoration plan in the power outage restoration tree, the optimized power outage restoration plan is obtained; The above construction of a power outage recovery tree is based on a given power outage scenario, a sequence of targets to be restored under the given power outage scenario, and the recovery paths of each target to be restored. The expected recovery benefit, security risk, and expected recovery cost of each recovery path in the power outage recovery tree are evaluated, including: Take the given power outage scenario as the root node, and obtain no more than the preset number N according to the sequence of targets to be restored and the recovery path of each target to be restored under the given power outage scenario. w The next layer of child nodes is selected and the expected recovery benefit, security risk and expected recovery cost of the recovery path between the parent node and the child node are evaluated; For each child node, obtain the sequence of targets to be restored and the recovery path of each target to be restored under the child node, and obtain no more than the preset number N according to the sequence of targets to be restored and the recovery path of each target to be restored under the child node. w The next layer of child nodes is calculated, and the expected recovery benefit, security risk and expected recovery cost of the recovery path between the parent node and the child node are evaluated. This step is repeated until there is no next layer of child nodes or the node level reaches the threshold N. D , obtain the power outage recovery tree.

2. The method for optimizing a power outage restoration plan for a single area of a transmission network according to claim 1, characterized in that: Obtain the sequence of targets to be restored and the recovery path for each target to be restored, including: According to the power outage scenario, obtain the units and buses to be restored in the power outage scenario; Evaluate the estimated restoration benefits of the units and busbars to be restored; Sort the units and buses to be restored based on the estimated restoration benefits, and construct a target sequence for restoration in the power outage scenario. According to the sequence of targets to be restored, the recovery path of each target to be restored is obtained.

3. The method for optimizing a power outage restoration plan for a single area of a transmission network according to claim 2, characterized in that: The formula for evaluating the estimated restoration benefits of the units to be restored and the busbars to be restored is: Among them, I G is the estimated recovery benefit of the unit to be restored, I B is the estimated restoration benefit of the busbar to be restored, β G is the unit recovery benefit conversion coefficient, I G,L is the estimated value of the load recovery benefit generated after the unit is restored and connected to the grid, C G is the cost of restoring the unit, η sys is the system recovery demand satisfaction rate, β B is the busbar recovery benefit conversion coefficient, I B,L is the estimated value of the busbar load recovery benefit, C B The cost of restoring the busbar load.

4. The method for optimizing a power outage restoration plan for a single area of a transmission network according to claim 2, wherein: Before evaluating the estimated restoration benefits of the units to be restored, the steps of screening the units to be restored are also included, including: Eliminate the units to be restored that do not meet the spinning reserve constraints and transient frequency constraints, as well as the units to be restored that cannot be hot-started or cold-started.

5. The method for optimizing a power outage restoration plan for a single area of a transmission network according to claim 1, characterized in that: According to the sequence of targets to be restored and the recovery path of each target to be restored, obtain no more than the preset number N w The next layer of child nodes is selected and the expected recovery benefit, security risk, and expected recovery cost of the recovery path between the parent node and the child node are evaluated, including: 1) Recovery path r,h The recovery operation in the process is security verified and sampled to generate a deterministic recovery process; among them, the recovery path path r,h is the hth recovery path of the rth target to be restored, r = 1, h = 1; 2) Evaluate the unit recovery benefits, load recovery benefits, safety control costs, and recovery costs of the deterministic recovery process; 3) Based on the unit recovery benefit, load recovery benefit, safety control cost, and recovery cost of the deterministic recovery process, evaluate the expected recovery benefit, safety risk, and expected recovery cost of the hth recovery path; 4) Generate a child node based on the parent node and the h-th recovery path, h = h + 1; 5) If the number of generated child nodes is less than the preset number N w And r is less than N O , go to 6), otherwise end the child node acquisition process; where N O The number of elements in the target sequence to be restored; 6) If h is less than or equal to N path,r , then restore the path path r,h Perform security verification and sampling simulation on the recovery operation in , generate a deterministic recovery process, and go to 2); where N path,r The number of recovery paths for the rth target to be restored; If h is greater than N path,r , then r=r+1, h=1, for the recovery path path r,h Perform security verification and sampling simulation on the recovery operations in , generate a deterministic recovery process, and go to 2).

6. The method for optimizing a power outage restoration plan for a single area of a transmission network according to claim 5, characterized in that: The load recovery benefit formula for evaluating the deterministic recovery process is: Among them, I L,r,h,i is the load recovery benefit of the i-th deterministic recovery process, t r,h,i is the end time of the i-th deterministic recovery process, t e is the preset evaluation end time, α L,r,h,i (t) is the unit recovery benefit of the load restored in the i-th deterministic recovery process at time t, ΔP L,r,h,i (t) is the capacity of the load restored in the i-th deterministic recovery process at time t; The formula for evaluating the security control cost of the deterministic recovery process is: Among them, E r,h,i is the security control cost of the i-th deterministic recovery process, N F is the total number of failures in the ith deterministic recovery process, e r,h,i,j is the optimal safety control cost after the jth failure in the i-th deterministic recovery process; The recovery cost formula for evaluating the deterministic recovery process is: Among them, C r,h,i is the recovery cost of the i-th deterministic recovery process, μ L,r,h,i (t) is the unit electricity cost of the load restored in the i-th deterministic recovery process at time t, C PC,r,h,i is the preventive control cost of the i-th deterministic recovery process.

7. The method for optimizing a power outage restoration plan for a single area of a transmission network according to claim 5, characterized in that: The expected recovery benefit formula for evaluating the recovery path is: Among them, I r,h is the expected restoration benefit of the h-th restoration path, N P is the number of deterministic recovery processes of the h-th recovery path, I G,r,h,i is the unit recovery benefit of the i-th deterministic recovery process, I L,r,h,i is the load recovery benefit of the i-th deterministic recovery process; The formula for evaluating the security risk of the recovery path is: Among them, R r,h is the security risk of the h-th recovery path, E r,h,i is the security control cost of the i-th deterministic recovery process; The expected recovery cost formula for evaluating the recovery path is: Among them, C r,h is the expected restoration cost of the h-th restoration path, C r,h,i is the recovery cost of the i-th deterministic recovery process.

8. The method for optimizing a power outage restoration plan for a single area of a transmission network according to claim 1, characterized in that: The formula for calculating the net benefit per unit of electricity for each power outage restoration scheme in the power outage restoration tree is: Among them, γ is the net benefit index per unit electricity of the power outage restoration plan in the power outage restoration tree, N M is the number of node levels in the power outage recovery tree, I k is the expected recovery benefit of the k-th level recovery path, R k is the security risk of the k-th level recovery path, C k is the expected recovery cost of the k-th level recovery path, W k The power required for the k-th level recovery solution.

9. The method for optimizing a power outage restoration plan for a single area of a transmission network according to claim 1, characterized in that: Based on the net benefit per unit of electricity of each power outage restoration plan in the power outage restoration tree, the optimized power outage restoration plan is obtained, including: According to the unit electricity net benefit index of each power outage restoration plan in the power outage restoration tree, the power outage restoration plan with the largest unit electricity net benefit index is selected as the optimized power outage restoration plan.

10. An optimization system for a single-zone power outage restoration plan for a transmission network, characterized in that: include: Given power outage scenario information acquisition module: according to the given power outage scenario of the transmission network, obtain the sequence of targets to be restored and the restoration path of each target to be restored under the given power outage scenario; Power outage recovery tree construction module: Based on a given power outage scenario, the sequence of targets to be restored under the given power outage scenario, and the recovery paths of each target to be restored, a power outage recovery tree is constructed, and the expected recovery benefits, security risks, and expected recovery costs of each recovery path in the power outage recovery tree are evaluated. The nodes in the power outage recovery tree are all power outage scenarios; the root node is the given power outage scenario; and the child nodes are new power outage scenarios generated based on the parent node and the recovery paths under the parent node. Index calculation module: Calculates the net benefit per unit of electricity for each power outage restoration plan in the power outage restoration tree based on expected restoration benefits, security risks, and expected restoration costs. A power outage restoration plan includes associated nodes in the power outage restoration tree and the deduced restoration paths between them. Optimization plan acquisition module: obtains the optimized power outage restoration plan based on the unit power net benefit index of each power outage restoration plan in the power outage restoration tree; The above-mentioned power outage recovery tree construction module includes: The child node acquisition module of the root node: takes the given power outage scenario as the root node, and obtains no more than a preset number N of child nodes according to the sequence of targets to be restored and the recovery path of each target to be restored under the given power outage scenario. w The next layer of child nodes is selected and the expected recovery benefit, security risk and expected recovery cost of the recovery path between the parent node and the child node are evaluated; The remaining sub-node acquisition module: for each sub-node, obtain the sequence of targets to be restored and the recovery path of each target to be restored under the sub-node, and obtain no more than the preset number N according to the sequence of targets to be restored and the recovery path of each target to be restored under the sub-node. w The next layer of child nodes is calculated, and the expected recovery benefit, security risk and expected recovery cost of the recovery path between the parent node and the child node are evaluated. This step is repeated until there is no next layer of child nodes or the node level reaches the threshold N. D , obtain the power outage recovery tree.

11. A computer-readable storage medium storing one or more programs, characterized in that: The one or more programs include instructions that, when executed by a computing device, cause the computing device to perform any one of the methods according to claims 1 to 9.

12. A computing device, characterized in that include: One or more processors, one or more memories, and one or more programs, wherein the one or more programs are stored in the one or more memories and configured to be executed by the one or more processors, the one or more programs comprising instructions for performing any of the methods according to claims 1 to 9.

Images