Virtual power plant two-layer optimization scheduling method considering security constraints

Through the two-layer optimization scheduling method, the electricity price and wind power output uncertainty of virtual power plants in uncertain environments is handled, which improves the scheduling capacity and robustness of virtual power plants, and solves the problem of degradation of virtual power plants.

CN118941009APending Publication Date: 2024-11-12HANGZHOU KAIDA ELECTRIC POWER CONSTR +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410969177.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Priority Date
2024-07-10
Filing Date
2024-07-18
Publication Date
2024-11-12

AI Technical Summary

Technical Problem

When virtual power plants participate in scheduling, they are affected by the uncertainty of electricity prices and output of renewable energy such as wind power, resulting in a decline in scheduling capacity.

Method used

Using two-layer optimization scheduling method, the upper-level economic scheduling model and the lower-level safety scheduling model are constructed, and the electricity price uncertainty and the robust optimization method are used to deal with wind power output uncertainty, combining Monte Carlo simulation and improving particle swarm optimization algorithm Generate the optimal scheduling scheme.

Benefits of technology

It improves the scheduling capability and robustness of virtual power plants, reduces computing complexity, and enhances economic benefits and safety constraint satisfaction in uncertain environments.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118941009A_ABST
    Figure CN118941009A_ABST
Patent Text Reader

Abstract

The invention relates to the technical field of virtual power plant scheduling, solves the technical problem of how to improve the schedulability of a virtual power plant in an uncertain environment, and particularly relates to a virtual power plant two-layer optimization scheduling method considering security constraints, which comprises the following steps: constructing a first objective function and a first constraint condition based on a power plant economic scheduling model; the power plant economic dispatching model is optimized based on the uncertainty of the electricity price of renewable energy power generation; constructing a second objective function and a second constraint condition based on the power plant safety scheduling model; and solving the upper-layer economic scheduling model and the lower-layer safe scheduling model to generate an optimal scheduling scheme of the virtual power plant. According to the method, a large-scale complex power dispatching planning problem is decomposed into two layers of dispatching sub-problems, namely upper-layer economic dispatching and lower-layer safe dispatching, so that the calculation complexity can be reduced while the economical efficiency and the reliability of a dispatching scheme are ensured, and the schedulability of a virtual power plant can be improved in an uncertain environment.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of virtual power plant scheduling, and in particular to a two-layer optimization scheduling method for virtual power plants taking safety constraints into account. Background Art

[0002] Distributed power generation has great randomness and volatility, which brings risks to the operation and control of the power grid. As a new type of integrated energy service provider, virtual power plant can effectively manage distributed power generation and grid-connected power generation. Its basic concept is to participate in grid dispatching and power market transactions as a controllable power generator by aggregating distributed energy such as distributed power sources, controllable loads and energy storage systems.

[0003] As the proportion of distributed power sources connected to the grid continues to increase, the randomness and intermittency of their output pose a threat to the safe and stable operation of the power system. Virtual power plants provide a new idea for effectively solving the problem of distributed power sources connected to the grid. Due to the uncertainty in the power generation and electricity prices of renewable energy such as wind power, virtual power plants are affected by the uncertainty in the electricity prices and output of wind power renewable energy when participating in scheduling, which seriously reduces the scheduling capacity of virtual power plants. Summary of the invention

[0004] In view of the shortcomings of the existing technology, the present invention provides a two-layer optimization scheduling method for virtual power plants taking into account safety constraints, which solves the technical problem of how to improve the dispatchability of virtual power plants in uncertain environments and can enhance the scheduling capacity of virtual power plants.

[0005] In order to solve the above technical problems, the present invention provides the following technical solutions: a two-layer optimization scheduling method of a virtual power plant taking into account security constraints, the method comprising the following processes:

[0006] Constructing a first objective function and a first constraint condition based on the power plant economic dispatch model to form an upper-level economic dispatch model for handling uncertainties in electricity prices and output;

[0007] Optimize the power plant economic dispatch model based on the uncertainty of electricity prices for renewable energy generation, including wind farms;

[0008] Constructing a second objective function and a second constraint condition based on the power plant safety dispatch model to form a lower-level safety dispatch model for adjusting the initial dispatch value according to the safety constraint;

[0009] The upper-level economic dispatch model and the lower-level safety dispatch model are solved to generate the optimal dispatch plan for the virtual power plant.

[0010] Furthermore, the first objective function is:

[0011]

[0012] in,

[0013]

[0014] In the above formula, T is the total number of time periods in the scheduling cycle; n s is the number of electricity price schemes in Monte Carlo simulation; π(s) corresponds to the probability of the sth group of electricity price schemes; R t is the profit function of period t; C t is the cost function of period t; H t , D t are the electric energy delivered according to the contract requirements and the electric energy delivered to the day-ahead market plan during period t, respectively, which are decision variables; h is the contract electricity price; is the electricity price in the t period in the sth group of schemes; B t is the amount of electricity purchased, that is, the purchase price is Count; n i is the number of generator sets in the virtual power plant; K t,i is the startup or shutdown cost of unit i; Boolean variable k t,i Indicates whether unit i is in action during period t, n j is the number of segments; p i is the fixed cost of unit i; is the slope of the jth section of unit i; is the power generation of the jth segment; g t,i is the power generation of unit i during period t, that is is the decision variable; is the environmental value of the mth pollutant produced by unit i; v mi is the penalty coefficient of the mth pollutant produced by unit i; n m is the total number of pollutants.

[0015] Furthermore, the first constraint condition for constructing the power plant economic dispatch model includes gas turbine constraints, pumped storage power station constraints, forward contract constraints and power balance constraints.

[0016] Furthermore, the gas turbine constraints are:

[0017] B workt,i ,k t,i ,B ont,i ,B offt,i ∈{0,1}

[0018] B ont,i +B offt,i =K t,i

[0019] k t,i =B workt,i -B workt-1,i

[0020] g i,min B workt,i ≤g t,i ≤g i,max B workt,i

[0021] The climbing constraint of the unit is:

[0022] -r i d ≤g t,i -g t-1,i ≤r i u

[0023] The minimum startup time constraint is:

[0024]

[0025] The minimum downtime constraint is:

[0026]

[0027] Among them, the Boolean variable B workt,i Indicates whether machine i is working during period t, if yes, set to 1, otherwise set to 0; Boolean variable B ont,i Indicates whether unit i is started during period t, if yes, set to 1, otherwise set to 0; B offt,i Indicates whether unit i is shut down during period t, if yes, set to 1, otherwise set to 0; g i,max , g i,min are the maximum and minimum power generation of unit i respectively; t oni,min ,t offi,min are the minimum on and off time of unit i respectively; r i u is the upward climbing rate of unit i, r i d is the downward climbing rate of unit i; t onx,i ,t offx′,i are the minimum on and off time of unit x respectively; N is a positive integer; B workt,x+y,i is the minimum startup time of unit i in the time period x+y; B worktx′+y′,i is the minimum downtime of unit i in the time period x′+y′;

[0028] The constraints of the pumped storage power station are:

[0029] E1=0

[0030] E t +E int ≤E max

[0031] E outt≤E t-1

[0032] E int ≤E c

[0033] E outt ≤E d

[0034] E t -E t-1 =E int -E out

[0035] Among them, E int and E outt are the amount of electricity stored and discharged during period t, respectively, and are decision variables; E max is the maximum storage capacity; E c E is the maximum storage capacity; d is the maximum discharge capacity; E t is the total energy of the battery;

[0036] The forward contract constraints are:

[0037] There may be a certain deviation between the actual power transmission of the virtual power plant and the contracted power. By introducing the deviation coefficient Z allowed by the contract, Z∈[0,1], we have:

[0038] (1-Z)H t ≤H t ′≤(1+Z)H t

[0039]

[0040] Among them, H t is the electric energy delivered according to the contract requirements during period t, which is the decision variable; H t ′ represents the actual amount of electricity delivered to meet the contract requirements, which is a decision variable; T is the total number of time periods in the dispatch cycle;

[0041] The power balance constraint is:

[0042] W t +g t +B t +E outt μ1=H t′ +D t +E int / μ2

[0043] Among them, W t is the predicted value of the fan output during period t; g t is the total power generation of the unit; μ1 and μ2 are power generation efficiency and energy storage efficiency respectively; B tis the planned electricity purchase amount submitted to the balancing market by the virtual power plant under the economic dispatch model during period t; D t It is the electric energy planned to be delivered to the day-ahead market during period t.

[0044] Furthermore, the optimization of the power plant economic dispatch model includes constructing a wind turbine model and establishing a feasible solution of the wind turbine model to obtain a wind turbine output constraint, and adding the wind turbine output constraint to the first constraint condition, specifically:

[0045] The fan model is:

[0046]

[0047] in, is the uncertain form of fan output; t is the predicted value of fan output; η t is the uncertainty interval coefficient; ρ t is the empirical error coefficient;

[0048] Construct feasible solutions, including:

[0049] According to the constraints of the fan model, the optimization modifications are as follows:

[0050]

[0051] make:

[0052]

[0053] It can become:

[0054]

[0055] Substituting the fan model into the above formula, the fan output constraint is:

[0056] -w t -η t ρ t w t ≤F t

[0057] Among them, E int and E outt are the amount of electricity stored and discharged during period t, respectively, and are decision variables; H t ′ represents the actual amount of electricity delivered to meet the contract requirements and is a decision variable.

[0058] Furthermore, the second objective function is:

[0059]

[0060] Where T is the total number of time periods in the scheduling cycle; g't,i is the decision variable, which is the optimal output solution of gas turbine i under the safe scheduling model in period t; E' int is the decision variable, which is the optimal solution of energy storage obtained under the safe dispatch model of the pumped storage power station in period t; E' outt is the decision variable, which is the optimal solution for power generation of the pumped storage power station under the safe dispatch model in period t; B t ' is the decision variable, which is the revised amount of electricity purchased by the virtual power plant submitted to the balancing market under the security dispatch model in period t; g t,i is the power generation of unit i during period t; E int and E outt are the amount of electricity stored and discharged during period t, respectively, and are decision variables; B t It is the planned electricity purchase amount submitted to the balancing market by the virtual power plant under the economic dispatch model during period t.

[0061] Furthermore, the second constraint condition includes power flow constraint, apparent power constraint of the line, capacity constraint of the connection point between the distribution network and the main grid, and node voltage constraint, specifically:

[0062] The power flow constraint is:

[0063]

[0064] Among them, U i,t and U j,t are the voltage amplitudes of nodes i and j in period t respectively; θ i,t and θ j,t are the voltage phase angles of node i and node j during period t; p d,i,t is the injected active power of node i in period t; p g,i,t is the total active power generated by DG at node i during period t; Q g,i,t is the total reactive power generated by DG at node i during period t; Q d,i,t is the reactive power consumed by node i during period t; Y ij is the amplitude of the node admittance matrix element; δ j,t and δ i,t are the phase angles of the line admittance between node i and node j in period t; ij is the phase angle of the line admittance between node i and node j;

[0065] The apparent power constraint of the line is:

[0066]

[0067] Among them, S ij,t is the apparent power between node i and node j during period t; is the line capacity between node i and node j; Sb is the collection of all branches in the distribution network;

[0068] The capacity constraint of the connection point between the distribution network and the main grid is:

[0069]

[0070] Among them, S GSP,t , They are the apparent power exchanged between the distribution network and the main grid at the point of public connection and its upper limit;

[0071] Node Voltage Constraints

[0072]

[0073] Among them, U i,t is the voltage amplitude of node i in the distribution network during period t; are the minimum and maximum voltage values ​​allowed at node i, respectively.

[0074] By means of the above technical solution, the present invention provides a two-layer optimization scheduling method for a virtual power plant taking into account safety constraints, which has at least the following beneficial effects:

[0075] 1. The present invention decomposes a large-scale and complex power scheduling planning problem into two scheduling sub-problems: upper-level economic scheduling and lower-level safety scheduling. It can reduce the complexity of calculation while ensuring the economy and reliability of the scheduling scheme, and can improve the dispatchability of virtual power plants in uncertain environments.

[0076] 2. The present invention can improve the economic benefits of economic dispatch and enhance the robustness of the dispatch scheme by using a stochastic programming method to deal with the uncertainty of electricity prices and a robust optimization method to deal with the uncertainty of wind power output in the upper economic dispatch model of the virtual power plant.

[0077] 3. In the lower-level safety scheduling model of the virtual power plant proposed in the present invention, the safety constraint will reduce the initial scheduling value to meet the requirements of the safety constraint. The stricter the safety constraint, the greater the reduction in the initial scheduling value. BRIEF DESCRIPTION OF THE DRAWINGS

[0078] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0079] Figure 1 A flowchart for solving the two-layer optimization scheduling of the virtual power plant of the present invention;

[0080] Figure 2 A schematic diagram of the virtual power plant optimization market dispatching scheme of the present invention;

[0081] Figure 3 This is a schematic diagram of the DG scheduling scheme for optimizing the virtual power plant of the present invention;

[0082] Figure 4 is a power curve diagram of the gas turbine 1 of the present invention;

[0083] Figure 5 is a power curve diagram of the gas turbine 2 of the present invention;

[0084] Figure 6 is a power curve diagram of the gas turbine 3 of the present invention;

[0085] Figure 7 It is a power curve diagram of the pumped storage power station of the present invention;

[0086] Figure 8 The power curve diagram of the balanced market power purchase of the present invention;

[0087] Fig. 9 is a node voltage curve diagram of the third period of the present invention;

[0088] Fig.10 It is a node voltage curve diagram of the 9th period of the present invention. DETAILED DESCRIPTION

[0089] In order to make the above-mentioned purposes, features and advantages of the present invention more obvious and easy to understand, the present invention is further described in detail below with reference to the accompanying drawings and specific implementation methods, so that the implementation process of how the present application uses technical means to solve technical problems and achieve technical effects can be fully understood and implemented accordingly.

[0090] In order to solve the problem that the uncertainty of wind power and other renewable energy generation and electricity prices will seriously affect the dispatchability of virtual power plants, please refer to Figure 1-Figure 10 This embodiment proposes a two-layer optimization scheduling method for virtual power plants taking into account safety constraints. By decomposing a large-scale and complex power scheduling planning problem into two scheduling sub-problems: upper-layer economic scheduling and lower-layer safety scheduling, the complexity of calculation can be reduced while ensuring the economy and reliability of the scheduling scheme, and the dispatchability of virtual power plants can be improved in uncertain environments. The method includes the following steps:

[0091] S1. Construct the first objective function and the first constraint condition based on the power plant economic dispatch model to form an upper-level economic dispatch model for dealing with the uncertainty of electricity price and output; the economic dispatch model takes profit maximization as the objective function. Since the electricity price in the power market is characterized by uncertainty, the stochastic programming method is used to deal with the uncertainty of electricity price, that is, the Monte Carlo simulation method is used to generate n groups of electricity price plans and the expression of the power plant economic dispatch model is as follows:

[0092]

[0093] The first objective function is:

[0094]

[0095] in,

[0096]

[0097] In the above formula, T is the total number of time periods in the scheduling cycle; n s is the number of electricity price schemes in Monte Carlo simulation; π(s) corresponds to the probability of the sth group of electricity price schemes; R t is the profit function of period t; C t is the cost function of period t; H t , D t are the electric energy delivered according to the contract requirements and the electric energy delivered to the day-ahead market plan during period t, respectively, which are decision variables; h is the contract electricity price; is the electricity price in the t period in the sth group of schemes; B t is the amount of electricity purchased, that is, the purchase price is Count; n i is the number of generator sets in the virtual power plant; K t,i is the startup or shutdown cost of unit i; Boolean variable k t,i Indicates whether unit i is in action during period t, n j is the number of segments; p i is the fixed cost of unit i; is the slope of the jth section of unit i; is the power generation of the jth segment; g t,i is the power generation of unit i during period t, that is is the decision variable; is the environmental value of the mth pollutant produced by unit i; v mi is the penalty coefficient of the mth pollutant produced by unit i; n m is the total number of pollutants.

[0098] The first constraint condition of the power plant economic dispatch model is constructed, which includes gas turbine constraints, pumped storage power station constraints, forward contract constraints and power balance constraints.

[0099] The gas turbine constraints are:

[0100] B workt,i ,k t,i ,B ont,i ,B offt,i ∈{0,1}(2)

[0101] B ont,i +B offt,i =Kt,i (3)

[0102] k t,i =B workt,i -B workt-1,i (4)

[0103] g i,min B workt,i ≤g t,i ≤g i,max B workt,i (5)

[0104] -r i d ≤g t,i -g t-1,i ≤r i u (6)

[0105]

[0106] Among them, the Boolean variable B workt,i Indicates whether machine i is working during period t, if yes, set to 1, otherwise set to 0; Boolean variable B ont,i Indicates whether unit i is started during period t, if yes, set to 1, otherwise set to 0; B offt,i Indicates whether unit i is shut down during period t, if yes, set to 1, otherwise set to 0; g i,max , g i,min are the maximum and minimum power generation of unit i respectively; t oni,min ,t offi,min are the minimum on and off time of unit i respectively; Formula (6) is the ramp constraint of the unit, r i u is the upward climbing rate of unit i, r i d is the downward ramp rate of unit i; Formula (7) is the minimum startup time constraint; Formula (8) is the minimum shutdown time constraint; t onx,i ,t offx′,i are the minimum on and off time of unit x respectively; N is a positive integer; B workt,x+y,i is the minimum startup time of unit i in the time period x+y; B worktx′+y′,i is the minimum downtime of unit i in the time period x′+y′.

[0107] The constraints of the pumped storage power station are:

[0108] E1=0 (9)

[0109] E t +E int ≤E max (10)

[0110] Eoutt ≤E t-1 (11)

[0111] E int ≤E c (12)

[0112] E outt ≤E d (13)

[0113] E t -E t-1 =E int -E out (14)

[0114] Among them, E int and E outt are the amount of electricity stored and discharged during period t, respectively, and are decision variables; E max is the maximum storage capacity; E c E is the maximum storage capacity; d is the maximum discharge capacity; E t is the total energy of the battery.

[0115] The forward contract constraints are:

[0116] There may be a certain deviation between the actual power transmission of the virtual power plant and the contracted power. By introducing the deviation coefficient Z allowed by the contract, Z∈[0,1], we have:

[0117] (1-Z)H t ≤H t ′≤(1+Z)H t (15)

[0118]

[0119] Among them, H t is the electric energy delivered according to the contract requirements during period t, which is the decision variable; H t ′ represents the actual amount of electricity delivered to meet the contract requirements and is a decision variable; T is the total number of time periods in the scheduling cycle.

[0120] The power balance constraint is:

[0121] W t +g t +B t +E outt μ1=H t′ +D t +E int / μ2 (17)

[0122] Among them, W t is the predicted value of the fan output during period t; g tis the total power generation of the unit; μ1 and μ2 are power generation efficiency and energy storage efficiency respectively; B t is the planned electricity purchase amount submitted to the balancing market by the virtual power plant under the economic dispatch model during period t; D t It is the electric energy planned to be delivered to the day-ahead market during period t.

[0123] S2. Based on the uncertainty of the electricity price of renewable energy power generation, the economic dispatch model of the power plant is optimized. Renewable energy power generation includes wind farms, which includes constructing a wind turbine model and establishing a feasible solution of the wind turbine model to obtain the wind turbine output constraint, and adding the wind turbine output constraint to the first constraint condition, specifically:

[0124] The fan model is:

[0125]

[0126] in, is the uncertain form of fan output; t is the predicted value of fan output; η t is the uncertainty interval coefficient; ρ t is the empirical error coefficient.

[0127] Construct feasible solutions, including:

[0128] Formula (19) is optimized and modified according to the constraints of formula (18) as follows:

[0129]

[0130] make:

[0131]

[0132] Then formula (19) can be transformed into:

[0133]

[0134] Substituting equation (18) into equation (21), the wind turbine output constraint is obtained as:

[0135] -w t -η t ρ t w t ≤F t

[0136] Among them, E int and E outt are the amount of electricity stored and discharged during period t, respectively, and are decision variables; H t ′ represents the actual amount of electricity delivered to meet the contract requirements and is a decision variable.

[0137] S3. Construct a second objective function and a second constraint condition based on the power plant safety dispatch model to form a lower-level safety dispatch model for adjusting the initial dispatch value according to the safety constraint. In the power plant safety dispatch model, the virtual power plant takes the minimum deviation between the optimal solution of safety dispatch and the optimal solution of economic dispatch as the optimization goal. Therefore, the expression of the power plant safety dispatch model is as follows:

[0138]

[0139] Among them, the second objective function is:

[0140]

[0141] Where T is the total number of time periods in the scheduling cycle; g t ' ,i is the decision variable, which is the optimal output solution of gas turbine i under the safe scheduling model in period t; E i ' nt is the decision variable, which is the optimal solution of energy storage obtained under the safe dispatch model of the pumped storage power station in period t; E o ' utt is the decision variable, which is the optimal solution for power generation of the pumped storage power station under the safe dispatch model in period t; B t ' is the decision variable, which is the revised amount of electricity purchased by the virtual power plant submitted to the balancing market under the security dispatch model in period t; g t,i is the power generation of unit i during period t; E int and E outt are the amount of electricity stored and discharged during period t, respectively, and are decision variables; B t It is the planned electricity purchase amount submitted to the balancing market by the virtual power plant under the economic dispatch model during period t.

[0142] The second constraint condition includes power flow constraint, apparent power constraint of the line, capacity constraint of the connection point between the distribution network and the main grid, and node voltage constraint, which are as follows:

[0143] The power flow constraint is:

[0144]

[0145] Among them, U i,t and U j,t are the voltage amplitudes of nodes i and j in period t respectively; θ i,t and θ j,t are the voltage phase angles of node i and node j during period t; p d,i,t is the injected active power of node i in period t; p g,i,t is the total active power generated by DG at node i during period t; Q g,i,tis the total reactive power generated by DG at node i during period t; Q d,i,t is the reactive power consumed by node i during period t; Y ij is the amplitude of the node admittance matrix element; δ j,t and δ i,t are the phase angles of the line admittance between node i and node j in period t; ij is the phase angle of the line admittance between node i and node j.

[0146] The apparent power constraint of the line is:

[0147]

[0148] Among them, S ij,t is the apparent power between node i and node j during period t; is the line capacity between node i and node j; S b It is the collection of all branches in the distribution network.

[0149] The capacity constraint of the connection point between the distribution network and the main grid is:

[0150]

[0151] Among them, S GSP,t , They are the apparent power exchanged between the distribution network and the main grid at the public connection point and its upper limit.

[0152] Node Voltage Constraints

[0153]

[0154] Among them, U i,t is the voltage amplitude of node i in the distribution network during period t; are the minimum and maximum voltage values ​​allowed at node i, respectively.

[0155] S4. Solve the upper economic dispatch model and the lower safety dispatch model to generate the optimal dispatch plan of the virtual power plant; use the improved particle swarm optimization algorithm and CPLEX software to solve the above two models and obtain the optimal dispatch plan of the virtual power plant. For specific steps, please refer to Figure 1 .

[0156] This embodiment uses the IEEE33 node system to simulate and verify the above model and algorithm. The example analysis of a virtual power plant consisting of a wind farm, a pumped storage power station and a gas turbine verifies the feasibility and effectiveness of the proposed model, as follows:

[0157] The above economic dispatch model was solved by using IBM's optimization software CPLEX12.5 on a personal computer with a quad-core 3.30GHz CPU and 4GB memory, and the market dispatch scheme and DG dispatch scheme were obtained as follows: Figure 2 and Figure 3 As shown. Figure 2 It can be seen that during periods of low electricity prices, virtual power plants purchase electricity from the balancing market to save power generation costs; during periods of high electricity prices, virtual power plants do not purchase electricity from the balancing market, but instead provide as much power as possible to the day-ahead market. Figure 3 It can be seen that pumped-storage power stations pump water for storage when electricity prices are low, and generate electricity when electricity prices are high, thereby playing the role of peak shaving and valley filling.

[0158] The IEEE 33-node distribution network test system is calculated to obtain the modified virtual power plant optimization scheduling scheme as follows: Figure 4 , 5 , 6, 7, and 8. They respectively give the dispatch strategies for the output of three groups of gas turbines, the charging and discharging of pumped storage power stations, and the balancing market power purchase under the initial scheme (without safety constraints), scheme 1, and scheme 2.

[0159] Fig. 9 , 10 The voltages of the nodes in the distribution network in the 3rd and 9th periods under Scheme 1 and Scheme 2 are given respectively. It can be seen from the figure that the voltage constraints and other conditions of Scheme 2 are much stronger than those of Scheme 1, and the node voltage curves in the figure can meet the requirements of each scheme.

[0160] The following conclusions can be drawn from the figure:

[0161] 1. The upper-level economic dispatch model of the virtual power plant uses the stochastic programming method to deal with the uncertainty of electricity prices, and the robust optimization method to deal with the uncertainty of wind power output, which can improve the economic benefits of economic dispatch and enhance the robustness of the dispatch scheme;

[0162] 2. In the lower-level safety dispatch model of the virtual power plant, the safety constraint will reduce the initial dispatch value to meet the requirements of the safety constraint. The stricter the safety constraint, the greater the reduction in the initial dispatch value.

[0163] 3. Decomposing a large-scale and complex power scheduling planning problem into two scheduling sub-problems: upper-level economic scheduling and lower-level safety scheduling can reduce the complexity of calculation while ensuring the economy and reliability of the scheduling scheme.

[0164] This embodiment also provides a computer device, which includes a processor, a memory, a network interface, an input device and a display screen connected through a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory includes a storage medium and an internal memory. The storage medium can be a non-volatile storage medium or a volatile storage medium. The storage medium stores an operating system and can also store computer-readable instructions. When the computer-readable instructions are executed by the processor, the processor can implement a two-layer optimization scheduling method for a virtual power plant. The internal memory provides an environment for the operation of the operating system and computer-readable instructions in the storage medium. The internal memory can also store computer-readable instructions. When the computer-readable instructions are executed by the processor, the processor can execute the two-layer optimization scheduling method for a virtual power plant. The network interface of the computer device is used to communicate with an external server through a network connection. The display screen of the computer device can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer device can be a touch layer covered on the display screen, or a key, trackball or touchpad set on the housing of the computer device, or an external keyboard, touchpad or mouse.

[0165] Those skilled in the art can understand that all or part of the steps in the above-mentioned embodiment method can be completed by instructing the relevant hardware through a program, so the present application can take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present application can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program codes.

[0166] The above implementation methods have been described in detail. Specific examples are used herein to illustrate the principles and implementation methods of the present invention. The description of the above embodiments is only used to help understand the method of the present invention and its core idea. At the same time, for those skilled in the art, according to the idea of ​​the present invention, there will be changes in the specific implementation methods and application scope. In summary, the content of this specification should not be understood as a limitation on the present invention.

Claims

1. A two-layer optimization scheduling method for virtual power plants taking into account safety constraints, characterized in that: The Method The process includes: Constructing a first objective function and a first constraint condition based on the power plant economic dispatch model to form an upper-level economic dispatch model for handling uncertainties in electricity prices and output; Optimize the power plant economic dispatch model based on the uncertainty of electricity prices for renewable energy generation, including wind farms; Constructing a second objective function and a second constraint condition based on the power plant safety dispatch model to form a lower-level safety dispatch model for adjusting the initial dispatch value according to the safety constraint; The upper-level economic dispatch model and the lower-level safety dispatch model are solved to generate the optimal dispatch plan for the virtual power plant.

2. The two-layer optimization scheduling method of a virtual power plant according to claim 1 is characterized in that: The first objective function is: in, In the above formula, T is the total number of time periods in the scheduling cycle; n s is the number of electricity price schemes in Monte Carlo simulation; π(s) corresponds to the probability of the sth group of electricity price schemes; R t is the profit function of period t; C t is the cost function of period t; H t , D t are the electric energy delivered according to the contract requirements and the electric energy delivered to the day-ahead market plan during period t, respectively, which are decision variables; h is the contract electricity price; is the electricity price in the t period in the sth group of schemes; B t is the amount of electricity purchased, that is, the purchase price is Count; n i is the number of generator sets in the virtual power plant; K t,i is the startup or shutdown cost of unit i; Boolean variable k t,i Indicates whether unit i is in action during period t, n j is the number of segments; p i is the fixed cost of unit i; is the slope of the jth section of unit i; is the power generation of the jth segment; g t,i is the power generation of unit i during period t, that is is the decision variable; is the environmental value of the mth pollutant produced by unit i; v mi is the penalty coefficient of the mth pollutant produced by unit i; n m is the total number of pollutants.

3. The two-layer optimization scheduling method of a virtual power plant according to claim 1 is characterized in that: The first constraint condition for constructing the power plant economic dispatch model includes gas turbine constraints, pumped storage power station constraints, forward contract constraints and power balance constraints.

4. The two-layer optimization scheduling method of a virtual power plant according to claim 3 is characterized in that: The gas turbine constraints are: B workt,i ,k t,i ,B ont,i ,B offt,i ∈{0,1} B ont,i +B offt,i =K t,i k t,i =B workt,i -B workt-1,i g i,min B workt,i ≤g t,i ≤g i,max B workt,i The climbing constraint of the unit is: The minimum startup time constraint is: The minimum downtime constraint is: Among them, the Boolean variable B workt,i Indicates whether machine i is working during period t, if yes, set to 1, otherwise set to 0; Boolean variable B ont,i Indicates whether unit i is started during period t, if yes, set to 1, otherwise set to 0; B offt,i Indicates whether unit i is shut down during period t, if yes, set to 1, otherwise set to 0; g i,max , g i,min are the maximum and minimum power generation of unit i respectively; t oni,min ,t offi,min are the minimum on and off time of unit i respectively; r i u is the upward climbing rate of unit i, r i d is the downward climbing rate of unit i; t onx,i ,t offx′,i are the minimum on and off time of unit x respectively; N is a positive integer; B workt,x+y,i is the minimum startup time of unit i in the time period x+y; B worktx′+y′,i is the minimum downtime of unit i in the time period x′+y′; The constraints of the pumped storage power station are: E1=0 AND t +E int ≤E max AND outt ≤E t-1 AND int ≤E c AND outt ≤E d AND t -AND t-1 =And int -AND out Among them, E int and E outt are the amount of electricity stored and discharged during period t, respectively, and are decision variables; E max is the maximum storage capacity; E c E is the maximum storage capacity; d is the maximum discharge capacity; E t is the total energy of the battery; The forward contract constraints are: There may be a certain deviation between the actual power transmission of the virtual power plant and the contracted power. By introducing the deviation coefficient Z allowed by the contract, Z∈[0,1], we have: (1-Z)H t ≤H t ′≤(1+Z)H t Among them, H t is the electric energy delivered according to the contract requirements during period t, which is the decision variable; H t ′ represents the actual amount of electricity delivered to meet the contract requirements, which is a decision variable; T is the total number of time periods in the dispatch cycle; The power balance constraint is: W t +g t +B t +E outt μ1=H t′ +D t +E int / μ2 Among them, W t is the predicted value of the fan output during period t; g t is the total power generation of the unit; μ1 and μ2 are power generation efficiency and energy storage efficiency respectively; B t is the planned electricity purchase amount submitted to the balancing market by the virtual power plant under the economic dispatch model during period t; D t It is the electric energy planned to be delivered to the day-ahead market during period t.

5. The two-layer optimization scheduling method of a virtual power plant according to claim 1 is characterized in that: The optimization power plant economic dispatch model includes constructing a wind turbine model and establishing a feasible solution of the wind turbine model to obtain a wind turbine output constraint, and adding the wind turbine output constraint to the first constraint condition, specifically: The fan model is: in, is the uncertain form of fan output; t is the predicted value of fan output; η t is the uncertainty interval coefficient; ρ t is the empirical error coefficient; Construct feasible solutions, including: According to the constraints of the fan model, the optimization modifications are as follows: make: It can become: Substituting the fan model into the above formula, the fan output constraint is: -w t -or t r t w t ≤F t Among them, E int and E outt are the amount of electricity stored and discharged during period t, respectively, and are decision variables; H t ′ represents the actual amount of electricity delivered to meet the contract requirements and is a decision variable.

6. The two-layer optimization scheduling method of a virtual power plant according to claim 1 is characterized in that: The second objective function is: Where T is the total number of time periods in the scheduling cycle; g t ' ,i is the decision variable, which is the optimal output solution of gas turbine i under the safe scheduling model in period t; E i ' nt is the decision variable, which is the optimal solution of energy storage obtained under the safe dispatch model of the pumped storage power station in period t; E o ' utt is the decision variable, which is the optimal solution for power generation of the pumped storage power station under the safe dispatch model in period t; B t ' is the decision variable, which is the revised amount of electricity purchased by the virtual power plant submitted to the balancing market under the security dispatch model in period t; g t,i is the power generation of unit i during period t; E int and E outt are the amount of electricity stored and discharged during period t, respectively, and are decision variables; B t It is the planned electricity purchase amount submitted to the balancing market by the virtual power plant under the economic dispatch model during period t.

7. The two-layer optimization scheduling method of a virtual power plant according to claim 1 is characterized in that: The second constraint condition includes power flow constraint, apparent power constraint of the line, capacity constraint of the connection point between the distribution network and the main grid, and node voltage constraint, which is specifically: The power flow constraint is: Among them, U i,t and U j,t are the voltage amplitudes of nodes i and j in period t respectively; θ i,t and θ j,t are the voltage phase angles of node i and node j during period t; p d,i,t is the injected active power of node i in period t; p g,i,t is the total active power generated by DG at node i during period t; Q g,i,t is the total reactive power generated by DG at node i during period t; Q d,i,t is the reactive power consumed by node i during period t; Y ij is the amplitude of the node admittance matrix element; δ j,t and δ i,t are the phase angles of the line admittance between node i and node j in period t; ij is the phase angle of the line admittance between node i and node j; The apparent power constraint of the line is: Among them, S ij,t is the apparent power between node i and node j during period t; is the line capacity between node i and node j; S b is the collection of all branches in the distribution network; The capacity constraint of the connection point between the distribution network and the main grid is: Among them, S GSP,t , They are the apparent power exchanged between the distribution network and the main grid at the point of public connection and its upper limit; Node Voltage Constraints Among them, U i,t is the voltage amplitude of node i in the distribution network during period t; are the minimum and maximum voltage values ​​allowed at node i, respectively.

8. A computer-readable storage medium, characterized in that: It stores computer executable instructions, which, when executed by a processor, can implement the two-layer optimization scheduling method for a virtual power plant as described in any one of claims 1 to 7.

9. A computer device, characterized in that: It includes a processor and a memory, the memory is used to store a computer program, and when the computer program is executed by the processor, it implements the two-layer optimization scheduling method of a virtual power plant as described in any one of claims 1 to 7.