Next Article in Journal
Research on the Optimal Design of Community Public Space from the Perspective of Social Capital
Next Article in Special Issue
Accurate and Efficient Energy Management System of Fuel Cell/Battery/Supercapacitor/AC and DC Generators Hybrid Electric Vehicles
Previous Article in Journal
The Impact of Green Finance on Upgrading the Manufacturing Industry of the Yangtze River Economic Belt Based on the Spatial Econometric Model
Previous Article in Special Issue
Role of Metaheuristics in Optimizing Microgrids Operating and Management Issues: A Comprehensive Review
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Two-Stage Robust Optimization for Prosumers Considering Uncertainties from Sustainable Energy of Wind Power Generation and Load Demand Based on Nested C&CG Algorithm

1
Gansu Key Laboratory of Renewable Energy Integration Operation and Control, State Grid Gansu Electric Power Research Institute, Lanzhou 730070, China
2
College of Electrical Engineering, Zhejiang University, Hangzhou 310027, China
*
Author to whom correspondence should be addressed.
Sustainability 2023, 15(12), 9769; https://doi.org/10.3390/su15129769
Submission received: 22 May 2023 / Revised: 8 June 2023 / Accepted: 13 June 2023 / Published: 19 June 2023

Abstract

:
This paper develops a two-stage robust optimization (TSRO) model for prosumers considering multiple uncertainties from the sustainable energy of wind power generation and load demand and extends the existing nested column-and-constraint generation (C&CG) algorithm to solve the corresponding optimization problem. First, considering the impact of these uncertainties on market trading strategies of prosumers, a box uncertainty set is introduced to characterize the multiple uncertainties; a TSRO model for prosumers considering multiple uncertainties is then constructed. Second, the existing nested C&CG algorithm is extended to solve the corresponding optimization problem of which the second-stage optimization is a bi-level one and the inner level is a non-convex optimization problem containing 0–1 decision variables. Finally, a case study is solved. The optimized final overall operating cost of prosumers under the proposed model is CNY 3201.03; the extended algorithm requires only four iterations to converge to the final solution. If a convergence accuracy of 10−6 is used, the final solution time of the extended algorithm is only 9.75 s. The case study result shows that prosumers dispatch the ESS to store surplus wind power generated during the nighttime period and release the stored electricity when the wind power generation is insufficient during the daytime period. It can contribute to promoting the local accommodation of renewable energy and improving the efficiency of renewable energy utilization. The market trading strategy and scheduling results of the energy storage system (ESS) are affected by multiple uncertainties. Moreover, the extended nested C&CG algorithm has a high convergence accuracy and a fast convergence speed.

1. Introduction

To solve the world energy shortage and environmental pollution, there is an increasingly urgent demand on renewable energy or sustainable energy [1]. As a result, the penetration rate of distributed new energy sources on the energy consumption side has been increasing. However, with the increasing penetration level of renewable energy, the uncertainties of renewable energy generation will cause a greater impact on the safe and stable operation of the power grid, and the renewable energy accommodation will also become more prominent. In this regard, energy storage technology plays a significant role in improving the level of renewable energy accommodation and maintaining the safe and stable operation of the power system. There have been numerous studies devoted to the energy storage system (ESS). In [2], a comprehensive study was reported for determining the battery size in the battery ESS. In [3], the optimal installation of the battery ESS and capacitors was investigated using the optimization objective of maximizing the benefits of the low-voltage distribution system with a high percentage of photovoltaic (PV), and the application of a battery ESS was proved to significantly improve the voltage distribution of the power system. In [4], it was presented that the overvoltage in low-voltage power grids with a high PV penetration can be prevented through the application of an ESS.
With the continuous advancement of distributed renewable energy generation technology, the number of prosumers with “source-load” dual attributes, which can deliver electricity to the grid, is gradually increasing in the distribution network [5]. Prosumers are generally an aggregate of multiple distributed energy sources, such as customer-side distributed sources, the ESS, and electric vehicles [6,7]. Prosumers can independently manage their internal flexibility resources and achieve efficient management and control of load-side resources by virtue of the flexibility and complementarity of their aggregation units [5,8]. Prosumers can participate in electricity market transactions as independent interest subjects [9]. Numerous efforts have been devoted to energy management and energy trading strategies for prosumers. In [10], an energy management strategy for large-scale prosumer groups based on the interactive energy mechanism was proposed. In [11], a market trading strategy and an energy management method among community prosumers were proposed based on the master–slave game model. In [12], a multi-objective optimization model based on time-of-day tariff was proposed to optimize the operating cost and market trading electricity quantity of prosumers through the cooperative scheduling of “source-load-storage”. In [13], a bi-auction market mechanism was proposed to optimize both the operation and market trading strategies of prosumers. In [14], a peer-to-peer (P2P) energy trading model using the objective of the total energy cost of all smart households in a microgrid was established, and a near-optimal energy cost optimization algorithm was proposed. In [15], a P2P energy trading mechanism for sharing the ownership of an ESS among multiple users in a residential community was investigated. In [16], an energy trading scheme with the participation of sustainable users, considering both fairness and optimality among prosumers, was introduced. In [17], a low-carbon P2P energy trading model considering clean energy preferences of prosumers was investigated. In [18], a P2P energy trading model on the basis of an urban community microgrid information–physical network system, considering the coordination and complementarity of flexibility resources among prosumers, was presented.
It should be pointed out that in the existing works of [10,11,12,13,14,15,16,17,18], the impact of the uncertainties of renewable energy generation or sustainable energy on energy management and energy trading strategies of prosumers are not considered. Considering the fact that prosumers are equivalently the active load with a high percentage of renewable energy, it is necessary to fully consider the impact of the uncertainties of renewable energy generation on the overall benefits of prosumers in developing energy management and energy trading strategies. Generally, robust optimization (RO), stochastic optimization (SO), and distributed robust optimization (DRO) are typical approaches to deal with optimization problems under uncertainties. In [19], an optimal scheduling strategy for prosumers considering participation in joint energy market transactions was presented, and an RO method was used to address the uncertainty of PV generations. In [20], a day-ahead energy trading model for prosumers equipped with PV facilities was established, and an adjustable RO method was investigated to address the uncertainty of PV generations. In [21], a two-stage robust optimization (TSRO) model for prosumers considering the uncertainties of renewable energy generation and the electricity market price was developed, and the column-and-constraint generation (C&CG) algorithm was introduced to solve the linearized optimization problem. In [22], a two-stage SO model was proposed for prosumers equipped with PV and battery ESS facilities. In [23], an energy sharing strategy for neighboring PV prosumers based on an energy sharing provider equipped with an ESS was presented, and an SO method was used to deal with the uncertainty in the PV generation, the electricity price, and the load demand. In [24], a DRO approach was proposed to address the uncertainties of renewable energy generations for prosumers. In [25], a data-driven DRO model for P2P energy trading among prosumers was developed. In addition, there are some other studies that consider multiple uncertainties in their models. In [26,27], scenarios under multiple uncertainties caused by renewable energy and load were modeled using the corresponding probability distribution functions. In [28], multiple uncertainties aroused by renewable energy and load were addressed by the Latin hypercube sampling (LHS) method. In [29], multiple scenarios were generated using the LHS method. In [30], the uncertainties of harmonic source load were addressed under the proposed probability distribution model. However, in the existing approaches, the RO method relies heavily on the calculation scenarios. As the number of scenarios increases, the number of models will increase exponentially, which brings the curse of dimensionality and thus leads to a low solving efficiency. Moreover, a DRO model is a typical non-convex optimization model, which is difficult to transform into a convex problem. With the increase in uncertainty factors, the complexity of the model will also increase. An RO method can obtain the optimal robust strategy under all possible worst-case scenarios without any requirement on the probability distribution information of uncertainties. It can flexibly adjust the robustness and conservatism of the model by changing the robust parameter, and the original problem can be equivalently transformed using the C&CG algorithm, which has a high solving efficiency. In addition, a single-stage RO model is generally too conservative and pessimistic, so it is better to use a TSRO method to deal with the uncertainties in the optimization problems for prosumers.
However, most of these studies on energy management and energy trading optimization are devoted to solving a preconditioned TSRO problem, which is where the second-stage optimization is a convex optimization problem, and none have been directed to cases where the second-stage optimization of the energy management or energy trading optimization problem for prosumers is a bi-level one and the inner level is a non-convex optimization problem containing 0–1 decision variables. The models developed in these studies either do not consider the decision of the ESS in the second-stage optimization or do not consider the case where the ESS of prosumers cannot be charged and discharged simultaneously in the second-stage optimization problem.
Therefore, on the basis of the existing works, this paper considers the impact of multiple uncertainties from the sustainable energy of wind power generation and load demand on market trading strategies and scheduling results of an ESS. It establishes a general TSRO model for prosumers using the optimization objective of minimizing the overall operating cost of prosumers, where the second-stage optimization is a bi-level one and the inner level is a non-convex optimization problem containing 0–1 decision variables. In addition, the model considers the scenarios where the ESS of prosumers cannot be charged and discharged simultaneously in the second-stage optimization problem. Moreover, considering that the optimization in the second stage of the established model is a bi-level one and the inner level is a non-convex optimization problem containing 0–1 decision variables, the existing nested C&CG algorithm [31] is extended and used to solve the proposed model. Finally, the results of the market trading strategy and optimal scheduling results of the ESS considering multiple uncertainties are reported using case studies, and the convergence and effectiveness of the introduced algorithm are verified.
The remainder of this paper is organized as follows: In Section 2, the TSRO model for prosumers using the optimization objective of minimizing the overall operating cost is established. In Section 3, the nested C&CG algorithm is extended to solve the proposed TSRO model. In Section 4, a case study is solved, and the optimization results are presented, compared, and discussed. In Section 5, the conclusions are abstracted, and the limitations of the current study and suggestions for future work are suggested.

2. A TSRO Model for Prosumers Considering Multiple Uncertainties

Prosumers are generally an aggregate of customer-side flexibility resources. In this paper, the aggregation units of prosumers include customer-side wind power generation, ESS, and fixed load. Then, a box uncertainty set is introduced to characterize multiple uncertainties [32,33,34]. Finally, this paper develops a TSRO model considering multiple uncertainties using the optimization objective of minimizing the overall operating cost of prosumers.

2.1. Objective Function

For prosumers aggregated by wind power generation, the ESS, and fixed load, the optimization objective of the proposed model considering multiple uncertainties includes specifically the revenue from electricity sales, the cost of electricity purchase, and the cost of the ESS. Therefore, the objective function is formulated as follows:
min Y N o n t t = 1 T ( C t b u y R t s e l l ) + max U r e s , U L o a d min X N o n t t = 1 T C t E S S ,
where T is the dispatch period. C t b u y and R t s e l l are the cost of electricity purchase and the revenue from electricity sales at time t, respectively. Since the ESS of the prosumers will cause battery loss in charging and discharging, which will affect the battery lifetime [35], the cost of battery loss should be considered in the cost of the ESS, and C t E S S is the cost of the ESS for power charging and discharging at time t. Ures and ULoad are both uncertainty sets. Y N o n t and X N o n t are the vector sums of decision variables in the first and the second stage, Y N o n t = [ P P b t , P P s t , Z P b t , Z P s t ] and X N o n t = [ P E c t , P E d t , SOCt, Z E c t , Z E d t ], respectively.

2.1.1. Revenue from Electricity Sales

The revenue from electricity sales is
R t s e l l = μ P s t P P s t ,
where μ P s t is the price for selling electricity of prosumers at time t, and P P s t is the electrical energy sold by prosumers at time t.

2.1.2. Cost of Electricity Purchase

The cost of electricity purchase is given as
C t b u y = μ P b t P P b t ,
where μ P b t is the price for purchasing electricity of prosumers at time t, and P P b t is the electrical energy purchased by prosumers at time t.

2.1.3. Cost of ESS

The cost of ESS is calculated using
C t E S S = c E P E c t + P E d t ,
where cE is the coefficient of the charged and discharged costs of ESS, and P E c t and P E d t are the charged and discharged power of ESS at time t, respectively.

2.2. Constraints

2.2.1. Constraints on Power Balance

It is mandatory to ensure the power balance by applying
P P b t + P r e s t + P E d t P E c t P P s t P L o a d t = 0 ,
where P r e s t is the wind power generation of prosumers at time t, and P L o a d t is the internal load demand of prosumers at time t.

2.2.2. Constraints on Purchased/Sold Power

The constraints on purchased/sold power include
0 P P b t P P b max Z P b t
0 P P s t P P s max Z P s t
Z P b t + Z P s t 1 ,
where P P b max and P P s max are the maximum purchased and sold power of prosumers, respectively; Z P b t and Z P s t are both 0–1 variables, representing whether prosumers purchase and sell electricity at time t, respectively.

2.2.3. Constraints on the ESS

The constraints on the ESS include constraints on the charged and discharged power of the ESS and constraints on the capacity of the ESS.
(1)
The constraints on charged and discharged power of the ESS are given as
0 P E c t P E c max Z E c t
0 P E d t P E d max Z E d t
Z E c t + Z E d t 1 ,
where P E c max and P E d max are the maximum charged and discharged power of ESS, respectively; Z E c t and Z E d t are both 0–1 variables, representing whether ESS is charged and discharged at time t, respectively.
(2)
The constraints on the capacity of the ESS are formulated as
S O C 1 S O C i n i t P E c 1 η E c + P E d 1 η E d = 0
S O C t S O C t 1 P E c t η E c + P E d t η E d = 0
S O C 24 S O C i n i t = 0
S O C min S O C t S O C max ,
where SOCt is the quantity of electricity stored in the ESS at time t, SOCinit is the initial quantity of electricity stored in the ESS, ƞEc and ƞEd are the charged and discharged efficiencies of the ESS, respectively, and SOCmax and SOCmin are the maximum and minimum values of the capacity of the ESS, respectively.

2.3. Uncertainty Sets

Because of the random and fluctuating characteristics of wind speed, wind power generation, a sustainable energy, has strong uncertainties [36,37]. In addition, due to the influence of social, economic, and environmental issues, the actual load demand of prosumers will exhibit random fluctuations and presents substantial uncertainties [38,39,40]. Therefore, prosumers need to take into account the influence of multiple uncertainties caused by wind power generation and load demand in their day-ahead electricity market trading decisions.
In this paper, multiple uncertainties are described as box uncertainty sets. First, the forecasted data of wind power generation and load demand are obtained on the basis of their historical data. Then, their respective maximum fluctuation ranges are predicted. Finally, the robust parameter is set to obtain the uncertainty sets, which are represented as follows:
U r e s = P r e s R 1 × T : t = 1 T Z r e s , L b t + Z r e s , U b t Γ , Δ r e s , L b t = 0.2 Z r e s , L b t P r e s , p r e t , Δ r e s , U b t = 0.2 Z r e s , U b t P r e s , p r e t , P r e s , p r e t Δ r e s , L b t P r e s t P r e s , p r e t + Δ r e s , U b t , Z r e s , L b t + Z r e s , U b t 1 , t T
U L o a d = P L o a d R 1 × T : t = 1 T Z L o a d , L b t + Z L o a d , U b t Γ , Δ L o a d , L b t = 0.2 Z L o a d , L b t P L o a d , p r e t , Δ L o a d , U b t = 0.2 Z L o a d , U b t P L o a d , p r e t , P L o a d , p r e t Δ L o a d , L b t P L o a d t P L o a d , p r e t + Δ L o a d , U b t , Z L o a d , L b t + Z L o a d , U b t 1 , t T ,
where Z r e s , L b t / Z L o a d , L b t and Z r e s , U b t / Z L o a d , U b t are both 0–1 variables, representing whether the fluctuation range of wind power generation/load demand reaches the minimum and maximum values of the forecast error at time t, respectively. P r e s , p r e t and P L o a d , p r e t are both the forecasted data at time t. Г is the robust parameter, which is used for conservative adjustment.

3. Solution Methodology Based on a Nested C&CG Algorithm

3.1. Overview of the Proposed Solution Methodology

Considering that the second-stage optimization of the constructed model is a bi-level one and the inner level optimization is non-convex, containing 0–1 decision variables, the nested C&CG algorithm is extended to solve the proposed optimization model. First, the model is decomposed into a main problem and a subproblem, and they are solved alternately, which is called the outer-level C&CG process. Then, considering that the subproblem is a bi-level one and the inner level is a non-convex optimization problem containing 0–1 decision variables, the subproblem is broken down into a subproblem and a main problem, and they are also solved alternately, which is called the inner-level C&CG process. By solving the model with the introduced algorithm, one can obtain the optimal scheduling results that minimize the operating cost of prosumers under the worst case of multiple uncertainties. The simplified block diagram of the proposed solution methodology is shown in Figure 1.

3.2. C&CG Algorithm

The general TSRO model expressed in a compact matrix form is presented as follows:
min y c y + max u U min x d x s . t . A y b   E y + F x h R u ,
where c, d, A, b, E, F, h, and R represent the coefficient matrix. y and x both represent decision variable matrices, and x of the second stage does not contain 0–1 decision variables. u represents the uncertain variable matrix, and U is the uncertainty set.
In addition, the subproblem of the second stage of the model is essentially a piecewise block convex function about x, as shown in Figure 2.
Therefore, the C&CG algorithm is introduced [41]. It breaks down model (18) into a min main problem and a max-min subproblem, then solves them alternately to acquire the optimal solution.

3.2.1. Min Main Problem

The min main problem is used for solving the first-stage optimization, and its model is formulated as follows:
min y , α , x c y + α s . t .   α d x p , p q             A y b             E y + F x p h R u p , p q
where q is the number of iterations. α is an introduced auxiliary decision variable. xp is the decision variable matrix added to the min main problem at the pth iteration. up is the worst-case scenario of uncertain variables acquired by solving the max-min subproblem at the pth iteration.

3.2.2. Max-Min Subproblem

After the first-stage decision y* is obtained in the min main problem, the max-min subproblem is used for solving the second-stage optimization, and its model is given as follows:
max u U min x d x s . t .   E y * + F x h R u .

3.3. Nested C&CG Algorithm

The TSRO model for prosumers considering multiple uncertainties constructed in this paper is
min Y N o n t t = 1 T ( μ P b t P P b t μ P s t P P s t ) + max U r e s , U L o a d min X N o n t t = 1 T c E P E c t + P E d t s . t .   5 17 .
For convenience with comparison to model (20), all decision variables in model (21) are then converted into the matrix vector form, and the following compact model is obtained:
min y c y + max u U min x , z d x s . t .   A y b     E y + F x + G z h R u     J z v ,
where c, d, A, b, E, F, G, h, R, J, and v represent the coefficient matrix. y, x, and z all represent decision variable matrices, and z is a 0–1 decision variable matrix of the second stage. u represents the uncertain variable matrix, and U is the uncertainty set.
Different from the general model (18), the model constructed in (22) of this paper contains 0–1 decision variables in its second-stage decision variable matrix, so the constructed model (22) cannot be directly solved by the C&CG algorithm. Therefore, the nested C&CG algorithm is introduced to solve the constructed model (22).

3.3.1. Outer-Level C&CG Procedures

The constructed model (21) is decomposed into a main problem and a subproblem of the original problem, which can be solved alternately to acquire the optimization results.
(1)
Main Problem of the Original Problem
The optimization results of the first stage can be acquired by solving the main problem. At the lth iteration of the outer level, the worst-case scenario ul, ul = [ P r e s t , l , P L o a d t , l ], of uncertain variables is given by solving the subproblem at the previous iteration. Then, decision variables xl and zl and their corresponding constraints are added, xl = [ P E c t , l , P E d t , l , SOCt,l] and zl = [ Z E c t , l , Z E d t , l ]. Finally, the optimization results of the first-stage optimization can be acquired. The model of the main problem is presented as follows:
min η , Y N o n t t = 1 T ( μ P b t P P b t μ P s t P P s t ) + η s . t .   η t = 1 T c E P E c t , l + P E d t , l , l k     P P b t + P r e s t , l + P E d t , l P E c t , l P P s t P L o a d t , l = 0 , l k     0 P E c t , l P E c max Z E c t , l , l k     0 P E d t , l P E d max Z E d t , l , l k     Z E c t , l + Z E d t , l 1 , l k     S O C 1 , l S O C i n i t P E c 1 , l η E c + P E d 1 , l η E d = 0 , l k     S O C t , l S O C t 1 , l P E c t , l η E c + P E d t , l η E d = 0 , l k     S O C 24 , l S O C i n i t = 0 , l k     S O C min S O C t , l S O C max , l k   6 8 .
where k is the number of iterations. ƞ is an introduced auxiliary decision variable.
(2)
Subproblem of the Original Problem
After the decision being made in the first stage, the optimization results of the second stage can be acquired by solving the subproblem. At the lth iteration of the outer level, the optimal solution yl, yl = [ P P b t , l , P P s t , l , Z P b t , l , Z P s t , l ], is already given. Then, the optimization results of the second stage can be acquired by solving the following subproblem:
max U r e s , U L o a d min X N o n t t = 1 T c E P E c t + P E d t s . t .   P P b t , l + P r e s t + P E d t P E c t P P s t , l P L o a d t = 0     9 17 .

3.3.2. Inner-Level C&CG Procedures

Considering that the subproblem of the original problem is bi-level and the inner level is a non-convex optimization problem containing 0–1 decision variables, the subproblem is broken down into a subproblem and a main problem, which can be solved alternately to acquire the optimization results of the subproblem. The optimal solution yl at the lth iteration in the outer-level C&CG process is already known. Then, the optimization results of the subproblem of the original problem at the lth iteration of the outer level can be obtained by the inner-level C&CG process.
(1)
Subproblem of the Subproblem
At the rth iteration of the inner level, the worst-case scenario of uncertain variables, denoted by ur, ur = [ P r e s t , r , P L o a d t , r ], is given at the previous iteration. Then, the optimization results can be acquired by solving the following subproblem of the subproblem:
min X N o n t t = 1 T c E P E c t + P E d t s . t .   P P b t , l + P r e s t , r + P E d t P E c t P P s t , l P L o a d t , r = 0     9 15 .
(2)
Main Problem of the Subproblem
Since the feasible set of the 0–1 decision variable matrix z in the subproblem is bounded, z is denoted by {z1, …, zs}. At the rth iteration of the inner level, the optimal solution zr, zr = [ Z E c t , r , Z E d t , r ], is given by solving the subproblem of the subproblem. Then, decision variables xr, xr = [ P E c t , r , P E d t , r , SOCt,r], and their corresponding constraints are added. Finally, the optimal solution ur can be acquired by solving the following main problem of the subproblem:
max U r e s , U L o a d θ s . t .   θ min X N o n t t = 1 T c E P E c t , r + P E d t , r , r m     P P b t , l + P r e s t + P E d t , r P E c t , r P P s t , l P L o a d t = 0 , r m     0 P E c t , r P E c max Z E c t , r , r m     0 P E d t , r P E d max Z E d t , r , r m     S O C 1 , r S O C i n i t P E c 1 , r η E c + P E d 1 , r η E d = 0 , r m     S O C t , r S O C t 1 , r P E c t , r η E c + P E d t , r η E d = 0 , r m     S O C 24 , r S O C i n i t = 0 , r m     S O C min S O C t , r S O C max , r m   16 17 ,
where m is the number of iterations. θ is the introduced auxiliary decision variable.
It should be noted that there is a minimization problem in the constraints of the model (26), which is modeled as (A1) in Appendix A. Since the minimization problem (A1) is a linear programming problem, the Karush–Kuhn–Tucker (KKT) conditions can be leveraged to transform the model (26). The KKT conditions of the minimization problem (A1) are presented as (A2)–(A5) in Appendix A.
Since the complementary slackness conditions (A5) contain a large number of bilinear terms, the big-M method is used to linearize them. After linearization, the complementary slackness conditions (A5) are transformed as (A6) in Appendix B. The dual feasible conditions (A4) are also contained in (A6). Therefore, the dual feasible conditions (A4) and the complementary slackness conditions (A5) can be equivalently replaced by (A6) in Appendix B.
Finally, the model (26) can be eventually converted into a linear optimization problem which is presented as follows:
max U r e s , U L o a d θ s . t .   θ t = 1 T c E P E c t , r + P E d t , r , r m     A 2 A 3 , B 1     16 17 .
The main problem of the subproblem is readily solved by any available solver, for example, the Cplex solver of Matlab R2019b software.

3.4. The Iteration Procedure of the Introduced Nested C&CG Algorithm

To facilitate the application of the introduced algorithm, its iterative procedures are shown in Figure 3.

4. Case Study

In this paper, we select prosumers containing wind power, an ESS, and fixed load to verify the feasibility and effectiveness of the constructed model and algorithm. The parameters are shown in Table 1. The forecasted data and fluctuation range of wind power generation/load demand are presented in Figure 4 and Figure 5. The purchase and sale prices of electricity in the electricity market are shown in Figure 6.

4.1. Optimal Scheduling Results of Prosumers

In the case study, the robust parameter Г is set to 12. The final overall operating cost of prosumers is CNY 3201.03. The worst-case scenarios of multiple uncertainties caused by the wind power generation and the load demand are shown in Figure 7 and Figure 8. The market trading strategy of prosumers is shown in Figure 9, where the positive/negative value represents the electricity purchased/sold by prosumers from/to the electricity market. The optimal scheduling results of the ESS is shown in Figure 10, where the positive/negative value represents the discharged/charged power of the ESS.
As seen from Figure 7, Figure 8, Figure 9 and Figure 10, during the nighttime period (23:00–5:00 of the next day), the load demand of prosumers is at its valley period, and the wind power generation is at its peak period. The electricity price is comparatively low at this time period, so prosumers respond to the electricity price to charge the ESS on the whole, which can contribute to promoting the local accommodation of wind power during the nighttime period. Prosumers would sell their surplus electricity in the electricity market. During the daytime period (10:00–19:00), the load demand of prosumers is at its peak period, and the wind power generation is at its valley period. The electricity price is comparatively high at this time, so prosumers respond to the electricity price to discharge the ESS on the whole, which can compensate for the lack of wind power generation during the daytime period. Prosumers would purchase their insufficient electricity in the electricity market.
Prosumers respond to the electricity price to reasonably dispatch the ESS, charging the ESS in the valley period of the electricity price and discharging the ESS in the peak period of the electricity price. As a result, prosumers can utilize the peak–valley difference in the electricity price to arbitrage, thus reducing the overall operating cost. In addition, prosumers dispatch the ESS to store surplus wind power generation during the nighttime period and release the stored electricity when the wind power generation is insufficient during the daytime period. This can contribute to promoting the local accommodation of renewable energy and improving the efficiency of renewable energy utilization.

4.2. Optimal Scheduling Results of Prosumers under the Previous TSRO Model

To demonstrate the reasonability of the proposed TSRO model, the previous TSRO model of which the second-stage optimization is a convex optimization problem not containing 0–1 decision variables is solved using the C&CG algorithm. In the previous TSRO model, the ESS can be charged and discharged at the same time in the second-stage optimization. The robust parameter Г is also set to 12 for a fair comparison. The finally optimized overall operating cost of prosumers is CNY 1436.12. The market trading strategy of prosumers is shown in Figure 11, where the positive/negative value represents the electricity purchased/sold by prosumers from/to the electricity market. The optimal scheduling results of the ESS are shown in Figure 12, where the positive/negative value represents the discharged/charged power of the ESS.
As can be seen from the comparison between Figure 10 and Figure 12, ESS cannot be charged and discharged simultaneously under the proposed model, while it can be charged and discharged simultaneously under the previous TSRO model. Moreover, as can be seen from the comparison between Figure 9 and Figure 11, under the previous TSRO model, prosumers purchase less electricity from the electricity market and sell more electricity to the electricity market compared to those under the proposed TSRO model.
Compared to the proposed TSRO model, the overall operating cost of prosumers under the previous TSRO model has decreased from CNY 3201.03 to CNY 1436.12. This is because the previous TSRO model does not consider the case that the ESS cannot be charged and discharged simultaneously. Therefore, the overall operating cost of prosumers obtained from solving the previous TSRO model is smaller than that from solving the proposed TSRO model. However, it is unreasonable that the ESS can be charged and discharged simultaneously. Consequently, the proposed TSRO model is more reasonable than the previous TSRO model.

4.3. Influence of the Robust Parameter on the Market Trading Strategy and the Scheduling Results of the ESS

To analyze further the impact of multiple uncertainties caused by wind power generation and load demand on the market trading strategy and the scheduling results of the ESS, the robust parameter Г is set to 0, 6, and 12.
The market trading strategy of prosumers under different robust parameters is shown in Figure 13, where the positive/negative value represents the electricity purchased/sold by prosumers from/to the electricity market. It can be seen that the robust parameter has an impact on the market trading strategy of prosumers. As the robust parameter increases, prosumers purchase more electricity at 12:00–14:00 and sell more electricity at 5:00–6:00. This is because as the robust parameter increases, the uncertainties gradually increase, and prosumers need to purchase or sell more electricity to meet the internal energy supply and demand balance.
The optimal scheduling results of the ESS under different robust parameters is shown in Figure 14, where the positive/negative value represents the discharged/charged power of the ESS. It can be seen that the robust parameter has an impact on the optimal scheduling results of the ESS of prosumers. As the robust parameter increases, prosumers charge and discharge more frequently with increased fluctuation. This is because as the robust parameter increases, the uncertainties gradually increase; coupled with the lower charged/discharged cost of the ESS, prosumers invoke the ESS for charging and discharging more frequently to meet the internal energy supply and demand balance.
Multiple uncertainties can increase the fluctuation of the market trading strategy and the scheduling results of the ESS, so it is necessary to use the robust optimization method to address the multiple uncertainties in the constructed model.

4.4. Performance Analysis of the Nested C&CG Algorithm

The robust parameter Г is set to 12. The final overall operating cost of prosumers is CNY 3201.03. The proposed TSRO model is run on a PC with a 12th Gen Intel Core i5-12500H CPU @ 2.50 GHz CPU and 16.0 GB RAM. The iteration process of the algorithm is shown in Table 2. As shown in Table 2, the outer-level procedure converges in only two iterations, and the inner-level procedure converges in only two iterations as well. So, the introduced algorithm requires only a small number of iterations to converge. When the convergence accuracy is 10−6, the final solution time of the algorithm is only 9.75 s, which can fully satisfy the requirement of day-ahead scheduling for prosumers. It can be seen that the introduced algorithm which is simple to implement has high convergence accuracy and fast convergence speed.
It should be noted that although the existing C&CG algorithm can efficiently solve the existing TSRO model of which the second-stage optimization is a convex optimization problem not containing 0–1 decision variables, it cannot be applied directly to solve the proposed TSRO model of which the second-stage optimization is a bi-level one and the inner level is a non-convex optimization problem containing 0–1 decision variables.

4.5. Discussion

As can be seen from the aforementioned optimal scheduling results of prosumers, through reasonable dispatch of the ESS, prosumers can fully utilize the peak–valley difference in the electricity price to reduce the overall operating cost, as well as promote the local accommodation of renewable energy and improve the efficiency of renewable energy utilization.
In addition, by comparison with the optimal scheduling results of prosumers obtained from solving the previous TSRO model, it is known that the proposed TSRO model has considered the case where the ESS cannot be charged and discharged simultaneously. Therefore, the proposed TSRO model is more reasonable than the previous TSRO model, although the overall operating cost is relatively higher.
In addition, through comparison of the optimization results for prosumers under different robust parameters, it can be seen that multiple uncertainties can increase the fluctuation of the market trading strategy and the scheduling results of the ESS. Therefore, it is necessary to use the robust optimization method to address the multiple uncertainties in the proposed TSRO model.
Moreover, the introduced algorithm requires only four iterations to converge. The final solution time of the algorithm is only 9.75 s under the convergence accuracy of 10−6. The results indicate that the introduced algorithm has high convergence accuracy and fast convergence speed.

5. Conclusions

This paper constructs a TSRO model for prosumers under multiple uncertainties. In addition, considering that the second stage of the model is bi-level and the inner level is a non-convex optimization problem containing 0–1 decision variables, a nested C&CG algorithm is extended and used. Finally, a case study is solved. The results show that prosumers can dispatch the ESS reasonably to reduce the overall operating cost and promote the local accommodation of renewable energy. Compared to the previous TSRO model, the overall operating cost of prosumers under the proposed TSRO model has increased from CNY 1436.12 to CNY 3201.03. Although the overall operating cost under the proposed TSRO model is relatively higher, the proposed TSRO model has considered the scenarios where the ESS cannot be charged and discharged simultaneously, as can be seen from the case study result. Therefore, the proposed TSRO model is more reasonable than the previous TSRO model. In addition, the case study results show that the multiple uncertainties have an impact on the market trading strategy and the optimal scheduling results of the ESS. Consequently, it is necessary to adopt the robust optimization method to address the uncertainties in the corresponding model. Moreover, the extended algorithm is simple to implement and requires only 4 iterations and a short computation time of 9.75 s to converge under the convergence accuracy of 10−6, enabling an efficient solution of the model.
However, the studies on the trading strategies of prosumers are limited to single electricity transactions between prosumers and the electricity market in this paper, without making full use of the complementary characteristics of multiple prosumers. In future work, electricity transactions between prosumers and the electricity market, as well as electricity transactions among multiple prosumers, could be considered in the optimization problem to fully utilize the complementary characteristics of the electricity consumption behavior of multiple prosumers.

Author Contributions

Conceptualization, P.G.; methodology, Q.Z. and J.Z.; validation, R.Z.; formal analysis, L.L.; investigation, S.W.; software, L.C. and W.W.; funding acquisition, S.Y. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by State Grid Gansu Electric Power Company under grant 52272222000N.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The data can be requested from the corresponding author by email.

Conflicts of Interest

The authors declare no conflict of interest.

Nomenclature

ESSEnergy storage system
PVPhotovoltaic
P2PPeer-to-peer
RO/SO/DRORobust/stochastic/distributed robust optimization
TSROTwo-stage robust optimization
C&CGColumn-and-constraint generation
TIndex of hours
k/mIndex of outer-level/inner-level iterations
TSet of time intervals
Ures/ULoadSet of wind power generation/load demand uncertainty
Parameters
ГRobust parameter
μ P s t / μ P b t Price for selling/purchasing electricity of prosumers at time t
cECoefficient of the charged and discharged costs of the ESS
P r e s , p r e t / P L o a d , p r e t Forecasted data of wind power generation/load demand at time t
P P b max / P P s max Maximum purchased/sold power of prosumers
P E c max / P E d max Maximum charged/discharged power of the ESS
SOCinitInitial quantity of electricity stored in the ESS
SOCmax/SOCminMaximum/minimum value of the ESS capacity
ƞEc/ƞEdCharged/discharged efficiency of the ESS
P P s t / P P b t Electrical energy sold/purchased by prosumers at time t
P E c t / P E d t Charged/discharged power of the ESS at time t
P r e s t / P L o a d t Wind power generation/load demand of prosumers at time t
SOCtQuantity of electricity stored in the ESS at time t
Z P b t / Z P s t State of purchasing/selling electricity for prosumers at time t
Z E c t / Z E d t State of being charged/discharged of the ESS at time t

Appendix A

The minimization problem in the constraints of the model (26) is modeled as follows:
min X N o n t t = 1 T c E P E c t , r + P E d t , r , r m s . t .   P P b t , l + P r e s t + P E d t , r P E c t , r P P s t , l P L o a d t = 0 , r m     0 P E c t , r P E c max Z E c t , r , r m     0 P E d t , r P E d max Z E d t , r , r m     S O C 1 , r S O C i n i t P E c 1 , r η E c + P E d 1 , r η E d = 0 , r m     S O C t , r S O C t 1 , r P E c t , r η E c + P E d t , r η E d = 0 , r m     S O C 24 , r S O C i n i t = 0 , r m     S O C min S O C t , r S O C max , r m .
The standard KKT conditions consist of the primal feasible conditions, the first-order stationary conditions, the dual feasible conditions, and the complementary slackness conditions. The KKT conditions of the minimization problem (A1) are presented as follows:
(1)
The primal feasible conditions
P P b t , l + P r e s t + P E d t , r P E c t , r P P s t , l P L o a d t = 0 , r m 0 P E c t , r P E c max Z E c t , r , r m 0 P E d t , r P E d max Z E d t , r , r m S O C 1 , r S O C i n i t P E c 1 , r η E c + P E d 1 , r η E d = 0 , r m S O C t , r S O C t 1 , r P E c t , r η E c + P E d t , r η E d = 0 , r m S O C 24 , r S O C i n i t = 0 , r m S O C min S O C t , r S O C max , r m .
(2)
The first-order stationary conditions
c E μ e t , r η E c μ Q t , r + λ E c 1 t , r λ E c 2 t , r = 0 , r m c E + μ e t , r + μ Q t , r η E d + λ E d 1 t , r λ E d 2 t , r = 0 , r m μ Q t , r μ Q t + 1 , r + λ Q 1 t , r λ Q 2 t , r = 0 , r m μ Q 24 , r + μ Q 25 , r + λ Q 1 24 , r λ Q 2 24 , r = 0 , r m ,
where λ E c 1 t , r , λ E c 2 t , r , λ E d 1 t , r , λ E d 2 t , r , λ Q 1 t , r , λ Q 2 t , r , μ e t , r , and μ Q t , r are dual variables.
(3)
The dual feasible conditions
λ E c 1 t , r , λ E c 2 t , r , λ E d 1 t , r , λ E d 2 t , r , λ Q 1 t , r , λ Q 2 t , r 0 , r m .
(4)
The complementary slackness conditions
λ E c 1 t , r P E c t , r P E c max Z E c t , r = 0 , r m λ E c 2 t , r P E c t , r = 0 , r m λ E d 1 t , r P E d t , r P E d max Z E d t , r = 0 , r m λ E d 2 t , r P E d t , r = 0 , r m λ Q 1 t , r S O C t , r S O C max = 0 , r m λ Q 2 t , r S O C t , r + S O C min = 0 , r m .

Appendix B

After linearization with the big-M method, the complementary slackness conditions (A5) are transformed as follows:
λ E c 1 t , r M Z E c 1 t , r , r m M 1 Z E c 1 t , r P E c t , r P E c max Z E c t , r , r m λ E c 2 t , r M Z E c 2 t , r , r m P E c t , r M 1 Z E c 2 t , r , r m λ E d 1 t , r M Z E d 1 t , r , r m M 1 Z E d 1 t , r P E d t , r P E d max Z E d t , r , r m λ E d 2 t , r M Z E d 2 t , r , r m P E d t , r M 1 Z E d 2 t , r , r m λ Q 1 t , r M Z Q 1 t , r , r m M 1 Z Q 1 t , r S O C t , r S O C max , r m λ Q 2 t , r M Z Q 2 t , r , r m S O C t , r S O C min M 1 Z Q 2 t , r , r m ,
where M is a sufficiently large constant. Z E c 1 t , r , Z E c 2 t , r , Z E d 1 t , r , Z E d 2 t , r , Z Q 1 t , r , and Z Q 2 t , r are the introduced auxiliary 0–1 decision variables.

References

  1. Sen, S.; Ganguly, S. Opportunities, barriers and issues with renewable energy development—A discussion. Renew. Sustain. Energy Rev. 2017, 69, 1170–1181. [Google Scholar] [CrossRef]
  2. Yang, Y.; Bremner, S.; Menictas, C.; Kay, M. Battery energy storage system size determination in renewable energy systems: A review. Renew. Sustain. Energy Rev. 2018, 91, 109–125. [Google Scholar] [CrossRef]
  3. Khaboot, N.; Srithapon, C.; Siritaratiwat, A.; Khunkitti, P. Increasing benefits in high PV penetration distribution system by using battery enegy storage and capacitor placement based on Salp swarm algorithm. Energies 2019, 12, 4817. [Google Scholar] [CrossRef] [Green Version]
  4. Hashemi, S.; Østergaard, J. Methods and strategies for overvoltage prevention in low voltage distribution systems with PV. IET Renew. Power Gener. 2017, 11, 205–214. [Google Scholar] [CrossRef] [Green Version]
  5. Morstyn, T.; McCulloch, M.D. Multiclass energy management for peer-to-peer energy trading driven by prosumer preferences. IEEE Trans. Power Syst. 2019, 34, 4005–4014. [Google Scholar] [CrossRef]
  6. Lilla, S.; Orozco, C.; Borghetti, A.; Napolitano, F.; Tossani, F. Day-ahead scheduling of a local energy community: An alternating direction method of multipliers approach. IEEE Trans. Power Syst. 2020, 35, 1132–1142. [Google Scholar] [CrossRef]
  7. Liu, N.; Yu, X.H.; Wang, C.; Wang, J.J. Energy sharing management for microgrids with PV prosumers: A Stackelberg game approach. IEEE Trans. Ind. Inform. 2017, 13, 1088–1098. [Google Scholar] [CrossRef]
  8. Ruiz-Cortes, M.; Gonzalez-Romera, E.; Amaral-Lopes, R.; Romero-Cadaval, E.; Martins, J.; Milanes-Montero, M.I.; Barrero-Gonzalez, F. Optimal charge/discharge scheduling of batteries in microgrids of prosumers. IEEE Trans. Energy Convers. 2019, 34, 468–477. [Google Scholar] [CrossRef]
  9. Parag, Y.; Sovacool, B.K. Electricity market design for the prosumer era. Nat. Energy 2016, 1, 16032. [Google Scholar] [CrossRef]
  10. Teotia, F.; Mathuria, P.; Bhakar, R. Peer-to-peer local electricity market platform pricing strategies for prosumers. IET Gener. Transm. Distrib. 2020, 14, 4388–4397. [Google Scholar] [CrossRef]
  11. Paudel, A.; Chaudhari, K.; Long, C.; Gooi, H.B. Peer-to-peer energy trading in a prosumer-based community microgrid: A game-theoretic model. IEEE Trans. Ind. Electron. 2019, 66, 6087–6097. [Google Scholar] [CrossRef]
  12. Wang, F.; Zhou, L.D.; Ren, H.; Liu, X.L.; Shafie-Khah, M.; Catalao, J.P.S. Multi-objective optimization model of source-load-storage synergetic dispatch for building energy system based on TOU price demand response. In Proceedings of the 4th Annual Meeting of the IEEE-Industry-Applications-Society (IAS), Cincinnati, OH, USA, 29 September–5 October 2017. [Google Scholar] [CrossRef]
  13. Chen, K.X.; Lin, J.; Song, Y.H. Trading strategy optimization for a prosumer in continuous double auction based peer-to-peer market: A prediction-integration model. Appl. Energy 2019, 242, 1121–1133. [Google Scholar] [CrossRef]
  14. Alam, M.R.; St-Hilaire, M.; Kunz, T. Peer-to-peer energy trading among smart homes. Appl. Energy 2019, 238, 1434–1443. [Google Scholar] [CrossRef]
  15. Zhong, W.F.; Xie, K.; Liu, Y.; Yang, C.; Xie, S.L. Multi-resource allocation of shared energy storage: A distributed combinatorial auction approach. IEEE Trans. Smart Grid 2020, 11, 4105–4115. [Google Scholar] [CrossRef]
  16. Tushar, W.; Saha, T.K.; Yuen, C.; Liddell, P.; Bean, R.; Poor, H.V. Peer-to-peer energy trading with sustainable user participation: A game theoretic approach. IEEE Access 2018, 6, 62932–62943. [Google Scholar] [CrossRef]
  17. Park, D.H.; Park, J.B.; Lee, K.Y.; Son, S.Y.; Roh, J.H. A bidding-based peer-to-peer energy transaction model considering the green energy preference in virtual energy community. IEEE Access 2021, 9, 87410–87419. [Google Scholar] [CrossRef]
  18. Chen, S.J.; Liu, C.C. From demand response to transactive energy: State of the art. J. Mod. Power Syst. Clean Energy 2017, 5, 10–19. [Google Scholar] [CrossRef] [Green Version]
  19. Hu, G.; Chen, X.; Wu, C.; Zhou, Y. Virtual prosumer aggregator in joint energy and auxiliary service market: A robust cooperative game approach. In Proceedings of the 2021 IEEE Sustainable Power and Energy Conference (iSPEC), Nanjing, China, 23–25 December 2021. [Google Scholar] [CrossRef]
  20. Correa-Florez, C.A.; Michiorri, A.; Kariniotakis, G. Comparative analysis of adjustable robust optimization alternatives for the participation of aggregated residential prosumers in electricity markets. Energies 2019, 12, 1019. [Google Scholar] [CrossRef] [Green Version]
  21. Yin, S.; Ai, Q.; Li, Z.; Zhang, Y.; Lu, T. Energy management for aggregate prosumers in a virtual power plant: A robust Stackelberg game approach. Int. J. Electr. Power Energy Syst. 2020, 117, 105605. [Google Scholar] [CrossRef]
  22. Agathokleous, C.; Steen, D. Stochastic operation scheduling model for a Swedish prosumer with PV and BESS in Nordic day-ahead electricity market. In Proceedings of the 2019 IEEE Milan PowerTech, Milan, Italy, 23–27 June 2019. [Google Scholar] [CrossRef] [Green Version]
  23. Liu, N.A.; Cheng, M.Y.; Yu, X.H.; Zhong, J.X.; Lei, J.Y. Energy-sharing provider for PV prosumer clusters: A hybrid approach using stochastic programming and Stackelberg game. IEEE Trans. Ind. Electron. 2018, 65, 6740–6750. [Google Scholar] [CrossRef]
  24. Sun, G.; Wang, R.; Chen, S.; Wu, C.; Wei, Z.; Zang, H. Nash–Cournot power market model with a high penetration of prosumers: A distributionally robust optimization approach. J. Clean. Prod. 2022, 353, 131565. [Google Scholar] [CrossRef]
  25. Li, J.; Khodayar, M.E.; Wang, J.; Zhou, B. Data-driven distributionally robust co-optimization of p2p energy trading and network operation for interconnected microgrids. IEEE Trans. Smart Grid 2021, 12, 5172–5184. [Google Scholar] [CrossRef]
  26. Zhou, S.; Han, Y.; Yang, P.; Mahmoud, K.; Lehtonen, M.; Darwish, M.M.; Zalhaf, A.S. An optimal network constraint-based joint expansion planning model for modern distribution networks with multi-types intermittent RERS. Renew. Energy 2022, 194, 137–151. [Google Scholar] [CrossRef]
  27. Zhou, S.; Han, Y.; Chen, S.; Yang, P.; Wang, C.; Zalhaf, A.S. Joint expansion planning of distribution network with uncertainty of demand load and renewable energy. Energy Rep. 2022, 8, 310–319. [Google Scholar] [CrossRef]
  28. Zhou, S.; Han, Y.; Chen, S.; Yang, P.; Mahmoud, K.; Darwish, M.M.; Matti, L.; Zalhaf, A.S. A multiple uncertainty-based bi-level expansion planning paradigm for distribution networks complying with energy storage system functionalities. Energy 2023, 275, 127511. [Google Scholar] [CrossRef]
  29. Zhou, S.; Han, Y.; Zalhaf, A.S.; Chen, S.; Zhou, T.; Yang, P.; Elboshy, B. A novel multi-objective scheduling model for grid-connected hydro-wind-PV-battery complementary system under extreme weather: A case study of Sichuan, China. Renew. Energy 2023, 212, 818–833. [Google Scholar] [CrossRef]
  30. Fu, J.; Han, Y.; Li, W.; Feng, Y.; Zalhaf, A.S.; Zhou, S.; Yang, P.; Wang, C. A novel optimization strategy for line loss reduction in distribution networks with large penetration of distributed generation. Int. J. Electr. Power Energy Syst. 2023, 150, 109112. [Google Scholar] [CrossRef]
  31. Long, Z.; Bo, Z. An Exact Algorithm for Two-Stage Robust Optimization with Mixed Integer Recourse Problems. Available online: https://optimization-online.org/?p=11876 (accessed on 21 May 2023).
  32. Leyffer, S.; Menickelly, M.; Munson, T.; Vanaret, C.; Wild, S.M. A survey of nonlinear robust optimization. INFOR Inf. Syst. Oper. Res. 2020, 58, 342–373. [Google Scholar] [CrossRef]
  33. Shang, K.; Chan, F.T.S.; Karungaru, S.; Terada, K.; Feng, Z.R.; Ke, L.J. Two-stage robust optimization for the orienteering problem with stochastic weights. Complexity 2020, 2020, 5649821. [Google Scholar] [CrossRef]
  34. Yang, Y.W.; Zhou, R.J.; Ran, X.H. Robust optimization with box set for reactive power optimization in wind power integrated system. In Proceedings of the General Meeting of the IEEE-Power-and-Energy-Society, San Diego, CA, USA, 22–26 July 2012. [Google Scholar] [CrossRef]
  35. Mongird, K.; Viswanathan, V.; Balducci, P.; Alam, J.; Fotedar, V.; Koritarov, V.; Hadjerioua, B. An evaluation of energy storage cost and performance characteristics. Energies 2020, 13, 3307. [Google Scholar] [CrossRef]
  36. Liu, Y.; Nair, N.K.C. A two-stage stochastic dynamic economic dispatch model considering wind uncertainty. IEEE Trans. Sustain. Energy 2016, 7, 819–829. [Google Scholar] [CrossRef]
  37. Xiong, P.; Jirutitijaroen, P.; Singh, C. A distributionally robust optimization model for unit commitment considering uncertain wind power generation. IEEE Trans. Power Syst. 2017, 32, 39–49. [Google Scholar] [CrossRef]
  38. Yang, J.; Su, C. Robust optimization of microgrid based on renewable distributed power generation and load demand uncertainty. Energy 2021, 223, 120043. [Google Scholar] [CrossRef]
  39. Yu, Y.; Zhao, N.; Xu, Z.; Li, J.Y.; Wen, X.S. Robust investment for demand response in a distribution network considering wind power and load demand uncertainties. Int. J. Emerg. Electr. Power Syst. 2019, 20, 20180218. [Google Scholar] [CrossRef]
  40. Xu, Y.; Xie, L.; Singh, C. Optimal scheduling and operation of load aggregators with electric energy storage facing price and demand uncertainties. In Proceedings of the 2011 North American Power Symposium, Boston, MA, USA, 4–6 August 2011. [Google Scholar] [CrossRef]
  41. Zeng, B.; Zhao, L. Solving two-stage robust optimization problems using a column-and-constraint generation method. Oper. Res. Lett. 2013, 41, 457–461. [Google Scholar] [CrossRef]
Figure 1. The simplified block diagram of the proposed solution methodology.
Figure 1. The simplified block diagram of the proposed solution methodology.
Sustainability 15 09769 g001
Figure 2. The max-min subproblem.
Figure 2. The max-min subproblem.
Sustainability 15 09769 g002
Figure 3. The iterative procedures of the introduced nested C&CG algorithm.
Figure 3. The iterative procedures of the introduced nested C&CG algorithm.
Sustainability 15 09769 g003
Figure 4. Forecasted data and fluctuation range of wind power generation.
Figure 4. Forecasted data and fluctuation range of wind power generation.
Sustainability 15 09769 g004
Figure 5. Forecasted data and fluctuation range of load demand.
Figure 5. Forecasted data and fluctuation range of load demand.
Sustainability 15 09769 g005
Figure 6. Purchase and sale prices of power in the electricity market.
Figure 6. Purchase and sale prices of power in the electricity market.
Sustainability 15 09769 g006
Figure 7. Worst-case scenario of wind power generation.
Figure 7. Worst-case scenario of wind power generation.
Sustainability 15 09769 g007
Figure 8. Worst-case scenario of load demand.
Figure 8. Worst-case scenario of load demand.
Sustainability 15 09769 g008
Figure 9. Market trading strategy.
Figure 9. Market trading strategy.
Sustainability 15 09769 g009
Figure 10. Optimal scheduling results of the ESS.
Figure 10. Optimal scheduling results of the ESS.
Sustainability 15 09769 g010
Figure 11. Market trading strategy under the previous TSRO model.
Figure 11. Market trading strategy under the previous TSRO model.
Sustainability 15 09769 g011
Figure 12. Optimal scheduling results of the ESS under the previous TSRO model.
Figure 12. Optimal scheduling results of the ESS under the previous TSRO model.
Sustainability 15 09769 g012
Figure 13. Market trading strategy under different robust parameters.
Figure 13. Market trading strategy under different robust parameters.
Sustainability 15 09769 g013
Figure 14. Optimal scheduling results of the ESS under different robust parameters.
Figure 14. Optimal scheduling results of the ESS under different robust parameters.
Sustainability 15 09769 g014
Table 1. Parameter setting.
Table 1. Parameter setting.
ParametersValue of Parameters
Upper limit of purchased/sold power (kW)450/450
Coefficient of charged and discharged cost of the ESS (CNY/kW)0.05
Upper limit of charged/discharged power of the ESS (kW)100/100
Initial quantity of electricity stored in the ESS (kWh)125
Upper/lower limit of the capacity of the ESS (kWh)225/25
Charged/discharged efficiency of the ESS0.98/0.98
Table 2. Iterative process of the nested C&CG algorithm.
Table 2. Iterative process of the nested C&CG algorithm.
Outer LevelInner Level
Iteration Ordinal NumberLower BoundUpper BoundIteration Ordinal NumberLower BoundUpper Bound
13200.623201.03140.008240.4164
240.416440.4164
23201.033201.03140.416450.0102
250.010250.0102
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Zhou, Q.; Zhang, J.; Gao, P.; Zhang, R.; Liu, L.; Wang, S.; Cheng, L.; Wang, W.; Yang, S. Two-Stage Robust Optimization for Prosumers Considering Uncertainties from Sustainable Energy of Wind Power Generation and Load Demand Based on Nested C&CG Algorithm. Sustainability 2023, 15, 9769. https://doi.org/10.3390/su15129769

AMA Style

Zhou Q, Zhang J, Gao P, Zhang R, Liu L, Wang S, Cheng L, Wang W, Yang S. Two-Stage Robust Optimization for Prosumers Considering Uncertainties from Sustainable Energy of Wind Power Generation and Load Demand Based on Nested C&CG Algorithm. Sustainability. 2023; 15(12):9769. https://doi.org/10.3390/su15129769

Chicago/Turabian Style

Zhou, Qiang, Jianmei Zhang, Pengfei Gao, Ruixiao Zhang, Lijuan Liu, Sheng Wang, Lin Cheng, Wei Wang, and Shiyou Yang. 2023. "Two-Stage Robust Optimization for Prosumers Considering Uncertainties from Sustainable Energy of Wind Power Generation and Load Demand Based on Nested C&CG Algorithm" Sustainability 15, no. 12: 9769. https://doi.org/10.3390/su15129769

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop