CN112861315B - One-dimensional descent search method for non-convex single-target optimal power flow global solution of power system - Google Patents
One-dimensional descent search method for non-convex single-target optimal power flow global solution of power system Download PDFInfo
- Publication number
- CN112861315B CN112861315B CN202110030468.5A CN202110030468A CN112861315B CN 112861315 B CN112861315 B CN 112861315B CN 202110030468 A CN202110030468 A CN 202110030468A CN 112861315 B CN112861315 B CN 112861315B
- Authority
- CN
- China
- Prior art keywords
- solution
- global
- objective function
- value
- power flow
- 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
- 238000000034 method Methods 0.000 title claims abstract description 45
- 238000004364 calculation method Methods 0.000 claims abstract description 10
- 238000005457 optimization Methods 0.000 claims description 18
- 238000006467 substitution reaction Methods 0.000 claims description 3
- 230000005540 biological transmission Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 239000000446 fuel Substances 0.000 description 2
- 239000011159 matrix material Substances 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000015572 biosynthetic process Effects 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000009191 jumping Effects 0.000 description 1
- 238000013178 mathematical model Methods 0.000 description 1
- 238000010845 search algorithm Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
-
- 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—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/06—Energy or water supply
-
- 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
-
- 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
- H02J3/04—Circuit arrangements for ac mains or ac distribution networks for connecting networks of the same frequency but supplied from different sources
- H02J3/06—Controlling transfer of power between connected networks; Controlling sharing of load between connected networks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2111/00—Details relating to CAD techniques
- G06F2111/04—Constraint-based CAD
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2111/00—Details relating to CAD techniques
- G06F2111/10—Numerical modelling
-
- 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]
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02E—REDUCTION OF GREENHOUSE GAS [GHG] EMISSIONS, RELATED TO ENERGY GENERATION, TRANSMISSION OR DISTRIBUTION
- Y02E40/00—Technologies for an efficient electrical power generation, transmission or distribution
- Y02E40/70—Smart grids as climate change mitigation technology in the energy generation sector
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y04—INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
- Y04S—SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
- Y04S10/00—Systems supporting electrical power generation, transmission or distribution
- Y04S10/50—Systems or methods supporting the power network operation or management, involving a certain degree of interaction with the load-side end user applications
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Human Resources & Organizations (AREA)
- General Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Power Engineering (AREA)
- General Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Game Theory and Decision Science (AREA)
- Geometry (AREA)
- Quality & Reliability (AREA)
- Evolutionary Computation (AREA)
- Computer Hardware Design (AREA)
- General Engineering & Computer Science (AREA)
- Public Health (AREA)
- Water Supply & Treatment (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Supply And Distribution Of Alternating Current (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a one-dimensional descent search method for a non-convex single-target optimal power flow global solution of an electric power system, which comprises the following steps of: 1) Determining an objective function; 2) Determining a constraint condition; 3) Performing primary power flow calculation to obtain a primary power flow solution and an initial objective function value; 4) Subtracting a positive small deviation value from the initial objective function value, and substituting the initial objective function value into the original objective function to obtain an equation, and further forming an equation set with the constraint condition; 5) Solving the formed equation set by adopting an interior point method to obtain a new trend solution and an objective function value; 6) And (5) repeatedly executing the step 4) and the step 5), when the condition that the equation set has no solution occurs, ending the loop, and obtaining the set value and the solution of the equation set in the last iteration step, namely the required global optimal value and the required global optimal solution. The method can solve the problem of trapping in the local extreme point and ensure continuous search in the direction of the global extreme point; meanwhile, the global extreme point can be correctly identified, and the reliability of the global extreme value is ensured.
Description
Technical Field
The invention belongs to the technical field of intelligent control of an electric power system, and particularly relates to a one-dimensional descent search method for a non-convex single-target optimal power flow global solution of the electric power system.
Background
The Optimal Power Flow (OPF) is to find a load that satisfies all specified system operation and safety constraints and makes a predetermined system performance index reach Optimal Power Flow distribution by adjusting control variables when structural parameters and load conditions of the Power system are given. The research of the optimal power flow problem is mainly divided into the following two aspects: on one hand, constraint conditions and optimization targets are added in the optimal power flow model, such as unit combination problems, dynamic reactive power constraints and the like, and the large-scale power system engineering problems are analyzed and solved. On the other hand, the optimal power flow problem is often an NP-hard (Non-deterministic polymeric) problem, for example, optimization methods such as a convex programming method and an uncertainty algorithm are introduced to ensure that the global extreme value of the optimal power flow of the power system is accurately and reliably solved.
The optimization algorithm is an important basis for solving the optimal power flow problem, and the quality of the algorithm directly determines the quality of the optimal power flow solution. The existing global optimization algorithm, whether a probabilistic algorithm or a deterministic algorithm, has respective advantages and disadvantages and needs to be further perfected. The probabilistic algorithm has simple form and strong robustness, but the characteristics of black-boxed optimization problem and random search cause the solving efficiency to be low, and only approximate solution is often obtained when the search time is limited; the deterministic search algorithm utilizes the analytic information of the optimization problem, has a definite search direction and high efficiency, but when the analytic information of the optimization problem does not have strict global property, the search is trapped in a local extreme point. Therefore, if the traditional optimization algorithm is adopted, only local extremum solutions can be obtained, and the global optimal solution cannot be reliably solved.
Disclosure of Invention
The invention aims to provide a one-dimensional descent search method for a non-convex single-target optimal power flow global solution of an electric power system, aiming at solving the problem of non-convex power flow optimization of the electric power system in the prior art. The invention relates to a single-target optimization algorithm, which can effectively solve the problems of extreme point jumping and judgment in the global extreme value optimizing process and is applied to the conventional optimal power flow problem.
The optimal power flow mathematical model of the power system is as follows:
in formula (1): f is an objective function, h is an equality constraint, g is an inequality constraint,and u is the upper and lower limits of the continuous variable u, the symbols m, p and n represent equality constraint, inequality constraint and the number of variables, respectively, and the symbol RnRepresenting an n-dimensional real vector space; the OPF problem is to find a solution u from the feasible domain such that f is minimized, under the constraint of h and g.
In order to achieve the purpose, the invention adopts the following technical scheme:
a one-dimensional descent search method for a non-convex single-target optimal power flow global solution of an electric power system is a deterministic global optimal value search method established according to analysis information of global properties of an optimization problem, has clear global property analysis information, and can solve the problem of trapping in a local extreme point and ensure continuous search in the direction of the global extreme point, wherein the search direction is a one-dimensional descent direction; meanwhile, a judgment mechanism of search termination is provided, the global extreme point can be correctly identified, and the reliability of the sought global extreme value is ensured.
The one-dimensional descent search method comprises the following steps:
1) Determining an objective function;
2) Determining a constraint condition;
3) Performing primary power flow calculation to obtain a primary power flow solution and an initial objective function value;
4) Subtracting a positive small deviation value from the initial objective function value, and substituting the initial objective function value into the original objective function to obtain an equation, and further forming an equation set with the constraint condition;
5) Solving the formed equation set by adopting an interior point method to obtain a new power flow solution and an objective function value;
6) And (5) repeatedly executing the step 4) and the step 5), when the condition that the equation set has no solution occurs, ending the loop, and obtaining the set value and the solution of the equation set in the last iteration step, namely the required global optimal value and the required global optimal solution.
The termination criterion is when at the local minimum point GiIf a feasible solution X can be foundiThe setpoint is decremented cyclically in the direction of the decline of the setpoint of the objective function. When the set value G isvLess than global minimum G*And when the situation that no solution exists occurs, the search is stopped at the moment, and the solutions of the set values and the equation sets obtained in the last iteration step are the required global optimal values and the required global optimal solutions. Whereby the set value G can be decremented as a loop in the descending direction of the sequence SvTo search for the global optimum G*The termination criterion of (1).
The invention further illustrates that the objective function is:
Min F(x) (1a)
wherein F is an objective function and x is a continuous variable.
The invention further explains that the constraint conditions are as follows:
in the formula, h is equality constraint, g is inequality constraint, and symbols m and p respectively represent the number of equality constraint and inequality constraint.
According to a further aspect of the invention, the continuous variable x is:
x=(x1,x2,...,xn)T∈Rn
in the formula, RnA real vector space representing the dimension, n representing the number of variables;
the symbol I is used to represent the feasible field of Problem1, i.e., I = { x | h (x) =0,g (x) ≦ 0,x ∈ Rn}; problem1 contains an objective function F, an equality constraint h and an inequality constraint g;
let it be assumed that the calculated value of the objective function F is identified by the symbol G, i.e. F (x) = G; according to the definition of the global minimum, there must be a sequence of values:
S={F(x1)=G1,...,F(xv)=Gv,...,F(x*)=G*};G1>...>Gv>...>G*
wherein G is the global optimum value of F; when x of Problem1 is continuous in the feasible region, S is a continuous interval; in the case of a discrete interval, at a certain solution x of the optimization problemvWith a certain value G of the objective function FvThere is a correspondence between, i.e. xv→Gv。
The invention further explains that in the step 3), the primary power flow calculation is carried out to obtain a primary power flow solution and an initial objective function value G0To form Problem1.
The invention further explains that the specific process of the step 4) is as follows:
setting a precision parameter sigma>0; small deviation amount delta>0; the initial objective function value F (x)0)=G0Subtracting a positive small deviation amount delta, and substituting Problem1 into a substitution formula (1 a), thereby obtaining a new Problem form Problem 2; setting an iteration count value v =1;
in the formula, Δ is a small positive deviation amount, and may be set to 0.001, for example.
The invention further explains that the step 5) is specifically as follows:
with xv-1As an initial point, solving Problem 2 by using an interior point method to obtain GvAnd a corresponding solution x thereofv。
The invention further explains that the step 6) is specifically as follows:
if Problem 2 has no solution, G obtained from the last iterationv-1And a corresponding solution xv-1The loop stops for the optimal solution. Otherwise, let Gv=Gv-1-Δ;xv=xv-1(ii) a v = v +1, forming a new equation set, and continuing iteration until no solution exists; and after the solution is finished, outputting a global optimal value and a global optimal solution.
The invention has the advantages that:
the one-dimensional descent search method provided by the invention has clear global property analysis information, the search direction is a one-dimensional descent direction, the problem of trapping in a local extreme point can be solved, and continuous search in the direction of the global extreme point is ensured; meanwhile, a judgment mechanism of search termination is provided, the global extreme point can be correctly identified, and the reliability of the sought global extreme value is ensured.
Drawings
FIG. 1 is a graph of local extrema and global extrema.
Fig. 2 is a calculation flow chart.
Fig. 3 is a five node system diagram.
Detailed Description
The invention is further described below with reference to the accompanying drawings.
Example (b):
a one-dimensional descent search method for a non-convex single-target optimal power flow global solution of an electric power system is a deterministic global optimal value search method established according to analysis information of global properties of an optimization problem, has clear global property analysis information, and can solve the problem of trapping in a local extreme point and ensure continuous search in the direction of the global extreme point, wherein the search direction is a one-dimensional descent direction; meanwhile, a judgment mechanism of search termination is provided, the global extreme point can be correctly identified, and the reliability of the sought global extreme value is ensured. The method comprises the following steps:
1) Determining an objective function:
Min F(x)
wherein F is an objective function and x is a continuous variable;
2) Determining a constraint condition:
in the formula, h is equality constraint, g is inequality constraint, and symbols m and p respectively represent the number of equality constraint and inequality constraint;
the continuous variable x is as follows:
x=(x1,x2,...,xn)T∈Rn
in the formula, RnA real vector space representing the dimension, n representing the number of variables;
the symbol I is used to represent the feasible field of Problem1, i.e., I = { x | h (x) =0,g (x) ≦ 0,x ∈ Rn}; problem1 contains an objective function F, an equality constraint h and an inequality constraint g;
let it be assumed that the calculated value of the objective function F is identified by the symbol G, i.e. F (x) = G; according to the definition of the global minimum, there must be a sequence of values:
S={F(x1)=G1,...,F(xv)=Gv,...,F(x*)=G*};G1>...>Gv>...>G*
wherein G is the global optimum value of F; when the temperature is higher than the set temperatureWhen x of Problem1 is continuous in the feasible region, S is a continuous interval; in the case of a discrete interval, at a certain solution x of the optimization problemvWith a certain value G of the objective function FvThere is a corresponding relationship between them, i.e. xv→Gv;
3) Performing primary power flow calculation to obtain a primary power flow solution and an initial objective function value G0Forming Problem1;
4) Subtracting a positive small deviation value from the initial objective function value, and substituting the initial objective function value into the original objective function to obtain an equation, and further forming an equation set with the constraint condition; the specific process is as follows:
setting a precision parameter sigma>0; small deviation amount delta>0; the initial objective function value F (x)0)=G0Subtracting a positive small deviation amount delta, and substituting Problem1 into a substitution formula (1 a), thereby obtaining a new Problem form Problem 2; setting an iteration count value v =1;
where Δ is a small positive deviation;
5) Solving the formed equation set by adopting an interior point method to obtain a new trend solution and an objective function value; the method comprises the following specific steps:
with xv-1For the initial point, solving Problem 2 by using an interior point method to obtain GvAnd a corresponding solution xv;
6) Repeatedly executing the step 4) and the step 5), when the condition that the equation set has no solution appears, the loop is terminated, and the iteration of the previous step obtains the set value and the solution of the equation set, namely the required global optimal value and the global optimal solution; the method specifically comprises the following steps:
if Problem 2 has no solution, G obtained in last iterationv-1And a corresponding solution xv-1The loop is stopped for an optimal solution. Otherwise, let Gv=Gv-1-Δ;xv=xv-1(ii) a v = v + 1, forming a new equation set, and continuing iteration until no solution exists; and after the solution is finished, outputting a global optimal value and a global optimal solution.
One-dimensional descent search method optimization power flow problem example analysis based on the embodiment
The test system adopts a 5-node standard test system, and a system single line diagram and impedance parameters are shown in figure 3. Wherein nodes 4 and 5 are generator nodes, the balance node is node 5, and the remaining nodes are PQ nodes. Node voltage data and node power data of the system are respectively shown in tables 1 and 2, limited line transmission power data are shown in table 3, and fuel consumption coefficients of the generator set are shown in table 4. All data are in per unit value form unless otherwise specified.
TABLE 1 System node Voltage data
Note: means do not set
TABLE 2 System node Power data
TABLE 3 line Transmission Power Limit data
TABLE 4 System Generator set Fuel consumption coefficient
System admittance matrix formation
The admittance matrix for test system I can be formed from the data of fig. 3 as follows:
(II) System variable Condition
In the test system I, 5 nodes are provided, 2 generator sets are provided, and no other reactive power source exists. According to the node voltage and power data, the number of variables to be solved of the system is 13:
X=(V1,θ1,V2,θ2,V3,θ3,V4,θ4,V5,PG4,QG4,PG5,QG5)
wherein the state variable is (V)1,θ1,V2,θ2,V3,θ3,V4,θ4,V5) (ii) a The control variable is (P)G4,QG4,PG5,QG5)。
(III) System optimal Power flow model
With the generator operating cost as the objective function, the data according to table 4 can be obtained:
the equality constraint of the optimal power flow model of the test system is 10 node power equations in total; there are 14 inequality constraints and variable constraints, including: 5 node voltage constraints, 2 power supply active power constraints, 2 power supply reactive power constraints, and 5 branch transmission power constraints.
Further, the analysis is integrated to obtain an optimal power flow model of the test system I:
Vimin≤Vi≤Vimax;(i=1,...,5)
PGimin≤PGi≤PGimax;(i=4,5)
QGimin≤QGi≤QGimax;(i=4,5)
wherein, Pij=ViVj(Gijcosθij+Bijsinθij)-ViGij。
And 2, constructing an objective function equation constraint. When the objective function value is set to be G, an objective function equation constraint is formed:
this, together with other constraints in the optimal power flow model, forms a system of operational power flow equations.
Firstly, initialization setting is carried out: the convergence condition is 1e-6; the initial value of the system variable is V1=1.0,θ1=0.0, V2=1.0,θ2=0.0,V3=1.0,θ3=0.0,V4=1.0,θ4=0.0,V5=1.0,PG4=4.0,QG4=0.1,PG5=3.0,QG5=0.1, it is noted that node 5 is a balanced node, the phase angle of which is a fixed value θ5=0.0, but the voltage amplitude of the node 5 is adjustable. The small deviation for the objective function is set to Δ =0.1; the remaining known parameters are: pD1=-1.6,QD1=-0.8,PD2=-2,QD2=-1,PD3=-3.7,QD3And (4) = -1.3. And obtaining an initial set value G =7973.8 of the objective function through primary power flow calculation.
And 4, subtracting a positive small deviation amount delta from the initial set value G =7973.8 of the target function, and substituting the formula Min F (x) = G into Problem1 to obtain a Problem 2.
And 5, solving the formed equation set by adopting an interior point method to obtain a new trend solution and an objective function value.
And 6, repeatedly executing the step sequence of the step 4 and the step 5. If no solution exists in the 507 circulation equation set, the circulation is terminated, the global optimal solution is obtained by searching, and the intermediate calculation process is shown as follows. Table 5 is a calculated value of the voltage parameter of each node in the search process, and table 6 is a calculated value of the power parameter of the generator set.
TABLE 5 variation of the Voltage parameters of the nodes
TABLE 6 variation of generator power
The global solutions searched by the one-dimensional descent search method are shown in tables 7, 8 and 9. Wherein, table 7 is the optimal solution for each node voltage; table 8 is the calculated value of the branch active power; table 9 is the optimal solution for active and reactive power, and the global optimal value for the objective function.
TABLE 7 optimal solution for each node voltage
Table 8 branch active power
TABLE 9 active, reactive, and objective function optima
It should be understood that the above-described embodiments are merely examples for clearly illustrating the present invention and are not intended to limit the practice of the present invention. Other variations and modifications will be apparent to persons skilled in the art in light of the above description; it is not necessary or exhaustive for all embodiments to be presented herein; and obvious variations or modifications are intended to be within the scope of the present invention.
Claims (8)
1. A one-dimensional descent search method for a non-convex single-target optimal power flow global solution of an electric power system is characterized by comprising the following steps of: the method is a deterministic global optimum value searching method established according to the analysis information of the global property of the optimization problem, has definite global property analysis information, and can solve the problem of trapping in a local extreme point and ensure continuous searching in the direction of the global extreme point, wherein the searching direction is a one-dimensional descending direction; meanwhile, a judgment mechanism of search termination is provided, so that the global extreme point can be correctly identified, and the reliability of the sought global extreme value is ensured;
the one-dimensional descent search method comprises the following steps:
1) Determining an objective function;
2) Determining a constraint condition;
3) Performing primary power flow calculation to obtain a primary power flow solution and an initial objective function value;
4) Subtracting a positive small deviation value from the initial objective function value, and substituting the initial objective function value into the original objective function to obtain an equation, and further forming an equation set with the constraint condition;
5) Solving the formed equation set by adopting an interior point method to obtain a new trend solution and an objective function value;
6) And (5) repeatedly executing the step 4) and the step 5), when the condition that the equation set has no solution occurs, ending the loop, and obtaining the set value and the solution of the equation set in the last iteration step, namely the required global optimal value and the required global optimal solution.
2. The one-dimensional descent search method for the non-convex single-target optimal power flow global solution of the power system as claimed in claim 1, wherein the objective function is:
Min F(x) (1a)
wherein F is an objective function and x is a continuous variable.
3. The one-dimensional descent search method for the non-convex single-target optimal power flow global solution of the power system as claimed in claim 2, wherein the constraint conditions are as follows:
in the formula, h is equality constraint, g is inequality constraint, and symbols m and p respectively represent the number of equality constraint and inequality constraint.
4. The one-dimensional descent search method for the non-convex single-target optimal power flow global solution of the power system as claimed in claim 3, wherein the continuous variable x is:
x=(x1,x2,...,xn)T∈Rn
in the formula, RnA real vector space representing the dimension, n representing the number of variables;
the symbol I is used to represent the feasible field of Problem1, i.e., I = { x | h (x) =0,g (x) ≦ 0,x ∈ Rn}; problem1 contains an objective function F, an equality constraint h and an inequality constraint g;
let it be assumed that the calculated value of the objective function F is identified by the symbol G, i.e. F (x) = G; according to the definition of the global minimum, there must be a sequence of values:
S={F(x1)=G1,...,F(xv)=Gv,...,F(x*)=G*};G1>...>Gv>...>G*
wherein G is the global optimum value of F; when x of Problem1 is continuous in the feasible region, S is a continuous interval; in the case of a discrete interval, at a certain solution x of the optimization problemvWith a certain value G of the objective function FvThere is a corresponding relationship between them, i.e. xv→Gv。
5. The one-dimensional descent search method for the non-convex single-target optimal power flow global solution of the power system as claimed in claim 4, wherein in the step 3), a primary power flow calculation is performed to obtain a primary power flow solution and an initial objective function value G0To form Problem1.
6. The one-dimensional descent search method for the non-convex single-target optimal power flow global solution of the power system according to claim 5, wherein the specific process of the step 4) is as follows:
setting a precision parameter sigma>0; small deviation Δ>0; the initial objective function value F (x)0)=G0Subtracting a positive small deviation amount delta, and substituting Problem1 into a Problem1 substitution formula (1 a) so as to obtain a new Problem form Problem 2; setting an iteration count value v =1;
in the formula, Δ is a small positive deviation amount.
7. The one-dimensional descent search method for the non-convex single-target optimal power flow global solution of the power system according to claim 6, wherein the step 5) is specifically as follows:
with xv-1As an initial point, solving Problem 2 by using an interior point method to obtain GvAnd a corresponding solution xv。
8. The one-dimensional descent search method for the non-convex single-target optimal power flow global solution of the power system according to claim 7, wherein the step 6) is specifically as follows:
if Problem 2 has no solution, G obtained in last iterationv-1And a corresponding solution x thereofv-1For the optimal solution, the cycle is stopped; otherwise, let Gv=Gv-1-△;xv=xv-1(ii) a v = v +1, forming a new equation set, and continuing iteration until no solution exists; and after the solution is finished, outputting a global optimal value and a global optimal solution.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110030468.5A CN112861315B (en) | 2021-01-11 | 2021-01-11 | One-dimensional descent search method for non-convex single-target optimal power flow global solution of power system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110030468.5A CN112861315B (en) | 2021-01-11 | 2021-01-11 | One-dimensional descent search method for non-convex single-target optimal power flow global solution of power system |
Publications (2)
Publication Number | Publication Date |
---|---|
CN112861315A CN112861315A (en) | 2021-05-28 |
CN112861315B true CN112861315B (en) | 2022-11-01 |
Family
ID=76002298
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202110030468.5A Active CN112861315B (en) | 2021-01-11 | 2021-01-11 | One-dimensional descent search method for non-convex single-target optimal power flow global solution of power system |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN112861315B (en) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113743806B (en) * | 2021-09-09 | 2024-03-19 | 广西康耐肯特科技有限公司 | Searching method for non-convex double-target optimal power flow global solution of power system |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101976837A (en) * | 2010-10-17 | 2011-02-16 | 华中电网有限公司 | Method for adjusting unsolvable power flow of electric power system |
CN108493939A (en) * | 2018-03-06 | 2018-09-04 | 国网江西省电力有限公司电力科学研究院 | A kind of air conditioner load Optimization Scheduling based on optimal load flow |
Family Cites Families (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20140258356A1 (en) * | 2012-12-13 | 2014-09-11 | University Of South Florida | Column and constraint generation method for optimal strategies |
CN104573861A (en) * | 2015-01-05 | 2015-04-29 | 河海大学 | Quasi direct current optimal power flow method based on interior point semi-definite programming |
CN105932670A (en) * | 2016-05-26 | 2016-09-07 | 国网山东省电力公司潍坊供电公司 | Distribution network state estimation method based on semi-definite programming |
CN106026105B (en) * | 2016-07-22 | 2019-04-30 | 浙江理工大学 | A kind of Optimal Power Flow Problems control method based on the concave-convex optimisation technique of punishment |
CN107064646B (en) * | 2017-05-23 | 2020-02-21 | 广西大学 | Power grid impedance real-time identification method for multi-input multi-output asymmetric system |
CN109460876A (en) * | 2018-12-23 | 2019-03-12 | 上海电力学院 | A kind of power distribution network evaluation of power supply capability method considered after the relieving of sale of electricity side |
CN109902854B (en) * | 2019-01-11 | 2020-11-27 | 重庆大学 | Method for constructing optimal power flow full-linear model of electric-gas interconnection system |
CN110277789B (en) * | 2019-07-16 | 2021-06-29 | 华北电力大学 | Multi-period reactive power optimization method and device for power grid |
-
2021
- 2021-01-11 CN CN202110030468.5A patent/CN112861315B/en active Active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101976837A (en) * | 2010-10-17 | 2011-02-16 | 华中电网有限公司 | Method for adjusting unsolvable power flow of electric power system |
CN108493939A (en) * | 2018-03-06 | 2018-09-04 | 国网江西省电力有限公司电力科学研究院 | A kind of air conditioner load Optimization Scheduling based on optimal load flow |
Also Published As
Publication number | Publication date |
---|---|
CN112861315A (en) | 2021-05-28 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Buşoniu et al. | Online least-squares policy iteration for reinforcement learning control | |
CN108599172B (en) | Transmission and distribution network global load flow calculation method based on artificial neural network | |
CN104794541B (en) | A kind of power distribution network running optimizatin method based on simulated annealing and cone optimization | |
CN108490790A (en) | A kind of overheating steam temperature active disturbance rejection cascade control method based on multiple-objection optimization | |
CN112861315B (en) | One-dimensional descent search method for non-convex single-target optimal power flow global solution of power system | |
CN112213945A (en) | Improved robust prediction control method and system for electric vehicle participating in micro-grid group frequency modulation | |
Kubalík et al. | Optimal control via reinforcement learning with symbolic policy approximation | |
CN113964884A (en) | Power grid active frequency regulation and control method based on deep reinforcement learning | |
CN107069831B (en) | droop control method | |
CN109066651A (en) | The calculation method of wind-powered electricity generation-load scenarios limit transmitted power | |
CN110795841A (en) | Mathematical modeling method for uncertainty of intermittent energy output | |
CN113408622A (en) | Non-invasive load identification method and system considering characteristic quantity information expression difference | |
CN112748665B (en) | Hydrogen fuel cell iteration control method and device based on fuzzy Kalman filtering | |
CN113033012A (en) | Hierarchical data-driven wind power plant generated power optimization scheme | |
CN113743806B (en) | Searching method for non-convex double-target optimal power flow global solution of power system | |
CN113270867B (en) | Automatic adjustment method for weak power grid tide without solution | |
CN113283654B (en) | Micro-grid group optimization control method and system based on aggregation and disconnection mechanism | |
CN115528684A (en) | Ultra-short-term load prediction method and device and electronic equipment | |
CN112531725B (en) | Method and system for identifying parameters of static var generator | |
CN115146936A (en) | Dynamic adjustment learning factor algorithm for solving cascade water-light storage complementary scheduling model | |
CN112699922A (en) | Self-adaptive clustering method and system based on intra-region distance | |
ILIYA et al. | Differential Evolution Based PID Antenna Position Control System | |
CN107947181B (en) | Decoupling full-linear optimal power flow model based on similar hot start environment | |
Gonçalves et al. | Solving economic load dispatch problem by natural computing intelligent systems | |
Ma et al. | Photovoltaic time series aggregation method based on K-means and MCMC algorithm |
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 |