Next Article in Journal
A Fully Three Dimensional Semianalytical Model for Shale Gas Reservoirs with Hydraulic Fractures
Previous Article in Journal
A Power System Network Splitting Strategy Based on Contingency Analysis
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Network-Constrained Unit Commitment Based on Reserve Models Fully Considering the Stochastic Characteristics of Wind Power

State Key Laboratory of Advanced Electromagnetic Engineering and Technology, Huazhong University of Science and Technology, No. 1037, Luoyu Road, Wuhan 430074, China
*
Author to whom correspondence should be addressed.
Energies 2018, 11(2), 435; https://doi.org/10.3390/en11020435
Submission received: 21 January 2018 / Revised: 9 February 2018 / Accepted: 11 February 2018 / Published: 15 February 2018
(This article belongs to the Section F: Electrical Engineering)

Abstract

:
The existing optimization approaches regarding network-constrained unit commitment with large wind power integration face great difficulties in reconciling the two crucial but contradictory objectives: computational efficiency and the economy of the solutions. This paper proposes a new network-constrained unit commitment approach, which aims to better achieve these two objectives, by introducing newly proposed reserve models and simplified network constraints. This approach constructs the reserve models based on a sufficiently large number of stochastic wind power scenarios to fully and accurately capture the stochastic characteristics of wind power. These reserve models are directly incorporated into the traditional unit commitment formulation to simultaneously optimize the on/off decision variables and system reserve levels, therefore, this approach can comprehensively evaluate the costs and benefits of the scheduled reserves and thus produce very economical schedule. Meanwhile, these reserve models bring in very little computational burden because they simply consist of a small number of continuous variables and linear constraints. Besides, this approach can evaluate the impact of network congestion on the schedule by just introducing a small number of network constraints that are closely related to network congestion, i.e., the simplified network constraints, and thus concurrently ensures its high computational efficiency. Numerical results show that the proposed approach can produce more economical schedule than stochastic approach and deterministic approach but has similar computational efficiency as the deterministic approach.

1. Introduction

Wind power is recognized as an important part of the renewable energy mix to achieve global climate and sustainability objectives and has undergone a substantial growth in many power systems in recent years [1,2]. However, due to its intrinsic intermittent and uncertain nature [3], wind power can only be predictable to such a limited extent such that large wind power integration aggravates the operational risks of power systems [4,5]. Day-ahead unit commitment (UC) is one of the crucial short-term operation problems and can manage many kinds of operational risks, including the risks imposed by wind power variability, by scheduling flexible resources.
The existing optimization approaches regarding UC with large wind power integration can be mainly classified into four types: deterministic UC (DUC) [6,7,8], robust UC [9,10,11], interval UC [12,13,14], and stochastic UC (SUC) [15,16,17,18,19,20,21]. For UC approaches, computational efficiency and the economy of solutions are two crucial objectives, which are quite difficult to achieve concurrently using the existing approaches. DUC follows the traditional UC framework to maintain computational efficiency and sets additional predefined system reserve levels to accommodate the operational risks imposed by wind power, but DUC fails to evaluate the costs and benefits of such reserves and may result in bad economic performance [22]. Robust UC minimizes the worst-case costs regarding all possible outcomes of the uncertain parameters and produces very conservative solutions [23]. Interval UC represents wind power characteristics through only three non-probabilistic scenarios and imposes feasibility constraints on the transitions among these scenarios. The extreme transitions have a very low probability and lead to very conservative solutions [14]. SUC represents wind power characteristics by many stochastic scenarios containing the probability information and simultaneously optimizes the on/off decision variables and system reserve levels, instead of the predefined system reserve levels in the DUC, so as to comprehensively evaluate the costs and benefits of such scheduled reserves [24]. Therefore, it produces more economical solutions, compared to the above three kinds of approaches, but suffers from a much heavier computational burden. SUC often resorts to scenario reduction techniques to attain computational feasibility at the cost of partially sacrificing its economic performance. Reduced scenarios inevitably discard some stochastic characteristics information of wind power, especially when the adopted scenarios are very few, the loss of stochastic characteristics information will be so severe that it may largely impair the advantage of SUC in the economic performance over other approaches [25]. Such occasions may frequently happen when SUC is applied to large-scale power systems due to computational efficiency limits.
One remarkable challenge faced by UC with significant wind power penetration comes from reserve optimization, which has been a crucial part of the research regarding the power system operation with large wind power integration. There are abundant research achievements concerning reserve optimization, including the related research incorporated in the unit commitment problems and also some specialized research [18,26,27]. An important contribution presented in [22] recognized that economical reserve strategy should comprehensively evaluate the costs and benefits of the scheduled reserves. Such evaluations are more easily realized by simultaneously optimizing the system reserve levels and on/off decision variables and are thus suitable to be incorporated in the UC problems. However, as we have discussed above, the existing UC approaches face great difficulties in reconciling the contradiction between computational efficiency and the economy of the solutions (including the reserve strategy).
One motivation of this work is to find a more concise and effective way to describe the relationships between the costs and benefits of the scheduled reserves so that the above two objectives (computational efficiency and the economy of the solutions) can be better achieved. The relationships between the costs and benefits of the reserves are translated in this paper into the relationships between the system reserve levels and the lost load (or wind power curtailment) caused by reserve shortage so that such relationships can be described by newly proposed reserve models. The reserve models can then be incorporated into the traditional UC formulation to evaluate the costs and benefits of reserves. Furthermore, the reserve models simply consist of a small number of continuous variables and linear constraints and thus bring in very little computational burden.
The above reserve optimization focuses on the total amount of system reserve requirements caused by wind power but neglects that the scheduled reserves may be blocked in real-time operation due to network congestion. In addition, network congestion may not only affect reserve applicability but also occur in the case that has no relationship with reserve applicability, such as the day-ahead schedule under the expected wind power production. The impact of network congestion is usually studied in the network-constrained unit commitment (NCUC) problems, which are also called security-constrained unit commitment problems in some articles, but the latter terminology may lead to unnecessary misunderstanding for some readers. The NCUC problems can be solved by the above-mentioned four types of UC approaches, but only SUC can evaluate the costs and benefits of lost load (or wind power curtailment) caused by network congestion under different wind power scenarios through scenario-related network constraints and thus produce more economical schedule. However, the network constraints in the SUC need to account for all the periods and all the adopted wind power scenarios, resulting in huge computational burden.
The other motivation of this work is to evaluate the impact of network congestion on the schedule at much less computational burden compared to SUC. In practice, network congestion only occurs in a small proportion of periods and scenarios for the actual power systems that have been well planned. Therefore, picking out such periods and scenarios enables to evaluate the impact of network congestion on the schedule (including reserve strategy) through a much smaller number of network constraints compared to SUC. In addition, inspired by [7], only a small number of transmission lines that are easily congested are considered in the proposed approach to further decrease the computational burden. The contributions of this work are threefold:
(1)
This work proposes a new NCUC approach that introduces newly proposed reserve models and simplified network constraints. This new approach aims to produce very economical schedule at high computational efficiency.
(2)
This work proposes reserve models which fully reflect the impact of the stochastic characteristics of wind power on the reserve optimization but bring in very little computational burden. The reserve models can be directly incorporated into the traditional UC formulation and thus enable the new NCUC approach to evaluate the costs and benefits of the scheduled reserves in a concise and effective way and thus to produce very economical schedule.
(3)
This work proposes the simplified network constraints, which enable the new NCUC approach to evaluate the impact of network congestion on the schedule at low computational burden.
The organization chart of other parts of this paper is shown in Figure 1. Section 2 proposes the reserve models fully considering the stochastic characteristics of wind power. Section 3 analyses the impact of network congestion and proposes the simplified network constraints accordingly. The newly proposed reserve models and simplified network constraints are incorporated into the formulation of the proposed NCUC approach, which is presented in Section 4. Section 5 validated the effectiveness of the proposed approach. Conclusions are drawn in Section 6.

2. Reserve Models Fully Considering Stochastic Characteristics of Wind Power

For description convenience, net load, load minus wind power output, is used here to describe the reserve requirements incurred by wind power. The net load change in the consecutive periods can be illustrated in Figure 2, in which the white circles represent the forecasted net load and the shaded circles represent the boundaries of the net load considering the uncertainty. Reserve requirements incurred by net load can be classified into two aspects: one is the reserve requirements incurred by the forecasting errors of net load in a single period; the other is the ramping reserve requirements incurred by the change of net load in two consecutive periods. Correspondingly, reserve optimization consists of two aspects: one is the single-period reserve optimization, which aims to optimize the range of net load that the single-period reserves covers (shown as black circle in Figure 2); the other is the ramping reserve optimization, which aims to optimize the ramping amplitude of net load in two consecutive periods that the ramping reserves covers (the amplitude of ramping up reserve requirements is between zero and the amplitude of the black dashed lines, the amplitude of ramping down reserve requirements is between zero and the amplitude of the black dotted lines, shown in Figure 2).
Reserve models are constructed to implement the above single-period reserve optimization and ramping reserve optimization by reflecting the relationships between the system reserve levels and lost load (or wind power curtailment) caused by reserve shortage. To assess specifically the effect of characteristics of wind power, no uncertain demand and no equipment failure are considered in this paper. Therefore, the change of net load can be recognized to be caused by the stochastic nature of wind power. Reserve models are constructed based on the stochastic characteristics of wind power, which is presented in Section 2.1. Reserve models consist of single-period reserve models and additional ramping reserve models, which are presented in Section 2.2 and Section 2.3, respectively. The linearization of all these reserve models is introduced in Section 2.4.

2.1. Stochastic Characteristics of Wind Power

From the perspective of reserve optimization, the stochastic characteristics of wind power can be classified into two aspects: wind power uncertainty in a single period and wind power change in two consecutive periods. The former one is caused by wind power prediction errors, called single-period wind power characteristics hereinafter. The latter one is affected by the combined effect of wind power prediction errors and wind power variability, also abbreviated as ramping event hereinafter. Wind power stochastic characteristics can be described by the stochastic wind power scenarios tagged with probability information. Wind power scenarios are the time-dependent series of wind power production, including the ramping events as well as the single-period wind power characteristics.
The number of scenarios is a crucial factor that affects the approximation precision of the stochastic characteristics of wind power. Reduced scenarios inevitably discard some stochastic characteristics information of wind power, especially when the adopted scenarios are very few, the loss of stochastic characteristics information is severe. Moreover, reference [28] has verified that scenario reduction techniques fail to concurrently maintain both the single-period wind power characteristics and ramping events.
In order to fully and accurately capture the wind power stochastic characteristics, a sufficiently large number of scenarios are used in the following to construct the reserve models because the number of the adopted scenarios does not affect the complexity of the reserve models. Therefore, reserve models enable the proposed UC approach has a great advantage over SUC that adopts a very limited number of scenarios, in accurately modeling the wind power stochastic characteristics.
Scenario generation method in [29] is applied in this paper to generate the required number of scenarios with equal probability π s = 1 / S that constitute the scenario set W = { W s ,   s = 1 , , S } , in which W s = { w t s ,   t = 1 , , T } . W s is the sth wind power scenario, w t s is wind power production in period t and scenario s with the probability π t s = 1 / S . This scenario generation method accounts for both the interdependence relationship of prediction errors among different periods and the single-period probability distributions of wind power. Therefore, it can well describe both the single-period wind power characteristics and ramping events.

2.2. Single-Period Reserve Models

2.2.1. Single-Period Reserve Requirements

For description convenience, this subsection uses the probability density function (PDF) of wind power production to describe the single-period wind power characteristics. Theoretically, the set constituted by the wind power production of all the scenarios in the same period can be recognized as the discrete approximation of the PDF of wind power production in that period. Without losing generality, the PDF of wind power production can be assumed to accord with some kind of function f w ( w t ) , the illustrated diagram of which is shown in Figure 3. Here, wind power production denotes the sum of wind power production at every bus node. The PDF of wind power production in Figure 3 is truncated at the boundaries, the probability density of which is shown in Equation (1), because wind power production should be not less than zero and not greater than the installed capacity w max . In Figure 3, w t F and w t E represent the point forecast value and the expected value of wind power production. The expected value w t E can be expressed as Equation (2), including the integral form and accumulation form:
f w ( 0 ) = 0 f w ( w t ) d ( w t ) ;   f w ( w max ) = w max + f w ( w t ) d ( w t )
w t E = 0 w max f w ( w t ) w t d ( w t ) = s π t s w t s
From the viewpoint of a single period, reserve requirements are used to compensate the deviation of actual wind power production from the reference value that is set as w t E . Single-period up reserve (SPUR) requirements can be recognized as the negative deviation of actual wind power production, i.e., r t + = w t E w t . Single-period down reserve (SPDR) requirements can be recognized as the positive deviation, i.e., r t = w t w t E . The PDFs of the SPUR and SPDR requirements are illustrated in Figure 4a,b. The functions f r + ( r t + ) and f r ( r t ) should be truncated at their left boundaries because r t + 0 and r t 0 , the probability density of which is amended as Equations (3) and (4), respectively.
f r + ( 0 ) = w t E w max f w ( w t ) d w t
f r ( 0 ) = 0 w t E f w ( w t ) d w t

2.2.2. Construction of Single-Period Reserve Models

The power system has to shed load when the SPUR requirement r t + exceeds the given SPUR level r v t + ( 0 r v t + w t E ) , i.e., r t + > r v t + . The expected load not served (ELNS) r d t + caused by SPUR shortage can be expressed as Equation (5), including the integral form and accumulation form. In the accumulation form, the condition r t + > r v t + is transformed as w t s w t E r v t + , the symbol s | w t s w t E r v t + represents the scenario set that contains all the scenarios that meet the condition w t s w t E r v t + . This way of representing the scenario set is also adopted hereinafter. Equation (5) denotes the relationship between the SPUR level and the ELNS caused by SPUR shortage, called the SPUR model.
Similarly, the power system has to curtail wind power production when the SPDR requirement r t excesses the given SPDR level r v t ( 0 r v t w max w t E ) , i.e., r t > r v t . The expected wind power curtailment (EWC) r d t caused by SPDR shortage can be expressed as Equation (6). Equation (6) denotes the relationship between the SPDR level and the EWC caused by SPDR shortage, called the SPDR model:
r d t + ( r v t + ) = r v t + w t E f r + ( r t + ) ( r t + r v t + ) d r t + = s | w t s w t E r v t + π t s ( w t E r v t + w t s )
r d t ( r v t ) = r v t w max w t E f r ( r t ) ( r t r v t ) d r t = s | w t s w t E + r v t π t s ( w t s w t E r v t )
Note that the SPDR model may fail to accurately estimate the EWC caused by SPDR shortage if the expected value w t E excesses the maximum wind power production w t m that the power system can accommodate, i.e., w t E > w t m , shown in Figure 4b. The revisions concerning such a case will be described in detail Section 4.2.3.

2.3. Additional Ramping Reserve Models

Before constructing additional ramping reserve models, we should first recognize that some ramping reserve requirements have already been satisfied through other ways and should be excluded in the construction of additional ramping reserve models to avoid overlapping of the ramping reserves.
Ramping reserve requirements are caused by the following factors (shown in Figure 5, taking ramping up reserve in two consecutive periods as an example): variation of expected net load ( n d t E n d t 1 E ), wind power prediction deviation ( r v ˜ t + ), and additional ramping reserve requirements ( r a t + ). Ramping reserve requirements caused by expected net load, including load variation ( l d t l d t 1 ) and expected wind power variation ( w t 1 E w t E ), can be covered by system power balancing constraint. Ramping reserve requirements caused by wind power prediction deviation can be covered by single-period reserve levels r v ˜ t + , r v ˜ t , which should be calculated in advance before constructing the additional ramping reserve models. Additional ramping reserve requirements are used to construct the additional ramping reserve models.

2.3.1. Additional Ramping Reserve Requirements

The existing ramping capacity can cover the expected wind power variation and wind power prediction deviation. Additional ramping reserve requirements can be calculated by subtracting such existing ramping capacity from the actual wind power variation in two consecutive periods (the amplitude of ramping event). The existing ramping up reserve capacity for expected wind power variation and wind power prediction deviation is r p t + = max ( r v ˜ t + , r v ˜ t + + ( w t 1 E w t E ) ) and the existing ramping down reserve capacity is r p t = max ( r v ˜ t , r v ˜ t + ( w t E w t 1 E ) ) . Then, additional ramping up reserve (ARUR) requirement of scenario s is r a t s + = w t 1 , s w t s r p t + and additional ramping down reserve (ARDR) requirement is r a t s = w t s w t 1 , s r p t . The value of r a t s + , r a t s should be set at zero when w t 1 , s w t s < r p t + or w t s w t 1 , s < r p t because only non-negative additional ramping reserve requirements need to be taken into account.
Additional ramping reserve requirements are calculated after given single-period reserve levels r v ˜ t + , r v ˜ t , which can cover the wind power range I t w = [ w t E r v ˜ t + , w t E + r v ˜ t ] . Because the lost load (or wind power curtailment) caused by wind power scenarios beyond the range I t w has been considered in the single-period reserve models, therefore, additional ramping reserve requirements should be limited to the range I t w to avoid the repeated calculation of such lost load (or wind power curtailment). For additional ramping reserve requirements, wind power production beyond this range should be adjusted to the corresponding nearer boundaries of the range I t w . After adjustment, wind power production w t s , w t 1 , s is rewritten as w t s , w t 1 , s . Accordingly, the ARUR requirement is rewritten as r a t s + = w t 1 , s w t s r p t + and the ARDR requirement as r a t s = w t s w t 1 , s r p t .

2.3.2. Construction of Additional Ramping Reserve Models

The power system has to shed load when the ARUR requirement r a t s + excesses the given ARUR level r v a t + , i.e., r a t s + > r v a t + . The ELNS r d a t + caused by ARUR shortage can be expressed as Equation (7). Equation (7) denotes the relationship between the ARUR level and the ELNS caused by ARUR shortage, called the ARUR model.
Similarly, the power system has to curtail wind power production when the ARDR requirement r a t s excesses the given ARDR level r v a t , i.e., r a t s > r v a t . The EWC r d a t caused by ARDR shortage can be expressed as Equation (8). Equation (8) denotes the relationship between the ARDR level and the EWC caused by ARDR shortage, called the ARDR model. Note that ARDR model faces the same problem as the SPDR model when w t E > w t m , which will be solved together in Section 4.2.3:
r d a t + ( r v a t + ) = s | r a t s + > r v a t + π t s ( r a t s + r v a t + )
r d a t ( r v a t ) = s | r a t s > r v a t π t s ( r a t s r v a t )
According to the definition of additional ramping reserve requirements, a non-negative additional ramping reserve requirements means that the amplitudes of the corresponding ramping events should excess the corresponding existing ramping capacity, thus, such ramping events have large amplitudes but theoretically low probability. Meanwhile, additional ramping reserve requirements have relatively low value because they are calculated by subtracting the existing ramping capacity from the amplitudes of ramping events. Therefore, additional ramping reserve models constructed based on additional ramping reserve requirements have much less impact on the solutions, compared to the single-period reserve models, and can be regarded as the supplements of the latter ones to further enhance the reliability of the schedule to withstand the risks of both load shedding and wind power curtailment.

2.4. Linearization of Reserve Models

The reserve models in Section 2.2 and Section 2.3 are non-linear and thus are not conducive to being incorporated into the UC formulation. But these models can be linearized by the piecewise linear functions Equations (9) and (10) [30] because they have convex statistical characteristics, illustrated in Figure 6. For simplicity, variables r d t + , r d t , r d a t + , r d a t are replaced by variable r d t in Equations (9) and (10), r v t + , r v t , r v a t + , r v a t by r v t :
r d t ( r v t ) = r d t ( 0 ) + k α t k r v t k ,   0 r v t k r v t max / N
r v t = k r v t k
where r v t k is the k-th segment of r v t , α t k = ( r d t ( r v t k max ) r d t ( r v t , k 1 max ) ) N / r v t max , r v t k max = r v t max k / N , N is the number of the segments.

3. Network Congestion Analysis

The above reserve models focus on the optimization of system reserve levels but neglect that the scheduled reserves may be blocked in real-time operation due to network congestion. In addition, network congestion may not only affect reserve applicability but also occur in the case that has no relationship with reserve applicability, such as the day-ahead schedule under the expected wind power production. Network congestion may result in the increase of real-time operating costs caused by the unexpected lost load or wind power curtailment. However, it is also not an economical choice or even infeasible to avoid such unexpected lost load and wind power curtailment in all the possible wind power scenarios. The ideal remedy is to evaluate the costs/benefits of such lost load (or wind power curtailment) caused by network congestion and to optimize the schedule accordingly. SUC adopts this remedy by introducing many scenario-related network constraints to evaluate the impact of network congestion on the reserve applicability, resulting in heavy computational burden.
To avoid the heavy computational burden caused by many scenario-related network constraints, this section only selects the network constraints (simplified network constraints) that are closely related to network congestion, instead of all the network constraints adopted in the SUC. Further, this section proposes the estimating functions of lost load and wind power curtailment caused by network congestion so that the following UC formulation can evaluate the costs/benefits of such lost load and wind power curtailment.

3.1. Simplified Network Constraints

Evaluating the impact of network congestion needs to resort to the scenario-related network constraints because evaluating reserve applicability should simulate the possible realizations in the real-time operation through stochastic scenarios and because judging network congestion should be on the basis of power flow calculation, which depends on the injected power at every node in the same period and the same scenario. Because the expected wind power production is the expected value of all the stochastic wind power scenarios, scenario-related network constraints can naturally reflect the impact of network congestion on the day-ahead schedule under the expected wind power production.
The network constraints in the SUC needs to contain the power flow constraints of all lines in all periods and scenarios. In the actual power systems that have been well planned, however, network congestion only occurs in a small proportion of periods and wind power scenarios, furthermore, it mainly occurs in a small number of transmission lines. By identifying the set S N c of such pairs of period and scenario ( t , s ) and the set Lc of lines that easily suffer network congestion, only a small number of network constraints are required to reflect the impacts of network congestion on the schedule. The process to obtain such sets will be explained in Section 4.2.2.
The simplified network constraints Sgd include power balance constraint Equation (11), transmission capacity constraint Equation (12), power output constraint of the unit Equation (13), and boundary constraints for load shedding and wind power curtailment Equation (14):
i p i t s = j ( l d j t w j t s l s j t s + w c j t s ) ,   ( t , s ) S N c .
p f l max A l ( Y g × P t s + W P t s W C t s L D t L S t s ) = p f l s p f l max ,   l L c , ( t , s ) S N c .
p i t r g i t p i t s p i t + r g i t + ,   i , ( t , s ) S N c .
0 w c j t s w j t s , 0 l s j t s l d j t ,   j , ( t , s ) S N c .

3.2. Estimating Functions of ELNS and EWC Caused by Network Congestion

Estimating the ELNS and EWC caused by network congestion should exclude the impact of the reserve shortage so as to avoid the overlapping calculation of the ELNS and EWC. Because additional ramping reserves have much less impact compared to single-period reserves, for simplicity, this subsection only considers the impact of the single-period reserves, neglecting that of additional ramping reserves.
The ELNS and EWC caused by network congestion are related to wind power range I t w . Given the range I t w , there are two cases, namely, w t s I t w and w t s I t w . If w t s I t w , load shedding l s t s N or wind power curtailment w c t s N is solely caused by network congestion. The variable l s t s N is the sum of load shedding l s j t s at every bus j , i.e., l s t s N = j l s j t s , and w c t s N is the sum of wind power curtailment w c j t s at every bus j , i.e., w c t s N = j w c j t s . If w t s I t w , load shedding or wind spillage is caused by the combined effect of network congestion and single-period reserve shortage. The amount of load shedding caused by reserve shortage can be expressed as w t E r v ˜ t + w t s and the amount of corresponding wind power curtailment is w t s w t E r v ˜ t . Then the amount of load shedding caused by network congestion is l s t s N = j l s j t s ( w t E r v ˜ t + w t s ) and the amount of corresponding wind power curtailment is w c t s N = j w c j t s ( w t s w t E r v ˜ t ) .
In addition, the amount of wind power curtailment should be revised when w t E > w t m . In such a case, the amount of wind power curtailment caused by reserve shortage is w t s w t m , then the amount of wind power curtailment caused by network congestion is w c t s N = j w c j t s ( w t s w t m ) .
In conclusion, the ELNS l s t N caused by network congestion can be expressed as Equation (15) and the EWC w c t N is Equation (16):
l s t N = s | w t s I t w π t s l s t s + s | w t s I t w π t s [ l s t s ( w t E r v ˜ t + w t s ) ]
w c t N = s i t s | w t s I t w π t s w c t s + s i t s | w t s I t w π t s [ w c t s ( w t s w t E r v ˜ t ) ] + ( 1 s i t ) s π t s [ w c t s ( w t s w t m ) ]
where s i t is the auxiliary parameter to indicate the case w t E > w t m , in which it is set at zero, otherwise, s i t = 1 . The method to calculate s i t and w t m is provided in Section 4.2.3. The former two items in Equation (16) take effect when w t m w t E and the last one takes effect when w t E > w t m .

4. NCUC Approach Based on Reserve Models

This proposed NCUC approach introduces the newly proposed reserve models and simplified network constraints into the traditional UC formulation. The reserve models enable this approach to fully capture the impact of the stochastic characteristics of wind power on the reserve optimization and simultaneously optimize the system reserve levels and on/off decision variables. In this way, this approach can comprehensively evaluate the costs and benefits of the scheduled reserves and thus produce very economic schedules. Meanwhile, the reserve models simply consist of a small number of continuous variables and linear constraints and thus bring in very little computational burden. Besides, the simplified network constraints enable this approach to evaluate the impact of network congestion on the schedule at low computational burden. Section 4.1 presents the mathematical formulation of the NCUC based on reserve models (RMUC), Section 4.2 presents the methodology to solve RMUC.

4.1. Mathematical Formulation

The mathematical formulation of RMUC is described as follows:
Min   i , t [ d t c i ( p i t ) + c i su ( u i , t 1 , u i t ) ] + t d t v l t l s t E + t d t v w t w c t E
l s t E = r d t + + r d a t + + l s t N ,   t .
w c t E = s i t r d t + s i t r d a t + w c t N ,   t .
s.t:
i p i t = l d t w t E + s w t ,   t .
i r g i t + r v t + + r v a t + ,   t .
i r g i t r v t + r v a t ,   t .
p i t + r g i t + P i max u i t ,   i , t .
p i t r g i t P i min u i t ,   i , t .
p i t p i , t 1 + r g i t + S U R i ( 1 u i , t 1 ) + d t R U i u i , t 1 ,   i , t .
p i , t 1 p i t + r g i t S D R i ( 1 u i t ) + d t R D i u i t ,   i , t .
0 r g i t + d t R U i ,   i , t .
0 r g i t d t R D i ,   i , t .
( r d t + , r d t ) S rv ( r v t + , r v t ) ,   t .
( r d a t + , r d a t ) S rva ( r v a t + , r v a t ) ,   t .
( p i t s , w j t s , l s j t s , w c j t s ) S gd ( u i t , p i t , r g i t + , r g i t ) ,   ( t , s ) S N c .
The objective function Equation (17) seeks to minimize the total operating costs, including fuel costs, start-up costs, penalty costs of ELNS, and penalty costs of EWC. Fuel cost functions are usually expressed as quadratic functions, which are approximated by the piecewise linear functions [30]. Start-up cost functions are the functions of commitment variables, in which the start-up cost of each time is set to constant [17]. Equations (18) and (19) are used to calculate the total ELNS and the total EWC, respectively, both of which contain three parts and are caused by three factors: the single-period reserve shortage, additional ramping reserve shortage, and network congestion. Equation (19) also introduces parameter s i t to identify the case w t E > w t m as Equation (16) does. When w t E > w t m , the EWC caused by the single-period reserve shortage and the additional ramping reserve shortage is excluded through setting s i t = 0 to avoid the overlapping calculation of such EWC. More detail about the revision of EWC will be explained in Section 4.2.3. Note that parameters v l t , v w t are not predefined and are calculated according to the operating costs in each period. The calculations of v l t , v w t are explained in Section 4.2.2.
Note that the penalty costs of ELNS and EWC in the objective function Equation (17) is quite different from those in the objective function of DUC due to their different calculations of load shedding and wind power curtailment. Traditional DUC can only consider the load shedding and wind power curtailment under the expected (or point forecasted) wind power scenario. But the ELNS and EWC in the objective function Equation (17) represent the total expected load shedding and the total expected wind power curtailment, respectively, caused by both reserve shortage and network congestion. In this way, the penalty costs of ELNS and EWC in the objective function Equation (17) can be used to express the potential benefits of both the scheduled reserves and mitigating network congestion, or in more straightforward words, the potentially reduced penalty costs of ELNS and EWC due to both the scheduled reserves and mitigating network congestion. The increased costs of both the scheduled reserves and mitigating network congestion can be calculated by the former two terms of objective function Equation (17), i.e., fuel costs and start-up costs. Therefore, objective Equation (17) can comprehensively evaluate the costs and benefits of both the scheduled reserves and eliminating network congestion, but the objective in the DUC is incapable of doing that.
RMUC is restricted by the following constraints: power balance constraint Equation (20), system up and down spinning reserve requirements Equations (21) and (22), upper and lower power limits of the unit Equations (23) and (24), ramping up and down reserve limits of the unit Equations (25) and (26), reserve boundaries of the unit Equations (27) and (28), single-period reserve models Equation (29), additional ramping reserve models Equation (30), and simplified network constraints Equation (31). Constraint Equation (20) introduces the slack variable s w t to attain the feasibility of the model when the case w t E > w t m occurs. Constraints Equations (21) and (22) regard system up and down spinning reserve requirements as decision variables, which are correlated to the ELNS Equation (18) and EWC Equation (19) through reserve models Equations (29) and (30) and thus can be optimized based on the cost/benefit analysis. Single-period reserve models Equation (29) consist of Equations (5) and (6). Additional ramping reserve models Equation (30) consist of Equations (7) and (8). The single-period reserve capacity and additional ramping reserve capacity are deployed as the spinning reserves in this paper, for simplicity, temporarily neglecting the non-spinning reserves. Simplified network constraints Equation (31) consist of Equations (11)–(14). In addition, RMUC includes other technique constraints such as minimum up- and down-time limits, which are not provided in this paper for the sake of brevity and can be referred to [31].
It is important to emphasize that there are two remarkable aspects of differences between the RMUC and typical DUC [6], despite the fact they both follow the traditional UC framework to achieve high computational efficiency. On the one hand, system up and down spinning reserve requirements are decision variables in the RMUC, instead of the predefined value in the DUC. Similar to SUC, RMUC can evaluate the costs and benefits of the system spinning reserve requirements and thus produce very economical reserve strategy. On the other hand, RMUC can evaluate the impact of network congestion on the reserve applicability through the network constraints Equation (31). But typical DUC simply considers the network constraints under the expected (or point forecasted) wind power scenario and thus fails to consider that the scheduled reserves may be blocked in the real-time operation due to network congestion.

4.2. Methodology of Solving RMUC

The methodology of solving RMUC is illustrated in Figure 7. RMUC requires some essential parameters such as I t w , S N c , and L c , which should be calculated in advance. Initial UC (IUC) provides the parameter I t w and also provides the initial schedule for economic dispatch (ED) simulations. ED simulations can simulate the real-time operation to provide some other required parameters such as S N c and L c .

4.2.1. Solving IUC

Compared to RMUC, IUC does not contain additional ramping reserve model Equation (30) and network constraints Equation (31) and should replace Equations (18) and (19), Equations (21) and (22) by Equations (32)–(35). Parameters v l t , v w t in the IUC are taken as the empirical value. IUC is simple and quite computationally efficient. After solving IUC, the wind power range I t w can be obtained according to r v t + , r v t :
l s t E = r d t + ,   t .
w c t E = r d t ,   t .
i r g i t + r v t + ,   t .
i r g i t r v t ,   t .

4.2.2. ED Simulations

ED simulations can simulate the possible realizations of real-time operation through stochastic scenarios to analyze the possible impact of network congestion on the schedule and to estimate the expected operating costs regarding all the possible realizations. Each ED model in the ED simulations corresponds to one stochastic scenario and can be regarded as the SUC model under a single scenario with the given commitment decision variables provided by IUC. The ED model is a linear programming problem that is quite computationally efficient. Besides, ED models under different scenarios are mutually independent and thus can be paralleled solved to further improve the computational efficiency.
ED simulations can assess the impact of network congestion on the schedule and thus obtain the parameters S N c and L c . In ED simulations, if there is any pair of scenario and period in which the lost load (or wind power curtailment) caused by network congestion satisfies the condition l s t s N > 0 (or w c t s N > 0 ), such pair of scenario and period will be included into the set S N c . The functions to calculate the value l s t s N , w c t s N can be referred to Section 3.2, the required variables in these functions can be approximately obtained by the corresponding data from the solutions of the IUC and ED simulations. In ED simulations, if any transmission reaches its transmission capacity, such line will be included into the set L c .
Besides, ED simulations can calculate the expected operating costs regarding all the scenarios in every period and thus can calculate the parameters v l t , v w t . The value of loss load v l t is set at the fixed times of the operating costs per load demand in period t . The value of wind power curtailment v w t is set at the operating costs per net load (load minus wind power) in period t , representing the opportunity costs of curtailed wind power.
However, ED simulations cannot adopt as many scenarios as reserve models do because too many scenarios in ED simulations may lead to that the scale of the set S N c is too large when the network is heavily congested. Though the set S N c accounts for a small proportion of all the pairs of period and scenario considered in the SUC, its proportion still rises with the aggravation of network congestion, moreover, the scale of the set S N c is proportional to the number of scenarios. A large set S N c impairs the computational efficiency of RMUC, therefore, ED simulations should reduce the scenarios of the set W adopted in reserve models. The k-means clustering technique is applied in this paper to reduce the scenarios [28].

4.2.3. Solving RMUC

Besides the parameters mentioned in the above two processes, the parameters s i t and w t m should also be calculated in advance before solving RMUC. The parameter s i t is used to identify the case w t E > w t m , in which the EWC caused by reserve shortage can be roughly approximated by w t E w t m , i.e., the value of s w t in the power system balance constraint Equation (20). This approximation of EWC is not accurate but has little impact on the economy of the schedule due to the low value of wind power curtailment. In such a case, the EWC caused by the single-period reserve shortage and additional ramping reserve shortage has been included in the system power balance constraint Equation (20) and therefore Equation (19) need to exclude such EWC by setting s i t = 0 . Because w t E w t m is equal to s w t , s i t can be approximated by value of s w t ( s w t 0 ) in the IUC. When s w t 0 > 0 , s i t is set at zero and w t m is w t E s w t 0 , otherwise, s i t is set at one and w t m is zero. After solving RMUC, the EWC can be calculated by Equation (36):
w c t E = s i t r d t + s i t r d a t + ( 1 s i t ) s w t + w c t N ,   t .
The above processes provide a simple way for RMUC to calculate its required parameters, which may slightly depart from their optimal value. However, the above processes can provide a good approximation of the core parameters, including I t w , L c , and S N c . The parameter I t w mainly affects the additional ramping reserve models, which are the supplements of single-period reserve models and have much less impact on the schedule compared to single-period reserve models. The parameters L c and S N c are used to manage the possible network congestion and will not vary apparently if the set L c is carefully selected. The set L c can be well selected by ED simulations and can be better selected with the help of historical operation data.

5. Numerical Results

Numerical simulations use the modified version of 118-bus test system from motor.ece.iit.edu/data/ltscuc, so as to better accord with the engineering practice. The modified system consists of 54 units with a total installed capacity of 14,470 MW and with the peak load of 13,000 MW. Ten wind farms are integrated into the modified system at ten different bus nodes, each with 450 MW of installed capacity. Wind data are from [32]. The initial value of wind power curtailment is 40 $/MW∙h for the IUC. The value of lost load is fixed at 1000 $/MW∙h for the sake of comparisons among different UC approaches. Ten-piece piecewise linear functions are used to approximate the fuel cost functions, fifty-piece piecewise linear functions to approximate the single-period reserve models, and ten-piece piecewise linear functions to approximate the additional ramping reserve models.
All numerical simulations are coded with YALMIP toolbox under the MATLAB platform and are solved by the commercial solver GUROBI 6.0.5 with a pre-specified optimal gap of 0.1% on a Windows-based server equipped with a Xeon ES-1650 (3.50 GHz, six6 cores) processor. The simulation results are presented in the following two parts: Section 5.1 compares the economic performance of schedules produced by different approaches, including DUC, SUC, and RMUC; Section 5.2 compares their computing performance.

5.1. Economic Performance Analysis

DUC is represented by the traditional 3σ approach, which sets the system up reserve level as three times the standard deviation (3σ) of the wind power forecasting errors. The SUC formulation used for comparison is derived from [19]. Three thousand (3000) scenarios, which constitute the original scenario set W , are generated by the method in [29] to fully approximate the stochastic characteristic of wind power. The original scenario set is used to construct the reserve models and then is reduced to a small scenario set containing 20 scenarios by the k-means clustering method [28]. The reduced scenario set is used in the SUC and in the ED simulations of RMUC. More scenarios adopted in the reduced scenario set may contribute to the better economic performance of SUC, but more scenarios require so many computational resources that are beyond the ability of our simulation environment.
The day-ahead schedules directly produced by different UC approaches are not comparable because these approaches adopt different means of modeling wind power characteristics. But these approaches can be compared when their day-ahead schedules have been implemented real-time simulations, i.e., ED simulations under the original scenario set W t . Economic performance results of the three different approaches are provided in Table 1, including total operating costs (TOC), total fuel costs (TFC), expected load not served (ELNS), and expected wind power curtailment (EWC). The column RT represents the real-time expected results calculated by the results of real-time simulations, Δ represents the difference between the real-time expected results and the day-ahead schedule results. Moreover, Table 1 gives the results of the three approaches under different severity degrees of network congestion. The suffixes (1.0, 1.2, and 1.4) in the first column are congestion factors ρ , which are used to represent the severity degree of network congestion. Assuming the initial transmission capacity of line l is p f l max , then the transmission capacity of the corresponding line for the test system with the congestion factor ρ is p f l max / ρ . The congestion factor is larger, there are more lines that are prone to congestion.
As shown in Table 1, RMUC has the lowest total operating costs compared to DUC and SUC, furthermore, has the lowest differences (Δ) regarding the two most important indexes, i.e., the total operating costs and the ELNS. The penalty costs of ELNS greatly affect the total operating costs because the value of lost load is very high. Therefore, accurately estimating the ELNS in the day-ahead schedule is crucial for the economic performance of a UC approach. DUC and SUC heavily underestimate the ELNS in the day-ahead schedule, resulting in the remarkable increase of total operating costs in the real-time expected results. Instead, RMUC can better estimate the ELNS in the day-ahead schedule and thus produce more economical schedule.
On the other hand, RMUC is much less sensitive to the severity degree of network congestion compared to DUC. This is because DUC ignores the impact of network congestion on the reserve applicability. If the network congestion aggravates, the economic performance of DUC worsens. When the congestion factor is ρ = 1.4 , DUC needs the more total operating costs by 1.99% and 2.71% compared to SUC and RMUC.

5.2. Computing Performance Analysis

The number of variables and the number of constraints are the important and intuitional indexes that reflect the model scale of the UC approach. The model scale remarkably affects the computing time of the UC approach, however, computing time is also affected by other complex factors such as the algorithm. The impact of the algorithm on the computing time is complicated and is beyond the scope of this paper. All the formulations of these three UC approaches are solved by the same commercial MILP solver of GUROBI in this paper.
The model scales of different approaches are shown in Figure 8, including the number of integer variables (NIV), the number of continuous variables (NCV), the number of constraints (NCT). The values of these indexes are written in the form of logarithm. Note that the model scales of DUC and SUC have no relationship with the severity degree of network congestion so they have no suffixes indicating the severity degree of network congestion in Figure 8. The computing performance of different approaches is illustrated in Table 2, including the number of the pairs of scenario and period (NSP), the number of lines (NL), and computing time (CPT).
As shown in Figure 8, RMUC has much smaller model scale compared to SUC especially when the network congestion is slight. The model scale of RMUC increases when the congestion factor enlarges, but even when ρ = 1.4 , the number of continuous variables of RMUC is only 1/7 of that of SUC and the number of constraints is only 1/9. The advantage of RMUC in the model scale over SUC attributes to that RMUC can pick out the scenarios, periods, and lines that are easily suffered to network congestion and thus has much smaller NSP and NL, which is verified in Table 2, avoiding many inactive constraints adopted in the SUC. Therefore, RMUC has a more reasonable model scale that varies depending on the severity degree of network congestion, compared to SUC.
When ρ = 1.0 or ρ = 1.2 , RMUC has the similar computing time as DUC and has much less computing time compared to SUC. When ρ = 1.4 , RMUC consumes a little more computing time compared to DUC. It is important to note that the SUC consumes much more time when ρ = 1.4 compared to when ρ = 1.0 though the model scale keeps the same. This is because more network constraints take effect when the network congestion aggravates. When ρ = 1.4 , the computing time of RMUC is only 1/56 of that of SUC.

6. Conclusions

This paper proposes a new NCUC approach that introduces the newly proposed reserve models and simplified network constraints. This approach constructs the reserve models based on a sufficiently large number of stochastic wind power scenarios to fully and accurately capture the stochastic characteristics of wind power. These reserve models are directly incorporated into traditional UC formulation to simultaneously optimize the system reserve levels and on/off decision variables. Therefore, the proposed approach can better perform the cost/benefit analysis in the reserve optimization and thus produce very economical schedule. These reserve models bring in very little computational burden because they simply consist of a small number of continuous variables and linear constraints. Besides, this approach can reflect the impact of network congestion on the schedule by introducing only a small number of network constraints, i.e., the simplified network constraints, and thus can concurrently ensure its high computational efficiency.
Numerical simulations have been performed to compare the economic performance and computing performance of DUC, SUC, and RMUC. The following conclusions can be drawn accordingly:
(1)
RMUC can better estimate the real-time expected results, containing total operating costs and expected load not served, in the day-ahead schedule compared to DUC and SUC. However, DUC and SUC fail to accurately estimate the expected load not served in the day-ahead schedule, resulting in the remarkable increase of total operating costs in the real-time simulations.
(2)
RMUC can produce more economical schedule compared to DUC and SUC and effectively cope with the impact of network congestion on the schedule. When the network congestion aggravates, RMUC has much more advantage in economic performance over DUC.
(3)
RMUC is much more computationally efficient than SUC and has similar computational efficiency as DUC. This is partly because RMUC has a more reasonable model scale that varies depending on the severity degree of network congestion, compared to SUC, avoiding many inactive constraints adopted in the SUC.
This proposed approach focuses on the spinning reserves and neglects the non-spinning reserves. The extension of this approach should be further studied to make it more widely applicable.

Author Contributions

Gang Wang and Dahai You proposed the core idea. Gang Wang developed the models, performed the simulations and exported the results. Zhe Zhang, Li Dai, Qi Zou, and Hengwei Liu provided some important reference material. All authors discussed the results and contributed to writing this paper.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

ARDRAdditional Ramping Down Reserve
ARURAdditional Ramping Up Reserve
CPTComputing Time
DUCDeterministic Unit Commitment
EDEconomic Dispatch
ELNSExpected Load Not Served
EWCExpected Wind Power Curtailment
IUCInitial Unit Commitment
NCTNumber of Constraints
NCUCNetwork-Constrained Unit Commitment
NCVNumber of Continuous Variables
NIVNumber of Integer Variables
NLNumber of Lines
NSPNumber of the Pairs of Scenario and Period
PDFProbability Density Function
RMUCNetwork-Constrained Unit Commitment Based on Reserve Models
SPDRSingle-Period Down Reserve
SPURSingle-Period Up Reserve
SUCStochastic Unit Commitment
UCUnit Commitment

Nomenclature

Indices
i Index of generating units.
j Index of buses.
k Index of the segments of the piecewise linear functions.
l Index of lines.
s Index of scenarios.
t Index of time periods.
Variables
c i ( ) Fuel cost function of unit i .
c i su ( ) Start-up function of unit i .
f r + ( ) , f r ( ) Probabilistic distribution function of single-period up/down reserve requirements.
f w ( ) Probabilistic distribution function of wind power production.
l s j t s Lost load in period t and scenario s at bus j .
l s t E Total expected load not served in period t .
l s t N Expected load not served in period t caused by network congestion.
p i t Power output of unit i in period t under the scenario of expected wind power production.
p i t s Power output of unit i in period t and scenario s .
p f l s Active power flowing through line l in scenario s .
r t + , r t Single-period up/down reserve requirements in period t .
r a t + , r a t   ( r a t s + , r a t s ) Additional ramping up/down reserve requirements in period t (in scenario s ).
r d t + , r d t Expected load not served or expected wind power curtailment in period t caused by the single-period up/down reserve shortage.
r d a t + , r d a t Expected load not served or expected wind power curtailment in period t caused by the additional ramping up/down reserve shortage.
r d t Simplified expression of variables r d t + , r d t , r d a t + , r d a t .
r g i t + , r g i t Up or down reserve of unit i in period t under the scenario of the expected wind power production.
r p t + , r p t Existing ramping up/down reserve capacity in period t .
r v t + , r v t Single-period up/down reserve levels in period t .
r v a t + , r v a t Additional ramping up/down reserve levels in period t .
r v t Simplified expression of variables r v t + , r v t , r v a t + , r v a t .
r v t k The kth segment of r v t .
s w t Slack variable in period t .
u i t Commitment variable of unit i in period t .
v l t Value of loss load in period t .
v w t Value of wind power curtailment in period t .
w t Total wind power production in period t .
w c j t s Wind power curtailment in period t and scenario s at bus j .
w c t E Total expected wind power curtailment in period t .
w c t N Expected wind power curtailment in period t caused by network congestion.
Constants
d t Duration of period t .
l d t Forecasting load in period t .
l d j t Forecasting load in period t at bus j .
N Number of the segments.
n d t E Difference between the load and expected wind power production in period t .
P i max , P i min Maximum or minimum power output of unit i .
p f l max Transmission capacity of line l .
R U i , R D i Ramping up/down limit of unit i .
r v t max Maximum value of r v t .
r v t k max Maximum value of r v t k .
r v ˜ t + , r v ˜ t Value of single-period up/down reserve level calculated by the initial unit commitment model in period t .
S Number of scenarios.
s i t Auxiliary parameter to indicate the case w t m < w t E in period t .
s w t 0 Value of slack variable calculated by the initial unit commitment model in period t .
S U R i , S D R i Startup or shutdown ramping limit of unit i .
T Number of periods.
w t s , w t s Wind power production or adjusted wind power production in period t and scenario s .
w j t s Wind power production in period t and scenario s at bus j .
w t E Total expected wind power production in period t .
w t F Total point forecasting wind power production in period t .
w t m Maximum wind power production that the power system can accommodate in period t .
w max Total installed capacity of wind power.
α t k Slope of the k-th segment of the piecewise linear function in period t .
ρ Congestion factor.
π t s Probability of scenario s in period t .
Vectors and sets
A l The l-th row vector of the branch-bus adjacency matrix.
I t w Wind power range tσhat is covered by single-period up and down reserve in period t .
L c Set of lines that easily suffer network congestion.
L D t Forecasting load vector in period t .
L S t s Forecasting load vector in period t and scenario s .
P t s Unit’s power output vector in period t and scenario s .
S N c Set of the pairs of scenario and period ( t , s ) that suffer network congestion.
W Original wind power scenario set.
W C t s Wind power curtailment vector in period t and scenario s .
W P t s Wind power vector in period t and scenario s .
Y g Branch-bus adjacency matrix.

References

  1. IRNEA. Roadmap for a Renewable Energy Future. Available online: http://www.irena.org/DocumentDownloads/Publications/IRENA_REmap_2016_edition_report.pdf (accessed on 12 January 2018).
  2. Hernández-Escobedo, Q.; Saldaña-Flores, R.; Rodríguez-García, E.R.; Manzano-Agugliaro, F. Wind energy resource in Northern Mexico. Renew. Sustain. Energy Rev. 2014, 32, 890–914. [Google Scholar] [CrossRef]
  3. Hernandez-Escobedo, Q.; Manzano-Agugliaro, F.; Gazquez, J.A.; Zapata-Sierra, A. Is the wind a periodical phenomenon? The case of Mexico. Renew. Sustain. Energy Rev. 2011, 15, 721–728. [Google Scholar] [CrossRef]
  4. NERL. Integrating Variable Renewable Energy: Challenges and Solutions. Available online: http://www.nrel.gov/docs/fy13osti/60451.pdf (accessed on 12 January 2018).
  5. Wang, G.; You, D.; Lou, S.; Zhang, Z.; Dai, L. Economic valuation of low-Load operation with auxiliary firing of coal-fired units. Energies 2017, 10, 1317. [Google Scholar] [CrossRef]
  6. Conejo, A.J.; Castillo, E.; Mínguez, R.; García-Bertrand, R. Decomposition Techniques in Mathematical Programming; Springer: Berlin, Germany, 2006; pp. 368–373. [Google Scholar]
  7. Kalantari, A.; Restrepo, J.F.; Galiana, F.D. Security-constrained unit commitment with uncertain wind generation: The loadability set approach. IEEE Trans. Power Syst. 2013, 28, 1787–1796. [Google Scholar] [CrossRef]
  8. Kalantari, A.; Galiana, F.D. Generalized sigma approach to unit commitment with uncertain wind power generation. Int. J. Electr. Power 2015, 65, 367–374. [Google Scholar] [CrossRef]
  9. Bertsimas, D.; Litvinov, E.; Sun, X.A.; Zhao, J.; Zheng, T. Adaptive robust optimization for the security constrained unit commitment problem. IEEE Trans. Power Syst. 2013, 28, 52–63. [Google Scholar] [CrossRef]
  10. Ding, T.; Bie, Z.; Bai, L.; Li, F. Adjustable robust optimal power flow with the price of robustness for large-scale power systems. IET Gener. Transm. Distrib. 2016, 10, 164–174. [Google Scholar] [CrossRef]
  11. Bucher, M.A.; Ortega-Vazquez, M.A.; Kirschen, D.S.; Andersson, G. Robust allocation of reserves considering different reserve types and the flexibility from HVDC. IET Gener. Transm. Distrib. 2017, 11, 1472–1478. [Google Scholar] [CrossRef]
  12. Wang, Y.; Xia, Q.; Kang, C. Unit commitment with volatile node injections by using interval optimization. IEEE Trans. Power Syst. 2011, 26, 1705–1713. [Google Scholar] [CrossRef]
  13. Doostizadeh, M.; Aminifa, F.R.; Ghasemi, H.; Lesani, H. Energy and reserve scheduling under wind power uncertainty: An adjustable interval approach. IEEE Trans. Smart Grid 2011, 7, 2943–2952. [Google Scholar] [CrossRef]
  14. Pandžić, H.; Dvorkin, Y.; Qiu, T.; Wang, Y.; Kirschen, D.S. Toward cost-efficient and reliable unit commitment under uncertainty. IEEE Trans. Power Syst. 2011, 31, 970–982. [Google Scholar] [CrossRef]
  15. Wu, L.; Shahidehpour, M.; Li, T. Stochastic security-constrained unit commitment. IEEE Trans. Power Syst. 2007, 22, 800–811. [Google Scholar] [CrossRef]
  16. Morales, J.M.; Conejo, A.J.; Perez-Ruiz, J. Economic valuation of reserves in power systems with high penetration of wind power. IEEE Trans. Power Syst. 2009, 24, 900–910. [Google Scholar] [CrossRef]
  17. Constantinescu, E.M.; Zavala, V.M.; Rocklin, M.; Lee, S.; Anitescu, M. A computational framework for uncertainty quantification and stochastic optimization in unit commitment with wind power generation. IEEE Trans. Power Syst. 2011, 26, 431–441. [Google Scholar] [CrossRef]
  18. Zheng, Q.P.; Wang, J.; Pardalos, P.M.; Guan, Y. A decomposition approach to the two-stage stochastic unit commitment problem. Ann. Oper. Res. 2011, 210, 387–410. [Google Scholar] [CrossRef]
  19. Papavasiliou, A.; Oren, S.S. Multiarea stochastic unit commitment for high wind penetration in a transmission constrained network. Oper. Res. 2011, 61, 578–592. [Google Scholar] [CrossRef]
  20. Uçkun, C.; Botterud, A.; Birge, J.R. An improved stochastic unit commitment formulation to accommodate wind uncertainty. IEEE Trans. Power Syst. 2016, 31, 2507–2517. [Google Scholar] [CrossRef]
  21. Marneris, I.; Biskas, P.; Bakirtzis, A. Stochastic and deterministic unit commitment considering uncertainty and variability reserves for high renewable integration. Energies 2017, 10, 140. [Google Scholar] [CrossRef]
  22. Ortega-Vazquez, M.; Kirschen, D.S. Estimating the spinning reserve requirements in systems with significant wind power generation penetration. IEEE Trans. Power Syst. 2009, 24, 114–124. [Google Scholar] [CrossRef]
  23. Zheng, Q.P.; Wang, J.; Liu, A.L. Stochastic optimization for unit commitment—A review. IEEE Trans. Power Syst. 2015, 30, 1913–1924. [Google Scholar] [CrossRef]
  24. Restrepo, J.F.; Galiana, F.D. Assessing the yearly impact of wind power through a new hybrid deterministic/stochastic unit commitment. IEEE Trans. Power Syst. 2011, 26, 401–410. [Google Scholar] [CrossRef]
  25. Ruiz, P.A.; Philbrick, C.R.; Zak, E.; Cheung, K.W.; Sauer, P.W. Uncertainty management in the unit commitment problem. IEEE Trans. Power Syst. 2009, 24, 642–651. [Google Scholar] [CrossRef]
  26. Bucksteeg, M.; Niesen, L.; Weber, C. Impacts of dynamic probabilistic reserve sizing techniques on reserve requirements and system costs. IEEE Trans. Sustain. Energy 2016, 7, 1408–1420. [Google Scholar] [CrossRef]
  27. Kwon, K.B.; Park, H.; Lyu, J.K.; Park, J.K. Cost Analysis Method for Estimating Dynamic Reserve Considering Uncertainties in Supply and Demand. Energies 2016, 9, 845. [Google Scholar] [CrossRef]
  28. Du, E.; Zhang, N.; Kang, C.; Ding, Y. Impact of Wind Power Scenario Reduction Techniques on Stochastic Unit Commitment. In Proceedings of the 2th International Symposium on Stochastic MODELS in Reliability Engineering, Beer-Sheva, Israel, 15–18 February 2016; pp. 202–210. [Google Scholar]
  29. Pierre, P.; Henrik, M.; Aa, N.H.; Papaefthymiou, G.; Klockl, B. From probabilistic forecasts to statistical scenarios of short-term wind power production. Wind Energy 2010, 12, 51–62. [Google Scholar]
  30. Wu, L. A Tighter Piecewise Linear Approximation of Quadratic Cost Curves for Unit Commitment Problems. IEEE Trans. Power Syst. 2011, 26, 2581–2583. [Google Scholar] [CrossRef]
  31. Rajan, B.D.; Takriti, S. Minimum Up/Down Polytopes of the Unit Commitment Problem with Start-Up Costs; Technical Report; IBM Corporation: Westchester, NY, USA, 8 June 2005. [Google Scholar]
  32. Eastern Wind Integration and Transmission Study—NREL Data. Available online: https://www.nrel.gov/grid/eastern-wind-data.html (accessed on 9 February 2018).
Figure 1. Organization chart of other part of this paper.
Figure 1. Organization chart of other part of this paper.
Energies 11 00435 g001
Figure 2. Illustrative example of net load change and reserve requirement.
Figure 2. Illustrative example of net load change and reserve requirement.
Energies 11 00435 g002
Figure 3. The PDF of wind power production.
Figure 3. The PDF of wind power production.
Energies 11 00435 g003
Figure 4. (a) The PDF of the SPUR requirements; (b) The PDF of the SPDR requirements.
Figure 4. (a) The PDF of the SPUR requirements; (b) The PDF of the SPDR requirements.
Energies 11 00435 g004
Figure 5. Ramping reserve requirements.
Figure 5. Ramping reserve requirements.
Energies 11 00435 g005
Figure 6. Piecewise linearization of reserve models.
Figure 6. Piecewise linearization of reserve models.
Energies 11 00435 g006
Figure 7. Methodology of solving RMUC.
Figure 7. Methodology of solving RMUC.
Energies 11 00435 g007
Figure 8. Model scales of different approaches.
Figure 8. Model scales of different approaches.
Energies 11 00435 g008
Table 1. Economic performance results of three approaches.
Table 1. Economic performance results of three approaches.
ApproachTOC/$ 1 MTFC/$ 1MELNS/MW·hEWC/MW·h
RTΔRTΔRTΔRTΔ
DUC_1.08.2370.3377.7400.0802582566856399
SUC_1.08.2040.2287.7640.0332041956856160
RMUC_1.08.0960.0067.8230.04735−1830888
DUC_1.28.2610.3587.7430.0822782776891434
SUC_1.28.2180.2347.7640.0322182026888153
RMUC_1.28.0930.0037.8220.04121−10810486
DUC_1.48.3800.4607.7580.0783823826798543
SUC_1.48.2130.1847.8190.0311591538232125
RMUC_1.48.1530.0347.8430.052529823169
Table 2. Computing performance of different approaches.
Table 2. Computing performance of different approaches.
ApproachNSPNLCPT(s)
DUC_1.02418644
SUC_1.04801862410
RMUC_1.04328
DUC_1.22418624
SUC_1.24801862676
RMUC_1.2431129
DUC_1.42418637
SUC_1.44801866594
RMUC_1.416515118

Share and Cite

MDPI and ACS Style

Wang, G.; You, D.; Zhang, Z.; Dai, L.; Zou, Q.; Liu, H. Network-Constrained Unit Commitment Based on Reserve Models Fully Considering the Stochastic Characteristics of Wind Power. Energies 2018, 11, 435. https://doi.org/10.3390/en11020435

AMA Style

Wang G, You D, Zhang Z, Dai L, Zou Q, Liu H. Network-Constrained Unit Commitment Based on Reserve Models Fully Considering the Stochastic Characteristics of Wind Power. Energies. 2018; 11(2):435. https://doi.org/10.3390/en11020435

Chicago/Turabian Style

Wang, Gang, Dahai You, Zhe Zhang, Li Dai, Qi Zou, and Hengwei Liu. 2018. "Network-Constrained Unit Commitment Based on Reserve Models Fully Considering the Stochastic Characteristics of Wind Power" Energies 11, no. 2: 435. https://doi.org/10.3390/en11020435

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