CN111092427A - Path optimization method for parallel recovery of power system - Google Patents
Path optimization method for parallel recovery of power system Download PDFInfo
- Publication number
- CN111092427A CN111092427A CN201911261330.5A CN201911261330A CN111092427A CN 111092427 A CN111092427 A CN 111092427A CN 201911261330 A CN201911261330 A CN 201911261330A CN 111092427 A CN111092427 A CN 111092427A
- Authority
- CN
- China
- Prior art keywords
- unit
- time
- power
- recovery
- formula
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
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
Landscapes
- Engineering & Computer Science (AREA)
- Power Engineering (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The invention discloses a path optimization method for parallel recovery of an electric power system, which constructs active power constraint according to rated power, climbing rate, starting power, starting time and 0-1 variable of each unit; establishing a recovery time constraint of the power transmission line according to a system topological structure; establishing cold and hot start time limit constraint of the non-black start unit according to the maximum hot start time limit and the minimum cold start time limit; establishing a recovery target function according to the maximum target of the generated energy in the system recovery process; and solving a recovery path optimization model formed by the constraint conditions and the objective function, and determining the starting time and the recovery path of each unit. The invention greatly reduces the calculated amount, increases the application range of the model and better meets the requirement of the actual situation on the recovery scheme.
Description
Technical Field
The invention belongs to the technical field of power grids, and particularly relates to a path optimization method for parallel recovery of a power system.
Background
With the development of power systems, the connection between regional power grids is becoming more and more intimate, and once a blackout accident caused by equipment failure, misoperation and severe weather occurs, huge economic loss and severe social influence can be caused. The recovery path optimization is important work in the recovery process of the power system after a blackout, and has important influence on improving the recovery efficiency of the power system and reducing economic and social losses. The existing restoration path optimization method mainly comprises two types: firstly, a nonlinear recovery path optimization model is established, and a meta-heuristic intelligent algorithm is used for solving, so that the solving efficiency is low, and the local optimal solution is easy to converge; secondly, the system topology structure is added into the recovery path optimization model in a connectivity constraint verification mode, the influence of the system topology structure on the recovery path optimization is weakened, and the optimality of the recovery scheme is reduced.
The method linearizes the topological structure of the system by utilizing the recovery time of the power transmission line, and establishes a recovery path optimization hybrid integer programming linear model which can simultaneously take the unit attribute and the topological structure of the power system into account.
Disclosure of Invention
The invention aims to provide a path optimization method for parallel recovery of a power system.
The technical solution for realizing the purpose of the invention is as follows: a path optimization method for parallel recovery of a power system comprises the following steps:
and 5, solving a recovery path optimization model formed by the constraint conditions and the objective function, and determining the starting time and the recovery path of each unit.
Compared with the prior art, the invention has the following remarkable advantages: 1) the active power constraint is established by utilizing the rated power, the climbing rate, the starting power, the starting time and the 0-1 variable of each unit, so that the calculated amount is greatly reduced, the optimized model can be used for a larger-scale system, and the application range of the model is enlarged; 2) the influence of a system topological structure on the recovery path optimization is considered, and the scheduling requirement can be better adapted; 3) the maximum hot start time limit and the minimum cold start time limit of the unit can be considered at the same time, and the actual scheduling requirement is better met.
Drawings
Fig. 1 is a modeling flow chart of a parallel restoration path optimization model of an electric power system based on mixed integer programming.
Fig. 2 is a topology diagram of an IEEE standard 10 machine 39 node system according to the present invention.
FIG. 3 is a schematic diagram of a recovery area according to the present invention.
Detailed Description
The invention is further illustrated by the following examples in conjunction with the accompanying drawings.
The invention discloses a path optimization method for parallel recovery of a power system, which comprises the following steps:
in the recovery process after the power system blackout, the active power of the system should be always non-negative, that is:
in the formula I, a unit set;
i-unit serial number;
pi(t) -the output power of the crew i at time t, which is a linear expression function of the crew properties:
wherein t is the current time;
xi-set i start-up time;
ci-the power required for starting the unit i;
ti cthe time required by the unit i from starting to grid connection is shortened;
ri-the set i ramp rate;
ti rthe time required for the unit i to climb from 0 to rated power;
pi-rated power of unit i;
pi(t) -the output power of the unit i at time t;
t is the total time required by system recovery;
in order to linearly represent the active power constraint, p needs to be expressedi(t) linear expression function is rewritten asAs follows:
in the formulaA variable of 0 to 1, which indicates whether the unit i is between 0 and x at the time tiA stage;a variable 0-1 representing whether the unit i is at x at time ti~xi+ti cA stage;a variable 0-1 representing whether the unit i is at x at time ti+ti c~xi+ti c+ti rA stage;a variable 0-1 representing whether the unit i is at x at time ti+ti c+ti r-T phase. When in useTime, the unit i is between 0 and x at time tiA stage; the same is true.
Substituting equation (3) for equation (1) may rewrite the active power constraint to the form:
through the analysis of the linear expression function of the unit attribute in the formula (2), the sum of the active power of the system is reduced only when each non-black start unit is started, so that the sum of the active power of the system is not negative only when each non-black start unit is started, and the sum of the active power of the system in the whole recovery process can be ensured to be not negative. Therefore, the active power constraint equation (4) can be further modified to the following form:
in the formulaA variable of-0 to 1, which indicates whether the unit i is between 0 and x when the unit m is startediA stage;a variable of 0 to 1 representing whether the unit i is at x or not when the unit m is startedi~xi+ti cA stage;a variable of 0 to 1 representing whether the unit i is at x or not when the unit m is startedi+ti c~xi+ti c+ti rA stage;a variable of 0 to 1 representing whether the unit i is at x or not when the unit m is startedi+ti c+ti r-T phase. When in useWhen the time, the unit i is between 0 and x when the unit m is startediA stage;the same is true.
The form of multiplication of variables appears in the active power constraint formula (5) —Now, in the formula (5) by using the formula (6) -formula (9)And carrying out linearization treatment.
Will assist variable wimAnd vimAfter equation (4) is substituted, the linear expression of the active power constraint is rewritten as:
according to the linear expression function formula (2) of the unit attributes, the output of the unit i is sequentially in 1 of 4 stages, namely:
for determining the state of the unit i when the unit m is started, a variable of 0-1 is setThe following constraints are constructed:
in the formula xm-start-up time of unit m;
xi-start-up time of unit i;
ε -a sufficiently small number close to 0, e.g. 10-4;
Maximum of M-big M algorithm, e.g. 107;
firstly, partitioning a power failure system according to the number of black start units under the condition that the capacity-load basic balance of a subsystem unit is met, and ensuring that only one black start unit exists in each partition; then, each transmission line in each subarea is set according to the scheduling requirement or the actual situationThe recovery time of the way; and finally, calculating the recovery time T between the non-black start unit i and the black start unit in each partition by using a Floyd algorithmiAnd then the power transmission line recovery time constraint is as follows:
xi≥Ti(16)
in the formula hi-is the maximum warm start time limit for unit i;
ci-is the minimum cold start time limit for unit i;
a variable of-0 to 1In time, the unit i is started before the maximum hot start time limit; when in useWhen, the constraint fails;
a variable of-0 to 1Then, the unit i is started after the minimum cold start time limit; when in useWhen, the constraint fails;
and 4, establishing a recovery objective function according to the maximum target of the generated energy in the system recovery process.
The final aim of the recovery of the power system is to finish the starting and load recovery of all non-black start units of the system as soon as possible and reduce load loss. In order to improve the system recovery efficiency and reduce the load loss, the invention takes the maximum generating capacity of the unit in the system recovery process as a target function:
in the formula EsysThe total power generation of all the units in the system recovery process;
Eigen-the total force output value of the unit i in the recovery process;
Eicrankand the total power consumption of the unit i in the starting process.
In order to build a unit restoration path model based on mixed integer linear programming, the objective function described in the formula (20) is required to be simplified.
Because the total power generation amount of the system in the recovery process is equal to the integral of the output values of all the units to the recovery time of the system:
in the formula Eigen-the total force output value of the unit i in the recovery process;
pi(t) -the output power of the unit i at time t;
t is the current time;
pi-rated power of unit i;
ti rthe time required for the unit i to climb from 0 to rated power;
t is the total time required by system recovery;
xi-the unit i is openedThe moving time;
ti cthe time required by the unit i from starting to grid connection is shortened;
the total power consumption of the system in the recovery process is equal to the integral of the starting power of all the units to the recovery time of the system:
in the formula EicrankAnd the total power consumption of the unit i in the starting process.
ci-the power required for starting the unit i;
ti cthe time required by the unit i from starting to grid connection is shortened;
substituting formulae (21) and (22) for formula (20) yields:
in the formula EsysThe total power generation of all the units in the system recovery process;
Eigen-the total force output value of the unit i in the recovery process;
Eicrankand the total power consumption of the unit i in the starting process.
pi-rated power of unit i;
ti rthe time required for the unit i to climb from 0 to rated power;
t is the total time required by system recovery;
xi-set i start-up time;
ti cthe time required by the unit i from starting to grid connection is shortened;
ci-the power required for starting the unit i;
ti cthe time required by the unit i from starting to grid connection is shortened;
in the formula EsysThe total power generation of all the units in the system recovery process;
pi-rated power of unit i;
xi-set i start-up time;
and 5, solving a restoration path optimization model formed by the constraint conditions and the objective function by using CPLEX.
Constraint conditions are as follows: formula (6) -formula (19);
an objective function: formula (24);
firstly, a recovery path optimization model based on mixed integer linear programming is established according to the formula (6) -formula (19), and p in the formula (9) is respectively set according to the rated power, the climbing rate, the starting power and the starting time of each unit in the power failure systemi、ri、ci、ti c(ii) a H in the formula (16) is respectively set according to the maximum hot start time limit and the minimum cold start time limit of each unitiAnd c in formula (17)i。
Then, setting the recovery time of each section of power transmission line according to the scheduling requirement or the actual condition, and establishing a matrix representing the communication relation of each node of the system according to the system structure and the Floyd algorithm requirement:
① if node i is directly connected to node j, then (i, j) and (j, i) in the matrix are set as the recovery time of the line;
② if node i is not directly connected to node j, then (i, j) and (j, i) in the matrix are set to ∞.
Calling Floyd algorithm to obtain the shortest time between the black start unit 30 and all the non-black start units i, and the shortest time is T in the formula (16)iThe value is assigned to the value to be assigned,
and finally, calling and utilizing CPLEX to solve the recovery path optimization model, and obtaining the starting time and the recovery path of each unit.
Examples
In order to verify the effectiveness of the scheme of the invention, the following simulation experiment is performed by taking an IEEE10 machine 39 node system as an example. The power grid topology is shown in fig. 2, wherein the number 30 unit is a hydroelectric generating unit and has self-starting capability, and the rest are thermal generating units and do not have self-starting capability. All unit attribute data are shown in table 1.
TABLE 1 Unit Attribute
A restoration path optimization model based on mixed integer programming is established in MATLAB according to equations (6) -19.
The values of the relevant parameters in the equations (10), (17), (18) are assigned according to table 1:
① substituting rated power, ramp rate, start power and start time for p in formula (10)i、ri、ci、ti c;
② substituting the maximum warm boot time limit for h in equation (17)iC in formula (18) is substituted for minimum cold start time limiti。
Assuming that the recovery time of each section of power transmission line is 4 minutes, establishing a matrix representing the communication relation of each node of the system according to the system structure and the Floyd algorithm requirement:
① if node i is directly connected to node j, then (i, j) and (j, i) in the matrix are set to 4;
② if node i is not directly connected to node j, then (i, j) and (j, i) in the matrix are set to ∞.
Calling Floyd algorithm to obtain the shortest time between the black start unit 30 and all the non-black start units i, and the shortest time is T in the formula (16)iAnd (5) assigning values, wherein specific numerical values are shown in a table 2. According to scheduling requirements and actual conditions, the recovery time of each line can be flexibly set, if the line is in permanent failure or cannot be recovered due to other reasons, the recovery time can be set to be infinity in a node communication matrix, and then the Floyd algorithm is utilized to recalculate the unit recoveryTime constraints are sufficient.
TABLE 2 Transmission line recovery time constraints
And solving the recovery path optimization model by using a CPLEX solver to obtain the recovery time of each unit, wherein the recovery scheme is shown in a table 3.
TABLE 3 recovery scheme
Fig. 3 is a schematic diagram of a system recovered area, in which a solid line part represents a system recovered area at the current time, and a parallel recovery path of the power system can be obtained by the method of the present invention, which takes into account both the topology of the system and the properties of the unit.
Claims (6)
1. A path optimization method for parallel recovery of a power system is characterized by comprising the following steps:
step 1, constructing active power constraint according to rated power, climbing rate, starting power, starting time and 0-1 variable of each unit;
step 2, establishing a power transmission line recovery time constraint according to a system topological structure;
step 3, establishing cold and hot start time limit constraint of the non-black start unit according to the maximum hot start time limit and the minimum cold start time limit;
step 4, establishing a recovery target function by taking the maximum generated energy in the system recovery process as a target;
and 5, solving a recovery path optimization model formed by the constraint conditions and the objective function, and determining the starting time and the recovery path of each unit.
2. The method for optimizing paths for parallel restoration of an electric power system according to claim 1, wherein in step 1, the active power constraint specifically includes:
in the formula I, a unit set;
i-unit serial number;
pi(t) -the output power of the crew i at time t, which is a linear expression function of the crew properties:
wherein t is the current time;
xi-set i start-up time;
ci-the power required for starting the unit i;
ti cthe time required by the unit i from starting to grid connection is shortened;
ri-the set i ramp rate;
ti rthe time required for the unit i to climb from 0 to rated power;
pi-rated power of unit i;
pi(t) -the output power of the unit i at time t;
t is the total time required by system recovery;
in order to linearly represent the active power constraint, p needs to be expressediThe linear expression function of (t) is rewritten as follows:
in the formulaA variable of 0 to 1, which indicates whether the unit i is between 0 and x at the time tiA stage;a variable 0-1 representing whether the unit i is at x at time ti~xi+ti cA stage;a variable 0-1 representing whether the unit i is at x at time ti+ti c~xi+ti c+ti rA stage;a variable 0-1 representing whether the unit i is at x at time ti+ti c+ti r-T phase. When in useTime, the unit i is between 0 and x at time tiA stage; the same process is carried out;
substituting equation (3) for equation (1), the active power constraint is rewritten as follows:
through the analysis of the linear expression function of the unit attribute of the formula (2), the sum of the active power of the system is only reduced when each non-black start unit is started, so that the sum of the active power of the system is not negative only when each non-black start unit is started, that is, the sum of the active power of the system in the whole recovery process is not negative, therefore, the active power constraint formula (4) can be further rewritten into the following form:
in the formulaA variable of-0 to 1, which indicates whether the unit i is between 0 and x when the unit m is startediA stage;a variable of 0 to 1 representing whether the unit i is at x or not when the unit m is startedi~xi+ti cA stage;a variable of 0 to 1 representing whether the unit i is at x or not when the unit m is startedi+ti c~xi+ti c+ti rA stage;a variable of 0 to 1 representing whether the unit i is at x or not when the unit m is startedi+ti c+ti r-T phase. When in useWhen the time, the unit i is between 0 and x when the unit m is startediA stage;the same is true.
The form of multiplication of variables appears in the active power constraint formula (5) —Now, in the formula (5) by using the formula (6) -formula (9)Carrying out linearization treatment;
Will assist variable wimAnd vimAfter equation (4) is substituted, the linear expression of the active power constraint is rewritten as:
according to the linear expression function formula (2) of the unit attributes, the output of the unit i is sequentially in 1 of 4 stages, namely:
for determining the state of the unit i when the unit m is started, a variable of 0-1 is setThe following constraints are constructed:
in the formula xm-start-up time of unit m;
xi-start-up time of unit i;
ε -a sufficiently small number close to 0;
m-maximum of the big M algorithm.
3. The method for optimizing the paths for the parallel restoration of the power system according to claim 1, wherein in the step 2, the specific method for establishing the power transmission line restoration time constraint is as follows:
firstly, partitioning a power failure system according to the number of black start units under the condition that the capacity-load basic balance of a subsystem unit is met, and ensuring that only one black start unit exists in each partition; then, setting the recovery time of each transmission line in each partition according to the scheduling requirement or the actual condition; and finally, calculating the recovery time T between the non-black start unit i and the black start unit in each partition by using a Floyd algorithmiAnd then the power transmission line recovery time constraint is as follows:
xi≥Ti(16)
in the formula xi-set i start time.
4. The method for optimizing the paths for the parallel recovery of the power system according to claim 1, wherein in step 3, the cold and hot start time limit of the non-black start unit is constrained as follows:
in the formula xi-set i start-up time;
hi-is the maximum warm start time limit for unit i;
ci-is the minimum cold start time limit for unit i;
a variable of-0 to 1In time, the unit i is started before the maximum hot start time limit; when in useWhen, the constraint fails;
a variable of-0 to 1Then, the unit i is started after the minimum cold start time limit; when in useWhen, the constraint fails;
m-maximum of the big M algorithm.
5. The method for optimizing paths for parallel restoration of a power system according to claim 1, wherein in step 4, the objective function is specifically:
in the formula EsysThe total power generation of all the units in the system recovery process;
Eigen-the total force output value of the unit i in the recovery process;
Eicrankand the total power consumption of the unit i in the starting process.
In order to establish a unit recovery path model based on mixed integer linear programming, the objective function described by the formula (20) is required to be simplified;
because the total power generation amount of the system in the recovery process is equal to the integral of the output values of all the units to the recovery time of the system:
in the formula Eigen-the total force output value of the unit i in the recovery process;
pi(t) -the output power of the unit i at time t;
t is the current time;
pi-rated power of unit i;
ti rthe time required for the unit i to climb from 0 to rated power;
t is the total time required by system recovery;
xi-set i start-up time;
ti cthe time required by the unit i from starting to grid connection is shortened;
the total power consumption of the system in the recovery process is equal to the integral of the starting power of all the units to the recovery time of the system:
in the formula EicrankAnd the total power consumption of the unit i in the starting process.
ci-the power required for starting the unit i;
ti cthe time required by the unit i from starting to grid connection is shortened;
substituting formulae (21) and (22) for formula (20) yields:
in the formula EsysThe total power generation of all the units in the system recovery process;
Eigen-the total force output value of the unit i in the recovery process;
Eicrankand the total power consumption of the unit i in the starting process.
pi-rated power of unit i;
ti rthe time required for the unit i to climb from 0 to rated power;
t is the total time required by system recovery;
xi-set i start-up time;
ti cthe time required by the unit i from starting to grid connection is shortened;
ci-the power required for starting the unit i;
ti cthe time required by the unit i from starting to grid connection is shortened;
in the formula EsysThe total power generation of all the units in the system recovery process;
pi-rated power of unit i;
xi-set i start time.
6. The method for optimizing paths for parallel restoration of a power system according to claim 1, wherein in step 5, the restoration path optimization model is solved by CPLEX.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201911261330.5A CN111092427B (en) | 2019-12-10 | 2019-12-10 | Path optimization method for parallel recovery of power system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201911261330.5A CN111092427B (en) | 2019-12-10 | 2019-12-10 | Path optimization method for parallel recovery of power system |
Publications (2)
Publication Number | Publication Date |
---|---|
CN111092427A true CN111092427A (en) | 2020-05-01 |
CN111092427B CN111092427B (en) | 2022-09-27 |
Family
ID=70396262
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201911261330.5A Active CN111092427B (en) | 2019-12-10 | 2019-12-10 | Path optimization method for parallel recovery of power system |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN111092427B (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112884607A (en) * | 2021-03-11 | 2021-06-01 | 国网陕西省电力公司电力科学研究院 | Computing method and computing system for in-zone black start recovery network |
CN114583705A (en) * | 2022-03-29 | 2022-06-03 | 合肥工业大学 | Black-start power supply planning method considering power flow of power system |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103279620A (en) * | 2013-06-07 | 2013-09-04 | 山东大学 | Method for restoring sequence and path of unit and simultaneously performing optimization |
CN107862405A (en) * | 2017-10-27 | 2018-03-30 | 广东电网有限责任公司电力调度控制中心 | The power system rack reconstruction and optimization method of meter and microgrid as black starting-up power supply |
CN110334862A (en) * | 2019-06-30 | 2019-10-15 | 南京理工大学 | Consider the electric system partition zone optimizing algorithm of recovery time |
-
2019
- 2019-12-10 CN CN201911261330.5A patent/CN111092427B/en active Active
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103279620A (en) * | 2013-06-07 | 2013-09-04 | 山东大学 | Method for restoring sequence and path of unit and simultaneously performing optimization |
CN107862405A (en) * | 2017-10-27 | 2018-03-30 | 广东电网有限责任公司电力调度控制中心 | The power system rack reconstruction and optimization method of meter and microgrid as black starting-up power supply |
CN110334862A (en) * | 2019-06-30 | 2019-10-15 | 南京理工大学 | Consider the electric system partition zone optimizing algorithm of recovery time |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112884607A (en) * | 2021-03-11 | 2021-06-01 | 国网陕西省电力公司电力科学研究院 | Computing method and computing system for in-zone black start recovery network |
CN112884607B (en) * | 2021-03-11 | 2023-08-01 | 国网陕西省电力公司电力科学研究院 | Computing method and computing system for black start restoration network in zone |
CN114583705A (en) * | 2022-03-29 | 2022-06-03 | 合肥工业大学 | Black-start power supply planning method considering power flow of power system |
CN114583705B (en) * | 2022-03-29 | 2024-03-12 | 合肥工业大学 | Black-start power supply planning method considering power flow of power system |
Also Published As
Publication number | Publication date |
---|---|
CN111092427B (en) | 2022-09-27 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2019165701A1 (en) | Random robust coupling optimization scheduling method for alternating-current and direct-current hybrid micro-grids | |
KR102551927B1 (en) | Comprehensive control method and system that guarantees voltage stability in power recovery phase of multi-phase DC system | |
CN110598913B (en) | Optimization method and system for equipment capacity configuration of park comprehensive energy system | |
CN103474972B (en) | A kind of relaying protection on-line setting method | |
CN105529701B (en) | A kind of method for optimizing route of power up containing DC converter station based on artificial bee colony algorithm | |
CN104882906A (en) | Distributed micro-grid black-start control system and method based on photovoltaic and energy storage | |
CN111092427B (en) | Path optimization method for parallel recovery of power system | |
CN105896537A (en) | Power supply restoration method for power distribution network based on intelligent soft switch | |
CN111525688A (en) | Electric power Internet of things power distribution network system based on 5G network and interconnection method | |
CN107453383B (en) | Flexible direct current configuration method and device for power supply partition interconnection | |
CN108493998B (en) | Robust power transmission network planning method considering demand response and N-1 expected faults | |
CN108388688A (en) | A kind of active distribution network reliability estimation method | |
CN112688285A (en) | Fault isolation and load recovery method for optimized scheduling of operators in power distribution network | |
CN114648179A (en) | Power grid transmission line maintenance plan generation method, device, equipment and storage medium | |
CN107104463B (en) | Converter station considers idle active input amount optimization method during black starting-up | |
CN111680375B (en) | Load prediction method and system for distributed FA simulation system | |
CN105406517A (en) | Finite time average consistency algorithm-based economic dispatching method for power system | |
Pico et al. | Reachability analysis of power system frequency dynamics with new high-capacity HVAC and HVDC transmission lines | |
US20200233386A1 (en) | Method for calculating control parameters of heating supply power of heating network | |
CN110429591B (en) | Power transmission network utilization rate evaluation method based on power system time sequence coupling | |
CN104809340A (en) | Method for quickly calculating operating point of multi-end flexible direct-current power transmission system | |
CN107451743A (en) | A kind of active power distribution network islet operation method of consideration source lotus operation characteristic | |
CN104135028A (en) | Unit distribution method combining black-start optimization model and FCB (Fast Cut Back) working condition | |
CN111291939A (en) | Method and system for planning links | |
CN111030084A (en) | Load recovery optimization method considering unit state in system recovery process |
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 |