CN113659579A - N-1 safety constraint considered regional power grid tie line power transmission capability calculation method - Google Patents

N-1 safety constraint considered regional power grid tie line power transmission capability calculation method Download PDF

Info

Publication number
CN113659579A
CN113659579A CN202110916768.3A CN202110916768A CN113659579A CN 113659579 A CN113659579 A CN 113659579A CN 202110916768 A CN202110916768 A CN 202110916768A CN 113659579 A CN113659579 A CN 113659579A
Authority
CN
China
Prior art keywords
constraint
power
feasible
safety
constraints
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
Application number
CN202110916768.3A
Other languages
Chinese (zh)
Other versions
CN113659579B (en
Inventor
宋少群
刘智煖
赖晓文
郑旭冬
翁桂萍
郑陈达
黄金富
刘冲
程鑫
陈绍君
赖永生
李顺宁
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Tsintergy Technology Co ltd
State Grid Fujian Electric Power Co Ltd
Original Assignee
Beijing Tsintergy Technology Co ltd
State Grid Fujian Electric Power Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Tsintergy Technology Co ltd, State Grid Fujian Electric Power Co Ltd filed Critical Beijing Tsintergy Technology Co ltd
Priority to CN202110916768.3A priority Critical patent/CN113659579B/en
Publication of CN113659579A publication Critical patent/CN113659579A/en
Application granted granted Critical
Publication of CN113659579B publication Critical patent/CN113659579B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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
    • 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
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/06—Electricity, gas or water supply
    • H—ELECTRICITY
    • H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • 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)
  • Business, Economics & Management (AREA)
  • Economics (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Health & Medical Sciences (AREA)
  • Marketing (AREA)
  • General Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Tourism & Hospitality (AREA)
  • Quality & Reliability (AREA)
  • Game Theory and Decision Science (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Power Engineering (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Public Health (AREA)
  • Water Supply & Treatment (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Supply And Distribution Of Alternating Current (AREA)

Abstract

The invention provides a method for calculating power transmission capability of a regional power grid tie line by considering N-1 safety constraint, which comprises the following steps of: step S1: establishing a transmission capacity calculation model considering N-1 safety constraint; wherein, when considering the N-1 safety constraint, the junctor power transmission capability represented in the form of feasible domain is defined as: all combinations of ground state tie line power that satisfy the ground state operating constraints and the N-1 safety constraints; step S2: the method for calculating the power transmission capability of the tie line based on the decoupling strategy is used for performing decoupling dimension reduction calculation on feasible domains considering mass N-1 fault states; wherein the decoupling characterization strategy comprises: parallel solution to satisfycA feasible domain of line fault constraint and ground state constraint; and, the feasible domain, taking into account the N-1 security constraints, can be characterized as all fault conditionsIntersection of feasible fields. The method can realize the fast calculation of the power transmission capability of the tie line considering the N-1 safety constraint.

Description

N-1 safety constraint considered regional power grid tie line power transmission capability calculation method
Technical Field
The invention relates to the technical field of power transmission networks, in particular to a method for calculating power transmission capability of a regional power grid tie line by considering N-1 safety constraint.
Background
With the large-scale new energy grid connection and the rapid increase of power load, the source load balance of a single regional power grid is difficult to realize. Especially for cross-region power transmission, the feasible region of tie line power is accurately depicted, and the method has more important significance for ensuring efficient cross-region utilization of power resources. The feasible domain form may enable efficient characterization of the tie-line power transmission capabilities, however existing approaches have difficulty accounting for the N-1 security constraints. In practice, line faults occur during the operation of the power grid, and inter-provincial power transmission needs to meet not only ground state safety constraint but also N-1 safety constraint.
Disclosure of Invention
Aiming at the defects and shortcomings of the prior art, the invention provides a method for calculating the power transmission capability of the tie line of the regional power grid in consideration of N-1 safety constraint on the premise of representing the power transmission capability of the tie line in a feasible domain form, and provides accurate boundary conditions for power grid scheduling. And the decoupling representation strategy is provided, so that the mass N-1 safety constraint is considered quickly.
According to the invention, a transmission capacity calculation model considering N-1 safety constraint is established, and a tie line power transmission capacity calculation method based on a decoupling strategy is used for performing decoupling dimension reduction calculation on feasible domains considering mass N-1 fault states, so that the tie line power transmission capacity considering N-1 safety constraint is calculated quickly.
The invention specifically adopts the following technical scheme
A method for calculating power transmission capability of a regional power grid tie line with consideration of N-1 safety constraint is characterized by comprising the following steps:
step S1: establishing a transmission capacity calculation model considering N-1 safety constraint;
wherein, when considering the N-1 safety constraint, the junctor power transmission capability represented in the form of feasible domain is defined as: all combinations of ground state tie line power that satisfy the ground state operating constraints and the N-1 safety constraints;
step S2: the method for calculating the power transmission capability of the tie line based on the decoupling strategy is used for performing decoupling dimension reduction calculation on feasible domains considering mass N-1 fault states;
wherein the decoupling characterization strategy comprises:
parallel solving of feasible domain omega meeting constraint of c-th line fault and ground state constraintc；
And, the feasible domain Ω, taking into account the N-1 security constraints, can be characterized as the feasible domain Ω under all fault conditionscThe intersection of (a).
Further, in step S1, the ground state operation constraint includes:
and power balance constraint:
Figure BDA0003205848170000021
in the formula:
Figure BDA0003205848170000022
and
Figure BDA0003205848170000023
the unit output and the tie line power under the ground state; p is a radical ofDIs the load demand; 1G、1BAnd 1DAre respectively and
Figure BDA0003205848170000024
and pDThe elements matched in dimension are all column vectors of 1;
and (3) line power flow constraint:
Figure BDA0003205848170000025
in the formula: sNA transfer distribution factor matrix in a ground state; a. theG、ABAnd ADAre respectively as
Figure BDA0003205848170000026
And pDA corresponding node incidence matrix;
Figure BDA0003205848170000027
andFrespectively representing the upper limit and the lower limit of the power flow of all lines;
and (3) unit capacity constraint:
Figure BDA0003205848170000028
in the formula:
Figure BDA0003205848170000029
andP Grespectively representing the upper limit and the lower limit of the output of the unit;
tie line power capacity constraint:
Figure BDA00032058481700000210
in the formula:
Figure BDA0003205848170000031
andP Brespectively, the upper and lower transmission limits of the tie.
The N-1 safety constraint is a safety constraint under the c line fault, and comprises the following steps:
and power balance constraint:
Figure BDA0003205848170000032
in the formula:
Figure BDA0003205848170000033
and
Figure BDA0003205848170000034
the output of the unit and the power of the tie line under the c line fault;
and (3) line power flow constraint:
Figure BDA0003205848170000035
in the formula: scA transfer distribution factor matrix in a ground state;
Figure BDA0003205848170000036
andF crespectively setting the upper limit and the lower limit of the power flow under the fault of the line c;
and (3) unit capacity constraint:
Figure BDA0003205848170000037
tie line power capacity constraint:
Figure BDA0003205848170000038
and (3) constraint of a unit fault condition control mode:
Figure BDA0003205848170000039
in the formula: rGThe output limit before and after the unit fault is considered, when RGWhen the value is 0, the unit is in a preventive control mode; otherwise, the unit is in a corrective control mode.
Further, the compact expressions of the ground state operating constraint and the N-1 safety constraint are:
Figure BDA00032058481700000310
Figure BDA00032058481700000311
in the formula: the constraint (10) characterizes ground state constraints (1) - (4), wherein
Figure BDA0003205848170000041
And GNIs a constant matrix; the constraint (11) characterizes an N-1 security constraint, wherein
Figure BDA0003205848170000042
And GNIs a constant matrix.
Further, step S2 specifically includes the following steps:
step S21: algorithm initialization, respectively obtaining according to equations (10) and (11)
Figure BDA0003205848170000043
Constructing an initialized tie line power feasible domain by using the maximum value and the minimum value on each dimension;
solving the problem of the minimum value of the ith dimension:
Figure BDA0003205848170000044
s.t.
Figure BDA0003205848170000045
Figure BDA0003205848170000046
in the formula:
Figure BDA0003205848170000047
is composed of
Figure BDA0003205848170000048
The ith element in (1);
solving the problem of the maximum value of the ith dimension:
Figure BDA0003205848170000049
s.t.
constraints (13) - (14) (16)
The derivatives of (12) to (14) and (15) to (16)
Figure BDA00032058481700000410
The optimal solution is used as a vertex V, and a feasible region omega is constructedc。
Step S22: searching a new vertex: by shifting out the feasible region omegacSearching for new vertices for each bounding plane; let the inequality expression of the kth bounding plane be
Figure BDA00032058481700000411
New vertices are obtained by solving the following linear programming problem:
Figure BDA00032058481700000412
s.t.
constraints (13) - (14) (18)
Figure BDA0003205848170000051
In the formula: vipIs a feasible region omegacAny point in (1);
the optimal solution due to linear programming is the vertex of the constraint. Therefore, the optimal solution in equations (17) - (19) is the new vertex, and after all edges have been translated, all vertices are recorded as Vnew；
Step S23: checking an algorithm termination condition: calculating the difference Δ V between the possible fields before and after the new vertex in step S22; when the variation of the delta V is smaller, the variation of the feasible region before and after the new vertex is added is smaller, therefore, when the delta V is smaller than a given threshold value, the algorithm is terminated, and the feasible region omega under the c line fault is recordedcIs composed of
Figure BDA0003205848170000052
Otherwise, constructing a feasible domain omega according to the new vertexcThen returns to step S22;
feasible domain when all fault conditions are obtained
Figure BDA0003205848170000053
The feasible domain omega, accounting for the N-1 security constraints, may be characterized as the feasible domain omega in all failure casescI.e. Ω ═ nc∈CΩc。
An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor when executing the program implements the steps of the regional power grid tie power transfer capability calculation method considering N-1 safety constraints as described above.
A non-transitory computer readable storage medium having stored thereon a computer program, wherein the computer program, when executed by a processor, implements the steps of the regional grid tie power transfer capability calculation method considering N-1 safety constraints as described above.
The invention and the preferred scheme thereof realize the quick calculation of the power transmission capability of the tie line considering the N-1 safety constraint, and have important significance for the safe operation of the power transmission network.
Drawings
The invention is described in further detail below with reference to the following figures and detailed description:
fig. 1 is a schematic diagram illustrating analysis of a constraint coupling relationship according to an embodiment of the present invention.
Fig. 2 is a schematic diagram of a decoupling characterization strategy according to an embodiment of the present invention.
Fig. 3 is a schematic diagram of a tie-line power transfer capability that does not account for the N-1 constraint.
Fig. 4 is a schematic diagram of tie-line power transmission capability in accordance with an embodiment of the present invention, taking into account N-1 constraints.
Detailed Description
In order to make the features and advantages of the present invention comprehensible, embodiments accompanied with figures are described in detail as follows:
in the scheme provided by the embodiment, firstly, a transmission capacity calculation model considering N-1 safety constraint is established, then, a tie line power transmission capacity calculation method based on a decoupling strategy is used for performing decoupling dimension reduction calculation on feasible domains considering mass N-1 fault states, and therefore quick calculation of the tie line power transmission capacity considering N-1 safety constraint is achieved.
(1) Transmission capability calculation model considering N-1 security constraints
When considering the N-1 safety constraint, the call wire power transmission capability characterized in the form of feasible domain is defined as: all combinations of ground state tie line power that satisfy the ground state operating constraints and the N-1 safety constraints.
1) Ground state operating constraints
a. Power balance constraint
Figure BDA0003205848170000061
In the formula:
Figure BDA0003205848170000062
and
Figure BDA0003205848170000063
the unit output and the tie line power under the ground state; p is a radical ofDIs the load demand; 1G、1BAnd 1DAre respectively and
Figure BDA0003205848170000064
and pDThe elements whose dimensions match are all column vectors of 1.
b. Line flow constraint
Figure BDA0003205848170000065
In the formula: sNA transfer distribution factor matrix in a ground state; a. theG、ABAnd ADAre respectively as
Figure BDA0003205848170000066
And pDA corresponding node incidence matrix;
Figure BDA0003205848170000067
andFrespectively, the upper limit and the lower limit of the power flow of all lines.
c. Capacity constraint of unit
Figure BDA0003205848170000068
In the formula:
Figure BDA0003205848170000071
andP Gthe upper limit and the lower limit of the output of the unit are respectively.
d. Tie line power capacity constraint
Figure BDA0003205848170000072
In the formula:
Figure BDA0003205848170000073
andP Brespectively, the upper and lower transmission limits of the tie.
2) Safety constraints under the failure of the c-th line
a. Power balance constraint
Figure BDA0003205848170000074
In the formula:
Figure BDA0003205848170000075
and
Figure BDA0003205848170000076
the output of the unit and the power of the tie line under the c line fault.
b. Line flow constraint
Figure BDA0003205848170000077
In the formula: scA transfer distribution factor matrix in a ground state;
Figure BDA0003205848170000078
andF crespectively, the upper limit and the lower limit of the power flow under the c line fault.
c. Capacity constraint of unit
Figure BDA0003205848170000079
d. Tie line power capacity constraint
Figure BDA00032058481700000710
e. Unit fault condition control mode constraints
Figure BDA00032058481700000711
In the formula: rGThe output limit before and after the unit fault. In particular, when RGWhen the value is 0, the unit is in a preventive control mode; otherwise, the unit is in a corrective control mode.
(20) The compact expression of the constraint in (28) is as follows:
Figure BDA0003205848170000081
Figure BDA0003205848170000082
in the formula: the constraint (29) characterizes ground state constraints (20) - (23), wherein
Figure BDA0003205848170000083
And GNIs a constant matrix; the constraints (30) characterize N-1 security constraints (24) - (28), wherein
Figure BDA0003205848170000084
And GNIs a constant matrix.
At this time, Constraints (29) - (30) may be projected to the Tie Line Power using the related techniques in the documents "z.tan, h.zhong, j.wang, q.xia and c.kang." engineering Intra-Regional Constraints in Tie-Line Scheduling: a project-Based Framework [ J ] ". IEEE transactions on Power Systems,2019,34(6): 4751-4761", thereby obtaining the Regional grid Tie Line Power transmission capability considering the N-1 security Constraints. However, since equations (29) - (30) contain a large number of constraints, the related art that can be employed is computationally inefficient and difficult to meet with the existing operational schedule computation time window. Therefore, the invention further provides a quick calculation method based on the decoupling representation strategy
(2) Rapid calculation method based on decoupling representation strategy
1) Description of decoupling characterization strategy
It can be found from formulas (29) to (30): the constraints (30) for each fault state are coupled by the ground state constraints (29), except that the constraints (30) for each fault state are not otherwise coupled, as shown in fig. 1.
Based on the characteristics of the coupling relationship, the decoupling characterization strategy is as follows:
a. parallel calculation of a feasible region omega satisfying a constraint (30) of the c-th line fault and a ground state constraint (29)c；
b. The feasible domain omega, taking into account the N-1 security constraints, can be characterized as the feasible domain omega in all failure casescThe intersection of (a).
A schematic of this strategy is given in fig. 2.
2) Feasible region omega under c line faultcIs solved for
Step 1: and (6) initializing an algorithm. By solving optimization problems (31) - (33) and (34) - (35), respectively
Figure BDA0003205848170000085
And constructing an initialization tie line power feasible domain according to the maximum value and the minimum value in each dimension.
Solving the problem of the minimum value of the ith dimension:
Figure BDA0003205848170000091
s.t.
Figure BDA0003205848170000092
Figure BDA0003205848170000093
in the formula:
Figure BDA0003205848170000094
is composed of
Figure BDA0003205848170000095
The ith element in (1).
Solving the problem of the maximum value of the ith dimension:
Figure BDA0003205848170000096
s.t.
constraints (32) - (33) (35)
The related ones obtained from formulae (31) to (33) and (34) to (35)
Figure BDA0003205848170000097
The optimal solution is used as a vertex V, and a feasible region omega is constructedcΩc。
Step 2: and searching a new vertex. By dividing the feasible region omegacMoves outward and searches for new vertices.
Let the inequality expression of the kth bounding plane be
Figure BDA0003205848170000098
New vertices are obtained by solving the following linear programming problem:
Figure BDA0003205848170000099
s.t.
constraints (32) - (33) (37)
Figure BDA00032058481700000910
In the formula: vipIs a feasible region omegacAt any point in the above.
The optimal solution due to linear programming is the vertex of the constraint. Therefore, the optimal solution in equations (36) - (38) is the new vertex, and after all edges have been translated, all vertices are recorded as Vnew。
Step 3: the algorithm terminates the condition check. The calculation considers the difference Δ V between the feasible fields before and after the new vertex in Step 2. When Δ V changes less, it means that the feasible region before and after adding a new vertex changes less. Therefore, when Δ V is less than a given threshold, the algorithm is terminated and the feasible region Ω under the c-th line fault is notedcIs composed of
Figure BDA0003205848170000101
Otherwise, constructing a feasible domain omega according to the new vertexcAnd then returns to Step 2.
Feasible domain when all fault conditions are obtained
Figure BDA0003205848170000102
The feasible domain omega, accounting for the N-1 security constraints, may be characterized as the feasible domain omega in all failure casescI.e. Ω ═ nc∈CΩc。
The following describes the present embodiment with reference to the embodiments.
Taking a certain provincial 661-node power grid containing 3 tie lines as an example, the effectiveness of the method for calculating the power transmission capability of the tie line of the regional power grid considering the N-1 safety constraint is verified.
(1) Comparison of area grid tie line power transfer capabilities with and without N-1 constraints
(a) As shown in FIG. 3, for tie-line power transfer capability that does not account for N-1 constraints
(b) As shown in FIG. 4, to account for N-1 constrained tie line power transfer capabilities
A comparison of the tie-line power transfer capabilities under different constraints can be seen in conjunction with fig. 3 and 4:
the tie-line power feasible domain under the N-1 constraint is far larger than under the N-1 constraint. This is because the combination of tie line power that would result in partially satisfying the ground state constraint would not satisfy the N-1 constraint when the N-1 constraint is added, thus allowing the feasible domain to shrink from fig. 3 to fig. 4. It can be seen that when the N-1 constraint is not considered, this will result in the tie line power transfer capability being overestimated, thereby threatening the safe operation of the power system.
(2) Method calculation efficiency based on decoupling representation strategy
The following two methods were compared:
m1: the Tie Line Power feasible region considering the N-1 safety constraint is directly obtained Based on the Constraints (10) - (11) by adopting the related technology in the documents 'Z.Tan, H.ZHong, J.Wang, Q.Xia and C.Kang.' engineering Intra-Regional Constraints in Tie-Line Scheduling: A project-Based Framework [ J ] ', IEEE transactions-actions on Power Systems,2019,34(6): 4751-way 4761'.
M2: based on the decoupling representation strategy provided by the patent, the tie line power transmission capability of N-1 safety constraint is calculated and taken into account.
Both methods M1-M2 may tie up the line power feasible region, whose computation time is shown in the following table:
TABLE 1 comparison of calculated times for different methods
Figure BDA0003205848170000111
As can be seen from Table 1, the calculation time of the M2 method is reduced by 99.8% compared with that of the M1 method.
The above method provided by this embodiment can be stored in a computer readable storage medium in a coded form, and implemented in a computer program, and inputs basic parameter information required for calculation through computer hardware, and outputs the calculation result.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solutions of the present invention and not for limiting the same, and although the present invention is described in detail with reference to the above embodiments, those of ordinary skill in the art should understand that: modifications and equivalents may be made to the embodiments of the invention without departing from the spirit and scope of the invention, which is to be covered by the claims.
The present invention is not limited to the above-mentioned preferred embodiments, and any other various methods for calculating the power transmission capability of the regional power grid tie-line considering the N-1 safety constraint can be derived from the teaching of the present invention, and all equivalent changes and modifications made according to the claims of the present invention shall fall within the scope of the present invention.

Claims (6)

1. A method for calculating power transmission capability of a regional power grid tie line with consideration of N-1 safety constraint is characterized by comprising the following steps:
step S1: establishing a transmission capacity calculation model considering N-1 safety constraint;
wherein, when considering the N-1 safety constraint, the junctor power transmission capability represented in the form of feasible domain is defined as: all combinations of ground state tie line power that satisfy the ground state operating constraints and the N-1 safety constraints;
step S2: the method for calculating the power transmission capability of the tie line based on the decoupling strategy is used for performing decoupling dimension reduction calculation on feasible domains considering mass N-1 fault states;
wherein the decoupling characterization strategy comprises:
parallel solving feasible domains which meet the constraint of the fault of the c line and the ground state constraint;
and, the feasible domain Ω, taking into account the N-1 security constraints, can be characterized as the feasible domain Ω under all fault conditionscThe intersection of (a).
2. The method for calculating the regional power grid tie-line power transmission capability considering the N-1 safety constraint according to the claim 1, wherein in the step S1, the ground state operation constraint comprises:
and power balance constraint:
Figure FDA0003205848160000011
in the formula:
Figure FDA0003205848160000012
and
Figure FDA0003205848160000013
the unit output and the tie line power under the ground state; p is a radical ofDIs the load demand; 1G、1BAnd 1DAre respectively and
Figure FDA0003205848160000014
and pDThe elements matched in dimension are all column vectors of 1;
and (3) line power flow constraint:
Figure FDA0003205848160000015
in the formula: sNA transfer distribution factor matrix in a ground state; a. theG、ABAnd ADAre respectively as
Figure FDA0003205848160000016
And pDA corresponding node incidence matrix;
Figure FDA0003205848160000017
and F is the upper limit and the lower limit of the power flow of all lines respectively;
and (3) unit capacity constraint:
Figure FDA0003205848160000021
in the formula:
Figure FDA0003205848160000022
andP Grespectively representing the upper limit and the lower limit of the output of the unit;
tie line power capacity constraint:
Figure FDA0003205848160000023
in the formula:
Figure FDA0003205848160000024
andP Bthe upper limit and the lower limit of transmission of the tie line are respectively;
the N-1 safety constraint is a safety constraint under the c line fault, and comprises the following steps:
and power balance constraint:
Figure FDA0003205848160000025
in the formula:
Figure FDA0003205848160000026
and
Figure FDA0003205848160000027
the output of the unit and the power of the tie line under the c line fault;
and (3) line power flow constraint:
Figure FDA0003205848160000028
in the formula: scA transfer distribution factor matrix in a ground state;
Figure FDA0003205848160000029
andF crespectively setting the upper limit and the lower limit of the power flow under the fault of the line c;
and (3) unit capacity constraint:
Figure FDA00032058481600000210
tie line power capacity constraint:
Figure FDA00032058481600000211
and (3) constraint of a unit fault condition control mode:
Figure FDA00032058481600000212
in the formula: rGThe output limit before and after the unit fault is considered, when RGWhen the value is 0, the unit is in a preventive control mode; otherwise, the unit is in a corrective control mode.
3. The method for calculating the regional power grid tie-line power transmission capability considering the N-1 safety constraint according to claim 2, wherein the concise expressions of the ground state operation constraint and the N-1 safety constraint are respectively:
Figure FDA0003205848160000031
Figure FDA0003205848160000032
in the formula: the constraint (10) characterizes ground state constraints (1) - (4), wherein
Figure FDA0003205848160000033
And GNIs a constant matrix; the constraint (11) characterizes an N-1 security constraint, wherein
Figure FDA0003205848160000034
And GNIs a constant matrix.
4. The method for calculating the regional power grid tie line power transmission capability considering the N-1 safety constraint according to claim 3, wherein: step S2 specifically includes the following steps:
step S21: algorithm initialization, respectively obtaining according to equations (10) and (11)
Figure FDA0003205848160000035
Constructing an initialized tie line power feasible domain by using the maximum value and the minimum value on each dimension;
solving the problem of the minimum value of the ith dimension:
Figure FDA0003205848160000036
s.t.
Figure FDA0003205848160000037
Figure FDA0003205848160000038
in the formula:
Figure FDA0003205848160000039
is composed of
Figure FDA00032058481600000310
The ith element in (1);
solving the problem of the maximum value of the ith dimension:
Figure FDA00032058481600000311
s.t.
constraints (13) - (14) (16)
Obtained by the following formulae (12) to (14) and (15) to (16)In connection with
Figure FDA0003205848160000041
The optimal solution is used as a vertex V, and a feasible region omega is constructedc；
Step S22: searching a new vertex: by shifting out the feasible region omegacSearching for new vertices for each bounding plane; let the inequality expression of the kth bounding plane be
Figure FDA0003205848160000042
New vertices are obtained by solving the following linear programming problem:
Figure FDA0003205848160000043
s.t.
constraints (13) - (14) (18)
Figure FDA0003205848160000044
In the formula: vipIs a feasible region omegacAny point in (1);
the optimal solution of the linear programming is the peak of the constraint; therefore, the optimal solution in equations (17) - (19) is the new vertex, and after all edges have been translated, all vertices are recorded as Vnew；
Step S23: checking an algorithm termination condition: calculating and considering the difference Δ V between the feasible region volumes before and after the new vertex in step S22; when the variation of the delta V is smaller, the variation of the feasible region before and after the new vertex is added is smaller, therefore, when the delta V is smaller than a given threshold value, the algorithm is terminated, and the feasible region omega under the c line fault is recordedcIs composed of
Figure FDA0003205848160000045
Otherwise, constructing a feasible domain omega according to the new vertexcThen returns to step S22;
feasible domain when all fault conditions are obtainedΩc，
Figure FDA0003205848160000046
The feasible domain omega, accounting for the N-1 security constraints, may be characterized as the feasible domain omega in all failure casescI.e. Ω ═ nc∈CΩc。
5. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor when executing the program implements the steps of the method of calculating a regional grid tie power transfer capability taking into account N-1 safety constraints as claimed in any of claims 1-4.
6. A non-transitory computer readable storage medium having stored thereon a computer program, which when executed by a processor, performs the steps of the regional grid tie power transfer capability calculation method considering N-1 safety constraints as claimed in any of claims 1-4.
CN202110916768.3A 2021-08-11 2021-08-11 N-1 safety constraint considered regional power grid tie line power transmission capability calculation method Active CN113659579B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110916768.3A CN113659579B (en) 2021-08-11 2021-08-11 N-1 safety constraint considered regional power grid tie line power transmission capability calculation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110916768.3A CN113659579B (en) 2021-08-11 2021-08-11 N-1 safety constraint considered regional power grid tie line power transmission capability calculation method

Publications (2)

Publication Number Publication Date
CN113659579A true CN113659579A (en) 2021-11-16
CN113659579B CN113659579B (en) 2022-10-04

Family

ID=78479459

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110916768.3A Active CN113659579B (en) 2021-08-11 2021-08-11 N-1 safety constraint considered regional power grid tie line power transmission capability calculation method

Country Status (1)

Country Link
CN (1) CN113659579B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103345713A (en) * 2013-06-24 2013-10-09 国家电网公司 Method for designing super-large scale power network synchronization security correction system
CN104868471A (en) * 2015-06-15 2015-08-26 国家电网公司 Static security aid decision making method for provincial power grid
WO2017028631A1 (en) * 2015-08-19 2017-02-23 中国电力科学研究院 Multi-fault coordinated integrative decision-making assistance method for static security and storage medium
CN108808738A (en) * 2018-05-29 2018-11-13 国电南瑞科技股份有限公司 A kind of power grid security Corrective control method considering constraint priority
CN109327025A (en) * 2018-08-30 2019-02-12 国家电网公司 Consider the power grid N-1 safety economy method for optimizing scheduling of transmission operation elastic space

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103345713A (en) * 2013-06-24 2013-10-09 国家电网公司 Method for designing super-large scale power network synchronization security correction system
CN104868471A (en) * 2015-06-15 2015-08-26 国家电网公司 Static security aid decision making method for provincial power grid
WO2017028631A1 (en) * 2015-08-19 2017-02-23 中国电力科学研究院 Multi-fault coordinated integrative decision-making assistance method for static security and storage medium
CN108808738A (en) * 2018-05-29 2018-11-13 国电南瑞科技股份有限公司 A kind of power grid security Corrective control method considering constraint priority
CN109327025A (en) * 2018-08-30 2019-02-12 国家电网公司 Consider the power grid N-1 safety economy method for optimizing scheduling of transmission operation elastic space

Also Published As

Publication number Publication date
CN113659579B (en) 2022-10-04

Similar Documents

Publication Publication Date Title
Baker Learning warm-start points for AC optimal power flow
CN108683192B (en) Method, system, equipment and storage medium for clearing electric power spot market
CN109190951A (en) A kind of electricity market goes out clearing method, goes out clear device and clear equipment out
CN108054789A (en) A kind of embedded idle and voltage security constraint economic dispatch method
CN108054757A (en) A kind of embedded idle and voltage N-1 Close loop security check methods
CN108683155B (en) A kind of converter valve thyristor and capacitance-resistance parameter optimization method and device
CN112018775A (en) Network strengthening method for distribution network of gas-electricity combined system considering natural disasters
CN117498433A (en) Transient stability power limit quantization method for hybrid parallel system
Mousavizadeh et al. A new approach for load flow calculation in AC/DC distribution networks considering the control strategies of different converters
Roos et al. Stability analysis of microgrid islanding transients based on interconnected dissipative subsystems
CN112736896B (en) Three-stage initialization method and system suitable for full-electromagnetic transient simulation
Akhavein et al. Review of reduction techniques in the determination of composite system adequacy equivalents
CN113659579B (en) N-1 safety constraint considered regional power grid tie line power transmission capability calculation method
CN108306299B (en) Asynchronous iterative distributed three-phase load flow calculation method and system for power distribution network
Roos et al. Direct-quadrature sequence models for energy-function based transient stability analysis of unbalanced inverter-based microgrids
CN109787211A (en) A kind of Multi-port direct-current distribution network tidal current computing method and system based on VSC
CN105226644B (en) Belt restraining equivalence method based on active volume uniformity
CN110417013B (en) Power system stabilizer parameter setting method and readable storage medium
Huang et al. Enabling secure peer-to-peer energy transactions through dynamic watermarking in electric distribution grids: Defending the distribution system against sophisticated cyberattacks with a provable guarantee
CN111291939A (en) Method and system for planning links
CN111614098A (en) Method and system for determining input capacity of alternating current filter of hybrid cascade direct current converter station
CN107634534A (en) Flexible direct-current transmission converter major loop electric parameter acquisition methods and device
CN113297861A (en) Experimental method and system for evaluating new energy ultimate access capability in synchronous power grid
CN113659580B (en) Method and system for determining feasible region of regional electric quantity transmission
CN111339632A (en) Method and system for isolating topological change of electromechanical-electromagnetic hybrid simulation network

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