Virtual power plant two-stage robust optimization scheduling method considering wind power and standby deployment request uncertainty

By building a robust optimization scheduling model for virtual power plants, considering the uncertainty of wind power and backup deployment requests, the problem of virtual power plants ignoring the uncertainty of backup market in power grid scheduling is solved, and efficient economic scheduling and resource utilization of virtual power plants are realized .

CN118917682APending Publication Date: 2024-11-08STATE GRID SHANGHAI MUNICIPAL ELECTRIC POWER CO +1
View PDF 0 Cites 3 Cited by

Patent Information

Application Number
CN202410940699.3
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Priority Date
2024-06-27
Filing Date
2024-07-12
Publication Date
2024-11-08

AI Technical Summary

Technical Problem

The prior art ignores the uncertainty of deployment requests in the backup market in power grid scheduling, resulting in poor virtual power plant scheduling, which may lead to large-scale power outages and economic losses in the power grid.

Method used

A two-stage robust optimization scheduling method for virtual power plants is proposed. By constructing thermal power unit models and wind power and backup deployment request uncertainty models, a robust uncertain set is formed, and the column and constraint generation algorithm is used to divide them into main and sub- Problem, solve by alternating iteration to obtain the optimal scheduling result.

Benefits of technology

The uncertainty of backup deployment requests in the backup market is effectively considered, the economic scheduling efficiency of virtual power plants is improved, the benefits of energy management systems are maximized and the efficient utilization of resources are achieved, and the increase in additional costs is avoided.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118917682A_ABST
    Figure CN118917682A_ABST
Patent Text Reader

Abstract

The invention relates to the technical field of power system optimization scheduling, solves the technical problem that traditional virtual power plant scheduling neglects influences brought by uncertainty of deployment requests in a standby market, and particularly relates to a virtual power plant two-stage robust optimization scheduling method considering wind power and standby deployment request uncertainty. The method comprises the following steps: constructing a thermal power generating unit model and a wind power and standby deployment request uncertainty set model which are used for reflecting the operation condition of an internal unit of a virtual power plant; constructing a two-stage robust optimization model of the virtual power plant according to the operation constraint condition of each part in the virtual power plant and the robust uncertainty set; and solving the two-stage robust model by adopting a column and constraint generation algorithm to obtain an optimal scheduling result. According to the method, the uncertainty of the standby deployment request in the standby market is considered in the economic dispatching of the virtual power plant, so that the benefit maximization of the energy management system is further realized, the existing resources are efficiently utilized, and the increase of extra cost is avoided.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of power system optimization and dispatching, and in particular to a two-stage robust optimization and dispatching method for a virtual power plant taking into account the uncertainty of wind power and standby deployment requests. Background Art

[0002] In recent years, as people pay more and more attention to environmental issues, renewable energy has developed rapidly. However, despite many years of technological development, there are still many problems about how to connect renewable energy to the grid on a large scale. Due to the unavoidable uncertainties of distributed energy such as wind power and photovoltaics, direct participation in grid dispatching will have major hidden dangers, which may lead to large-scale power outages in the grid and cause huge economic losses.

[0003] Therefore, renewable energy is usually not used alone. It is usually combined with traditional generators such as thermal power, energy storage systems and demand response to participate in the power dispatch of the power system. Virtual power plants are a new dispatching method born in this context, which can bring together distributed energy sources of different types and locations and operate them as a separate entity. Most of the current research focuses on the uncertainty of distributed energy output, while ignoring the uncertainty of deployment requests in the reserve market. New ways need to be explored for virtual power plants to participate in the dispatch of energy and reserve markets. Summary of the invention

[0004] In view of the shortcomings of the existing technology, the present invention provides a two-stage robust optimization scheduling method for virtual power plants that takes into account the uncertainty of wind power and reserve deployment requests, solving the technical problem that traditional virtual power plant scheduling ignores the impact of the uncertainty of deployment requests in the reserve market.

[0005] In order to solve the above technical problems, the present invention provides the following technical solutions: a two-stage robust optimization scheduling method for a virtual power plant taking into account the uncertainty of wind power and reserve deployment requests, the method comprising the following steps:

[0006] A thermal power unit model and a wind power and reserve deployment request uncertainty set model are constructed to reflect the internal unit operation status of the virtual power plant, and a robust uncertainty set consisting of the thermal power unit model and the wind power and reserve deployment request uncertainty set model is obtained;

[0007] According to the constraints and robust uncertainty sets of each part of the virtual power plant, a two-stage robust optimization model of the virtual power plant consisting of an upper model and a lower model is constructed.

[0008] The column and constraint generation algorithm is used to divide the two-stage robust modeling into main and sub-problems, and the optimal scheduling result is obtained by alternating the main and sub-problems.

[0009] Furthermore, the thermal power unit model is:

[0010]

[0011] In the above formula, P t g is the output power of the thermal power unit during period t; They represent the state variables of normal operation and shutdown of thermal power units during period t respectively; is the startup state variable of the thermal power unit during period t; are the minimum and maximum output of the unit respectively; Δt is the time interval; R C,U , R C,D Respectively represent the upper and lower climbing limits of the unit; R C,SD , R C,SU Respectively represent the start and stop ramp rates of the unit;

[0012] The uncertainty model of wind power and reserve deployment request is:

[0013]

[0014] In the above formula, P t W is the actual available power of wind power; is the average available power of wind power; ΔP t W is the wind power fluctuation level; are state variables representing up and down fluctuations, and are binary variables. When , it means that the wind power generation power reaches the upper limit. When , it indicates that the wind power generation power reaches the lower limit of output; are the state variables of the upper and lower standby deployment requests respectively; Γ w , Γ R They represent the uncertainty robustness coefficients of wind power and reserve deployment requests respectively. The smaller the value, the smaller the robustness and the more conservative it is. Conversely, the larger the robustness and the more aggressive it is.

[0015] Furthermore, the upper-level model takes maximizing the total profit of the virtual power plant as its objective function, and determines the decision to participate in the energy market and the reserve market; the lower-level model takes minimizing the expected profit of the virtual power plant under the worst case scenario as its objective function, and determines the specific operating conditions of each part within the virtual power plant.

[0016] Furthermore, the objective functions of the upper model and the lower model are:

[0017]

[0018] In the above formula, is the grid electricity price; P t grid The power of interaction between the virtual power plant and the grid; is the reserve market price; P t R+ , P t R- is the transaction power of power capacity in the upper and lower reserve markets; g,F 、f g,V are the fixed cost coefficient and variable cost coefficient of thermal power units; f g,SD 、f g,SU is the start-up and shutdown cost coefficient of thermal power units; Λ is the set of uncertain variables; Θ represents the feasible set.

[0019] Furthermore, the constraints for the operation of each part of the virtual power plant include power balance constraints, related operation constraints of thermal power units, wind power output constraints, battery energy storage charge state constraints, virtual power plant and energy market and reserve market interaction power constraints, etc. The constraints of the power grid are given by the following formulas:

[0020] The power balance constraint of the system network is:

[0021] P t grid +P t g +P t W +n t R- P t R- =P t load +n t R+ P t R+ (4)

[0022] In the above formula, P t load is the load at time t;

[0023] The relevant operating constraints of thermal power units are as shown in formula (1), that is:

[0024]

[0025] In the above formula, P t g is the output power of the thermal power unit during period t; They represent the state variables of normal operation and shutdown of thermal power units during period t respectively; is the startup state variable of the thermal power unit during period t; are the minimum and maximum output of the unit respectively; Δt is the time interval; R C,U , R C,D Respectively represent the upper and lower climbing limits of the unit; R C,SD , R C,SU Respectively represent the start and stop ramp rates of the unit;

[0026] The power constraint of the interaction between the virtual power plant and the energy market is:

[0027]

[0028] In the above formula, The maximum power of interaction between the virtual power plant and the grid;

[0029] The power constraints for the interaction between the virtual power plant and the reserve market include the upper and lower reserve market transaction power constraints, namely:

[0030]

[0031] In the above formula, are the maximum and minimum transaction power in the upper and lower reserve markets, respectively;

[0032] The battery energy storage state of charge constraint is:

[0033]

[0034] In the above formula, SOC t SOC is the state of charge of the energy storage device at time t; min , SOC max is the minimum and maximum state of charge of the battery energy storage device; η c , η d are the charging and discharging efficiency of the battery energy storage device; P t C , P t D They are respectively the energy storage charging and discharging power; are the maximum charge and discharge powers respectively; Δt is the time interval;

[0035] Wind power output constraints are:

[0036]

[0037] In the above formula, is the available power of wind power; P t W is the actual available power of wind power.

[0038] Furthermore, the specific steps of solving the two-stage robust model using the column and constraint generation algorithm include:

[0039] S31. Divide the two-stage robust optimization model into a main problem and sub-problems;

[0040] The main problem is stated as follows:

[0041]

[0042] In the above formula, θ is a continuous variable that assists the iterative approximation of the worst-case value of the objective function of the subproblem; is the grid electricity price; P t grid The power of interaction between the virtual power plant and the grid; is the reserve market price; P t R+ , P t R- is the transaction power of power capacity in the upper and lower reserve markets; f g,F 、f g,V are the fixed cost coefficient and variable cost coefficient of thermal power units; f g,SD 、f g ,SU is the start-up and shutdown cost coefficient of thermal power units; They represent the state variables of normal operation and shutdown of thermal power units during period t respectively; is the startup state variable of the thermal power unit during period t;

[0043] The sub-problem is stated as follows:

[0044]

[0045] In the above formula, f P is the penalty cost coefficient of the slack variable, ρ t + , t - Non-negative slack variables to ensure the feasibility of the subproblems along the iteration process; are the state variables of the upper and lower standby deployment requests respectively; P t g is the output power of the thermal power unit during period t; Δt is the time interval; P t R+(u) and P t R-(u) are the power capacities traded in the upper and lower reserve markets at iteration u, respectively;

[0046] S32, respectively establish the constraints of the main problem and the sub-problems;

[0047] S33. Convert the double-layer problem of the sub-problem into a single-layer problem, namely:

[0048]

[0049] In the above formula, X and Y are the uncertain variable set and the dual variable set respectively; c T 、b T are the coefficient matrices of the uncertain variable set and the dual variable set respectively; A is the coefficient matrix of the uncertain variable set; B and C are the coefficient matrices after the dual changes; d, e, and f are parameter matrices;

[0050] S34. Use the column and constraint generation algorithm to alternately iterate and solve the main problem and sub-problems to obtain the optimal scheduling result.

[0051] Furthermore, the constraints of the main problem are:

[0052]

[0053] In the above formula, ξ represents the set of variables generated during the iteration of the main problem and the sub-problem; φ represents the corresponding optimal value generated by the sub-problem during the iteration; They represent the state variables of normal operation and shutdown of thermal power units during period t; SOC min , SOC max is the minimum and maximum state of charge of the battery energy storage device; η c , η d are the charging and discharging efficiency of the battery energy storage device, respectively; are the maximum charge and discharge power respectively; P t g,u′ is the output of the thermal power unit at the u′th iteration; P t W,u′ is the wind power output generated by the subproblem at the u′th iteration; P t D,u′ is the demand response power at the u′th iteration; P t C,u′ is the energy storage charging power at the u′th iteration; P t load,u′ is the load power at the u′th iteration; P min g,u′ , P max g,u′ are the upper and lower limits of the thermal power unit output at the u′th iteration; SOC t,u′ is the energy storage charge state at the u′th iteration;

[0054] The sub-problem constraints are:

[0055]

[0056] In the above formula, α t ,ε t , μ t ,π t , κ t ,x t , Both are dual variables.

[0057] Furthermore, in step S34, the specific solution process is as follows:

[0058] S341. Given the initial worst scenario set, set the initial upper and lower boundaries U B =+∞,L B =-∞, and select the convergence value, and set the number of iterations to 1;

[0059] S342, solving the main problem according to step S341, passing the solution of the main problem to the sub-problem, and updating the upper boundary using the optimal value of the main problem;

[0060] S343, using the optimal solution of the main problem to solve the dual sub-problem, and after obtaining the optimal value of the sub-problem, update the lower bound based on it;

[0061] S344. Determine whether the difference between the upper boundary and the lower boundary is less than the convergence value. If so, output the optimal solution and the iteration ends. Otherwise, use the solution to the sub-problem to return to step S342 for iteration, and the number of iterations increases by 1.

[0062] By means of the above technical solution, the present invention provides a two-stage robust optimization scheduling method for a virtual power plant taking into account the uncertainty of wind power and standby deployment requests, which has at least the following beneficial effects:

[0063] 1. The present invention takes into account the uncertainty of reserve deployment requests in the reserve market into the economic dispatch of virtual power plants, further maximizing the benefits of the energy management system, efficiently utilizing existing resources, and avoiding additional costs.

[0064] 2. The present invention obtains a scheduling method for virtual power plants to participate in the energy market and the backup market by modeling the uncertainty of backup deployment requests, thereby solving the power scheduling problem of virtual power plants in the energy market and the backup market, and providing a basis for virtual power plants to participate in the energy market and the backup market at the same time.

[0065] 3. The present invention uses the robust concept for the first time to establish an uncertain set of wind power and reserve deployment requests, and takes it into account in the optimization scheduling model, thereby improving the dispatchability of the virtual power plant parameter market scheduling. BRIEF DESCRIPTION OF THE DRAWINGS

[0066] 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:

[0067] Figure 1 This is the flexible load interval diagram of the present invention;

[0068] Figure 2 This is a wind power output range diagram of the present invention;

[0069] Figure 3 The virtual power plant of the present invention participates in the energy market dispatch diagram;

[0070] Figure 4 The virtual power plant of the present invention participates in adjusting the reserve market dispatch diagram upward;

[0071] Figure 5 The virtual power plant of the present invention participates in downward adjustment of the reserve market dispatch diagram. DETAILED DESCRIPTION

[0072] 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.

[0073] Please refer to Figure 1-Figure 5 This embodiment proposes a two-stage robust optimization scheduling method for a virtual power plant taking into account the uncertainty of wind power and standby deployment requests, and the method includes the following steps:

[0074] S1. Construct a thermal power unit model and a wind power and standby deployment request uncertainty set model to reflect the internal unit operation status of the virtual power plant, and obtain a robust uncertainty set composed of the thermal power unit model and the wind power and standby deployment request uncertainty set model; among which, the thermal power unit model is:

[0075]

[0076] In the above formula, P t g is the output power of the thermal power unit during period t; They represent the state variables of normal operation and shutdown of thermal power units during period t respectively; is the startup state variable of the thermal power unit during period t; are the minimum and maximum output of the unit respectively; Δt is the time interval; R C,U , R C,D Respectively represent the upper and lower climbing limits of the unit; R C,SD , R C,SU Respectively represent the start and stop ramp rates of the unit.

[0077] The uncertainty model of wind power and reserve deployment request is:

[0078]

[0079] In the above formula, P t W is the actual available power of wind power; is the average available power of wind power; ΔP t W is the wind power fluctuation level; are state variables representing up and down fluctuations, and are binary variables. When , it means that the wind power generation power reaches the upper limit. When , it indicates that the wind power generation power reaches the lower limit of output; are the state variables of the upper and lower standby deployment requests respectively; Γ w , Γ R They represent the uncertainty robustness coefficients of wind power and reserve deployment requests respectively. The smaller the value, the smaller the robustness and the more conservative it is. Conversely, the larger the robustness and the more aggressive it is.

[0080] S2. According to the operating constraints and robust uncertainty sets of each part of the virtual power plant, a two-stage robust optimization model of the virtual power plant consisting of an upper model and a lower model is constructed. The two-stage robust optimization model of the virtual power plant is further rewritten by the thermal power unit model and the wind power and reserve deployment request uncertainty set model constructed in step S1. Specifically, the upper model takes maximizing the total profit of the virtual power plant as the objective function and determines the decision to participate in the energy market and the reserve market; the lower model takes minimizing the expected profit of the virtual power plant in the worst case as the objective function and determines the specific operation of each part of the virtual power plant; specifically, the objective function of the upper model and the lower model is a max-min-max problem, and the formula is as follows:

[0081]

[0082] In the above formula, is the grid electricity price; P t grid The power of interaction between the virtual power plant and the grid; is the reserve market price; P t R+ , P t R- is the transaction power of power capacity in the upper and lower reserve markets; f g,F 、f g,V are the fixed cost coefficient and variable cost coefficient of thermal power units; f g,SD 、f g,SU is the start-up and shutdown cost coefficient of thermal power units; Λ is the set of uncertain variables; Θ represents the feasible set.

[0083] The operating constraints of each part of the virtual power plant include power balance constraints, related operating constraints of thermal power units, wind power output constraints, battery energy storage charge state constraints, and power constraints for the interaction between the virtual power plant and the energy market and reserve market. The constraints of the power grid are given by the following formulas:

[0084] The power balance constraint of the system network is:

[0085] P t grid +P t g +P t W +n t R- P t R- =P t load +n t R+ P t R+ (4)

[0086] In the above formula, P t load is the load at time t;

[0087] The relevant operating constraints of thermal power units are as shown in formula (1), that is:

[0088]

[0089] In the above formula, P t g is the output power of the thermal power unit during period t; They represent the state variables of normal operation and shutdown of thermal power units during period t respectively; is the startup state variable of the thermal power unit during period t; are the minimum and maximum output of the unit respectively; Δt is the time interval; R C,U , R C,D Respectively represent the upper and lower climbing limits of the unit; R C,SD , R C,SU Respectively represent the start and stop ramp rates of the unit;

[0090] The power constraint of the interaction between the virtual power plant and the energy market is:

[0091]

[0092] In the above formula, The maximum power of interaction between the virtual power plant and the grid;

[0093] The power constraints for the interaction between the virtual power plant and the reserve market include the upper and lower reserve market transaction power constraints, namely:

[0094]

[0095] In the above formula, are the maximum and minimum transaction power in the upper and lower reserve markets, respectively;

[0096] The battery energy storage state of charge constraint is:

[0097]

[0098] In the above formula, SOC t SOC is the state of charge of the energy storage device at time t; min , SOC max is the minimum and maximum state of charge of the battery energy storage device; η c , η d are the charging and discharging efficiency of the battery energy storage device; P t C , P t D They are respectively the energy storage charging and discharging power; are the maximum charge and discharge powers respectively; Δt is the time interval.

[0099] Wind power output constraints are:

[0100]

[0101] In the above formula, is the available power of wind power; P t W is the actual available power of wind power.

[0102] S3. The two-stage robust model is divided into main and sub-problems by using the column and constraint generation algorithm, and the optimal scheduling result is obtained by solving the main problem and the sub-problems through alternating iterations. The specific steps of solving the two-stage robust optimization model using the column and constraint generation algorithm (C&CG) include:

[0103] S31. Divide the two-stage robust optimization model into a main problem and sub-problems;

[0104] The main problem is stated as follows:

[0105]

[0106] In the above formula, θ is a continuous variable that assists the iterative approximation of the worst-case value of the objective function of the subproblem; is the grid electricity price; P t grid The power of interaction between the virtual power plant and the grid; is the reserve market price; P tR+ , P t R- is the transaction power of power capacity in the upper and lower reserve markets; f g,F 、f g,V are the fixed cost coefficient and variable cost coefficient of thermal power units; f g,SD 、f g ,SU is the start-up and shutdown cost coefficient of thermal power units; They represent the state variables of normal operation and shutdown of thermal power units during period t respectively; is the startup state variable of the thermal power unit during period t;

[0107] The sub-problem is stated as follows:

[0108]

[0109] In the above formula, f P is the penalty cost coefficient of the slack variable, Non-negative slack variables to ensure the feasibility of the subproblems along the iteration process; are the state variables of the upper and lower standby deployment requests respectively; P t g is the output power of the thermal power unit during period t; Δt is the time interval; P t R+(u) and P t R-(u) are the power capacities traded in the upper and lower reserve markets at iteration u respectively.

[0110] S32, respectively establish the constraints of the main problem and the sub-problems;

[0111] The constraints of the main problem are:

[0112]

[0113] In the above formula, ξ represents the set of variables generated during the iteration of the main problem and the sub-problem; φ represents the corresponding optimal value generated by the sub-problem during the iteration; They represent the state variables of normal operation and shutdown of thermal power units during period t; SOC min , SOC max is the minimum and maximum state of charge of the battery energy storage device; η c , η d are the charging and discharging efficiency of the battery energy storage device, respectively; are the maximum charge and discharge power respectively; P t g,u′ is the output of the thermal power unit at the u′th iteration; P t W,u′ is the wind power output generated by the subproblem at the u′th iteration; Pt D,u′ is the demand response power at the u′th iteration; P t C,u′ is the energy storage charging power at the u′th iteration; P t load,u′ is the load power at the u′th iteration; P min g,u′ , P max g,u′ are the upper and lower limits of the thermal power unit output at the u′th iteration; SOC t,u′ is the energy storage charge state at the u′th iteration.

[0114] The sub-problem constraints are:

[0115]

[0116] In the above formula, α t , ε t , μ t , π t , κ t ,x t , Both are dual variables.

[0117] S33. Convert the double-layer problem of the sub-problem into a single-layer problem, namely:

[0118] Since the subproblem is a min-max two-level problem and the lower-level decision variables are in the problem, the duality theory can be used to transform the subproblem into a single-level problem. The compact form after conversion is as follows:

[0119]

[0120] In the above formula, X and Y are the uncertain variable set and the dual variable set respectively; c T , b T are the coefficient matrices of the uncertain variable set and the dual variable set respectively; A is the coefficient matrix of the uncertain variable set; B and C are the coefficient matrices after the dual changes; d, e, and f are parameter matrices;

[0121] S34. Use the column and constraint generation algorithm to alternately iterate and solve the main problem and the sub-problem to obtain the optimal scheduling result. The specific solution process is as follows:

[0122] S341. Given the initial worst scenario set, set the initial upper and lower boundaries U B =+∞,L B =-∞, and select the convergence value, and set the number of iterations to 1;

[0123] S342, solving the main problem according to step S341, passing the solution of the main problem to the sub-problem, and updating the upper boundary using the optimal value of the main problem;

[0124] S343, using the optimal solution of the main problem to solve the dual sub-problem, and after obtaining the optimal value of the sub-problem, update the lower bound based on it;

[0125] S344. Determine whether the difference between the upper boundary and the lower boundary is less than the convergence value. If so, output the optimal solution and the iteration ends. Otherwise, use the solution to the sub-problem to return to step S342 for iteration, and the number of iterations increases by 1.

[0126] The present invention considers the transaction of virtual power plants participating in the energy market and the reserve market under different robustness coefficients. For the purpose of illustration, the time interval is set to 1h and the total duration is 24h. Table 1 shows the technical parameters of the thermal power unit, and Table 2 shows the relevant parameters of the battery energy storage. Figure 1 is the hourly energy consumption range of the flexible load, and Table 3 shows the trading power requirements of the virtual power plant in the energy market and the reserve market.

[0127] Table 1 Technical parameters of thermal power units

[0128]

[0129] Table 2 Battery energy storage related parameters

[0130]

[0131] Table 3. Parameters of virtual power plant participating in the market

[0132]

[0133] In order to study the impact of the robustness coefficient on the virtual power plant's simultaneous participation in the energy market and the reserve market, the present invention sets multiple robustness coefficients, which are 4, 8, and 16. The robustness coefficient for wind power output is set to 12. Figure 2 is the available power generation range of wind power, Figure 3This figure shows the interactive power between the virtual power plant and the energy market under different robustness coefficients. It can be seen from the figure that, on the one hand, under all circumstances, the interactive power between the virtual power plant and the energy market is almost the same as the trend of the available power generation of wind power. When the virtual power plant begins to participate in the dispatch, the wind power generation is at a high level, and the load demand is low at this time. In order to maximize the profit of the virtual power plant, the power sold by the virtual power plant to the energy market is also at a high level. From the perspective of the size of the robustness coefficient, when the wind power generation is high and the robustness coefficient is 4, the amount of electricity sold by the virtual power plant to the market is low, and the amount of electricity sold when the robustness coefficient is 8 or 16 is almost the same and higher than when the coefficient is 4; and when the wind power generation is low, the smaller the robustness coefficient, the less electricity the virtual power plant sells to the energy market. When the wind power generation is close to 0MW, the amount of electricity sold when the robustness coefficient is 4 is also close to 0MW.

[0134] Figure 4 This figure shows the participation of virtual power plants in the reserve market under different robustness coefficients. It can be seen from the figure that when the robustness coefficient is smaller, the more conservative the system is. In the early stage when the load gradually increases and the wind power output is at a high level, the capacity of virtual power plants participating in the reserve market becomes smaller and smaller. When the load reaches its peak or the wind power output is the lowest, the capacity of participating in the reserve market is the smallest. From the perspective of the size of the robustness coefficient, as the robustness coefficient increases, the conservatism of the system becomes weaker and weaker, resulting in a significant decrease in the willingness of virtual power plants to participate in the reserve market. When the robustness coefficient is 16, the capacity participating in the reserve market is even 0MW during the period of maximum load or minimum wind power output.

[0135] Figure 5 Figure 2 shows the participation of virtual power plants in the reserve market under different robustness coefficients. Different from the participation in the reserve market, the capacity of virtual power plants in the reserve market reaches the maximum value in most periods, regardless of whether the robustness coefficient is 4, 8 or 16. As the load increases, the larger the robustness coefficient, the smaller the capacity of virtual power plants in the reserve market. Therefore, the robustness coefficient has a relatively large impact on the participation of virtual power plants in the reserve market.

[0136] 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.

[0137] Each embodiment in this specification is described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between the embodiments can be referred to each other. For the above embodiments, since they are basically similar to the method embodiments, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiments.

[0138] 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-stage robust optimization scheduling method for virtual power plants taking into account the uncertainty of wind power and reserve deployment requests, characterized in that: The method comprises the following steps: A thermal power unit model and a wind power and reserve deployment request uncertainty set model are constructed to reflect the internal unit operation status of the virtual power plant, and a robust uncertainty set consisting of the thermal power unit model and the wind power and reserve deployment request uncertainty set model is obtained; According to the constraints and robust uncertainty sets of each part of the virtual power plant, a two-stage robust optimization model of the virtual power plant consisting of an upper model and a lower model is constructed. The column and constraint generation algorithm is used to divide the two-stage robust modeling into main and sub-problems, and the optimal scheduling result is obtained by alternating the main and sub-problems.

2. The two-stage robust optimization scheduling method for virtual power plants according to claim 1 is characterized in that: The model of the thermal power unit is: In the above formula, P t g is the output power of the thermal power unit during period t; They represent the state variables of normal operation and shutdown of thermal power units during period t respectively; is the startup state variable of the thermal power unit during period t; are the minimum and maximum output of the unit respectively; Δt is the time interval; R C,U , R C,D Respectively represent the upper and lower climbing limits of the unit; R C,SD , R C,SU Respectively represent the start and stop ramp rates of the unit; The uncertainty model of wind power and reserve deployment request is: In the above formula, P t W is the actual available power of wind power; is the average available power of wind power; ΔP t W is the wind power fluctuation level; are state variables representing up and down fluctuations, and are binary variables. When , it means that the wind power generation power reaches the upper limit. When , it indicates that the wind power generation power reaches the lower limit of output; are the state variables of the upper and lower standby deployment requests respectively; Γ w , Γ R They represent the uncertainty robustness coefficients of wind power and reserve deployment requests respectively. The smaller the value, the smaller the robustness and the more conservative it is. Conversely, the larger the robustness and the more aggressive it is.

3. The two-stage robust optimization scheduling method for virtual power plants according to claim 1 is characterized in that: The upper model takes maximizing the total profit of the virtual power plant as its objective function, and determines the decision on participating in the energy market and the reserve market; the lower model takes minimizing the expected profit of the virtual power plant under the worst case scenario as its objective function, and determines the specific operating conditions of each part within the virtual power plant.

4. The two-stage robust optimization scheduling method for virtual power plants according to claim 3 is characterized in that: The objective functions of the upper model and the lower model are: In the above formula, is the grid electricity price; P t grid is the interaction power between the virtual power plant and the grid; t R+ , t R- is the reserve market price; P t R+ , P t R- is the transaction power of power capacity in the upper and lower reserve markets; f g,F 、f g,V are the fixed cost coefficient and variable cost coefficient of thermal power units; f g,SD 、f g,SU is the start-up and shutdown cost coefficient of thermal power units; Λ is the set of uncertain variables; Θ represents the feasible set.

5. The two-stage robust optimization scheduling method for virtual power plants according to claim 1 is characterized in that: The operating constraints of each part of the virtual power plant include power balance constraints, thermal power unit related operating constraints, wind power output constraints, battery energy storage charge state constraints, virtual power plant and energy market and reserve market interaction power constraints, etc. The constraints of the power grid are given by the following formulas: The power balance constraint of the system network is: P t grid +P t g +P t W +n t R- P t R- =P t load +n t R+ P t R+ (4) In the above formula, P t load is the load at time t; The relevant operating constraints of thermal power units are as shown in formula (1), that is: In the above formula, P t g is the output power of the thermal power unit during period t; They represent the state variables of normal operation and shutdown of thermal power units during period t respectively; is the startup state variable of the thermal power unit during period t; are the minimum and maximum output of the unit respectively; Δt is the time interval; R C,U , R C,D Respectively represent the upper and lower climbing limits of the unit; R C,SD , R C,SU Respectively represent the start and stop ramp rates of the unit; The power constraint of the interaction between the virtual power plant and the energy market is: In the above formula, The maximum power of interaction between the virtual power plant and the grid; The power constraints for the interaction between the virtual power plant and the reserve market include the upper and lower reserve market transaction power constraints, namely: In the above formula, are the maximum and minimum transaction power in the upper and lower reserve markets, respectively; The battery energy storage state of charge constraint is: In the above formula, SOC t SOC is the state of charge of the energy storage device at time t; min , SOC max The minimum and maximum charge states of the battery energy storage device; η c , η d are the charging and discharging efficiency of the battery energy storage device; P t C , P t D They are respectively the energy storage charging and discharging power; are the maximum charge and discharge powers respectively; Δt is the time interval; Wind power output constraints are: In the above formula, is the available power of wind power; P t W is the actual available power of wind power.

6. The two-stage robust optimization scheduling method for virtual power plants according to claim 1 is characterized in that: The specific steps of solving the two-stage robust model using the column and constraint generation algorithm include: S31. Divide the two-stage robust optimization model into a main problem and sub-problems; The main problem is stated as follows: In the above formula, θ is a continuous variable that assists the iterative approximation of the worst-case value of the objective function of the subproblem; λ t grid is the grid electricity price; P t grid is the interaction power between the virtual power plant and the grid; t R+ , t R- is the reserve market price; P t R+ , P t R- is the transaction power of power capacity in the upper and lower reserve markets; f g,F 、f g,V are the fixed cost coefficient and variable cost coefficient of thermal power units; f g,SD 、f g,SU is the start-up and shutdown cost coefficient of thermal power units; They represent the state variables of normal operation and shutdown of thermal power units during period t respectively; is the startup state variable of the thermal power unit during period t; The sub-problem is stated as follows: In the above formula, f P is the penalty cost coefficient of the slack variable, Non-negative slack variables to ensure the feasibility of the subproblems along the iteration process; are the state variables of the upper and lower standby deployment requests respectively; P t g is the output power of the thermal power unit during period t; Δt is the time interval; P t R+(u) and P t R-(u) are the power capacities traded in the upper and lower reserve markets at iteration u, respectively; S32, respectively establish the constraints of the main problem and the sub-problems; S33. Convert the double-layer problem of the sub-problem into a single-layer problem, namely: In the above formula, X and Y are the uncertain variable set and the dual variable set respectively; c T 、b T are the coefficient matrices of the uncertain variable set and the dual variable set respectively; A is the coefficient matrix of the uncertain variable set; B and C are the coefficient matrices after the dual changes; d, e, and f are parameter matrices; S34. Use the column and constraint generation algorithm to alternately iterate and solve the main problem and sub-problems to obtain the optimal scheduling result.

7. The two-stage robust optimization scheduling method for virtual power plants according to claim 6 is characterized in that: The constraints of the main problem are: In the above formula, ξ represents the set of variables generated during the iteration of the main problem and the sub-problem; φ represents the corresponding optimal value generated by the sub-problem during the iteration; They represent the state variables of normal operation and shutdown of thermal power units during period t; SOC min , SOC max The minimum and maximum charge states of the battery energy storage device; η c , η d are the charging and discharging efficiency of the battery energy storage device, respectively; are the maximum charge and discharge power respectively; P t g,u′ is the output of the thermal power unit at the u′th iteration; P t W,u′ is the wind power output generated by the subproblem at the u′th iteration; P t D,u′ is the demand response power at the u′th iteration; P t C,u′ is the energy storage charging power at the u′th iteration; P t load,u′ is the load power at the u′th iteration; P min g,u′ , P max g,u′ are the upper and lower limits of the thermal power unit output at the u′th iteration; SOC t,u′ is the energy storage charge state at the u′th iteration; The sub-problem constraints are: In the above formula, Both are dual variables.

8. The two-stage robust optimization scheduling method for virtual power plants according to claim 6 is characterized in that: In step S34, the specific solution process is as follows: S341. Given the initial worst scenario set, set the initial upper and lower boundaries U B =+∞,L B =-∞, and select the convergence value, and set the number of iterations to 1; S342, solving the main problem according to step S341, passing the solution of the main problem to the sub-problem, and updating the upper boundary using the optimal value of the main problem; S343, using the optimal solution of the main problem to solve the dual sub-problem, and after obtaining the optimal value of the sub-problem, update the lower bound based on it; S344. Determine whether the difference between the upper boundary and the lower boundary is less than the convergence value. If so, output the optimal solution and the iteration ends. Otherwise, use the solution to the sub-problem to return to step S342 for iteration, and the number of iterations increases by 1.

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

10. 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-stage robust optimization scheduling method of a virtual power plant as described in any one of claims 1 to 8.

Citation Information

Cited By

  • Scheduling method for virtual power plant participating in inertia and standby market

    CN119154284A

  • A dispatching method for virtual power plants to participate in inertia and reserve markets

    CN119154284B

  • Optimized scheduling method and system for virtual power plant participating in super-large scale power grid

    CN120657867A