CN114358384A - Distribution network power failure recovery method and system and storage medium - Google Patents

Distribution network power failure recovery method and system and storage medium Download PDF

Info

Publication number
CN114358384A
CN114358384A CN202111476877.4A CN202111476877A CN114358384A CN 114358384 A CN114358384 A CN 114358384A CN 202111476877 A CN202111476877 A CN 202111476877A CN 114358384 A CN114358384 A CN 114358384A
Authority
CN
China
Prior art keywords
power
power failure
candidate
recovery
node
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202111476877.4A
Other languages
Chinese (zh)
Inventor
张子衿
赖业宁
孙丰杰
周天
撖奥洋
李吉晨
罗鲁东
钟世民
李泽
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
QINGDAO POWER SUPPLY Co OF STATE GRID SHANDONG ELECTRIC POWER Co
NARI Nanjing Control System Co Ltd
Original Assignee
QINGDAO POWER SUPPLY Co OF STATE GRID SHANDONG ELECTRIC POWER Co
NARI Nanjing Control System Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by QINGDAO POWER SUPPLY Co OF STATE GRID SHANDONG ELECTRIC POWER Co, NARI Nanjing Control System Co Ltd filed Critical QINGDAO POWER SUPPLY Co OF STATE GRID SHANDONG ELECTRIC POWER Co
Priority to CN202111476877.4A priority Critical patent/CN114358384A/en
Publication of CN114358384A publication Critical patent/CN114358384A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/06—Electricity, gas or water supply
    • H—ELECTRICITY
    • H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02H—EMERGENCY PROTECTIVE CIRCUIT ARRANGEMENTS
    • H02H3/00—Emergency protective circuit arrangements for automatic disconnection directly responsive to an undesired change from normal electric working condition with or without subsequent reconnection ; integrated protection
    • H02H3/02—Details
    • H02H3/06—Details with automatic reconnection
    • H02H3/066—Reconnection being a consequence of eliminating the fault which caused disconnection

Abstract

The invention discloses a distribution network power failure recovery method, a distribution network power failure recovery system and a storage medium.

Description

Distribution network power failure recovery method and system and storage medium
Technical Field
The invention relates to a distribution network power failure recovery method, a distribution network power failure recovery system and a storage medium, and belongs to the technical field of power grids.
Background
The power distribution network (hereinafter referred to as "distribution network") is used as an important link for connecting a power transmission and transmission system and a terminal user, is directly oriented to the terminal user, is closely related to the production and life of people, and is an important public infrastructure for serving the people. However, in recent years, large-area power failure accidents have frequently occurred due to natural disasters, network attacks, power grid equipment failures, large-scale new energy grid disconnection, resource blockage and the like. The power failure accidents seriously affect the normal energy utilization of users and the safe operation of a power generation and transmission system, so in order to improve the power utilization quality of the users and reduce the power failure loss, measures for recovering power supply need to be taken in time to efficiently recover the power distribution network.
The power system has been researched more maturely in the aspect of power failure recovery, and with the large-scale access of novel loads such as Mobile Emergency power generation (MEG), a distribution network gradually has multiple sources and initiative, so that a new opportunity is brought to the power failure recovery control of the distribution network.
The MEG is actually a vehicle-mounted generator, and the more common MEG is generally a diesel generator car, a gas turbine generator car and a magnetic suspension flywheel energy storage generator car. When the power equipment has persistent faults to prolong the fault time of the distribution network, and due to the intermittence and uncertainty of a Distributed Generation (DG) in time and space, the MEG can be used as an important flexible resource for quickly recovering the power supply of important power-losing users of the distribution network most effectively.
The distribution network power failure recovery containing the MEG is greatly different from the traditional distribution network power failure recovery, a large amount of achievements are obtained in the research on the traditional distribution network power failure recovery at present, and the MEG is not applied to the research on the distribution network power failure recovery.
Disclosure of Invention
The invention provides a distribution network power failure recovery method, a distribution network power failure recovery system and a storage medium, and solves the problems disclosed in the background technology.
In order to solve the technical problems, the technical scheme adopted by the invention is as follows:
a distribution network power failure recovery method comprises the following steps:
acquiring power failure nodes and candidate power partitions of a non-isolated power failure area in a current distribution network; the candidate power supply partition is a partition where a candidate power supply is located, each partition is provided with one candidate power supply, each candidate power supply comprises an electrified system, a quasi-electrified system and an MEG candidate connection point, the electrified system is a part stably running and supplying power in a distribution network, and the quasi-electrified system is a power supply which is in a power failure state but has self-starting capability in the distribution network;
dividing the power failure nodes into candidate power partitions according to preset criteria;
aiming at MEG candidate connection point partitions divided with power failure nodes, performing MEG access optimization according to a preset model to obtain MEG candidate connection point partitions accessed to MEG and MEG candidate connection point partitions not accessed to MEG;
dividing MEG candidate connection point partition power-off nodes which are not connected with MEG into electrified system partitions or quasi-electrified system partitions according to a preset criterion;
and determining the optimal power failure recovery scheme of each candidate power supply partition according to the power failure node division result.
The preset criteria are:
the number of switching operations is minimal;
the distribution network structure should be minimally changed;
dividing into MEG candidate connection point subareas with residual available capacity, electrified system subareas with active vacancy less than or equal to a threshold value and quasi-electrified system subareas with active vacancy less than or equal to the threshold value;
preferentially dividing the candidate power supply partition with the shortest power-obtaining time of the power failure node;
if the shortest power obtaining time of the power failure node from the candidate power partitions is consistent and the power failure node is the power supply node, dividing the power failure node into the candidate power partition with the largest active power shortage;
if the shortest power obtaining time of the power failure node from the candidate power partitions is consistent, and the power failure node is a load node, dividing the power failure node into the candidate power partition with the smallest active power shortage;
if the shortest power obtaining time of the power failure node from the quasi-charged system partition/charged system partition is consistent with the shortest power obtaining time of the candidate MEG connection point partition, the power failure node is divided into the quasi-charged system partition/charged system partition;
if the shortest power obtaining time of the power failure node from the multiple MEG candidate connection point partitions is consistent, the power failure node is divided into the multiple MEG candidate connection point partitions at the same time;
the power failure node does not consider the partition of the cross-candidate power supply partition;
and not dividing the power failure node into candidate power partitions with the distance larger than the threshold value.
The method comprises the steps that a preset model aims at the maximum total recovery net income of a power failure node;
the objective function of the preset model is:
max W＝WI-WC-WR
wherein W is the total net return of the blackout node, WIFor total recovery of power failure node, WCTotal recovery cost for blackout node, WRThe total recovery risk of the power failure node;
Figure BDA0003393795490000031
Figure BDA0003393795490000032
Figure BDA0003393795490000033
wherein N iseFor total number of power-off nodes in distribution network, alphaiImportance coefficient, P, for the ith blackout nodeiFor the power shortage of the i-th blackout node, TiFor the early recovery time of the ith blackout node, NkFor total number of switches, gamma, in the distribution networkjFor operation of the jth switch, KjIs the number of operations of the jth switch, NrTo recover the total number of paths, βkFor the probability of unsuccessful commissioning of the kth recovery path, LkLosses due to unsuccessful commissioning of the kth restoration path.
Determining the optimal power failure recovery scheme of each candidate power supply partition according to the power failure node division result, wherein the scheme comprises the following steps:
calculating the recovery risk, the recovery cost and the recovery income of the shortest time recovery path of the power failure node in the candidate power supply partition; the shortest time recovery path is a recovery path corresponding to the shortest power obtaining time;
calculating the net recovery profit of the power failure node shortest time recovery path in the candidate power supply partition according to the recovery risk, the recovery cost and the recovery profit;
and determining the recovery sequence and the number of the power failure nodes according to the recovery net income of the shortest time recovery path of the power failure nodes and the candidate power supply power, and obtaining an optimal power failure recovery scheme.
The net return for recovery of the shortest time recovery path of the power failure node in the candidate power supply partition is calculated according to the formula:
Figure BDA0003393795490000041
wherein, Wi tThe net benefit of the recovery of the path in the shortest time for the ith blackout node of the tth candidate power partition,
Figure BDA0003393795490000045
recovery gains for ith blackout node shortest time recovery path of tth candidate power partition，
Figure BDA0003393795490000046
Recovering cost of the shortest time recovering path of the ith blackout node of the ith candidate power partition,
Figure BDA0003393795490000047
recovering the risk of the ith power failure node shortest time recovery path for the tth candidate power supply partition;
Figure BDA0003393795490000042
Figure BDA0003393795490000043
Figure BDA0003393795490000044
wherein the content of the first and second substances,
Figure BDA0003393795490000048
importance coefficient, P, for ith blackout node of tth candidate power partitioni tFor the power shortage power, T, of the ith power failure node of the tth candidate power partitioni tThe early recovery time of the ith blackout node of the tth candidate power supply partition, J is the total number of switches of the recovery path of the ith blackout node of the tth candidate power supply partition in the shortest time,
Figure BDA0003393795490000049
the expense is penalized for the operation of the jth switch,
Figure BDA00033937954900000410
the number of operations of the jth switch,
Figure BDA0003393795490000051
partitioning ith blackout node for tth candidate power supplyThe probability of unsuccessful commissioning of the point shortest time restoration path k',
Figure BDA0003393795490000052
the method is the loss caused by unsuccessful commissioning of the ith power failure node recovery path k' for the tth candidate power supply partition in the shortest time.
A distribution network power outage restoration system comprising:
an acquisition module: acquiring power failure nodes and candidate power partitions of a non-isolated power failure area in a current distribution network; the candidate power supply partition is a partition where a candidate power supply is located, each partition is provided with one candidate power supply, each candidate power supply comprises an electrified system, a quasi-electrified system and an MEG candidate connection point, the electrified system is a part stably running and supplying power in a distribution network, and the quasi-electrified system is a power supply which is in a power failure state but has self-starting capability in the distribution network;
a first division module: dividing the power failure nodes into candidate power partitions according to preset criteria;
MEG access optimization module: aiming at MEG candidate connection point partitions divided with power failure nodes, performing MEG access optimization according to a preset model to obtain MEG candidate connection point partitions accessed to MEG and MEG candidate connection point partitions not accessed to MEG;
a second dividing module: dividing MEG candidate connection point partition power-off nodes which are not connected with MEG into electrified system partitions or quasi-electrified system partitions according to a preset criterion;
an optimal scheme determination module: and determining the optimal power failure recovery scheme of each candidate power supply partition according to the power failure node division result.
The preset criteria are:
the number of switching operations is minimal;
the distribution network structure should be minimally changed;
dividing into MEG candidate connection point subareas with residual available capacity, electrified system subareas with active vacancy less than or equal to a threshold value and quasi-electrified system subareas with active vacancy less than or equal to the threshold value;
preferentially dividing the candidate power supply partition with the shortest power-obtaining time of the power failure node;
if the shortest power obtaining time of the power failure node from the candidate power partitions is consistent and the power failure node is the power supply node, dividing the power failure node into the candidate power partition with the largest active power shortage;
if the shortest power obtaining time of the power failure node from the candidate power partitions is consistent, and the power failure node is a load node, dividing the power failure node into the candidate power partition with the smallest active power shortage;
if the shortest power obtaining time of the power failure node from the quasi-charged system partition/charged system partition is consistent with the shortest power obtaining time of the candidate MEG connection point partition, the power failure node is divided into the quasi-charged system partition/charged system partition;
if the shortest power obtaining time of the power failure node from the multiple MEG candidate connection point partitions is consistent, the power failure node is divided into the multiple MEG candidate connection point partitions at the same time;
the power failure node does not consider the partition of the cross-candidate power supply partition;
and not dividing the power failure node into candidate power partitions with the distance larger than the threshold value.
The MEG is accessed into an optimization module, and the maximum total recovery net income of a preset model based on the power failure node is a target;
the objective function of the preset model is:
max W＝WI-WC-WR
wherein W is the total net return of the blackout node, WIFor total recovery of power failure node, WCTotal recovery cost for blackout node, WRThe total recovery risk of the power failure node;
Figure BDA0003393795490000061
Figure BDA0003393795490000062
Figure BDA0003393795490000063
wherein N iseFor total number of power-off nodes in distribution network, alphaiImportance coefficient, P, for the ith blackout nodeiFor the power shortage of the i-th blackout node, TiFor the early recovery time of the ith blackout node, NkFor total number of switches, gamma, in the distribution networkjFor operation of the jth switch, KjIs the number of operations of the jth switch, NrTo recover the total number of paths, βkFor the probability of unsuccessful commissioning of the kth recovery path, LkLosses due to unsuccessful commissioning of the kth restoration path.
An optimal solution determination module comprising:
a risk cost benefit calculation module: calculating the recovery risk, the recovery cost and the recovery income of the shortest time recovery path of the power failure node in the candidate power supply partition; the shortest time recovery path is a recovery path corresponding to the shortest power obtaining time;
a net gain calculation module: calculating the net recovery profit of the power failure node shortest time recovery path in the candidate power supply partition according to the recovery risk, the recovery cost and the recovery profit;
a screening module: and determining the recovery sequence and the number of the power failure nodes according to the recovery net income of the shortest time recovery path of the power failure nodes and the candidate power supply power, and obtaining an optimal power failure recovery scheme.
The net profit calculation module calculates the formula for recovering the net profit as follows:
Figure BDA0003393795490000074
wherein, Wi tThe net benefit of the recovery of the path in the shortest time for the ith blackout node of the tth candidate power partition,
Figure BDA0003393795490000075
recovering the recovery benefit of the path in the shortest time of the ith blackout node of the tth candidate power partition,
Figure BDA0003393795490000076
recovering cost of the shortest time recovering path of the ith blackout node of the ith candidate power partition,
Figure BDA0003393795490000077
recovering the risk of the ith power failure node shortest time recovery path for the tth candidate power supply partition;
Figure BDA0003393795490000071
Figure BDA0003393795490000072
Figure BDA0003393795490000073
wherein the content of the first and second substances,
Figure BDA0003393795490000078
importance coefficient, P, for ith blackout node of tth candidate power partitioni tFor the power shortage power, T, of the ith power failure node of the tth candidate power partitioni tThe early recovery time of the ith blackout node of the tth candidate power supply partition, J is the total number of switches of the recovery path of the ith blackout node of the tth candidate power supply partition in the shortest time,
Figure BDA0003393795490000081
the expense is penalized for the operation of the jth switch,
Figure BDA0003393795490000082
the number of operations of the jth switch,
Figure BDA0003393795490000083
unsuccessful commissioning of ith power failure node shortest time recovery path k' for tth candidate power partitionThe probability of (a) of (b) being,
Figure BDA0003393795490000084
the method is the loss caused by unsuccessful commissioning of the ith power failure node recovery path k' for the tth candidate power supply partition in the shortest time.
A computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a computing device, cause the computing device to perform a distribution network outage restoration method.
The invention achieves the following beneficial effects: according to the method, the power failure nodes are divided into the candidate power supply partitions, the MEG access optimization is carried out on the MEG candidate connection point partitions with the power failure nodes, the power failure nodes of the MEG candidate connection point partitions which are not accessed into the MEG are divided again, the optimal power failure recovery scheme of each candidate power supply partition is determined according to the power failure node division result, and the MEG is effectively applied to the power failure recovery of the distribution network.
Drawings
Fig. 1 is a flow chart of a distribution network power failure recovery method.
Detailed Description
The invention is further described below with reference to the accompanying drawings. The following examples are only for illustrating the technical solutions of the present invention more clearly, and the protection scope of the present invention is not limited thereby.
As shown in fig. 1, a distribution network power failure recovery method includes the following steps:
step 1, acquiring power failure nodes and candidate power supply partitions of a non-isolated power failure area in a current distribution network; the candidate power supply partition is a partition where a candidate power supply is located, each partition is provided with one candidate power supply, each candidate power supply comprises an electrified system, a quasi-electrified system and an MEG candidate connection point, the electrified system is a part stably running and supplying power in a distribution network, and the quasi-electrified system is a power supply which is in a power failure state but has self-starting capability in the distribution network;
step 2, dividing the power failure nodes into candidate power partitions according to a preset criterion;
step 3, aiming at MEG candidate connection point partitions divided with power failure nodes, carrying out MEG access optimization according to a preset model to obtain MEG candidate connection point partitions accessed to MEG and MEG candidate connection point partitions not accessed to MEG;
step 4, dividing the power failure nodes of the MEG candidate connection point partitions which are not connected with the MEG into the electrified system or the quasi-electrified system partitions according to a preset criterion;
and 5, determining the optimal power failure recovery scheme of each candidate power supply partition according to the power failure node division result.
According to the method, the power failure nodes are divided into the candidate power supply partitions, the MEG access optimization is carried out on the MEG candidate connection point partitions with the power failure nodes, the power failure nodes of the MEG candidate connection point partitions which are not accessed into the MEG are divided again, the optimal power failure recovery scheme of each candidate power supply partition is determined according to the power failure node division result, and the MEG is effectively applied to the power failure recovery of the distribution network.
According to the fault conditions of equipment such as a power transmission line, a switch and the like in a distribution network and the topological structure of the distribution network, the running state of the whole distribution network can be identified as an isolated power failure area and a non-isolated power failure area; if all the power failure nodes and any candidate power supply in the area have no potential power transmission paths, defining the area as an isolated power failure area; and if potential power transmission paths exist between all the power failure nodes and at least one candidate power supply in the area, defining the area as a non-isolated power failure area.
The main consideration for the power failure recovery of the distribution network is the power supply recovery of power failure nodes in a non-isolated power failure area, and the isolated power failure area has no possibility of power supply recovery temporarily, but can gradually become the non-isolated power failure area along with the maintenance of power equipment of the distribution network system.
In a distribution network, the power supply capacities of a power grid and an MEG are considered, and the candidate connection points of a live system, a quasi-live system and the MEG have potential power supply capacities for power failure nodes, so that the candidate connection points are collectively called as candidate power supplies; the live system is a part for stably running and supplying power in a distribution network, a live power supply, a live load communicated with the live power supply and a path of the live power supply are collectively called as the live system, the quasi-live system is a power supply which is in a power failure state and has self-starting capability in the distribution network, and the MEG candidate connection point is a node capable of being connected with the MEG.
When power failure recovery is carried out, power failure nodes and candidate power partitions of a non-isolated power failure area in a current distribution network are acquired, and then a parallel power supply area division strategy is adopted to recover power supply for the power failure nodes.
Therefore, the power failure nodes need to be divided into candidate power supply partitions, wherein the candidate power supply partitions are partitions where candidate power supplies are located, and each partition has one candidate power supply; when dividing, the power failure nodes with high importance can be divided preferentially.
The partitioning may employ the following criteria:
1) the number of switching operations is minimal;
2) in order to enable the distribution network to recover to the original power supply structure as soon as possible, the distribution network structure changes minimally;
3) dividing into MEG candidate connection point subareas with residual available capacity, electrified system subareas with active vacancy less than or equal to a threshold value and quasi-electrified system subareas with active vacancy less than or equal to the threshold value;
4) preferentially dividing the candidate power supply partition with the shortest power-obtaining time of the power failure node;
5) if the shortest power obtaining time of the power failure node from the candidate power partitions is consistent and the power failure node is the power supply node, dividing the power failure node into the candidate power partition with the largest active power shortage;
6) if the shortest power obtaining time of the power failure node from the candidate power partitions is consistent, and the power failure node is a load node, dividing the power failure node into the candidate power partition with the smallest active power shortage;
7) if the shortest power obtaining time of the power failure node from the quasi-charged system partition/charged system partition is consistent with the shortest power obtaining time of the candidate MEG connection point partition, and the MEG residual available capacity is uncertain, the power failure node is divided into the quasi-charged system partition/charged system partition with the determined residual available capacity;
8) if the shortest power obtaining time of the power failure node from the multiple MEG candidate connection point partitions is consistent, the power failure node is divided into the multiple MEG candidate connection point partitions at the same time;
9) the power failure node does not consider the partition of the cross-candidate power supply partition;
10) in consideration of the problem of voltage out-of-limit, the power failure node is not divided into candidate power partitions with distances larger than the threshold value, namely, the power failure node is not divided into distant candidate power partitions.
Assuming that a single MEG can start a power supply node with power failure certainly, in order to fully exert the power supply recovery capability of the MEG, aiming at the candidate connection point partition of the MEG with the power failure node, the access of the MEG needs to be optimized, and analysis is performed from three angles of the total recovery income of the power failure node, the total recovery cost of the power failure node and the total recovery risk of the power failure node.
Total recovery yield of blackout nodes:
the total recovery income of the power failure node is mainly related to the power shortage power, the importance degree and the time of recovery in advance of the power failure node to be recovered, so the total recovery income of the power failure node can be as follows:
Figure BDA0003393795490000111
wherein, WIFor total recovery of power outage node, NeFor total number of power-off nodes in distribution network, alphaiImportance coefficient, P, for the ith blackout nodeiFor the power shortage of the i-th blackout node, TiThe early recovery time of the ith power failure node is;
the power failure node early recovery time is the difference between the predicted recovery time of the power failure node and the power obtaining time of the power failure node, the power obtaining time of the power failure node from the DG is the sum of the DG starting time and the DG power supply operation time, and the power obtaining time of the power failure node from the MEG is the sum of the MEG scheduling driving time, the MEG starting time and the MEG power supply operation time.
Total recovery cost of blackout nodes:
the power distribution network recovers to complete the power restoration of the power failure node through the closing of the operation switch, so the total recovery cost of the power failure node is mainly the control cost of the operation switch, and therefore the power distribution network can be as follows:
Figure BDA0003393795490000121
wherein, WCFor total restoration cost of blackout node, NkFor total number of switches, gamma, in the distribution networkjFor operation of the jth switch, KjThe number of operations of the jth switch.
Total recovery risk of blackout node:
there is a risk of unsuccessful switching operations, resulting in unsuccessful commissioning of the restoration path, so the total restoration risk of a blackout node may be defined as:
Figure BDA0003393795490000122
wherein N isrTo recover the total number of paths, βkFor the probability of unsuccessful commissioning of the kth recovery path, LkLosses due to unsuccessful commissioning of the kth restoration path.
Total net return revenue of blackout node:
the power distribution network recovery is a multi-objective optimization problem, the maximum recovery benefit of the power failure node is realized as far as possible, and the recovery cost and the risk of the power failure node are minimum. Therefore, the multi-objective problem is converted into the single-objective problem by acquiring the maximum net return of the power failure node, namely, the total net return of the optimization model by the power failure node is maximum.
The objective function may be:
max W＝WI-WC-WR
wherein W is the total net return gain of the blackout node.
The power distribution network recovery constraint conditions mainly consider tidal current balance constraint, node voltage constraint, branch current constraint, branch capacity constraint and topological structure constraint.
And power flow balance constraint of the power distribution network:
Figure BDA0003393795490000131
wherein N is the total number of nodes of the power distribution network (the total number of all nodes of the power distribution network, including power failure and power failure), and P isi、QiInput active and reactive power, P, respectively, of the ith nodeDGi、QDGiActive power and reactive power of distributed power supply respectively accessed to ith node, PMEGi、QMEGiActive power and reactive power P of mobile emergency power supply respectively accessed to ith nodedi、QdiRespectively the active value and the reactive value of the load at the ith node; u shapei、Ui′Voltage values of an ith node and an ith' node are respectively obtained; gii′、Bii′Respectively the real part and the imaginary part of the admittance of the line i-i'; thetaii′The phase angle difference of the ith node and the ith' node.
Node voltage constraint:
Ui,min≤Ui≤Ui,max
wherein, Ui,min、Ui,maxAre respectively UiLower and upper limits of.
And (3) branch current constraint:
Ii-i′,min≤Ii-i′≤Ii-i′,max
wherein, Ii-i′Is the current of line I-I', Ii-i′,min、Ii-i′,maxAre respectively Ii-i′Lower and upper limits of.
Branch capacity constraint:
Si-j≤Si-j,max
wherein S isi-j、Si-j,maxThe actual capacity and the maximum capacity of the line i-i', respectively.
And (3) topological structure constraint:
g∈G
wherein G is the network topology structure after reconstruction, and G is the set of all radial network topologies.
And based on the optimization model, MEG access optimization is carried out, MEG candidate connection point partitions accessed to the MEG and MEG candidate connection point partitions not accessed to the MEG can be obtained, then power failure nodes of the MEG candidate connection point partitions not accessed to the MEG are divided into the electrified system or the quasi-electrified system partitions, and the final division results of all the power failure nodes are obtained.
According to the power failure node division result, determining the optimal power failure recovery scheme of each candidate power supply partition, wherein the following method can be adopted:
s1) calculating the recovery risk, recovery cost and recovery benefit of the shortest time recovery path of the power failure node in the candidate power supply partition; the shortest time recovery path is a recovery path corresponding to the shortest power obtaining time;
the calculation formula is similar to the above, and the following formula can be adopted:
Figure BDA0003393795490000141
Figure BDA0003393795490000142
Figure BDA0003393795490000143
wherein the content of the first and second substances,
Figure BDA0003393795490000145
importance coefficient, P, for ith blackout node of tth candidate power partitioni tFor the power shortage power, T, of the ith power failure node of the tth candidate power partitioni tThe early recovery time of the ith blackout node of the tth candidate power supply partition, J is the total number of switches of the recovery path of the ith blackout node of the tth candidate power supply partition in the shortest time,
Figure BDA0003393795490000146
the expense is penalized for the operation of the jth switch,
Figure BDA0003393795490000147
the number of operations of the jth switch,
Figure BDA0003393795490000148
the probability of unsuccessful commissioning of the path k' is recovered for the shortest time of the ith blackout node of the tth candidate power partition,
Figure BDA0003393795490000149
the method is the loss caused by unsuccessful commissioning of the ith power failure node recovery path k' for the tth candidate power supply partition in the shortest time.
S2), calculating the recovery net benefit of the power failure node shortest time recovery path in the candidate power supply partition according to the recovery risk, the recovery cost and the recovery benefit.
The following formula may be employed:
Figure BDA0003393795490000144
wherein, Wi tThe net benefit of the recovery of the path in the shortest time for the ith blackout node of the tth candidate power partition,
Figure BDA0003393795490000151
recovering the recovery benefit of the path in the shortest time of the ith blackout node of the tth candidate power partition,
Figure BDA0003393795490000152
recovering cost of the shortest time recovering path of the ith blackout node of the ith candidate power partition,
Figure BDA0003393795490000153
recovery risk of ith blackout node shortest time recovery path for tth candidate power partition
S3) determining the recovery sequence and the number of the blackout nodes according to the recovery net income of the blackout node shortest time recovery path and the candidate power supply power, and obtaining an optimal blackout recovery scheme.
Because the power of the power supply in the partition may not be enough to recover all the blackout nodes in the partition, loads with higher net recovery yield need to be screened out and recovered preferentially, that is, the recovery sequence and the number of the blackout nodes are determined, so that the optimal blackout recovery scheme of the partition can be obtained.
According to the method, the mobile emergency power supply is applied to power failure recovery of the power distribution network, various recovery resources are fully utilized in a coordinated manner, the power supply reliability of the power distribution network is greatly improved, and the method is concerned by the majority of relevant professional researchers.
The software system corresponding to the method is a distribution network power failure recovery system, and comprises the following steps:
an acquisition module: acquiring power failure nodes and candidate power partitions of a non-isolated power failure area in a current distribution network; the candidate power supply partition is a partition where the candidate power supply is located, each partition is provided with one candidate power supply, the candidate power supplies comprise an electrified system, a quasi-electrified system and an MEG candidate connection point, the electrified system is a part stably running and supplying power in a distribution network, and the quasi-electrified system is a power supply which is in a power failure state but has self-starting capability in the distribution network.
A first division module: and dividing the power failure nodes into candidate power partitions according to a preset criterion.
The preset criteria are:
the number of switching operations is minimal;
the distribution network structure should be minimally changed;
dividing into MEG candidate connection point subareas with residual available capacity, electrified system subareas with active vacancy less than or equal to a threshold value and quasi-electrified system subareas with active vacancy less than or equal to the threshold value;
preferentially dividing the candidate power supply partition with the shortest power-obtaining time of the power failure node;
if the shortest power obtaining time of the power failure node from the candidate power partitions is consistent and the power failure node is the power supply node, dividing the power failure node into the candidate power partition with the largest active power shortage;
if the shortest power obtaining time of the power failure node from the candidate power partitions is consistent, and the power failure node is a load node, dividing the power failure node into the candidate power partition with the smallest active power shortage;
if the shortest power obtaining time of the power failure node from the quasi-charged system partition/charged system partition is consistent with the shortest power obtaining time of the candidate MEG connection point partition, the power failure node is divided into the quasi-charged system partition/charged system partition;
if the shortest power obtaining time of the power failure node from the multiple MEG candidate connection point partitions is consistent, the power failure node is divided into the multiple MEG candidate connection point partitions at the same time;
the power failure node does not consider the partition of the cross-candidate power supply partition;
and not dividing the power failure node into candidate power partitions with the distance larger than the threshold value.
MEG access optimization module: and aiming at the MEG candidate connection point partition divided with the power failure node, performing MEG access optimization according to a preset model to obtain an MEG candidate connection point partition accessed to the MEG and an MEG candidate connection point partition not accessed to the MEG.
The MEG is accessed into an optimization module, and the maximum total recovery net income of a preset model based on the power failure node is a target;
the objective function of the preset model is:
max W＝WI-WC-WR
wherein W is the total net return of the blackout node, WIFor total recovery of power failure node, WCTotal recovery cost for blackout node, WRThe total recovery risk of the power failure node;
Figure BDA0003393795490000161
Figure BDA0003393795490000171
Figure BDA0003393795490000172
wherein N iseFor total number of power-off nodes in distribution network, alphaiImportance coefficient, P, for the ith blackout nodeiFor the ith stopPower loss of electrical node, TiFor the early recovery time of the ith blackout node, NkFor total number of switches, gamma, in the distribution networkjFor operation of the jth switch, KjIs the number of operations of the jth switch, NrTo recover the total number of paths, βkFor the probability of unsuccessful commissioning of the kth recovery path, LkLosses due to unsuccessful commissioning of the kth restoration path.
A second dividing module: and dividing the power failure nodes of the MEG candidate connection point partitions which are not connected with the MEG into the electrified system or the quasi-electrified system partitions according to a preset criterion.
An optimal scheme determination module: and determining the optimal power failure recovery scheme of each candidate power supply partition according to the power failure node division result.
An optimal solution determination module comprising:
a risk cost benefit calculation module: calculating the recovery risk, the recovery cost and the recovery income of the shortest time recovery path of the power failure node in the candidate power supply partition; the shortest time recovery path is a recovery path corresponding to the shortest power obtaining time;
a net gain calculation module: calculating the net recovery profit of the power failure node shortest time recovery path in the candidate power supply partition according to the recovery risk, the recovery cost and the recovery profit;
the net profit calculation module calculates the formula for recovering the net profit as follows:
Figure BDA0003393795490000173
wherein, Wi tThe net benefit of the recovery of the path in the shortest time for the ith blackout node of the tth candidate power partition,
Figure BDA0003393795490000174
recovering the recovery benefit of the path in the shortest time of the ith blackout node of the tth candidate power partition,
Figure BDA0003393795490000184
recovering cost of the shortest time recovering path of the ith blackout node of the ith candidate power partition,
Figure BDA0003393795490000185
recovering the risk of the ith power failure node shortest time recovery path for the tth candidate power supply partition;
Figure BDA0003393795490000181
Figure BDA0003393795490000182
Figure BDA0003393795490000183
wherein the content of the first and second substances,
Figure BDA0003393795490000186
importance coefficient, P, for ith blackout node of tth candidate power partitioni tFor the power shortage power, T, of the ith power failure node of the tth candidate power partitioni tThe early recovery time of the ith blackout node of the tth candidate power supply partition, J is the total number of switches of the recovery path of the ith blackout node of the tth candidate power supply partition in the shortest time,
Figure BDA0003393795490000187
the expense is penalized for the operation of the jth switch,
Figure BDA0003393795490000188
the number of operations of the jth switch,
Figure BDA0003393795490000189
the probability of unsuccessful commissioning of the path k' is recovered for the shortest time of the ith blackout node of the tth candidate power partition,
Figure BDA00033937954900001810
the method is the loss caused by unsuccessful commissioning of the ith power failure node recovery path k' for the tth candidate power supply partition in the shortest time.
A screening module: and determining the recovery sequence and the number of the power failure nodes according to the recovery net income of the shortest time recovery path of the power failure nodes and the candidate power supply power, and obtaining an optimal power failure recovery scheme.
A computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a computing device, cause the computing device to perform a distribution network outage restoration method.
A computing device comprising one or more processors, one or more memories, and one or more programs stored in the one or more memories and configured to be executed by the one or more processors, the one or more programs including instructions for performing a distribution network outage restoration method.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The present invention is not limited to the above embodiments, and any modifications, equivalent replacements, improvements, etc. made within the spirit and principle of the present invention are included in the scope of the claims of the present invention which are filed as the application.

Claims (11)

1. A distribution network power failure recovery method is characterized by comprising the following steps:
acquiring power failure nodes and candidate power partitions of a non-isolated power failure area in a current distribution network; the candidate power supply partition is a partition where a candidate power supply is located, each partition is provided with one candidate power supply, each candidate power supply comprises an electrified system, a quasi-electrified system and an MEG candidate connection point, the electrified system is a part stably running and supplying power in a distribution network, and the quasi-electrified system is a power supply which is in a power failure state but has self-starting capability in the distribution network;
dividing the power failure nodes into candidate power partitions according to preset criteria;
aiming at MEG candidate connection point partitions divided with power failure nodes, performing MEG access optimization according to a preset model to obtain MEG candidate connection point partitions accessed to MEG and MEG candidate connection point partitions not accessed to MEG;
dividing MEG candidate connection point partition power-off nodes which are not connected with MEG into electrified system partitions or quasi-electrified system partitions according to a preset criterion;
and determining the optimal power failure recovery scheme of each candidate power supply partition according to the power failure node division result.
2. The distribution network power failure recovery method according to claim 1, wherein the preset criterion is as follows:
the number of switching operations is minimal;
the distribution network structure should be minimally changed;
dividing into MEG candidate connection point subareas with residual available capacity, electrified system subareas with active vacancy less than or equal to a threshold value and quasi-electrified system subareas with active vacancy less than or equal to the threshold value;
preferentially dividing the candidate power supply partition with the shortest power-obtaining time of the power failure node;
if the shortest power obtaining time of the power failure node from the candidate power partitions is consistent and the power failure node is the power supply node, dividing the power failure node into the candidate power partition with the largest active power shortage;
if the shortest power obtaining time of the power failure node from the candidate power partitions is consistent, and the power failure node is a load node, dividing the power failure node into the candidate power partition with the smallest active power shortage;
if the shortest power obtaining time of the power failure node from the quasi-charged system partition/charged system partition is consistent with the shortest power obtaining time of the candidate MEG connection point partition, the power failure node is divided into the quasi-charged system partition/charged system partition;
if the shortest power obtaining time of the power failure node from the multiple MEG candidate connection point partitions is consistent, the power failure node is divided into the multiple MEG candidate connection point partitions at the same time;
the power failure node does not consider the partition of the cross-candidate power supply partition;
and not dividing the power failure node into candidate power partitions with the distance larger than the threshold value.
3. The distribution network power failure recovery method according to claim 1, wherein the preset model aims at the maximum total recovery net income of the power failure nodes;
the objective function of the preset model is:
maxW＝WI-WC-WR
wherein W is the total net return of the blackout node, WIFor total recovery of power failure node, WCTotal recovery cost for blackout node, WRThe total recovery risk of the power failure node;
Figure FDA0003393795480000021
Figure FDA0003393795480000022
Figure FDA0003393795480000023
wherein N iseFor total number of power-off nodes in distribution network, alphaiImportance coefficient, P, for the ith blackout nodeiFor the power shortage of the i-th blackout node, TiFor the early recovery time of the ith blackout node, NkFor total number of switches, gamma, in the distribution networkjFor operation of the jth switch, KjIs the number of operations of the jth switch, NrTo recover the total number of paths, βkFor the probability of unsuccessful commissioning of the kth recovery path, LkLosses due to unsuccessful commissioning of the kth restoration path.
4. The distribution network power failure recovery method of claim 1, wherein the determining of the optimal power failure recovery scheme for each candidate power supply partition according to the power failure node partitioning result comprises:
calculating the recovery risk, the recovery cost and the recovery income of the shortest time recovery path of the power failure node in the candidate power supply partition; the shortest time recovery path is a recovery path corresponding to the shortest power obtaining time;
calculating the net recovery profit of the power failure node shortest time recovery path in the candidate power supply partition according to the recovery risk, the recovery cost and the recovery profit;
and determining the recovery sequence and the number of the power failure nodes according to the recovery net income of the shortest time recovery path of the power failure nodes and the candidate power supply power, and obtaining an optimal power failure recovery scheme.
5. The distribution network power failure recovery method according to claim 4, wherein the net return for recovery of the shortest time recovery path of the power failure node in the candidate power partition is calculated by the following formula:
Figure FDA0003393795480000031
wherein, Wi tThe net benefit of the recovery of the path in the shortest time for the ith blackout node of the tth candidate power partition,
Figure FDA0003393795480000032
recovering the recovery benefit of the path in the shortest time of the ith blackout node of the tth candidate power partition,
Figure FDA0003393795480000033
recovering cost of the shortest time recovering path of the ith blackout node of the ith candidate power partition,
Figure FDA0003393795480000034
recovering the risk of the ith power failure node shortest time recovery path for the tth candidate power supply partition;
Figure FDA0003393795480000035
Figure FDA0003393795480000036
Figure FDA0003393795480000037
wherein the content of the first and second substances,
Figure FDA0003393795480000038
importance coefficient, P, for ith blackout node of tth candidate power partitioni tFor the power shortage power, T, of the ith power failure node of the tth candidate power partitioni tThe early recovery time of the ith blackout node of the tth candidate power supply partition, J is the total number of switches of the recovery path of the ith blackout node of the tth candidate power supply partition in the shortest time,
Figure FDA0003393795480000041
the expense is penalized for the operation of the jth switch,
Figure FDA0003393795480000042
the number of operations of the jth switch,
Figure FDA0003393795480000043
the probability of unsuccessful commissioning of the path k' is recovered for the shortest time of the ith blackout node of the tth candidate power partition,
Figure FDA0003393795480000044
the method is the loss caused by unsuccessful commissioning of the ith power failure node recovery path k' for the tth candidate power supply partition in the shortest time.
6. A distribution network power failure recovery system, comprising:
an acquisition module: acquiring power failure nodes and candidate power partitions of a non-isolated power failure area in a current distribution network; the candidate power supply partition is a partition where a candidate power supply is located, each partition is provided with one candidate power supply, each candidate power supply comprises an electrified system, a quasi-electrified system and an MEG candidate connection point, the electrified system is a part stably running and supplying power in a distribution network, and the quasi-electrified system is a power supply which is in a power failure state but has self-starting capability in the distribution network;
a first division module: dividing the power failure nodes into candidate power partitions according to preset criteria;
MEG access optimization module: aiming at MEG candidate connection point partitions divided with power failure nodes, performing MEG access optimization according to a preset model to obtain MEG candidate connection point partitions accessed to MEG and MEG candidate connection point partitions not accessed to MEG;
a second dividing module: dividing MEG candidate connection point partition power-off nodes which are not connected with MEG into electrified system partitions or quasi-electrified system partitions according to a preset criterion;
an optimal scheme determination module: and determining the optimal power failure recovery scheme of each candidate power supply partition according to the power failure node division result.
7. The distribution network power failure recovery system according to claim 6, wherein the preset criteria are:
the number of switching operations is minimal;
the distribution network structure should be minimally changed;
dividing into MEG candidate connection point subareas with residual available capacity, electrified system subareas with active vacancy less than or equal to a threshold value and quasi-electrified system subareas with active vacancy less than or equal to the threshold value;
preferentially dividing the candidate power supply partition with the shortest power-obtaining time of the power failure node;
if the shortest power obtaining time of the power failure node from the candidate power partitions is consistent and the power failure node is the power supply node, dividing the power failure node into the candidate power partition with the largest active power shortage;
if the shortest power obtaining time of the power failure node from the candidate power partitions is consistent, and the power failure node is a load node, dividing the power failure node into the candidate power partition with the smallest active power shortage;
if the shortest power obtaining time of the power failure node from the quasi-charged system partition/charged system partition is consistent with the shortest power obtaining time of the candidate MEG connection point partition, the power failure node is divided into the quasi-charged system partition/charged system partition;
if the shortest power obtaining time of the power failure node from the multiple MEG candidate connection point partitions is consistent, the power failure node is divided into the multiple MEG candidate connection point partitions at the same time;
the power failure node does not consider the partition of the cross-candidate power supply partition;
and not dividing the power failure node into candidate power partitions with the distance larger than the threshold value.
8. The distribution network power failure recovery system according to claim 6, wherein the MEG is connected to the optimization module, and the preset model aims at maximizing the total recovery net income of the power failure nodes;
the objective function of the preset model is:
maxW＝WI-WC-WR
wherein W is the total net return of the blackout node, WIFor total recovery of power failure node, WCTotal recovery cost for blackout node, WRThe total recovery risk of the power failure node;
Figure FDA0003393795480000051
Figure FDA0003393795480000061
Figure FDA0003393795480000062
wherein N isePower failure node assembly in distribution networkNumber, alphaiImportance coefficient, P, for the ith blackout nodeiFor the power shortage of the i-th blackout node, TiFor the early recovery time of the ith blackout node, NkFor total number of switches, gamma, in the distribution networkjFor operation of the jth switch, KjIs the number of operations of the jth switch, NrTo recover the total number of paths, βkFor the probability of unsuccessful commissioning of the kth recovery path, LkLosses due to unsuccessful commissioning of the kth restoration path.
9. The distribution network power failure recovery system according to claim 6, wherein the optimal solution determining module comprises:
a risk cost benefit calculation module: calculating the recovery risk, the recovery cost and the recovery income of the shortest time recovery path of the power failure node in the candidate power supply partition; the shortest time recovery path is a recovery path corresponding to the shortest power obtaining time;
a net gain calculation module: calculating the net recovery profit of the power failure node shortest time recovery path in the candidate power supply partition according to the recovery risk, the recovery cost and the recovery profit;
a screening module: and determining the recovery sequence and the number of the power failure nodes according to the recovery net income of the shortest time recovery path of the power failure nodes and the candidate power supply power, and obtaining an optimal power failure recovery scheme.
10. The distribution network power failure recovery system of claim 9, wherein the net gain calculation module calculates the net gain recovery formula as follows:
Figure FDA0003393795480000063
wherein, Wi tThe net benefit of the recovery of the path in the shortest time for the ith blackout node of the tth candidate power partition,
Figure FDA0003393795480000064
recovering the recovery benefit of the path in the shortest time of the ith blackout node of the tth candidate power partition,
Figure FDA0003393795480000071
recovering cost of the shortest time recovering path of the ith blackout node of the ith candidate power partition,
Figure FDA0003393795480000072
recovering the risk of the ith power failure node shortest time recovery path for the tth candidate power supply partition;
Figure FDA0003393795480000073
Figure FDA0003393795480000074
Figure FDA0003393795480000075
wherein the content of the first and second substances,
Figure FDA0003393795480000076
importance coefficient, P, for ith blackout node of tth candidate power partitioni tFor the power shortage power, T, of the ith power failure node of the tth candidate power partitioni tThe early recovery time of the ith blackout node of the tth candidate power supply partition, J is the total number of switches of the recovery path of the ith blackout node of the tth candidate power supply partition in the shortest time,
Figure FDA0003393795480000077
the expense is penalized for the operation of the jth switch,
Figure FDA0003393795480000078
the number of operations of the jth switch,
Figure FDA0003393795480000079
the probability of unsuccessful commissioning of the path k' is recovered for the shortest time of the ith blackout node of the tth candidate power partition,
Figure FDA00033937954800000710
the method is the loss caused by unsuccessful commissioning of the ith power failure node recovery path k' for the tth candidate power supply partition in the shortest time.
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 of the methods of claims 1-5.
CN202111476877.4A 2021-12-06 2021-12-06 Distribution network power failure recovery method and system and storage medium Pending CN114358384A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111476877.4A CN114358384A (en) 2021-12-06 2021-12-06 Distribution network power failure recovery method and system and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111476877.4A CN114358384A (en) 2021-12-06 2021-12-06 Distribution network power failure recovery method and system and storage medium

Publications (1)

Publication Number Publication Date
CN114358384A true CN114358384A (en) 2022-04-15

Family

ID=81097972

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111476877.4A Pending CN114358384A (en) 2021-12-06 2021-12-06 Distribution network power failure recovery method and system and storage medium

Country Status (1)

Country Link
CN (1) CN114358384A (en)

Similar Documents

Publication Publication Date Title
CN108988322B (en) Microgrid operation strategy optimization method considering system time-varying property
CN112671029A (en) Multi-stage fault recovery method for distribution network with distributed power supply
CN104868465A (en) Power system grid structure reconfiguration and optimization method based on fuzzy chance constraint
CN105337278A (en) Method for network reconstruction double-layer optimization based on node importance evaluation matrix
CN103746366A (en) Electric power system recovery method based on node importance degree
CN108923428B (en) Dynamic recovery system and method for power distribution network based on cell apoptosis algorithm
CN110676839A (en) Method and system for evaluating reliability of alternating current-direct current hybrid power distribution network
CN115693755A (en) Island division-based fault recovery method for power distribution network with distributed power supply
CN113328437B (en) Intelligent power distribution network CPS topology construction method and fault recovery method
CN111724025B (en) High-voltage distribution network frame planning method based on power supply unit optimized division
CN113762792A (en) Fixed and mobile hybrid energy storage system optimal configuration system and method
Zemite et al. Genetic algorithm for optimization of power switch allocation in distribution network
CN114358384A (en) Distribution network power failure recovery method and system and storage medium
Sun et al. Determining optimal generator start-up sequence in bulk power system restoration considering uncertainties: A confidence gap decision theory based robust optimization approach
CN115549175A (en) Wind-solar uncertainty-based distributed power supply auxiliary power distribution network black start method
CN110492493B (en) Reactive compensation configuration optimization method for power system
CN112398129A (en) Power grid post-accident risk control aid decision-making method and device and storage medium
CN112688366A (en) Optimal recovery path based on distributed power supply and black start strategy
CN115603326B (en) Power distribution network load transfer method and system based on tree topology
CN110807590A (en) Power grid planning method based on probability available transmission capacity
Home-Ortiz et al. Enhancement of the resilience through microgrids formation and DG allocation with master-slave DG operation
Wang et al. An Integrated Energy System Optimization Method Considering Q Learning Algorithm
Chen et al. An Optimization Strategy for Power System Partition Recovery Considering Grid Reconfiguration Efficiency and Path Reliability
Chen et al. Study on Fast Fault Recovery for Active Distribution Networks Based on Directed Graph Traversal
CN110807553B (en) Power grid planning method based on opportunity constraint planning

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination