A method, system and storage medium for power outage recovery of a distribution network

Abstract

The present invention discloses a method, system and storage medium for power outage restoration in a distribution network. The present invention divides power outage nodes into candidate power supply partitions, performs MEG access optimization for the MEG candidate connection point partitions with power outage nodes divided therein, re-divides the power outage nodes in the MEG candidate connection point partitions without MEG access, and determines the optimal power outage restoration plan for each candidate power supply partition according to the power outage node division result, effectively realizing the application of MEG to power outage restoration in the distribution network.

Description

Technical Field

[0001] The present invention relates to a method, system and storage medium for power distribution network power outage restoration, belonging to the technical field of power grids. Background Art

[0002] As an important link connecting the power generation and transmission systems and end-users, the power distribution network (hereinafter referred to as "distribution network" for short) directly faces end-users and is closely related to people's production and life. It is an important public infrastructure for serving people's livelihood. However, in recent years, large-scale power outage accidents have occurred frequently due to natural disasters, cyber attacks, power grid equipment failures, large-scale disconnection of new energy sources, resource congestion, etc. These power outage accidents have seriously affected the normal energy consumption of users and the safe operation of the power generation and transmission systems. Therefore, in order to improve the power consumption quality of users and reduce power outage losses, it is necessary to take timely measures to restore power supply and efficiently restore the distribution network.

[0003] The power system has relatively mature research in power outage restoration. With the large-scale access of new types of loads such as Mobile Emergency Generators (MEG), the distribution network has gradually become multi-source and active, thus bringing new opportunities to the power outage restoration control of the distribution network.

[0004] MEG is actually a vehicle-mounted generator. The more common MEGs are generally diesel power generation vehicles, gas turbine power generation vehicles, and magnetic levitation flywheel energy storage power generation vehicles. When a persistent fault occurs in power equipment, resulting in an extended fault time of the distribution network, and due to the intermittency and uncertainty of Distributed Generators (DG) in time and space, when it is unable to restore power supply to important power-loss users, MEG can be used as an important flexible resource for the most effective and rapid restoration of power supply to important power-loss users in the distribution network.

[0005] The power outage restoration of the distribution network containing MEG is very different from the traditional power outage restoration of the distribution network. At present, a large number of research results have been obtained on the traditional power outage restoration of the distribution network. However, there is a lack of research on applying MEG to the power outage restoration of the distribution network. Summary of the Invention

[0006] The present invention provides a method, system and storage medium for power distribution network power outage restoration, which solves the problems disclosed in the background art.

[0007] In order to solve the above technical problems, the technical solutions adopted by the present invention are as follows:

[0008] A method for power distribution network power outage restoration includes:

[0009] Obtain the power outage nodes and candidate power supply partitions in the current power distribution network for non-isolated power outage areas; among them, the candidate power supply partition is the partition where the candidate power supply is located, each partition has a candidate power supply, and the candidate power supply includes a live system, a quasi-live system, and a MEG candidate connection point. The live system is the part of the power distribution network that operates stably to supply power, and the quasi-live system is a power supply in the power distribution network that is in a power outage state but has self-starting ability;

[0010] According to the preset criteria, divide the power outage nodes into candidate power supply partitions;

[0011] For the MEG candidate connection point partitions with power outage nodes divided, according to the preset model, perform MEG access optimization to obtain the MEG candidate connection point partitions with MEG access and the MEG candidate connection point partitions without MEG access;

[0012] According to the preset criteria, divide the power outage nodes in the MEG candidate connection point partitions without MEG access into the live system or quasi-live system partitions;

[0013] According to the power outage node division results, determine the optimal power outage restoration plan for each candidate power supply partition.

[0014] The preset criteria are:

[0015] The number of switch operations is the least;

[0016] The change in the power distribution network structure should be the least;

[0017] Divide into the MEG candidate connection point partitions with remaining available capacity, the live system partitions with active power deficit less than or equal to the threshold, and the quasi-live system partitions with active power deficit less than or equal to the threshold;

[0018] Give priority to dividing into the candidate power supply partition where the power outage node can obtain power in the shortest time;

[0019] If the shortest power acquisition time of the power outage node from multiple candidate power supply partitions is the same and the power outage node is a power source node, then the power outage node is divided into the candidate power supply partition with the largest active power deficit;

[0020] If the shortest power acquisition time of the power outage node from multiple candidate power supply partitions is the same and the power outage node is a load node, then the power outage node is divided into the candidate power supply partition with the smallest active power deficit;

[0021] If the shortest power acquisition time of the power outage node from the quasi-live system partition / live system partition is the same as the shortest power acquisition time from the MEG candidate connection point partition, then the power outage node is divided into the quasi-live system partition / live system partition;

[0022] If the shortest power acquisition time of the power outage node from multiple MEG candidate connection point partitions is the same, then the power outage node is divided into multiple MEG candidate connection point partitions at the same time;

[0023] Power outage nodes are not considered for cross-candidate power supply partition division;

[0024] Power outage nodes are not divided into candidate power supply partitions with a distance greater than the threshold value.

[0025] The preset model aims to maximize the total net restoration benefit of power outage nodes;

[0026] The objective function of the preset model is:

[0027] max W = W I -W C -W R

[0028] where W is the total net restoration benefit of power outage nodes, W I is the total restoration benefit of power outage nodes, W C is the total restoration cost of power outage nodes, W R is the total restoration risk of power outage nodes;

[0029]

[0030]

[0031]

[0032] where N e is the total number of power outage nodes in the distribution network, α i is the importance coefficient of the i-th power outage node, P i is the power shortage of the i-th power outage node, T i is the early restoration time of the i-th power outage node, N k is the total number of switches in the distribution network, γ j is the operation loss cost of the j-th switch, K j is the number of operations of the j-th switch, N r is the total number of restoration paths, β k is the probability that the k-th restoration path fails to be put into operation, L k is the loss caused by the failure of the k-th restoration path to be put into operation.

[0033] According to the power outage node division results, determine the optimal power outage restoration plan for each candidate power supply partition, including:

[0034] Calculate the restoration risk, restoration cost, and restoration benefit of the shortest time restoration path of power outage nodes within the candidate power supply partition; among them, the shortest time restoration path is the restoration path corresponding to the shortest power acquisition time;

[0035] Calculate the net restoration benefit of the shortest time restoration path of power outage nodes within the candidate power supply partition according to the restoration risk, restoration cost, and restoration benefit;

[0036] Determine the restoration order and quantity of power outage nodes based on the net restoration benefit of the shortest-time restoration path of power outage nodes and the power of candidate power sources, and obtain the optimal power outage restoration plan.

[0037] The net restoration benefit of the shortest-time restoration path of power outage nodes within the candidate power source partition is calculated by the formula:

[0038]

[0039] where, W i t is the net restoration benefit of the shortest-time restoration path of the i-th power outage node in the t-th candidate power source partition, is the restoration benefit of the shortest-time restoration path of the i-th power outage node in the t-th candidate power source partition, is the restoration cost of the shortest-time restoration path of the i-th power outage node in the t-th candidate power source partition, is the restoration risk of the shortest-time restoration path of the i-th power outage node in the t-th candidate power source partition;

[0040]

[0041]

[0042]

[0043] where, is the importance coefficient of the i-th power outage node in the t-th candidate power source partition, P i t is the power shortage of the i-th power outage node in the t-th candidate power source partition, T i t is the early restoration time of the i-th power outage node in the t-th candidate power source partition, J is the total number of switches of the shortest-time restoration path of the i-th power outage node in the t-th candidate power source partition, is the operation loss cost of the j'-th switch, is the number of operations of the j'-th switch, is the probability that the k'-th operation of the shortest-time restoration path of the i-th power outage node in the t-th candidate power source partition is unsuccessful, is the loss caused by the unsuccessful operation of the k'-th operation of the shortest-time restoration path of the i-th power outage node in the t-th candidate power source partition.

[0044] A distribution network power outage restoration system includes:

[0045] Acquisition module: Acquire the power outage nodes and candidate power supply partitions in the current power distribution network for non-isolated power outage areas; among them, the candidate power supply partition is the partition where the candidate power supply is located, each partition has a candidate power supply, and the candidate power supply includes a live system, a quasi-live system, and a MEG candidate connection point. The live system is the part of the power distribution network that supplies power stably, and the quasi-live system is a power supply in the power distribution network that is in a power outage state but has self-starting ability;

[0046] First partitioning module: Partition the power outage nodes into candidate power supply partitions according to preset criteria;

[0047] MEG access optimization module: For the MEG candidate connection point partitions with power outage nodes partitioned, perform MEG access optimization according to a preset model to obtain the MEG candidate connection point partitions with MEG access and the MEG candidate connection point partitions without MEG access;

[0048] Second partitioning module: According to preset criteria, partition the power outage nodes in the MEG candidate connection point partitions without MEG access into live system or quasi-live system partitions;

[0049] Optimal solution determination module: Determine the optimal power outage restoration solution for each candidate power supply partition according to the power outage node partitioning results.

[0050] The preset criteria are:

[0051] The number of switch operations is the least;

[0052] The change in the power distribution network structure should be the least;

[0053] Partition into MEG candidate connection point partitions with remaining available capacity, live system partitions with active power deficit less than or equal to the threshold, and quasi-live system partitions with active power deficit less than or equal to the threshold;

[0054] Give priority to partitioning into the candidate power supply partition with the shortest power acquisition time for the power outage node;

[0055] If the shortest power acquisition time of the power outage node is the same from multiple candidate power supply partitions and the power outage node is a power source node, then the power outage node is partitioned into the candidate power supply partition with the largest active power deficit;

[0056] If the shortest power acquisition time of the power outage node is the same from multiple candidate power supply partitions and the power outage node is a load node, then the power outage node is partitioned into the candidate power supply partition with the smallest active power deficit;

[0057] If the shortest power acquisition time of the power outage node from the quasi-live system partition / live system partition is the same as the shortest power acquisition time from the MEG candidate connection point partition, then the power outage node is partitioned into the quasi-live system partition / live system partition;

[0058] If the shortest power acquisition times of the power outage nodes are the same among multiple MEG candidate connection point partitions, the power outage nodes are simultaneously divided into multiple MEG candidate connection point partitions;

[0059] Power outage nodes are not considered for division across candidate power supply partitions;

[0060] Power outage nodes are not divided into candidate power supply partitions with a distance greater than the threshold value.

[0061] In the MEG access optimization module, the preset model aims to maximize the total net recovery benefit of the power outage nodes;

[0062] The objective function of the preset model is:

[0063] max W = W I -W C -W R

[0064] where W is the total net recovery benefit of the power outage nodes, W I is the total recovery benefit of the power outage nodes, W C is the total recovery cost of the power outage nodes, W R is the total recovery risk of the power outage nodes;

[0065]

[0066]

[0067]

[0068] where N e is the total number of power outage nodes in the distribution network, α i is the importance coefficient of the i-th power outage node, P i is the power shortage of the i-th power outage node, T i is the early recovery time of the i-th power outage node, N k is the total number of switches in the distribution network, γ j is the operation loss cost of the j-th switch, K j is the number of operations of the j-th switch, N r is the total number of recovery paths, β k is the probability that the k-th recovery path fails to be put into operation, L k is the loss caused by the failure of the k-th recovery path to be put into operation.

[0069] The optimal solution determination module includes:

[0070] The risk-cost-benefit calculation module: calculates the recovery risk, recovery cost, and recovery benefit of the shortest-time recovery path of the power outage nodes within the candidate power supply partition; among them, the shortest-time recovery path is the recovery path corresponding to the shortest power acquisition time;

[0071] Net income calculation module: Calculate the net recovery income of the shortest time recovery path of power outage nodes in the candidate power supply area according to the recovery risk, recovery cost, and recovery income;

[0072] Screening module: Determine the recovery order and quantity of power outage nodes according to the net recovery income of the shortest time recovery path of power outage nodes and the candidate power supply capacity, and obtain the optimal power outage recovery plan.

[0073] The formula for the net income calculation module to calculate the net recovery income is:

[0074]

[0075] where, W i t is the net recovery income of the shortest time recovery path of the i-th power outage node in the t-th candidate power supply area, is the recovery income of the shortest time recovery path of the i-th power outage node in the t-th candidate power supply area, is the recovery cost of the shortest time recovery path of the i-th power outage node in the t-th candidate power supply area, is the recovery risk of the shortest time recovery path of the i-th power outage node in the t-th candidate power supply area;

[0076]

[0077]

[0078]

[0079] where, is the importance coefficient of the i-th power outage node in the t-th candidate power supply area, P i t is the power shortage of the i-th power outage node in the t-th candidate power supply area, T i t is the early recovery time of the i-th power outage node in the t-th candidate power supply area, J is the total number of switches of the shortest time recovery path of the i-th power outage node in the t-th candidate power supply area, is the operation loss cost of the j'-th switch, is the operation times of the j'-th switch, is the probability of unsuccessful operation of the k'-th power supply of the shortest time recovery path of the i-th power outage node in the t-th candidate power supply area, is the loss caused by the unsuccessful operation of the k'-th power supply of the shortest time recovery path of the i-th power outage node in the t-th candidate power supply area.

[0080] A computer-readable storage medium storing one or more programs, the one or more programs including instructions that, when executed by a computing device, cause the computing device to execute a power outage recovery method for a distribution network.

[0081] Advantages achieved by the present invention: The present invention divides power outage nodes into candidate power supply zones, optimizes MEG access for MEG candidate connection point zones with power outage nodes divided therein, re-divides power outage nodes in MEG candidate connection point zones not connected to MEG, and determines the optimal power outage recovery plan for each candidate power supply zone according to the power outage node division result, effectively implementing the application of MEG to power outage recovery in a distribution network. Description of the Drawings

[0082] Figure 1 It is a flowchart of a power outage recovery method for a distribution network. Detailed Embodiments

[0083] The present invention will be further described below with reference to the drawings. The following embodiments are only used to more clearly illustrate the technical solution of the present invention and cannot be used to limit the protection scope of the present invention.

[0084] As Figure 1 shown, a power outage recovery method for a distribution network includes the following steps:

[0085] Step 1, obtain power outage nodes and candidate power supply zones in the current distribution network where the non-isolated power outage area is located; among them, the candidate power supply zone is the zone where the candidate power supply is located, each zone has a candidate power supply, the candidate power supply includes a live system, a quasi-live system, and an MEG candidate connection point, the live system is the part of the distribution network that stably supplies power, and the quasi-live system is a power supply in the distribution network that is in a power outage state but has self-starting ability;

[0086] Step 2, divide the power outage nodes into candidate power supply zones according to a preset criterion;

[0087] Step 3, for the MEG candidate connection point zone with power outage nodes divided therein, perform MEG access optimization according to a preset model to obtain an MEG candidate connection point zone connected to MEG and an MEG candidate connection point zone not connected to MEG;

[0088] Step 4, divide the power outage nodes in the MEG candidate connection point zone not connected to MEG into a live system or a quasi-live system zone according to a preset criterion;

[0089] Step 5, determine the optimal power outage recovery plan for each candidate power supply zone according to the power outage node division result.

[0090] The above method divides the power outage nodes into candidate power supply areas. For the MEG candidate connection point areas with power outage nodes divided, MEG access optimization is carried out. The power outage nodes in the MEG candidate connection point areas without MEG access are re-divided. According to the power outage node division results, the optimal power outage restoration plan for each candidate power supply area is determined, effectively realizing the application of MEG to the power distribution network power outage restoration.

[0091] According to the fault conditions of equipment such as transmission lines and switches in the power distribution network and the power distribution network topology structure, the operating state of the entire power distribution network can be identified as an isolated power outage area and a non-isolated power outage area; among them, if all power outage nodes in the area have no potential power transmission paths to any candidate power supply, this area is defined as an isolated power outage area; if all power outage nodes in the area have potential power transmission paths to at least one candidate power supply, this area is defined as a non-isolated power outage area.

[0092] The power distribution network power outage restoration mainly considers the power supply restoration of the power outage nodes in the non-isolated power outage area. There is temporarily no possibility of restoring power supply in the isolated power outage area, but with the maintenance of power equipment in the power distribution network system, it can gradually become a non-isolated power outage area.

[0093] In the power distribution network, considering the power supply capabilities of the power grid and MEG, the energized system, the quasi-energized system, and the MEG candidate connection points all have the potential to supply power to the power outage nodes, so these are collectively referred to as candidate power supplies; among them, the energized system is the part of the power distribution network that supplies power stably, and the energized power supply and its connected energized load and path are collectively referred to as the energized system. The quasi-energized system is a power supply in the power distribution network that is in a power outage state but has self-starting ability, and the MEG candidate connection point is a node that can connect MEG.

[0094] When carrying out power outage restoration, first, the power outage nodes and candidate power supply areas in the non-isolated power outage area of the current power distribution network need to be obtained, and then a parallel power supply area division strategy is adopted to restore power supply to the power outage nodes.

[0095] Therefore, it is necessary to divide the power outage nodes into candidate power supply areas. Among them, the candidate power supply area is the area where the candidate power supply is located, and each area has a candidate power supply; when dividing, the power outage nodes with high importance can be preferentially divided.

[0096] The division can adopt the following criteria:

[0097] 1) The number of switch operations is the least;

[0098] 2) In order to enable the power distribution network to return to its original power supply structure as soon as possible, the change in the power distribution network structure should be the least;

[0099] 3) Divide into the MEG candidate connection point areas with remaining available capacity, the energized system areas with active power deficit less than or equal to the threshold, and the quasi-energized system areas with active power deficit less than or equal to the threshold;

[0100] 4) Prioritize partitioning to the candidate power supply partition with the shortest power acquisition time for the power outage node;

[0101] 5) If the shortest power acquisition times from multiple candidate power supply partitions for the power outage node are the same and the power outage node is a power source node, then this power outage node is partitioned to the candidate power supply partition with the largest active power deficit;

[0102] 6) If the shortest power acquisition times from multiple candidate power supply partitions for the power outage node are the same and the power outage node is a load node, then this power outage node is partitioned to the candidate power supply partition with the smallest active power deficit;

[0103] 7) If the shortest power acquisition time from the quasi - energized system partition / energized system partition for the power outage node is the same as the shortest power acquisition time from the MEG candidate connection point partition, since the remaining available capacity of the MEG is uncertain, then this power outage node is partitioned to the quasi - energized system partition / energized system partition with a determined remaining available capacity;

[0104] 8) If the shortest power acquisition times from multiple MEG candidate connection point partitions for the power outage node are the same, then this power outage node is simultaneously partitioned to multiple MEG candidate connection point partitions;

[0105] 9) Power outage nodes are not considered for partitioning across candidate power supply partitions;

[0106] 10) Considering the voltage violation problem, power outage nodes are not partitioned to candidate power supply partitions with a distance greater than the threshold value, that is, power outage nodes are not partitioned to relatively far candidate power supply partitions.

[0107] Assume that a single MEG can surely start the power source node with a power outage. To give full play to the power supply restoration ability of the MEG, for the MEG candidate connection point partition where power outage nodes are partitioned, it is necessary to optimize the access of the MEG. Here, it is analyzed from three aspects: the total restoration benefit of the power outage node, the total restoration cost of the power outage node, and the total restoration risk of the power outage node.

[0108] Total restoration benefit of the power outage node:

[0109] The total restoration benefit of the power outage node is mainly related to the power deficit, importance, and time of early restoration of the power outage node to be restored. Therefore, the total restoration benefit of the power outage node can be:

[0110]

[0111] Among them, W I is the total restoration benefit of the power outage node, N e is the total number of power outage nodes in the distribution network, α i is the importance coefficient of the i - th power outage node, P i is the power deficit of the i - th power outage node, T iis the early restoration time of the \(i\)-th power outage node;

[0112] The early restoration time of a power outage node is the difference between the expected restoration time of the power outage node and the power acquisition time of the power outage node. The power acquisition time of the power outage node from the DG is the sum of the DG startup time and the DG power supply operation time. The power acquisition time of the power outage node from the MEG is the sum of the MEG dispatching travel time, the MEG startup time, and the MEG power supply operation time.

[0113] The total restoration cost of a power outage node:

[0114] The restoration of the distribution network is completed by closing the operating switch to restore power to the power outage node. Therefore, the total restoration cost of the power outage node is mainly the control cost of the operating switch, so it can be:

[0115]

[0116] Among them, \(W\) C is the total restoration cost of the power outage node, \(N\) k is the total number of switches in the distribution network, \(\gamma\) j is the operation loss cost of the \(j\)-th switch, \(K\) j is the number of operations of the \(j\)-th switch.

[0117] The total restoration risk of a power outage node:

[0118] There is a risk that the switch operation is unsuccessful, resulting in the unsuccessful operation of the restoration path. Therefore, the definition of the total restoration risk of the power outage node can be:

[0119]

[0120] Among them, \(N\) r is the total number of restoration paths, \(\beta\) k is the probability that the \(k\)-th restoration path fails to operate, \(L\) k is the loss caused by the unsuccessful operation of the \(k\)-th restoration path.

[0121] The total restoration net income of a power outage node:

[0122] The restoration of the distribution network is a multi-objective optimization problem, aiming to maximize the restoration income of the power outage node and minimize the restoration cost and risk of the power outage node. Therefore, here, by obtaining the maximum net income of the power outage node restoration, the multi-objective problem is transformed into a single-objective problem, that is, the optimization model aims to maximize the total restoration net income of the power outage node.

[0123] The objective function can be:

[0124] \(\max W = W\) I \(-W\) C \(-W\) R

[0125] Among them, W is the total net recovery benefit of the power outage nodes.

[0126] The distribution network restoration constraint conditions mainly consider power flow balance constraint, node voltage constraint, branch current constraint, branch capacity constraint and topological structure constraint.

[0127] Distribution network power flow balance constraint:

[0128]

[0129] Among them, N is the total number of nodes in the distribution network (the total number of all nodes in the distribution network, including power outage nodes and energized nodes), P i , Q i are the input active power and reactive power of the i-th node respectively, P DGi , Q DGi are the active power and reactive power of the distributed power source connected to the i-th node respectively, P MEGi , Q MEGi are the active power and reactive power of the mobile emergency power source connected to the i-th node respectively, P di , Q di are the active value and reactive value of the load at the i-th node; U i , U i′ are the voltage values of the i-th node and the i'-th node respectively; G ii′ , B ii′ are the real part and imaginary part of the admittance of line i-i' respectively; θ ii′ is the phase angle difference between the i-th node and the i'-th node.

[0130] Node voltage constraint:

[0131] U i,min ≤U i ≤U i,max

[0132] Among them, U i,min , U i,max are the lower limit and upper limit of U i respectively.

[0133] Branch current constraint:

[0134] I i-i′,min ≤I i-i′ ≤I i-i′,max

[0135] Among them, I i-i′ is the current of line i-i', I i-i′,min , I i-i′,max are the lower limit and upper limit of I i-i′ respectively.

[0136] Branch capacity constraint:

[0137] S i-j ≤S i-j,max

[0138] Wherein, S i-j and S i-j,max are respectively the actual capacity and the maximum capacity of line i - i'.

[0139] Topological structure constraint:

[0140] g ∈ G

[0141] Wherein, g is the network topological structure after reconstruction, and G is the set of all radial network topologies.

[0142] Based on the above optimization model, MEG access optimization is carried out to obtain the MEG candidate connection point partition for accessing MEG and the MEG candidate connection point partition for not accessing MEG. Then, the power outage nodes in the MEG candidate connection point partition for not accessing MEG are divided into the energized system or the quasi - energized system partition to obtain the final division result of all power outage nodes.

[0143] According to the power outage node division result, the optimal power outage restoration plan for each candidate power supply partition can be determined by the following method:

[0144] S1) Calculate the restoration risk, restoration cost and restoration benefit of the shortest - time restoration path of the power outage nodes in the candidate power supply partition; wherein, the shortest - time restoration path is the restoration path corresponding to the shortest power - obtaining time;

[0145] The calculation formula is similar to the above, and the following formula can be used:

[0146]

[0147]

[0148]

[0149] Wherein, is the importance coefficient of the i - th power outage node in the t - th candidate power supply partition, P i t is the power shortage of the i - th power outage node in the t - th candidate power supply partition, T i t is the early restoration time of the i - th power outage node in the t - th candidate power supply partition, J is the total number of switches of the shortest - time restoration path of the i - th power outage node in the t - th candidate power supply partition, is the operation loss cost of the j'- th switch, is the operation times of the j'- th switch, is the probability that the operation of the shortest-time restoration path \(k'\) for the \(i\)-th power outage node in the \(t\)-th candidate power supply partition fails. is the loss caused by the failure of the shortest-time restoration path \(k'\) for the \(i\)-th power outage node in the \(t\)-th candidate power supply partition.

[0150] S2) Calculate the net restoration benefit of the shortest-time restoration path of the power outage nodes in the candidate power supply partition according to the restoration risk, restoration cost, and restoration benefit.

[0151] The following formula can be used:

[0152]

[0153] where \(W\) i t is the net restoration benefit of the shortest-time restoration path of the \(i\)-th power outage node in the \(t\)-th candidate power supply partition, is the restoration benefit of the shortest-time restoration path of the \(i\)-th power outage node in the \(t\)-th candidate power supply partition, is the restoration cost of the shortest-time restoration path of the \(i\)-th power outage node in the \(t\)-th candidate power supply partition, is the restoration risk of the shortest-time restoration path of the \(i\)-th power outage node in the \(t\)-th candidate power supply partition

[0154] S3) Determine the restoration order and quantity of the power outage nodes according to the net restoration benefit of the shortest-time restoration path of the power outage nodes and the candidate power supply capacity, and obtain the optimal power outage restoration plan.

[0155] Because the power supply capacity in the partition may not be enough to restore all the power outage nodes in the partition, it is necessary to screen out the loads with higher net restoration benefits and restore them first, that is, determine the restoration order and quantity of the power outage nodes, and then the optimal power outage restoration plan for the partition can be obtained.

[0156] The above method applies mobile emergency power supplies to the power distribution network outage restoration, fully coordinates and utilizes various restoration resources, and greatly improves the power supply reliability of the power distribution network, which should attract the attention of the majority of relevant professional researchers.

[0157] The software system corresponding to the above method, a power distribution network outage restoration system, includes:

[0158] An acquisition module: acquire the power outage nodes and candidate power supply partitions in the current non-isolated power outage area of the power distribution network; among them, the candidate power supply partition is the partition where the candidate power supply is located, each partition has a candidate power supply, and the candidate power supply includes a live system, a quasi-live system, and a MEG candidate connection point. The live system is the part of the power distribution network that supplies power stably, and the quasi-live system is a power supply in the power distribution network that is in a power outage state but has self-starting ability.

[0159] The first partitioning module: according to the preset criteria, partition the power outage nodes into candidate power supply areas.

[0160] The preset criteria are as follows:

[0161] The number of switch operations is the least;

[0162] The change in the distribution network structure should be the least;

[0163] Partition into the MEG candidate connection point area with remaining available capacity, the energized system area with active power deficit less than or equal to the threshold, and the quasi-energized system area with active power deficit less than or equal to the threshold;

[0164] Give priority to partitioning into the candidate power supply area with the shortest power acquisition time for the power outage node;

[0165] If the shortest power acquisition time of the power outage node is the same from multiple candidate power supply areas and the power outage node is a power source node, then the power outage node is partitioned into the candidate power supply area with the largest active power deficit;

[0166] If the shortest power acquisition time of the power outage node is the same from multiple candidate power supply areas and the power outage node is a load node, then the power outage node is partitioned into the candidate power supply area with the smallest active power deficit;

[0167] If the shortest power acquisition time of the power outage node from the quasi-energized system area / energized system area is the same as the shortest power acquisition time from the MEG candidate connection point area, then the power outage node is partitioned into the quasi-energized system area / energized system area;

[0168] If the shortest power acquisition time of the power outage node is the same from multiple MEG candidate connection point areas, then the power outage node is simultaneously partitioned into multiple MEG candidate connection point areas;

[0169] The power outage node is not considered for partitioning across candidate power supply areas;

[0170] Do not partition the power outage node into a candidate power supply area with a distance greater than the threshold value.

[0171] The MEG access optimization module: for the MEG candidate connection point area where the power outage node is partitioned, according to the preset model, perform MEG access optimization to obtain the MEG candidate connection point area with MEG access and the MEG candidate connection point area without MEG access.

[0172] In the MEG access optimization module, the preset model aims to maximize the total recovery net benefit of the power outage node;

[0173] The objective function of the preset model is:

[0174] max W = W I -W C -W R

[0175] Among them, \(W\) is the total net recovery benefit of the power outage nodes, \(W\) I is the total recovery benefit of the power outage nodes, \(W\) C is the total recovery cost of the power outage nodes, \(W\) R is the total recovery risk of the power outage nodes;

[0176]

[0177]

[0178]

[0179] Among them, \(N\) e is the total number of power outage nodes in the distribution network, \(\alpha\) i is the importance coefficient of the \(i\)-th power outage node, \(P\) i is the power shortage of the \(i\)-th power outage node, \(T\) i is the early recovery time of the \(i\)-th power outage node, \(N\) k is the total number of switches in the distribution network, \(\gamma\) j is the operation loss cost of the \(j\)-th switch, \(K\) j is the number of operations of the \(j\)-th switch, \(N\) r is the total number of recovery paths, \(\beta\) k is the probability that the \(k\)-th recovery path fails to be put into operation, \(L\) k is the loss caused by the failure of the \(k\)-th recovery path to be put into operation.

[0180] Second partitioning module: Partition the MEG candidate connection points that are not connected to the MEG into the energized system or the quasi-energized system partition according to the preset criteria.

[0181] Optimal solution determination module: Determine the optimal power outage recovery plan for each candidate power supply partition according to the power outage node partitioning result.

[0182] The optimal solution determination module includes:

[0183] Risk-cost-benefit calculation module: Calculate the recovery risk, recovery cost, and recovery benefit of the shortest-time recovery path of the power outage nodes in the candidate power supply partition; among them, the shortest-time recovery path is the recovery path corresponding to the shortest power acquisition time;

[0184] Net benefit calculation module: Calculate the net recovery benefit of the shortest-time recovery path of the power outage nodes in the candidate power supply partition according to the recovery risk, recovery cost, and recovery benefit;

[0185] The formula for the net benefit calculation module to calculate the net recovery benefit is:

[0186]

[0187] Among them, \(W\)i t is the net restoration benefit of the shortest-time restoration path for the \(i\)-th power outage node in the \(t\)-th candidate power supply partition. is the restoration benefit of the shortest-time restoration path for the \(i\)-th power outage node in the \(t\)-th candidate power supply partition. is the restoration cost of the shortest-time restoration path for the \(i\)-th power outage node in the \(t\)-th candidate power supply partition. is the restoration risk of the shortest-time restoration path for the \(i\)-th power outage node in the \(t\)-th candidate power supply partition.

[0188]

[0189]

[0190]

[0191] Among them, is the importance coefficient of the \(i\)-th power outage node in the \(t\)-th candidate power supply partition, \(P\) i t is the power shortage of the \(i\)-th power outage node in the \(t\)-th candidate power supply partition, \(T\) i t is the early restoration time of the \(i\)-th power outage node in the \(t\)-th candidate power supply partition, \(J\) is the total number of switches of the shortest-time restoration path for the \(i\)-th power outage node in the \(t\)-th candidate power supply partition. is the operation loss cost of the \(j'\)-th switch. is the number of operations of the \(j'\)-th switch. is the probability that the \(k'\)-th operation of the shortest-time restoration path for the \(i\)-th power outage node in the \(t\)-th candidate power supply partition fails to be put into operation. is the loss caused by the failure of the \(k'\)-th operation of the shortest-time restoration path for the \(i\)-th power outage node in the \(t\)-th candidate power supply partition to be put into operation.

[0192] Filtering module: Determine the restoration order and quantity of power outage nodes according to the net restoration benefit of the shortest-time restoration path of power outage nodes and the candidate power supply power, and obtain the optimal power outage restoration plan.

[0193] A computer-readable storage medium storing one or more programs, the one or more programs including instructions that, when executed by a computing device, cause the computing device to execute a distribution network power outage restoration method.

[0194] A computing device, including 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 a distribution network power outage restoration method.

[0195] Those skilled in the art should understand that the embodiments of the present invention can be provided as a method, a system, or a computer program product. Therefore, the present invention can take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present invention can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk memory, CD-ROM, optical memory, etc.) that contain computer-usable program code.

[0196] The present invention is described with reference to the flowcharts and / or block diagrams of methods, apparatuses (systems), and computer program products according to embodiments of the present invention. It should be understood that each flow and / or block in the flowchart and / or block diagram, as well as the combination of flows and / or blocks in the flowchart and / or block diagram, can be realized by computer program instructions. These computer program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing devices to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing devices generate means for realizing the functions specified in one Figure 1 one flow or multiple flows and / or blocks Figure 1 one block or multiple blocks.

[0197] These computer program instructions can 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 generate a manufactured article including instruction means, and the instruction means realizes the functions specified in one Figure 1 one flow or multiple flows and / or blocks Figure 1 one block or multiple blocks.

[0198] These computer program instructions can also be loaded onto a computer or other programmable data processing device, so that a series of operation steps are executed on the computer or other programmable device to generate a computer-implemented process. Thus, the instructions executed on the computer or other programmable device provide steps for realizing the functions specified in one Figure 1 one flow or multiple flows and / or blocks Figure 1 one block or multiple blocks.

[0199] The above are only embodiments of the present invention and are not used to limit the present invention. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present invention are included in the scope of the claims of the present invention pending approval.

Claims

1. A method for restoring power outage in a distribution network, characterized in that, Including: Obtain the power outage nodes and candidate power supply partitions in the current power distribution network where there is no isolated power outage area; among them, the candidate power supply partition is the partition where the candidate power supply is located, and there is one candidate power supply in each partition. The candidate power supply includes a live power system, a quasi-live power system, and a MEG candidate connection point. The live power system is the part of the power distribution network that operates stably to supply power, and the quasi-live power system is a power supply in the power distribution network that is in a power outage state but has the ability to self-start; According to a preset criterion, divide the power outage nodes into the candidate power supply partitions; For the MEG candidate connection point partitions with power outage nodes divided, according to a preset model, perform MEG access optimization to obtain the MEG candidate connection point partitions with MEG access and the MEG candidate connection point partitions without MEG access; According to a preset criterion, divide the power outage nodes in the MEG candidate connection point partitions without MEG access into the live power system partition or the quasi-live power system partition; According to the power outage node division result, determine the optimal power outage restoration plan for each candidate power supply partition; Among them, the preset criterion is: the number of switch operations is the least; the change in the power distribution network structure should be the least; divide into the MEG candidate connection point partitions with remaining available capacity, the live power system partitions with active power deficit less than or equal to the threshold, and the quasi-live power system partitions with active power deficit less than or equal to the threshold; preferentially divide into the candidate power supply partitions with the shortest power acquisition time for the power outage nodes; if the shortest power acquisition times of the power outage nodes from multiple candidate power supply partitions are the same and the power outage node is a power source node, then this power outage node is divided into the candidate power supply partition with the largest active power deficit; if the shortest power acquisition times of the power outage nodes from multiple candidate power supply partitions are the same and the power outage node is a load node, then this power outage node is divided into the candidate power supply partition with the smallest active power deficit; if the shortest power acquisition time of the power outage node from the quasi-live power system partition / live power system partition is the same as the shortest power acquisition time from the MEG candidate connection point partition, then this power outage node is divided into the quasi-live power system partition / live power system partition; if the shortest power acquisition times of the power outage nodes from multiple MEG candidate connection point partitions are the same, then this power outage node is divided into multiple MEG candidate connection point partitions at the same time; power outage nodes are not considered to be divided across candidate power supply partitions; do not divide power outage nodes into candidate power supply partitions with a distance greater than the threshold value; The preset model aims to maximize the total recovery net benefit of the power outage nodes; the objective function of the preset model is: maxW = W I -W C -W R Among them, W is the total net restoration benefit of the power outage nodes, and W I is the total restoration benefit of the power outage nodes, and W C is the total restoration cost of the power outage nodes, and W R is the total restoration risk of the power outage nodes; Among them, N e is the total number of power outage nodes in the distribution network, α i is the importance coefficient of the i-th power outage node, P i is the power shortage of the i-th power outage node, T i is the early restoration time of the i-th power outage node, N k is the total number of switches in the distribution network, γ j is the operation loss cost of the j-th switch, K j is the number of operations of the j-th switch, N r is the total number of restoration paths, β k is the probability that the k-th restoration path fails to be put into operation, L k is the loss caused by the failure of the k-th restoration path to be put into operation.

2. The power distribution network power outage recovery method according to claim 1, wherein According to the power outage node division result, determine the optimal power outage restoration plan for each candidate power supply partition, including: Calculate the recovery risk, recovery cost, and recovery benefit of the shortest time recovery path of the power outage nodes in the candidate power supply partition; among them, the shortest time recovery path is the recovery path corresponding to the shortest power acquisition time; According to the recovery risk, recovery cost, and recovery benefit, calculate the recovery net benefit of the shortest time recovery path of the power outage nodes in the candidate power supply partition; According to the recovery net benefit of the shortest time recovery path of the power outage nodes and the candidate power supply power, determine the recovery order and quantity of the power outage nodes to obtain the optimal power outage restoration plan.

3. The power distribution outage recovery method according to claim 2, wherein The calculation formula for the recovery net benefit of the shortest time recovery path of the power outage nodes in the candidate power supply partition is: Among them, W i t is the net recovery benefit of the shortest-time recovery path for the i-th power outage node in the t-th candidate power supply partition, is the recovery benefit of the shortest-time recovery path for the i-th power outage node in the t-th candidate power supply partition, is the recovery cost of the shortest-time recovery path for the i-th power outage node in the t-th candidate power supply partition, is the recovery risk of the shortest-time recovery path for the i-th power outage node in the t-th candidate power supply partition; Among them, is the importance coefficient of the i-th power outage node in the t-th candidate power supply partition, P i t is the power shortage of the i-th power outage node in the t-th candidate power supply partition, T i t is the early restoration time of the i-th power outage node in the t-th candidate power supply partition, J is the total number of switches on the shortest time restoration path of the i-th power outage node in the t-th candidate power supply partition, is the operation loss cost of the j'-th switch, is the number of operations of the j'-th switch, is the probability that the k'-th shortest time restoration path of the i-th power outage node in the t-th candidate power supply partition fails to be put into operation, is the loss caused by the failure of the k'-th shortest time restoration path of the i-th power outage node in the t-th candidate power supply partition to be put into operation.

4. A distribution network power outage recovery system, characterized in that, Including: Acquisition Module: Acquire the power outage nodes and candidate power supply partitions in the current power distribution network during power outage that are not isolated; among them, the candidate power supply partition is the partition where the candidate power supply is located, each partition has a candidate power supply, and the candidate power supply includes a live system, a quasi-live system, and a MEG candidate connection point. The live system is the part of the power distribution network that operates stably to supply power, and the quasi-live system is a power supply in the power distribution network that is in a power outage state but has the ability to self-start. First Partition Module: According to the preset criteria, partition the power outage nodes into candidate power supply partitions. MEG Access Optimization Module: For the MEG candidate connection point partitions with power outage nodes partitioned, according to the preset model, perform MEG access optimization to obtain the MEG candidate connection point partitions with MEG access and the MEG candidate connection point partitions without MEG access. Second Partition Module: According to the preset criteria, partition the power outage nodes in the MEG candidate connection point partitions without MEG access into the live system or quasi-live system partitions. Optimal Solution Determination Module: According to the power outage node partition results, determine the optimal power outage restoration plan for each candidate power supply partition. Among them, the preset criteria are: the number of switch operations should be the least; the change in the power distribution network structure should be the least; partition into the MEG candidate connection point partitions with remaining available capacity, the live system partitions with active power deficit less than or equal to the threshold, and the quasi-live system partitions with active power deficit less than or equal to the threshold; preferentially partition into the candidate power supply partitions with the shortest power acquisition time for the power outage nodes; if the shortest power acquisition times of the power outage nodes from multiple candidate power supply partitions are the same and the power outage nodes are power source nodes, then these power outage nodes are partitioned into the candidate power supply partitions with the largest active power deficit; if the shortest power acquisition times of the power outage nodes from multiple candidate power supply partitions are the same and the power outage nodes are load nodes, then these power outage nodes are partitioned into the candidate power supply partitions with the smallest active power deficit; if the shortest power acquisition time of the power outage nodes from the quasi-live system partition / live system partition is the same as the shortest power acquisition time from the MEG candidate connection point partition, then these power outage nodes are partitioned into the quasi-live system partition / live system partition; if the shortest power acquisition times of the power outage nodes from multiple MEG candidate connection point partitions are the same, then these power outage nodes are simultaneously partitioned into multiple MEG candidate connection point partitions; power outage nodes are not considered to be partitioned across candidate power supply partitions; do not partition power outage nodes into candidate power supply partitions with a distance greater than the threshold value. In the MEG Access Optimization Module, the preset model aims to maximize the total recovery net benefit of the power outage nodes; the objective function of the preset model is: maxW = W I -W C -W R Among them, \(W\) is the total net recovery benefit of the power outage nodes, \(W\) I is the total recovery benefit of the power outage nodes, \(W\) C is the total recovery cost of the power outage nodes, \(W\) R is the total recovery risk of the power outage nodes; Among them, N e is the total number of power outage nodes in the distribution network, α i is the importance coefficient of the i-th power outage node, P i is the power shortage of the i-th power outage node, T i is the early restoration time of the i-th power outage node, N k is the total number of switches in the distribution network, γ j is the operation loss cost of the j-th switch, K j is the number of operations of the j-th switch, N r is the total number of restoration paths, β k is the probability that the k-th restoration path fails to be put into operation, L k is the loss caused by the unsuccessful operation of the k-th restoration path.

5. The power distribution outage recovery system according to claim 4, characterized in that The Optimal Solution Determination Module includes: Risk Cost Benefit Calculation Module: Calculate the recovery risk, recovery cost, and recovery benefit of the shortest time recovery path of the power outage nodes in the candidate power supply partition; among them, the shortest time recovery path is the recovery path corresponding to the shortest power acquisition time. Net Benefit Calculation Module: According to the recovery risk, recovery cost, and recovery benefit, calculate the recovery net benefit of the shortest time recovery path of the power outage nodes in the candidate power supply partition. Screening Module: According to the recovery net benefit of the shortest time recovery path of the power outage nodes and the candidate power supply power, determine the recovery order and quantity of the power outage nodes to obtain the optimal power outage restoration plan.

6. The power distribution network power outage recovery system according to claim 5, wherein, The formula for the Net Benefit Calculation Module to calculate the recovery net benefit is: where, W i t is the net restoration benefit of the shortest-time restoration path for the i-th power outage node in the t-th candidate power supply partition, is the restoration benefit of the shortest-time restoration path for the i-th power outage node in the t-th candidate power supply partition, is the restoration cost of the shortest-time restoration path for the i-th power outage node in the t-th candidate power supply partition, is the restoration risk of the shortest-time restoration path for the i-th power outage node in the t-th candidate power supply partition; Among them, is the importance coefficient of the i-th power outage node in the t-th candidate power supply partition, P i t is the power shortage of the i-th power outage node in the t-th candidate power supply partition, T i t is the early restoration time of the i-th power outage node in the t-th candidate power supply partition, J is the total number of switches on the shortest time restoration path of the i-th power outage node in the t-th candidate power supply partition, is the operation loss cost of the j'-th switch, is the number of operations of the j'-th switch, is the probability that the k'-th shortest time restoration path of the i-th power outage node in the t-th candidate power supply partition fails to be put into operation, is the loss caused by the unsuccessful operation of the k'-th shortest time restoration path of the i-th power outage node in the t-th candidate power supply partition.

7. 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 of the methods according to claims 1 to 3.

Images