CN112310958B - Power grid dispatching optimization method considering power grid load rate and time sequence load change - Google Patents
Power grid dispatching optimization method considering power grid load rate and time sequence load change Download PDFInfo
- Publication number
- CN112310958B CN112310958B CN202011015012.3A CN202011015012A CN112310958B CN 112310958 B CN112310958 B CN 112310958B CN 202011015012 A CN202011015012 A CN 202011015012A CN 112310958 B CN112310958 B CN 112310958B
- Authority
- CN
- China
- Prior art keywords
- monkey
- power grid
- discrete
- distribution network
- switch
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- H02J3/00—Circuit arrangements for ac mains or ac distribution networks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/004—Artificial life, i.e. computing arrangements simulating life
- G06N3/006—Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- H02J2203/00—Indexing scheme relating to details of circuit arrangements for AC mains or AC distribution networks
- H02J2203/10—Power transmission or distribution systems management focussing at grid-level, e.g. load flow analysis, node profile computation, meshed network optimisation, active network management or spinning reserve management
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- H02J2203/00—Indexing scheme relating to details of circuit arrangements for AC mains or AC distribution networks
- H02J2203/20—Simulating, e g planning, reliability check, modelling or computer assisted design [CAD]
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Evolutionary Computation (AREA)
- Molecular Biology (AREA)
- Artificial Intelligence (AREA)
- Biomedical Technology (AREA)
- Biophysics (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Life Sciences & Earth Sciences (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Power Engineering (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The invention relates to a power grid dispatching optimization method considering power grid load rate and time sequence load change, which comprises the following steps: step 1, initializing variables on the basis of input power distribution network parameters, and setting discrete monkey group algorithm initial parameters: step 2, adopting a discrete monkey group algorithm to perform crawling process operation; step 3, carrying out hope-jump process operation by adopting a discrete monkey group algorithm; step 4, a discrete monkey group algorithm is adopted to turn over the process operation; step 5, termination judgment is carried out, if the termination criterion is met, the algorithm is ended to output an optimal result; if not, steps 2-4 are repeated until the termination criteria are met. According to the method, under the constraint condition of two dimensions of time and space of a section switch and a tie switch in a power distribution network, the network loss of the power distribution network is taken as a research object, and the optimal combination of the section switch and the tie switch in the power distribution network is obtained by optimizing the network loss in a period of time instead of a certain time section in the power distribution network.
Description
Technical Field
The invention belongs to the technical field of load rate balance control of transformer substation clusters in a power distribution system, relates to a power grid dispatching optimization method, and particularly relates to a power grid dispatching optimization method considering power grid load rate and time sequence load change.
Background
When a substation in a power grid is planned and designed, the requirement on the load rate of each substation is generally ignored according to the load prediction result of a planned area and the existing substation constitution situation, so that the load is unevenly distributed on each substation, and in addition, the space-time distribution characteristics of the load are considered, even if different areas at the same time are different in load type, different load characteristics are presented, so that the phenomenon of heavy load or light load of the substation in the power grid can occur. In an actual power distribution system, in order to ensure the reliability of power supply, substation feeders with close electrical distances are usually connected through tie lines, so that substation loads can be reasonably and evenly arranged by changing the states of tie switches in a power distribution network and section switches on the feeders, namely network reconfiguration, and the loss of a power grid is reduced.
The distribution network has more interconnection switches and section switches, and the calculation difficulty of carrying out operation optimization on the switching equipment of the distribution network on a time section is very high; furthermore, in order to ensure the reliability of power supply and reduce the complexity of operation management, and not allow the on-off state of the switch device to be changed frequently, the scheduler needs to reasonably adjust the states of the contact switches and the section switches on the feeders in the power distribution network in time according to the change of time sequence load and the load rate of the power grid, so that the difficulty in determining the operation decision of a large number of switch devices in the time dimension is higher.
In summary, it is necessary to optimize the power grid loss in a certain period of time rather than a certain time section to obtain the optimal switch state combination in the power grid, so that a power grid scheduling optimization method considering the power grid load rate and the time sequence load change is urgently needed for a scheduling department to assist scheduling personnel in making scientific and reasonable decisions on the states of the section switches and the interconnection switches in the power grid, thereby reducing the power grid loss and more reasonably utilizing resources.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provides a power grid dispatching optimization method considering the load rate and the time sequence load change of a power grid.
The technical scheme adopted by the invention for solving the technical problems is as follows:
a power grid dispatching optimization method considering power grid load rate and time sequence load change is characterized in that: the method comprises the following steps:
step 1, initializing variables based on input power distribution network parameters, and setting discrete monkey group algorithm initial parameters;
step 2, adopting a discrete monkey group algorithm to perform crawling process operation;
step 3, carrying out hope-jump process operation by adopting a discrete monkey group algorithm;
step 4, adopting a discrete monkey group algorithm to perform process operation;
step 5, termination judgment is carried out, if the termination criterion is met, the algorithm is ended to output an optimal result; if not, steps 2-4 are repeated until the termination criteria are met.
Further: the network parameters of the power distribution network input in the step one comprise the number of feeder lines in the power distribution network, the number of normally closed switches of each feeder line and the number of interconnection switches.
Further: initializing variables in the first step specifically comprises the following steps:
establishing a model objective function, see expression (1):
Min G(x) (1)
g (x) is network loss in the power distribution network, and the variable x is a switching variable combination in the power distribution network;
the constraints of the established model comprise the constraints of two dimensions of space and time:
(1) Time dimension constraint
Including switching frequency constraints, which means that the number of operations of the sectionalizing switch and the tie switch in the optimization period has a certain limit,
see expression (2):
in the formula
Is an exclusive or mathematical operator; nx1 and nx2 are the maximum action times of the head-end circuit breaker or the section switch and the tie switch in the T time period;
(2) Spatial dimension constraints comprising:
a. tidal current equation constraints, see expression (3)
The power supply system comprises a power supply, a power supply controller and a power supply controller, wherein Px, t, qx and t are respectively active power and reactive power injected at the x-th feeder load at the moment t; ui, t represents the voltage amplitude loaded by the x-th feeder line at the t moment; gxj, bxj and xj respectively form conductance, susceptance and phase angle difference on a connecting line between the x-th feeder line and the j-th feeder line at the t-th moment;
b. the voltage and the transformer capacity are constrained by inequality, see expression (4);
U min ≤U x,t ≤U max
|L x,j |≤L max
S i ≤S imax (4)
wherein Ux, t, si and Lxj respectively represent the voltage amplitude of the x-th feeder line load at the time t, the actual load of the ith transformer and the transmission capacity on a connecting line between the x line and the j line;
c. a radiation operation constraint;
when the distribution network actually runs, the topological structure of the distribution network needs to be ensured to be radial, so that three switches, namely a feeder line head end breaker, a tie switch on the feeder line and a feeder line head end breaker connected with the feeder line, need to be ensured that only two switches are in an open state, see expression (5):
onoff1(x,t)+onoff2(x,t)+onoff1(j,t)-2＝0 (5)。
further: in the step 1, initial parameters of a discrete monkey group algorithm are set, and the method specifically comprises the following steps:
firstly, setting a tie switch on each feeder line to be in an open state, setting a breaker at the head end of the feeder line to be in a closed state, and then performing variation on a certain switch at a certain time by using a random number method to serve as an initial solution; the invention utilizes an improved discrete monkey group algorithm to solve, the scale of the monkey group is set as M, and for the ith monkey in the monkey group, the position of the ith monkey can be defined as:
X i ＝(x i,1 ,x i,2 ,…,x i,n ) T x i,n ∈{0,1}
wherein X i Corresponds to a switch in the power distribution system, the value x on each component i,1 ,x i,2 ,…,x i,n Indicating the state on the corresponding switch, 0 for on, 1 for off, so that the current position of each monkey is the set of switch combinations for the optimized model.
Further: step 2, performing crawling process operation by adopting a discrete monkey group algorithm, and specifically comprising the following steps:
step 2.1 random generation of vectors
See expression (6)
Wherein, Δ x i,j J ∈ {1,2, \8230;, n } is a randomly generated number from the set {0,1 };
step 2.2. Order
Computing
Step 2.3 if:
then order
Otherwise, if:
then order
Step 2.4 repeating steps 2.1 to 2.3 until the objective function value is not changed for a plurality of continuous iterations or reaches a preset iteration number N C,L 。
Further: step 3, carrying out hope-jump process operation by adopting a discrete monkey group algorithm, and specifically comprising the following steps:
for the ith monkey, the procedure was as follows:
step 3.1 random Generation of column vectors B i (j) And obtaining a vector: b is i ＝[B i (1),B i (2),...,B i (n)]I.e. a group of switch combinations in a period of time, but because the model is coupled in a time dimension, in order to avoid generating a large number of invalid solutions, the generated B is firstly combined i Making a decision in the time dimension[0,N]If the number of switching operations has reached an upper limit within a time period, the switching state remains unchanged since the last change, and secondly, for B generated i Judging in the space dimension so as to enable the space dimension to meet all constraint conditions, namely a set of feasible solutions;
step 3.2 if G (B) i )<G(X i ) Then let X i ＝B i Turning to the climbing process, otherwise, turning to the next step 3.3;
step 3.3 repeat steps 3.1 to 3.2 until the objective function value is not changed for a plurality of continuous iterations or reaches a preset iteration number N C,L
Further: step 4, a discrete monkey group algorithm is adopted to turn over process operation, and the method specifically comprises the following steps:
step 4.1, the number of iterations k = k +1, and a real number d is randomly generated at [0,1 ];
step 4.2 calculate the mean pj of the monkey population:
step 4.3 pairs
Calculate a = d | p j -X i (j) If a is more than or equal to 1, X i '(j)＝max(X i (j) +1, 1), otherwise X i ’(j)＝max(X i (j)+0,1)；
Step 4.4 likewise to avoid generating a large number of invalid solutions, the X generated is subjected to i ' (j) judging in both space-time dimensions if the above-mentioned X i If' (j) is feasible, let X i (j)＝X i ' (j), ending the scrolling process, and turning to the climbing process, otherwise, repeating the steps 4.1 to 4.4 until a feasible solution is found.
Further: step 5 termination interpretation includes two termination criteria:
(1) The iteration number k reaches the maximum value;
(2) The optimal solution obtained does not change for successive generations.
The invention has the advantages and positive effects that:
under the constraint condition of two dimensions of time and space of a section switch and a tie switch in a power distribution network, the invention takes the network loss of the power distribution network as a research object, and obtains the optimal combination of the section switch and the tie switch in the power distribution network by optimizing the network loss in a period of time instead of a certain time section in the power distribution network. Because the number of decision variables in the optimized model is increased by geometric multiples compared with the conventional network reconstruction, the optimized model is solved based on the improved discrete monkey group algorithm, and the optimal combination of the switches in the power distribution network is obtained by utilizing the better optimizing capability and the convergence speed of the monkey group algorithm; secondly, different types of loads in different areas are considered, and different types of actual load curves introduced into the feeder line of the transformer substation in the power distribution network are simulated; finally, in the improved monkey swarm algorithm, the particularity of the model is combined, and the randomly generated variables are limited by adopting a manual strategy to form a group of feasible solutions, so that a large number of invalid solutions are avoided, the calculation time is saved, and the optimization speed is increased.
Drawings
FIG. 1 is a flow chart of a power grid dispatching optimization method taking into account power grid load rate and time sequence load changes according to the invention;
fig. 2 is a power distribution network topology structure diagram according to an embodiment of the present invention.
Detailed Description
The present invention will be described in more detail below with reference to the following embodiments, which are illustrative, but not restrictive, and should not be construed as limiting the scope of the present invention.
A power grid dispatching optimization method considering power grid load rate and time sequence load change, please refer to fig. 1, which is characterized in that: the method comprises the following steps:
step 1, initializing variables based on input power distribution network parameters, and setting discrete monkey group algorithm initial parameters;
the input power distribution network parameters comprise the number of feeders in the distribution network, the number of normally closed switches of each feeder and the number of interconnection switches.
Initializing variables specifically comprises:
establishing a model objective function, see expression (1):
Min G(x) (1)
g (x) is network loss in the power distribution network, and the variable x is a switching variable combination in the power distribution network;
the constraints of the established model comprise the constraints of two dimensions of space and time:
(1) Time dimension constraint
Including switching frequency constraints, which means that the number of operations of the sectionalizer and tie switch in an optimization cycle has certain limits,
see expression (2):
in the formula
Is an exclusive or mathematical operator; nx1 and nx2 are maximum action times of the head-end circuit breaker or the section switch and the tie switch in the T time period.
(2) A spatial dimension constraint comprising:
b. tidal current equation constraint, see expression (3)
The power supply system comprises a power supply module, a power supply module and a power supply module, wherein Px, t, qx and t are respectively active power and reactive power injected at the x-th feeder line load at the t moment; ui, t represents the voltage amplitude loaded by the x-th feeder line at the t moment; gxj, bxj, and xj respectively represent conductance, susceptance, and phase angle difference on a connecting line between the x-th feeder line and the j-th feeder line at the t-th moment;
b. the inequality constraints of voltage and transformer capacity are shown in expression (4);
U min ≤U x,t ≤U max
|L x,j |≤L max
S i ≤S imax (4)
the system comprises a plurality of lines, wherein Ux, t, si and Lxj respectively represent the voltage amplitude of the x-th feeder line load at the t moment, the actual load of an ith transformer and the transmission capacity of a connecting line between the x-th line and the j-th line;
d. a radiation operation constraint;
when the distribution network actually runs, the topological structure of the distribution network needs to be ensured to be radial, so that three switches, namely a feeder line head end breaker, a tie switch on the feeder line and a feeder line head end breaker connected with the feeder line, need to be ensured that only two switches are in an open state, see expression (5):
onoff1(x,t)+onoff2(x,t)+onoff1(j,t)-2＝0 (5)。
setting initial parameters of a discrete monkey group algorithm, specifically:
because the optimized model is complex and has a coupling relation in a time dimension, the randomly generated variables hardly satisfy the constraint condition as an initial solution. Firstly, setting a tie switch on each feeder line to be in an open state, setting a breaker at the head end of the feeder line to be in a closed state, and then performing variation on a certain switch at a certain time by using a random number method to serve as an initial solution; the invention utilizes an improved discrete monkey group algorithm to solve, the scale of the monkey group is set as M, and for the ith monkey in the monkey group, the position of the ith monkey can be defined as:
X i ＝(x i,1 ,x i,2 ,…,x i,n ) T x i,n ∈{0,1}
wherein, X i Corresponds to a switch in the power distribution system, the value x on each component i,1 ,x i,2 ,…,x i,n Indicating the state on the corresponding switch, 0 for on, 1 for off, so that the current position of each monkey is the set of switch combinations for the optimized model.
Step 2, performing crawling process operation by adopting a discrete monkey group algorithm, and specifically comprising the following steps:
step 2.1 generating vectors randomly
See expression (6)
Wherein, Δ x i,j Is a randomly generated number from the set {0,1}, j ∈ {1,2, \8230;, n };
step 2.2. Order
Computing
Step 2.3 if:
then order
Otherwise, if:
then order
Step 2.4 repeats steps 2.1 to 2.3 until the objective function value does not change for a plurality of continuous iterations or reaches a preset iteration number N C,L 。
Step 3, carrying out hope-jump process operation by adopting a discrete monkey group algorithm, which specifically comprises the following steps:
for the ith monkey, the procedure was as follows:
step 3.1 followingGenerating a column vector B i (j) And obtaining a vector: b i ＝[B i (1),B i (2),...,B i (n)]I.e. a group of switch combinations in a period of time, but because the model is coupled in a time dimension, in order to avoid generating a large number of invalid solutions, the generated B is firstly combined i Making a decision in the time dimension, at [0]If the number of switching operations has reached an upper limit within a time period, the switching state remains unchanged since the last change, and secondly, for B generated i Judging in the spatial dimension so that the solution satisfies all constraint conditions and is a set of feasible solutions;
step 3.2 if G (B) i )<G(X i ) Then let X i ＝B i Turning to a climbing process;
step 3.3 repeat steps 3.1 to 3.2 until the objective function value is not changed for a plurality of continuous iterations or reaches a preset iteration number N C,L 。
Step 4, a discrete monkey group algorithm is adopted to turn over the process operation, and the method specifically comprises the following steps:
step 4.1, the number of iterations k = k +1, and a real number d is randomly generated at [0,1 ];
step 4.2 calculate the mean pj of the monkey population:
step 4.3 pairs
Calculate a = d | p j -X i (j) If a is more than or equal to 1, X i '(j)＝max(X i (j) +1, 1), otherwise X i ’(j)＝max(X i (j)+0,1)；
Step 4.4 likewise to avoid generating a large number of invalid solutions, the X generated is subjected to i ' (j) judging in both space-time dimensions if X is above i If' (j) is feasible, let X i (j)＝X i ' (j), the turning process is finished, and the climbing process is switched toOtherwise, repeating the steps 4.1 to 4.4 until a feasible solution is found.
And step 5, termination judgment:
the whole algorithm has the following two termination criteria:
(1) The number of iterations k reaches a maximum value.
(2) The optimal solution obtained does not change for successive generations.
If the termination criterion is met, the algorithm is ended, the optimal result is output, and if the termination criterion is not met, the steps 2 to 4 are repeated until the termination criterion is met.
The effectiveness of the invention is demonstrated by the following specific examples. Suppose that four substations exist in a certain distribution network, each substation contains two 35/10kV main transformers, and the topological structure is shown in fig. 2. R can be obtained by calculation according to main transformer parameters i ＝0.219Ω,X i =3.111 Ω, and the impedance and inductive reactance of the feed line are R j ＝0.219Ω/km,X j =0.417 Ω/km, transmission capacity of each feeder line is 3MW, the load on each main transformer feeder is simulated using IEEE RTS load data, the load types on different feeders are different, including industrial, agricultural, commercial, municipal and random combinations thereof, and the simulation results are shown in table 1.
TABLE 1 simulation results using the improved discrete monkey swarm algorithm
Taking the second monkey example after 20 iterations, the initial variation position of the monkey is that the first outgoing line of the first main transformer of the fourth substation supplies the load to the fourth outgoing line of the second main transformer of the second substation at the twelfth moment, the final switch state of the first main transformer of the first substation and the breaker at the head end of the feeder line of the first transformer of the second main transformer connected with the feeder line of the first main transformer are respectively shown in table 2, wherein feeder lines 1,2, 3 and 4 are the four outgoing lines of the first main transformer of the first substation, and feeder lines 1,2 and 3 are respectively connected with the feeder lines of the first transformer of the second main transformer, i.e. 9, 10 and 11, so that the transfer state of the load on the feeder lines through the tie lines can be obviously seen, the feeder line 1 transfers the load to the feeder line 9 through the tie switch at the first moment, and the feeder line 10 supplies the load to the feeder line 2 at the fourteenth moments.
Table 2 optimal solution state of partial feeder head end circuit breaker
Although the embodiments and figures of the present invention have been disclosed for illustrative purposes, those skilled in the art will appreciate that: various substitutions, changes and modifications are possible without departing from the spirit and scope of the invention and the appended claims, and therefore the scope of the invention is not limited to the disclosure of the embodiments and figures.
Claims (6)
1. A power grid dispatching optimization method considering power grid load rate and time sequence load change is characterized in that: the method comprises the following steps:
step 1, initializing variables based on input power distribution network parameters, and setting discrete monkey group algorithm initial parameters;
step 2, adopting a discrete monkey group algorithm to perform crawling process operation;
step 3, carrying out hope-jump process operation by adopting a discrete monkey group algorithm;
step 4, a discrete monkey group algorithm is adopted to turn over the process operation;
step 5, termination judgment is carried out, if the termination criterion is met, the algorithm is ended to output an optimal result; if not, repeating the steps 2-4 until the termination criterion is met;
the power distribution network parameters input in the step 1 comprise the number of feeder lines in a distribution network, the number of normally closed switches of each feeder line and the number of interconnection switches;
initializing variables in step 1 specifically comprises:
establishing a model objective function, see expression (1):
Min G(x) (1)
g (x) is network loss in the power distribution network, and the variable x is a switching variable combination in the power distribution network;
the constraints of the established model comprise constraints of two dimensions of space and time:
(1) Time dimension constraint
Including switching frequency constraints, which means that the number of operations of the sectionalizing switch and the tie switch in the optimization period has a certain limit,
see expression (2):
in the formula
Is an exclusive or mathematical operator; nx1 and nx2 are the maximum action times of the head-end circuit breaker or the sectional switch and the tie switch in the T time period;
(2) Spatial dimension constraints comprising:
a. tidal current equation constraints, see expression (3)
The power supply system comprises a power supply module, a power supply module and a power supply module, wherein Px, t, qx and t are respectively active power and reactive power injected at the x-th feeder line load at the t moment; ui, t represents the voltage amplitude loaded by the x-th feeder line at the t moment; gxj, bxj, and xj respectively represent conductance, susceptance, and phase angle difference on a connecting line between the x-th feeder line and the j-th feeder line at the t-th moment;
b. the inequality constraints of voltage and transformer capacity are shown in expression (4);
U min ≤U x,t ≤U max
|L x,j |≤L max
S i ≤S imax (4)
wherein Ux, t, si and Lxj respectively represent the voltage amplitude of the x-th feeder line load at the time t, the actual load of the ith transformer and the transmission capacity on a connecting line between the x line and the j line;
c. a radiation operation constraint;
when the distribution network actually runs, the topological structure of the distribution network needs to be ensured to be radial, so that three switches, namely a feeder line head end breaker, a tie switch on the feeder line and a feeder line head end breaker connected with the feeder line, need to be ensured that only two switches are in an open state, see expression (5):
onoff1(x,t)+onoff2(x,t)+onoff1(j,t)-2＝0 (5)。
2. the power grid dispatching optimization method considering power grid load rate and time sequence load change according to claim 1, wherein initial parameters of a discrete monkey group algorithm are set in step 1, and specifically are as follows:
firstly, setting a tie switch on each feeder line to be in an open state, setting a breaker at the head end of the feeder line to be in a closed state, and then performing variation on a certain switch at a certain time by using a random number method to serve as an initial solution; the invention utilizes an improved discrete monkey group algorithm to solve, the scale of the monkey group is set as M, and for the ith monkey in the monkey group, the position of the ith monkey can be defined as:
X i ＝(x i,1 ,x i,2 ,…,x i,n ) T x i,n ∈{0,1}
wherein, X i Corresponds to a switch in the power distribution system, the value x on each component i,1 ,x i,2 ,…,x i,n Indicating the state on the corresponding switch, 0 for on, 1 for off, so that the current position of each monkey is the set of switch combinations for the optimized model.
3. The power grid dispatching optimization method considering power grid load rate and time sequence load change according to claim 1, wherein step 2 adopts a discrete monkey swarm algorithm to perform climbing process operation, and specifically comprises the following steps:
step 2.1 random generation of vectors
See expression (6)
Wherein, Δ x i,j J ∈ {1,2, \8230;, n } is a randomly generated number from the set {0,1 };
step 2.2. Order
Computing
Step 2.3 if:
then make it give
Otherwise, if:
then order
Step 2.4 repeating steps 2.1 to 2.3 until the objective function value does not change for a plurality of continuous iterations or reaches the preset iterationNumber of times N C,L 。
4. The power grid dispatching optimization method considering power grid load rate and time sequence load change according to claim 3, wherein the step 3 adopts a discrete monkey group algorithm to perform hope-jump process operation, and specifically comprises the following steps:
for the ith monkey, the procedure was as follows:
step 3.1 random Generation of column vectors B i (j) And obtaining a vector: b i ＝[B i (1),B i (2),...,B i (n)]I.e. a group of switch combinations in a period of time, but because the model is coupled in a time dimension, in order to avoid generating a large number of invalid solutions, the generated B is firstly combined i Making a decision in the time dimension, at [0]If the number of switching operations has reached an upper limit within a time period, the switching state remains unchanged since the last change, and secondly, for B generated i Judging in the spatial dimension so that the solution satisfies all constraint conditions and is a set of feasible solutions;
step 3.2 if G (B) i )＜G(X i ) Then let X i ＝B i Turning to the climbing process, otherwise, turning to the next step 3.3;
step 3.3 repeat steps 3.1 to 3.2 until the objective function value is not changed for a plurality of continuous iterations or reaches a preset iteration number N C,L 。
5. The power grid dispatching optimization method considering power grid load rate and time sequence load change according to claim 4, wherein the step 4 adopts a discrete monkey group algorithm to turn over process operation, and specifically comprises the following steps:
step 4.1, the iteration number k = k +1, and a real number d is randomly generated in [0,1 ];
step 4.2 calculate the mean pj of the monkey population:
step 4.3 pairs
Calculate a = d | p j -X i (j) If a is more than or equal to 1, X i '(j)＝max(X i (j) +1, 1), otherwise X i '(j)＝max(X i (j)+0,1)；
Step 4.4 likewise to avoid generating a large number of invalid solutions, the X generated is subjected to i ' (j) judging in both space-time dimensions if the above-mentioned X i If' (j) is feasible, let X i (j)＝X i ' (j), the process of turning over is finished, the process is turned to the process of climbing, otherwise, the steps 4.1 to 4.4 are repeated until a feasible solution is found.
6. The method of claim 5, wherein the step 5 termination interpretation comprises two termination criteria:
(1) The iteration number k reaches the maximum value;
(2) The optimal solution obtained does not change for successive generations.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011015012.3A CN112310958B (en) | 2020-09-24 | 2020-09-24 | Power grid dispatching optimization method considering power grid load rate and time sequence load change |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011015012.3A CN112310958B (en) | 2020-09-24 | 2020-09-24 | Power grid dispatching optimization method considering power grid load rate and time sequence load change |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112310958A CN112310958A (en) | 2021-02-02 |
| CN112310958B true CN112310958B (en) | 2023-01-24 |
Family
ID=74489168
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011015012.3A Active CN112310958B (en) | 2020-09-24 | 2020-09-24 | Power grid dispatching optimization method considering power grid load rate and time sequence load change |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112310958B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101814735A (en) * | 2010-05-19 | 2010-08-25 | 天津大学 | Method for expansion planning of power transmission network |
| CN103117545A (en) * | 2013-02-28 | 2013-05-22 | 国家电网公司 | Automatic load distribution method for intelligent transformer substation |
| CN103489047A (en) * | 2013-09-30 | 2014-01-01 | 国家电网公司 | Optimal configuring method for medium-voltage distribution network section switches |
| CN103903062A (en) * | 2014-03-12 | 2014-07-02 | 国家电网公司 | Method for reconstructing power distribution network based on double-ant-colony optimization |
| CN110348048A (en) * | 2019-05-31 | 2019-10-18 | 国网河南省电力公司郑州供电公司 | Based on the power distribution network optimal reconfiguration method for considering tropical island effect load prediction |
| CN111682525A (en) * | 2020-05-28 | 2020-09-18 | 天津大学 | Load transfer method based on optimal flow method and Mayeda spanning tree method |
-
2020
- 2020-09-24 CN CN202011015012.3A patent/CN112310958B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101814735A (en) * | 2010-05-19 | 2010-08-25 | 天津大学 | Method for expansion planning of power transmission network |
| CN103117545A (en) * | 2013-02-28 | 2013-05-22 | 国家电网公司 | Automatic load distribution method for intelligent transformer substation |
| CN103489047A (en) * | 2013-09-30 | 2014-01-01 | 国家电网公司 | Optimal configuring method for medium-voltage distribution network section switches |
| CN103903062A (en) * | 2014-03-12 | 2014-07-02 | 国家电网公司 | Method for reconstructing power distribution network based on double-ant-colony optimization |
| CN110348048A (en) * | 2019-05-31 | 2019-10-18 | 国网河南省电力公司郑州供电公司 | Based on the power distribution network optimal reconfiguration method for considering tropical island effect load prediction |
| CN111682525A (en) * | 2020-05-28 | 2020-09-18 | 天津大学 | Load transfer method based on optimal flow method and Mayeda spanning tree method |
Non-Patent Citations (4)
| Title |
|---|
| Discrete monkey algorithm and its application in transmission network expansion planning;Jingran Wang等;《IEEE PES General Meeting》;20100729;1-5页 * |
| Evolutionary Algorithm based Controller Design for Grid tie Inverter to improve the Quality of Power System;K. Vijayakumar等;《2019 2nd International Conference on Power and Embedded Drive Control (ICPEDC)》;20190823;249-253页 * |
| 离散猴群算法及其在输电网扩展规划中的应用;王靖然等;《天津大学学报》;20100915(第09期);798-803页 * |
| 输电网优化规划策略与安全价值评估;王靖然;《中国优秀博硕士学位论文全文数据库（博士）工程科技II辑》;20120515;C042-33 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112310958A (en) | 2021-02-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107800155B (en) | Active power distribution network multi-period island operation method considering intelligent soft switch | |
| CN108306298B (en) | Design method for flexible multi-state switch to be connected to power distribution network | |
| CN105719196B (en) | Active power distribution network voltage reactive power control method based on intelligent soft switch | |
| Li et al. | Piecewise normalized normal constraint method applied to minimization of voltage deviation and active power loss in an AC–DC hybrid power system | |
| CN104794541B (en) | A kind of power distribution network running optimizatin method based on simulated annealing and cone optimization | |
| Kavousi-Fard et al. | Stochastic framework for reliability enhancement using optimal feeder reconfiguration | |
| CN114362267B (en) | Distributed coordination optimization method for AC/DC hybrid power distribution network considering multi-objective optimization | |
| CN106159955B (en) | Electric system distributed optimal power flow method based on continuous punishment Duality Decomposition | |
| CN111817349A (en) | Multi-microgrid passive grid-connected and off-grid switching control method based on deep Q learning | |
| CN106058858A (en) | Power distribution network optimization method and device | |
| CN107528346A (en) | Distribution isolated island black starting-up based on dynamic programming model recovers online decision-making technique | |
| Yodphet et al. | Electrical distribution system reconfiguration for power loss reduction by the Salp Swarm algorithm | |
| CN106655253A (en) | Single-/three-phase multi-micro-grid region dynamic partitioning method | |
| CN114069664B (en) | Distributed control method for power distribution network voltage of large-scale energy storage system | |
| Mancer et al. | Multi objective optimal reactive power flow based STATCOM using three variant of PSO | |
| CN108376997B (en) | Active power distribution network island division method considering distributed power supply uncertainty | |
| Pavlov et al. | Multi-agent approach to modeling of electrotechnical complexes elements at the oil and gas production enterprises | |
| CN112310958B (en) | Power grid dispatching optimization method considering power grid load rate and time sequence load change | |
| Liu et al. | A fully distributed economic dispatch method in DC microgrid based on consensus algorithm | |
| Zeng et al. | Solving multiobjective optimal reactive power dispatch using improved multiobjective particle swarm optimization | |
| Yang et al. | Application of improve whale optimization algorithm to the distribution network reconfiguration with distributed generation | |
| CN114925880B (en) | Virtual energy storage power plant distributed cooperation method based on inaccurate alternating direction multiplier method | |
| CN112200410A (en) | Load balancing optimization method for distribution transformer cluster based on discrete monkey cluster algorithm | |
| Wu et al. | Modular modeling method and power supply capability evaluation for integrated hydrogen production stations of DC systems | |
| Ahmadi et al. | Optimal reconfiguration of unbalanced distribution systems using a new hybrid Big Bang-Big Crunch algorithm for loss reduction |
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 |