CN117810996A - Active power distribution network fault recovery method considering island division and network reconstruction - Google Patents
Active power distribution network fault recovery method considering island division and network reconstruction Download PDFInfo
- Publication number
- CN117810996A CN117810996A CN202410231848.9A CN202410231848A CN117810996A CN 117810996 A CN117810996 A CN 117810996A CN 202410231848 A CN202410231848 A CN 202410231848A CN 117810996 A CN117810996 A CN 117810996A
- Authority
- CN
- China
- Prior art keywords
- node
- load
- network
- constraint
- island
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 96
- 238000009826 distribution Methods 0.000 title claims abstract description 52
- 238000011084 recovery Methods 0.000 title claims abstract description 43
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 21
- 238000005457 optimization Methods 0.000 claims description 15
- 238000004364 calculation method Methods 0.000 claims description 12
- 238000004590 computer program Methods 0.000 claims description 9
- 230000006870 function Effects 0.000 claims description 7
- 238000012423 maintenance Methods 0.000 claims description 6
- 239000011159 matrix material Substances 0.000 claims description 6
- 238000005520 cutting process Methods 0.000 claims description 3
- 238000012163 sequencing technique Methods 0.000 claims description 3
- 238000003860 storage Methods 0.000 claims description 3
- 238000005192 partition Methods 0.000 claims 1
- 230000005540 biological transmission Effects 0.000 abstract description 2
- 238000000926 separation method Methods 0.000 abstract description 2
- 238000003892 spreading Methods 0.000 abstract description 2
- 238000005516 engineering process Methods 0.000 description 3
- 238000013178 mathematical model Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 238000004146 energy storage Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
Landscapes
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The invention discloses an active power distribution network fault recovery method considering island division and network reconstruction, which comprises the following steps: by modifying network constraint conditions in the conventional network reconstruction problem, load shedding operation and island generation can be performed, and island operation and network reconstruction operation can be performed cooperatively; then, a nonlinear item in the model is processed by adopting second-order cone relaxation, and the original model is converted into a standard mixed integer second-order cone model; determining that the output of the main power supply and the distributed power supply are matched with the load, performing island division by adopting an improved Di Jie Tesla algorithm, and then performing network reconstruction to confirm the load recovery amount; judging whether the power distribution network system meets the power flow constraint, and outputting a multi-period fault recovery operation result. The invention can avoid fault spreading through reasonable separation network, and optimize energy transmission path and improve system reliability by adjusting power network topology structure while reducing power loss load.
Description
Technical Field
The invention relates to a power distribution network fault recovery technology, in particular to an active power distribution network fault recovery method considering island division and network reconstruction.
Background
With the continuous increase of distributed power sources, the power distribution network has control and operation capabilities, becomes an active power distribution network, and has flexible and variable network structure. After the fault occurs, the structure of the power distribution network is adjusted by changing the switching state of the circuit, so that the flexible adjustment of the power flow distribution is realized, and the power supply of the non-fault area is quickly recovered. With the increase of the distributed power sources connected in the power distribution network, the system can independently supply power in different areas when in fault, so that an island running state is formed. Meanwhile, the power supply of the power distribution network can be recovered and the tide operation can be optimized by controlling the interconnection switch. Therefore, network reconstruction and island operation are effective means for recovering power supply of loads after faults.
At present, a plurality of techniques for recovering faults of the power distribution network are proposed at home and abroad, and are gradually and widely applied. However, the prior art still has some problems in terms of power distribution network island division, network reconfiguration and the like. For example, some schemes only perform island division on the power distribution network, and do not perform network reconstruction on the line after the fault; some schemes consider island division and network reconstruction, but consider the island division and the network reconstruction respectively, so that the network after the network reconstruction does not reach the running state of the optimal tide; some schemes use more iterative algorithms and have longer solving time.
Disclosure of Invention
The invention aims to: the invention aims to provide an active power distribution network fault recovery method considering island division and network reconstruction, which comprehensively considers four factors of total load recovery, network loss, node voltage offset and switching operation times, establishes a multi-objective function to solve the problem that the current power distribution network comprehensively utilizes network reconstruction and island operation to realize fault recovery, wherein island division is realized by adopting an improved Di Jie St-Law algorithm, and the island division solving speed is improved by adding constraint conditions; meanwhile, nonlinear terms possibly contained in the mathematical model of the problem, such as square terms of line current and node voltage, are converted into linear or convex forms by introducing second-order cone relaxation, so that the problem can be solved more easily by applying the existing convex optimization technology.
The technical scheme is as follows: the invention relates to an active power distribution network fault recovery method considering island division and network reconstruction, which comprises the following steps:
step 1, after a power distribution network fails, reading network information and failure parameters, and determining the position and capacity of a distributed power supply; the network information comprises fault planning total power failure time, DG output power, load prediction power and energy storage charge state.
And 2, establishing a multi-objective function containing the total load recovery amount, the network loss, the node voltage offset and the switching operation times, and constructing constraint functions according to load constraint, network topology constraint, load flow constraint, DG output constraint and maintenance strategy constraint.
The calculation formula of the total load recovery amount in the step 2 is as follows:
；
in the method, in the process of the invention,f 1 representing the total amount of load recovery;Nrepresenting a set of load nodes;ω i representing nodesiIs a load weight of (2);X i is a binary variable, and is respectively expressed by 1 and 0 to indicate whether to node or notiLoad recovery is carried out;trepresenting a fault duration;L i,t is a nodeiLoad at sitetActive power during a time period;
the calculation formula of the network loss is as follows:
；
in the method, in the process of the invention,f 2 representing network loss; omega is the aggregate of all branches in the power distribution network;representation oftTime nodeiAnd nodejA inter-arm current; />Representing nodesiAnd nodejA inter-arm resistance;
the calculation formula of the node voltage offset is as follows:
；
in the method, in the process of the invention,f 3 representing a node voltage offset;representing nodesiIs a reference voltage of (2);u i representing nodesiIs set to the actual voltage of (a);
the calculation formula of the switch operation times is as follows:
；
in the method, in the process of the invention,f 4 indicating the number of switch operations;Y ij,t and (3) withY ij,t-1 Respectively represent linesi-jThe switch states of two adjacent moments are that the switch is closed when the switch states are equal to 1, and the switch is opened when the switch states are equal to 0;
the load constraint is:
；
wherein the above formula is the load shedding constraint of the controllable load, the following formula represents the load shedding constraint of the uncontrollable load,representation oftA time period of,jThe node load shedding active total amount;/>representation oftA time period of,jThe total load-shedding reactive power of the nodes; />Representation oftA time period of,jThe node predicts the active load; />Representation oftA time period of,jPredicting reactive load by the nodes; z is a variable from 0 to 1,z t representation oftThe switching state of the load can be controlled at the moment, wherein 1 represents load cutting, and 0 represents load access;N T for duration of failure by deltatThe number of fault time periods equally divided for the time interval;
the network topology constraints are:
；
in the method, in the process of the invention,Z ij 、Z ji as a line flow-through direction variable,Z ij =1 indicates a branchl ij Power on by nodeiFlow direction nodej，Z ji And the same is done;Y ij representation linei-jThe switch state of (2) indicates that the switch is closed when equal to 1, and indicates that the switch is open when equal to 0;Y i is a nodeiIs a state of charge of (2); the state of charge of a node is defined as the sum of the flow direction variables flowing into the node, either 0 or 1; the tidal current constraint can be further simplified after definition; when the load state is 0, the node load is cut off, so that the operation is simplified;
the tide constraint is as follows:
；
in the method, in the process of the invention,α ij,t is thattTime slot circuiti-jSwitch shapeA state;P i,t 、Q i,t respectively istTime period nodeiActive power and reactive power injected at the site;G ij 、B ij respectively branch circuitsi-jIs a conductivity and susceptance of (a);B ii is a nodeiIs a self-conductance of (2);G ii is a nodeiIs a self-susceptance of (2);δ ij,t is thattTime period branchi-jA voltage phase angle difference; omega shape i Is a nodeiA set of connected nodes;V i,t is thattTime period nodeiIs a voltage of (2);V j,t is thattTime period nodejIs a voltage of (2);
the DG output constraint is:
；
in the method, in the process of the invention,P DG,i,t 、Q DG,i,t respectively istTime period nodeiActive and reactive power output of the distributed power supply;、/>is thattTime period nodeiThe lower limits of the active and reactive force of DG; />、/>Is thattTime period nodeiUpper limits of the active and reactive force of DG;
the maintenance strategy constraint is as follows:
；
in the method, in the process of the invention,β ij,t representing the state of each faulty line switch; omega is all faultsA collection of lines;kthe number of lines can be overhauled at most in a single period.
And 3, replacing a nonlinear term in the model by using a new variable, standardizing the original problem into a second-order cone optimization problem by adopting a second-order cone optimization method, and solving the second-order cone optimization problem.
The second order cone optimization method in the step 3 specifically comprises the following steps:
converting nonlinear terms into linear or convex form by introducing second order cone relaxation, for quadratic terms in constraintBy second order cone relaxation, i.e. introducing an auxiliary variablet ij The method comprises the steps of carrying out a first treatment on the surface of the The original model is converted into a standard mixed integer second order cone model, so that the model solving difficulty is reduced; for quadratic term->Auxiliary variablet ij The constraints are as follows:
。
and 4, determining that the output of the main power supply and the distributed power supply are matched with the load, performing island division by adopting an improved Di Jie Tesla algorithm, and then performing network reconstruction to confirm the load recovery amount.
The island division by adopting the improved Dijiesla algorithm in the step 4 is specifically as follows:
(4.1) initializing, namely inputting basic information of the power distribution network, including DG distribution, network architecture, line length, load level and weight;
(4.2) obtaining the initial island feasible range of each DG according to the network initial information;
(4.3) obtaining the shortest path between the node where each DG is located and all other first-level load nodes by adopting an improved Dijiestra algorithm, and sequencing according to the shortest distance corresponding to the shortest path;
(4.4) judging whether the node can be marked into an island according to the shortest path of the node according to the constraint condition, if so, marking the node into the island according to the shortest path of the node, marking the node and turning to the step (4.5), and if not, only marking the node and turning to the step (4.6);
(4.5) resetting all load weights within the island to zero and updating the shortest path;
(4.6) judging whether all important nodes in the island feasible range are marked, if so, turning to the step (4.7), and if not, turning to the step (4.3);
(4.7) dividing the primary load into the island under the condition of meeting the constraint according to the order of dividing the primary load into the island obtained in the previous step;
(4.8) whether the same node is divided into islands corresponding to two DGs or not, if so, performing the next step, and if not, ending the algorithm;
(4.9) merging two islands in which the same node exists into a new island U;
(4.10) ordering all loads directly connected with the island U according to the importance degree;
(4.11) scribing the nodes into islands according to the sequence obtained in the previous step;
(4.12) the algorithm ends.
The step (4.3) is specifically as follows:
(4.3.1) Forming an adjacency matrix based on network topologyAThe method comprises the steps of carrying out a first treatment on the surface of the Wherein each element of the adjacency matrixa ij The value of (2) is as follows:
in the middle ofq i Andq j respectively nodesi、jIs a load of (a) a load amount of (b);
(4.3.2) taking the node where the DG is positioned as a starting point and taking the load node as an end point;
(4.3.3) setting the starting point of the network asxThe end point isyThe method comprises the steps of carrying out a first treatment on the surface of the The number of the top points is n, and the number of the top points is T= { T 1 ，t 2 ，t 3 ，……，t n }；S ij Representing edge (t) i ，t j ) A kind of electronic deviceA weight value satisfying (t) i ，t j ) And is more than or equal to 0. Let T be x T j Representing a shortest path from a start point to a selected point;
(4.3.4) initializing T 1 =0, if the straight line distance T x T j Equal to T x T y I.e. the shortest path at this time. If it isx→jIn the process, not only one side chain exists, but also the vertex and the distance of each side chain are recorded;
(4.3.5) adding constraint conditions to mark all nodes in the path, so as to ensure that any node does not repeatedly pass during path searching, improve algorithm speed and ensure that the path is from the vertexxStarting, searching the minimum weight of the side chain passing through two adjacent vertexes, and setting the two vertexes as t i 、t j The method comprises the following steps:
；
(4.3.6) repeating (4.3.5), finding (t) i+1 ，t j+1 ) Minimum weight until the last node isyEnding the process, and obtaining the shortest path at the moment;
(4.3.7) likewisexIs the point of the vertex of the image,yfor the end point, a binary tree method is adopted fromx、yFor the start, the shortest path can be checked through reverse tracking;
step 5, judging whether the power distribution network meets the power flow constraint, and if not, returning to the step 4;
and 6, outputting a multi-period fault recovery operation result of the power distribution network.
A computer storage medium having stored thereon a computer program which, when executed by a processor, implements an active power distribution network fault recovery method as described above that takes into account islanding and network reconfiguration.
A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing an active power distribution network fault recovery method taking into account islanding and network reconfiguration as described above when executing the computer program.
The beneficial effects are that: compared with the prior art, the invention has the following advantages:
1. the invention has higher practical value, and island division and network reconstruction are used as two key technical means in the power system, and each plays a unique role in fault recovery. Island division is realized through a reasonable separation network, so that fault spreading is avoided, and power loss load is reduced. Meanwhile, the network reconstruction optimizes the energy transmission path by adjusting the topological structure of the power network, and improves the reliability of the system. By cooperatively applying the two, the performance of the whole power system can be optimized while the power loss load is reduced. By comprehensively considering island division and network reconstruction, a collaborative optimization fault recovery strategy is provided, the load rejection power is effectively reduced, and remarkable results are achieved in the application of DG power supply capability.
2. By introducing second order cone relaxation, nonlinear terms possibly contained in a problem mathematical model, such as square terms of line current and node voltage, can be converted into linear or convex forms, so that the problem mathematical model can be solved more easily by applying the existing convex optimization technology. And by introducing additional variables and constraints, the feasibility of the original problem is ensured. After conversion, island division and network reconstruction model solution can be carried out by adopting a current mature mathematical programming solver.
Drawings
FIG. 1 is a flow chart of the steps of the method of the present invention;
FIG. 2 is a block diagram of an IEEE33 node power distribution network system;
FIG. 3 is a power distribution diagram of wind power, photovoltaic and load in a system.
Detailed Description
The technical scheme of the invention is further described below with reference to the accompanying drawings.
As shown in fig. 1, an active power distribution network fault recovery method considering island division and network reconstruction includes the following steps:
step 1, after a power distribution network fails, reading in network information and failure parameters, and determining the position and capacity of a distributed power supply, as shown in fig. 2; the network information comprises fault planning total power failure time, DG output power, load prediction power and energy storage charge state.
And 2, establishing a multi-objective function containing the total load recovery amount, the network loss, the node voltage offset and the switching operation times, and constructing constraint functions according to load constraint, network topology constraint, load flow constraint, DG output constraint and maintenance strategy constraint.
The calculation formula of the total load recovery amount in the step 2 is as follows:
；
in the method, in the process of the invention,f 1 representing the total amount of load recovery;Nrepresenting a set of load nodes;ω i representing nodesiIs a load weight of (2);X i is a binary variable, and is respectively expressed by 1 and 0 to indicate whether to node or notiLoad recovery is carried out;trepresenting a fault duration;L i,t is a nodeiLoad at sitetActive power during a time period;
the calculation formula of the network loss is as follows:
；
in the method, in the process of the invention,f 2 representing network loss; omega is the aggregate of all branches in the power distribution network;representation oftTime nodeiAnd nodejA inter-arm current; />Representing nodesiAnd nodejA inter-arm resistance;
the calculation formula of the node voltage offset is as follows:
；
in the method, in the process of the invention,f 3 representing a node voltage offset;representing nodesiIs a reference voltage of (2);u i representing nodesiIs set to the actual voltage of (a);
the calculation formula of the switch operation times is as follows:
；
in the method, in the process of the invention,f 4 indicating the number of switch operations;Y ij,t and (3) withY ij,t-1 Respectively represent linesi-jThe switch states of two adjacent moments are that the switch is closed when the switch states are equal to 1, and the switch is opened when the switch states are equal to 0;
the load constraint is:
；
wherein the above formula is the load shedding constraint of the controllable load, the following formula represents the load shedding constraint of the uncontrollable load,representation oftA time period of,jThe node load shedding active total amount; />Representation oftA time period of,jThe total load-shedding reactive power of the nodes; />Representation oftA time period of,jThe node predicts the active load; />Representation oftA time period of,jPredicting reactive load by the nodes; z is a variable from 0 to 1,z t representation oftThe switching state of the load can be controlled at the moment, 1 represents load cutting,0 represents load access;N T for duration of failure by deltatThe number of fault time periods equally divided for the time interval;
the network topology constraints are:
；
in the method, in the process of the invention,Z ij 、Z ji as a line flow-through direction variable,Z ij =1 indicates a branchl ij Power on by nodeiFlow direction nodej，Z ji And the same is done;Y ij representation linei-jThe switch state of (2) indicates that the switch is closed when equal to 1, and indicates that the switch is open when equal to 0;Y i is a nodeiIs a state of charge of (2); the state of charge of a node is defined as the sum of the flow direction variables flowing into the node, either 0 or 1; the tidal current constraint can be further simplified after definition; when the load state is 0, the node load is cut off, so that the operation is simplified;
the tide constraint is as follows:
；
in the method, in the process of the invention,α ij,t is thattTime slot circuiti-jA switching state;P i,t 、Q i,t respectively istTime period nodeiActive power and reactive power injected at the site;G ij 、B ij respectively branch circuitsi-jIs a conductivity and susceptance of (a);B ii is a nodeiIs a self-conductance of (2);G ii is a nodeiIs a self-susceptance of (2);δ ij,t is thattTime period branchi-jA voltage phase angle difference; omega shape i Is a nodeiA set of connected nodes;V i,t is thattTime period nodeiIs a voltage of (2);V j,t is thattTime period nodejIs a voltage of (2);
the DG output constraint is:
；
in the method, in the process of the invention,P DG,i,t 、Q DG,i,t respectively istTime period nodeiActive and reactive power output of the distributed power supply;、is thattTime period nodeiThe lower limits of the active and reactive force of DG; />、/>Is thattTime period nodeiUpper limits of the active and reactive force of DG;
the maintenance strategy constraint is as follows:
；
in the method, in the process of the invention,β ij,t representing the state of each faulty line switch; omega is the set of all faulty lines;kthe number of lines can be overhauled at most in a single period.
And 3, replacing a nonlinear term in the model by using a new variable, standardizing the original problem into a second-order cone optimization problem by adopting a second-order cone optimization method, and solving the second-order cone optimization problem.
The second order cone optimization method in the step 3 specifically comprises the following steps:
converting nonlinear terms into linear or convex form by introducing second order cone relaxation, for quadratic terms in constraintBy second order cone relaxation, i.e. introducing an auxiliary variablet ij The method comprises the steps of carrying out a first treatment on the surface of the The original model is converted into a standard mixed integer second order cone model, so that the model solving difficulty is reduced; for quadratic term->Auxiliary variablet ij The constraints are as follows:
。
and 4, determining that the output of the main power supply and the distributed power supply are matched with the load, performing island division by adopting an improved Di Jie Tesla algorithm, and then performing network reconstruction to confirm the load recovery amount.
The island division by adopting the improved Dijiesla algorithm in the step 4 is specifically as follows:
(4.1) initializing, namely inputting basic information of the power distribution network, including DG distribution, network architecture, line length, load level and weight;
(4.2) obtaining the initial island feasible range of each DG according to the network initial information;
(4.3) obtaining the shortest path between the node where each DG is located and all other first-level load nodes by adopting an improved Dijiestra algorithm, and sequencing according to the shortest distance corresponding to the shortest path;
(4.4) judging whether the node can be marked into an island according to the shortest path of the node according to the constraint condition, if so, marking the node into the island according to the shortest path of the node, marking the node and turning to the step (4.5), and if not, only marking the node and turning to the step (4.6);
(4.5) resetting all load weights within the island to zero and updating the shortest path;
(4.6) judging whether all important nodes in the island feasible range are marked, if so, turning to the step (4.7), and if not, turning to the step (4.3);
(4.7) dividing the primary load into the island under the condition of meeting the constraint according to the order of dividing the primary load into the island obtained in the previous step;
(4.8) whether the same node is divided into islands corresponding to two DGs or not, if so, performing the next step, and if not, ending the algorithm;
(4.9) merging two islands in which the same node exists into a new island U;
(4.10) ordering all loads directly connected with the island U according to the importance degree;
(4.11) scribing the nodes into islands according to the sequence obtained in the previous step;
(4.12) the algorithm ends.
The (4.3) is specifically as follows:
(4.3.1) Forming an adjacency matrix based on network topologyAThe method comprises the steps of carrying out a first treatment on the surface of the Wherein each element of the adjacency matrixa ij The value of (2) is as follows:
；
in the middle ofq i Andq j respectively nodesi、jIs a load of (a) a load amount of (b);
(4.3.2) taking the node where the DG is positioned as a starting point and taking the load node as an end point;
(4.3.3) setting the starting point of the network asxThe end point isyThe method comprises the steps of carrying out a first treatment on the surface of the The number of the top points is n, and the number of the top points is T= { T 1 ，t 2 ，t 3 ，……，t n }；S ij Representing edge (t) i ，t j ) Is satisfied with (t) i ，t j ) And is more than or equal to 0. Let T be x T j Representing a shortest path from a start point to a selected point;
(4.3.4) initializing T 1 =0, if the straight line distance T x T j Equal to T x T y I.e. the shortest path at this time. If it isx→jIn the process, not only one side chain exists, but also the vertex and the distance of each side chain are recorded;
(4.3.5) adding constraint conditions to mark all nodes in the path, so as to ensure that any node does not repeatedly pass during path searching, improve algorithm speed and ensure that the path is from the vertexxStarting from and searchingThe minimum weight of the edge finding chain passing through two adjacent vertexes is set as t i 、t j The method comprises the following steps:
；
(4.3.6) repeating (4.3.5), finding (t) i+1 ，t j+1 ) Minimum weight until the last node isyEnding the process, and obtaining the shortest path at the moment;
(4.3.7) likewisexIs the point of the vertex of the image,yfor the end point, a binary tree method is adopted fromx、yFor the start, the shortest path can be checked through reverse tracking;
and 5, judging whether the power distribution network meets the power flow constraint, and if not, returning to the step 4.
And 6, outputting a multi-period fault recovery operation result of the power distribution network.
Wherein the load class and weight are as shown in table 1:
table 1 load class and weight
| Grade | Node numbering | Weight coefficient |
| 1 | 3、10、11、24、31 | 1 |
| 2 | 4、6、12、15、18、19、21、22、23、30、33 | 0.5 |
| 3 | Remaining nodes | 0.1 |
The power distribution of wind power, photovoltaic and load in the system is subject to the curves shown in fig. 3.
A computer storage medium having stored thereon a computer program which, when executed by a processor, implements an active power distribution network fault recovery method as described above that takes into account islanding and network reconfiguration.
A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing an active power distribution network fault recovery method taking into account islanding and network reconfiguration as described above when executing the computer program.
Claims (8)
1. An active power distribution network fault recovery method considering island division and network reconstruction is characterized by comprising the following steps:
step 1, after a power distribution network fails, reading network information and failure parameters, and determining the position and capacity of a distributed power supply;
step 2, establishing a multi-objective function containing load recovery total amount, network loss, node voltage offset and switching operation times, and constructing constraint functions according to load constraint, network topology constraint, load flow constraint, DG output constraint and maintenance strategy constraint;
step 3, replacing a nonlinear term in the model by using a new variable, standardizing an original problem into a second-order cone optimization problem by adopting a second-order cone optimization method, and solving the second-order cone optimization problem;
step 4, determining that the output of the main power supply and the distributed power supply are matched with the load, performing island division by adopting an improved Di Jie Tesla algorithm, and then performing network reconstruction to confirm the load recovery amount;
step 5, judging whether the power distribution network meets the power flow constraint, and if not, returning to the step 4;
and 6, outputting a multi-period fault recovery operation result of the power distribution network.
2. The method for recovering faults of an active power distribution network taking island division and network reconfiguration into consideration according to claim 1, wherein the network information in step 1 comprises a fault plan total power failure time, DG output power, load prediction power and stored charge state.
3. The active power distribution network fault recovery method considering island division and network reconstruction according to claim 1, wherein the calculation formula of the total load recovery in step 2 is as follows:
；
in the method, in the process of the invention,f 1 representing the total amount of load recovery;Nrepresenting a set of load nodes;ω i representing nodesiIs a load weight of (2);X i is a binary variable, and is respectively expressed by 1 and 0 to indicate whether to node or notiLoad recovery is carried out;trepresenting a fault duration;L i,t is a nodeiLoad at sitetActive power during a time period;
the calculation formula of the network loss is as follows:
；
in the method, in the process of the invention,f 2 representing network loss; omega is the aggregate of all branches in the power distribution network;representation oftTime nodeiAnd nodejA inter-arm current; />Representation sectionPoint(s)iAnd nodejA inter-arm resistance;
the calculation formula of the node voltage offset is as follows:
；
in the method, in the process of the invention,f 3 representing a node voltage offset;representing nodesiIs a reference voltage of (2);u i representing nodesiIs set to the actual voltage of (a);
the calculation formula of the switch operation times is as follows:
；
in the method, in the process of the invention,f 4 indicating the number of switch operations;Y ij,t and (3) withY ij,t-1 Respectively represent linesi-jThe switch states of two adjacent moments are that the switch is closed when the switch states are equal to 1, and the switch is opened when the switch states are equal to 0;
the load constraint is:
；
wherein the above formula is the load shedding constraint of the controllable load, the following formula represents the load shedding constraint of the uncontrollable load,representation oftA time period of,jThe node load shedding active total amount; />Representation oftA time period of,jThe total load-shedding reactive power of the nodes; />Representation oftA time period of,jThe node predicts the active load; />Representation oftA time period of,jPredicting reactive load by the nodes; z is a variable from 0 to 1,z t representation oftThe switching state of the load can be controlled at the moment, wherein 1 represents load cutting, and 0 represents load access;N T for duration of failure by deltatThe number of fault time periods equally divided for the time interval;
the network topology constraints are:
；
in the method, in the process of the invention,Z ij 、Z ji as a line flow-through direction variable,Z ij =1 indicates a branchl ij Power on by nodeiFlow direction nodej，Z ji And the same is done;Y ij representation linei-jThe switch state of (2) indicates that the switch is closed when equal to 1, and indicates that the switch is open when equal to 0;Y i is a nodeiIs a state of charge of (2); the state of charge of a node is defined as the sum of the flow direction variables flowing into the node, either 0 or 1; the tidal current constraint can be further simplified after definition; when the load state is 0, the node load is cut off, so that the operation is simplified;
the tide constraint is as follows:
；
in the method, in the process of the invention,α ij,t is thattTime slot circuiti-jA switching state;P i,t 、Q i,t respectively istTime period nodeiActive power and reactive power injected at the site;G ij 、B ij respectively branch circuitsi-jIs a conductivity and susceptance of (a);B ii is a nodeiIs a self-conductance of (2);G ii is a nodeiIs a self-susceptance of (2);δ ij,t is thattTime period branchi-jA voltage phase angle difference; omega shape i Is a nodeiA set of connected nodes;V i,t is thattTime period nodeiIs a voltage of (2);V j,t is thattTime period nodejIs a voltage of (2);
the DG output constraint is:
；
in the method, in the process of the invention,P DG,i,t 、Q DG,i,t respectively istTime period nodeiActive and reactive power output of the distributed power supply;、is thattTime period nodeiThe lower limits of the active and reactive force of DG; />、/>Is thattTime period nodeiUpper limits of the active and reactive force of DG;
the maintenance strategy constraint is as follows:
；
in the method, in the process of the invention,β ij,t representing the state of each faulty line switch; omega is the set of all faulty lines;kthe number of lines can be overhauled at most in a single period.
4. The active power distribution network fault recovery method considering island division and network reconstruction according to claim 1, wherein the second order cone optimization method in step 3 is specifically:
converting nonlinear terms into linear or convex form by introducing second order cone relaxation, for quadratic terms in constraintBy second order cone relaxation, i.e. introducing an auxiliary variablet ij The method comprises the steps of carrying out a first treatment on the surface of the The original model is converted into a standard mixed integer second order cone model, so that the model solving difficulty is reduced; for quadratic term->Auxiliary variablet ij The constraints are as follows:
。
5. the method for active power distribution network fault recovery taking island division and network reconstruction into consideration according to claim 1, wherein the island division by adopting the modified dijkstra algorithm in step 4 is specifically:
(4.1) initializing, namely inputting basic information of the power distribution network, including DG distribution, network architecture, line length, load level and weight;
(4.2) obtaining the initial island feasible range of each DG according to the network initial information;
(4.3) obtaining the shortest path between the node where each DG is located and all other first-level load nodes by adopting an improved Dijiestra algorithm, and sequencing according to the shortest distance corresponding to the shortest path;
(4.4) judging whether the node can be marked into an island according to the shortest path of the node according to the constraint condition, if so, marking the node into the island according to the shortest path of the node, marking the node and turning to the step (4.5), and if not, only marking the node and turning to the step (4.6);
(4.5) resetting all load weights within the island to zero and updating the shortest path;
(4.6) judging whether all important nodes in the island feasible range are marked, if so, turning to the step (4.7), and if not, turning to the step (4.3);
(4.7) dividing the primary load into the island under the condition of meeting the constraint according to the order of dividing the primary load into the island obtained in the previous step;
(4.8) whether the same node is divided into islands corresponding to two DGs or not, if so, performing the next step, and if not, ending the algorithm;
(4.9) merging two islands in which the same node exists into a new island U;
(4.10) ordering all loads directly connected with the island U according to the importance degree;
(4.11) scribing the nodes into islands according to the sequence obtained in the previous step;
(4.12) the algorithm ends.
6. The active power distribution network fault recovery method considering island division and network reconfiguration according to claim 5, wherein the step (4.3) specifically comprises:
(4.3.1) Forming an adjacency matrix based on network topologyAThe method comprises the steps of carrying out a first treatment on the surface of the Wherein each element of the adjacency matrixa ij The value of (2) is as follows:
；
in the middle ofq i Andq j respectively nodesi、jIs a load of (a) a load amount of (b);
(4.3.2) taking the node where the DG is positioned as a starting point and taking the load node as an end point;
(4.3.3) setting the starting point of the network asxThe end point isyThe method comprises the steps of carrying out a first treatment on the surface of the The number of the top points is n, and the number of the top points is T= { T 1 ，t 2 ，t 3 ，……，t n }；S ij Representing edge (t) i ，t j ) Is satisfied with (t) i ，t j ) Not less than 0; let T be x T j Representing a shortest path from a start point to a selected point;
(4.3.4) initializing T 1 =0, if the straight line distance T x T j Equal to T x T y I.e. the shortest path at this time; if it isx→jIn the process, not only one side chain exists, but also the vertex and the distance of each side chain are recorded;
(4.3.5) adding constraint conditions to mark all nodes in the path, so as to ensure that any node does not repeatedly pass during path searching, improve algorithm speed and obtain the path from the vertexxStarting, searching the minimum weight of the side chain passing through two adjacent vertexes, and setting the two vertexes as t i 、t j The method comprises the following steps:
；
(4.3.6) repeating (4.3.5), finding (t) i+1 ，t j+1 ) Minimum weight until the last node isyEnding the process, and obtaining the shortest path at the moment;
(4.3.7) likewisexIs the point of the vertex of the image,yfor the end point, a binary tree method is adopted fromx、yStarting from this, the shortest path can be checked by means of reverse tracking.
7. A computer storage medium having stored thereon a computer program which, when executed by a processor, implements an active power distribution network fault recovery method taking into account islanding partition and network reconfiguration as claimed in any one of claims 1 to 6.
8. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements an active power distribution network fault recovery method taking into account island division and network reconfiguration according to any one of claims 1-6 when executing the computer program.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410231848.9A CN117810996B (en) | 2024-03-01 | 2024-03-01 | Active power distribution network fault recovery method considering island division and network reconstruction |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410231848.9A CN117810996B (en) | 2024-03-01 | 2024-03-01 | Active power distribution network fault recovery method considering island division and network reconstruction |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117810996A true CN117810996A (en) | 2024-04-02 |
| CN117810996B CN117810996B (en) | 2024-05-17 |
Family
ID=90421945
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410231848.9A Active CN117810996B (en) | 2024-03-01 | 2024-03-01 | Active power distribution network fault recovery method considering island division and network reconstruction |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117810996B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109861199A (en) * | 2019-03-20 | 2019-06-07 | 湖南大学 | A kind of fault recovery method in DC distribution net |
| CN110350508A (en) * | 2019-05-16 | 2019-10-18 | 东南大学 | Method that is a kind of while considering the active distribution network fault recovery unified model that reconstruct is divided with isolated island |
| CN112650891A (en) * | 2020-12-30 | 2021-04-13 | 广西大学 | Method capable of rapidly detecting and preventing distributed power supply island effect generation |
| CN112909942A (en) * | 2021-04-22 | 2021-06-04 | 国网宁夏电力有限公司电力科学研究院 | Active power distribution network fault recovery method and system based on hybrid solution strategy |
| WO2021114849A1 (en) * | 2019-12-12 | 2021-06-17 | 国网浙江省电力有限公司台州供电公司 | Island power grid energy storage system hierarchical control method for ameliorating new energy power generation fluctuation |
| CN113328437A (en) * | 2021-06-23 | 2021-08-31 | 南京工业大学 | CPS (control performance Standard) topology construction method and fault recovery method for intelligent power distribution network |
| CN114386222A (en) * | 2021-11-29 | 2022-04-22 | 中国电力科学研究院有限公司 | Power distribution network cooperative fault recovery method and system based on information physical system |
| CN117175688A (en) * | 2023-09-13 | 2023-12-05 | 华北电力大学 | Power distribution network fault recovery method and system based on load side island division |
-
2024
- 2024-03-01 CN CN202410231848.9A patent/CN117810996B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109861199A (en) * | 2019-03-20 | 2019-06-07 | 湖南大学 | A kind of fault recovery method in DC distribution net |
| CN110350508A (en) * | 2019-05-16 | 2019-10-18 | 东南大学 | Method that is a kind of while considering the active distribution network fault recovery unified model that reconstruct is divided with isolated island |
| WO2021114849A1 (en) * | 2019-12-12 | 2021-06-17 | 国网浙江省电力有限公司台州供电公司 | Island power grid energy storage system hierarchical control method for ameliorating new energy power generation fluctuation |
| CN112650891A (en) * | 2020-12-30 | 2021-04-13 | 广西大学 | Method capable of rapidly detecting and preventing distributed power supply island effect generation |
| CN112909942A (en) * | 2021-04-22 | 2021-06-04 | 国网宁夏电力有限公司电力科学研究院 | Active power distribution network fault recovery method and system based on hybrid solution strategy |
| CN113328437A (en) * | 2021-06-23 | 2021-08-31 | 南京工业大学 | CPS (control performance Standard) topology construction method and fault recovery method for intelligent power distribution network |
| CN114386222A (en) * | 2021-11-29 | 2022-04-22 | 中国电力科学研究院有限公司 | Power distribution network cooperative fault recovery method and system based on information physical system |
| CN117175688A (en) * | 2023-09-13 | 2023-12-05 | 华北电力大学 | Power distribution network fault recovery method and system based on load side island division |
Non-Patent Citations (2)
| Title |
|---|
| WEN-HAO LI ET AL: "A Multi-Robot Coverage Path Planning Method Based On Genetic Algorithm", 2021 INTERNATIONAL CONFERENCE ON SECURITY, PATTERN ANALYSIS, AND CYBERNETICS（SPAC), 27 September 2021 (2021-09-27), pages 13 - 18 * |
| 张敏: "配电网源网储协同规划及分段开关优化配置", 工 程科技Ⅱ辑, no. 02, 15 February 2023 (2023-02-15), pages 1 - 54 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117810996B (en) | 2024-05-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105226643B (en) | Operation of Electric Systems simulation model quickly generates and method for solving under security constraint | |
| Millar et al. | Impact of MV connected microgrids on MV distribution planning | |
| Miranda et al. | Evolutionary computation in power systems | |
| Syahputra | Fuzzy multi-objective approach for the improvement of distribution network efficiency by considering DG | |
| Javadi et al. | Economic heat and power dispatch in modern power system harmony search algorithm versus analytical solution | |
| Tang et al. | Study on day-ahead optimal economic operation of active distribution networks based on Kriging model assisted particle swarm optimization with constraint handling techniques | |
| Home-Ortiz et al. | A mixed integer conic model for distribution expansion planning: Matheuristic approach | |
| CN103746374A (en) | Closed loop control method comprising multi-microgrid power distribution network | |
| CN111416359A (en) | Power distribution network reconstruction method considering weighted power flow entropy | |
| CN104037765A (en) | Method for selecting schemes for power restoration of active power distribution network based on improved genetic algorithm | |
| Parizad et al. | Optimal distribution systems reconfiguration for short circuit level reduction using PSO algorithm | |
| CN107480885A (en) | Distributed power source based on non-dominated ranking differential evolution algorithm is layouted planing method | |
| CN107808200B (en) | Short-time maintenance plan optimization method and device for power distribution network | |
| CN112467748A (en) | Double-time-scale distributed voltage control method and system for three-phase unbalanced active power distribution network | |
| Liu et al. | Stochastic optimal operation of flexible distribution networks for security improvement considering active management | |
| Kien et al. | Coot optimization algorithm for optimal placement of photovoltaic generators in distribution systems considering variation of load and solar radiation | |
| Fuchs et al. | Improved method for integrating renewable energy sources into the power system of Northern Europe: Transmission expansion planning for wind power integration | |
| CN115133540B (en) | Model-free real-time voltage control method for power distribution network | |
| CN117810996B (en) | Active power distribution network fault recovery method considering island division and network reconstruction | |
| CN114759616B (en) | Micro-grid robust optimization scheduling method considering characteristics of power electronic devices | |
| CN114154404B (en) | Method for deducing running state and parameters of adjacent hydropower station by using observation data | |
| CN107425519B (en) | Method for calculating maximum power supply capacity of three-phase power distribution network containing distributed power supply | |
| CN113312779B (en) | High-satisfaction dynamic comprehensive planning method for low-carbon flexible power distribution network | |
| Kubba et al. | An enhanced RCGA for a rapid and reliable load flow solution of electrical power systems | |
| CN104793107B (en) | A kind of power grid cascading fault determination method based on improvement OPA models |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |