The Scientific World Journal

Volume 2014, Article ID 583157, 12 pages

http://dx.doi.org/10.1155/2014/583157

## A Three-Stage Birandom Program for Unit Commitment with Wind Power Uncertainty

^{1}School of Electrical Engineering, Dalian University of Technology, Dalian 116024, China^{2}
State Grid Shenyang Electric Power Supply Company, Shenyang 110021, China

Received 11 April 2014; Accepted 29 April 2014; Published 29 May 2014

Academic Editor: Guojie Zhang

Copyright © 2014 Na Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

The integration of large-scale wind power adds a significant uncertainty to power system planning and operating. The wind forecast error is decreased with the forecast horizon, particularly when it is from one day to several hours ahead. Integrating intraday unit commitment (UC) adjustment process based on updated ultra-short term wind forecast information is one way to improve the dispatching results. A novel three-stage UC decision method, in which the day-ahead UC decisions are determined in the first stage, the intraday UC adjustment decisions of subfast start units are determined in the second stage, and the UC decisions of fast-start units and dispatching decisions are determined in the third stage is presented. Accordingly, a three-stage birandom UC model is presented, in which the intraday hours-ahead forecasted wind power is formulated as a birandom variable, and the intraday UC adjustment event is formulated as a birandom event. The equilibrium chance constraint is employed to ensure the reliability requirement. A birandom simulation based hybrid genetic algorithm is designed to solve the proposed model. Some computational results indicate that the proposed model provides UC decisions with lower expected total costs.

#### 1. Introduction

With growing concern about energy and the environment, wind power as the most visible renewable energy generation has been vigorously developed across the world. However, the growth of integrated wind power also brings many dispatching and control challenges due to the nature of wind energy and the characteristics of wind plants. High wind power uncertainties due to unsatisfactory forecast accuracy usually generate additional integration costs, which may be reduced by employing adaptive scheduling policies and developing more appropriate models. Unit commitment (UC) has always been regarded as one of the most crucial processes in system scheduling and the crucial basis for dispatching. How to address the wind power uncertainty in unit commitment has attracted much more concern in recent decades.

Increasing the system reserve level explicitly had been presented when wind uncertainty addressing problem appeared. Soder presented a methodology to estimate the requirements of kinds of reserves (including instantaneous reserve, fast reserve, and slow reserve) by linking with the predefined probability of too low frequency and predefined rate of load shedding in [1], considering multiple uncertainties including wind power. Doherty and O’Malley proposed a further approach in which the amount of SR requirements in each hour was calculated by linking with the reliability targets evaluated by predefined LSI over the year [2]. Ortega-Vazquez and Kirschen proposed a programming method to determine optimal SR requirement which minimizes the expected cost including interruptions and the operating costs [3], in which an uncommon conclusion was drawn that an increased wind power penetration did not necessarily require larger amounts of SR; however, the system reliability level might be compromised correspondingly.

Uncertain programming has been more widely applied in UC modeling to cope with high wind power uncertainties. In particular, stochastic UC (SUC) has been widely studied and applied [4, 5]. The benefit of using stochastic model was evaluated in [6, 7]. Regarding the particular feature of UC problem and its tight coupling relationship with following dispatching process, the two-stage UC model, determining the UC decisions in the first stage and the dispatching decisions in the second stage, is very suitable to cope with wind uncertainties [8]. To ensure the system reliability or the utilization of wind power meeting the required level, or for other aims, chance constraints are also usually applied in SUC modeling [9–11]. Especially in [12], a chance-constrained two-stage stochastic program was formulated, aiming at ensuring a large portion of the wind power output at each operating hour being utilized with a high probability on the premise of maintaining the system reliability in case of sudden fluctuation in wind power output. The two-stage robust UC model, aiming at obtaining the UC decisions which could deal with the anticipated worst scenario, was studied in [13, 14]. Besides stochastic model, fuzzy optimization supplies another approach for UC modeling based on the human’s lack of knowledge on exact wind forecast errors [15].

Besides applying advanced modeling methods, much valuable work has been conducted on building adaptive UC policies to cope with wind uncertainty. By using any of the kinds of forecast methods, the wind power forecast accuracy is increased with the forecast horizon shortening, which shows a clear trend when it is from day ahead to several hours ahead. Some studies on UC policy and modeling have been conducted based on this feature, and some positive effects have been shown up. Tuohy et al. [7, 16] presented a rolling UC strategy which committed the system more frequently, and the cost-saving benefit can be obtained by adjusting the UC decisions in intraday scheduling at a certain frequency using the updated wind power data. This offers a proper and practical approach to handle wind power uncertainty in the power systems with intraday electric market. However, in some power systems without electric market, it seems challenging to apply.

Integrating intraday adjustment event into day-ahead UC calculation as well as obtaining a UC decision with the lowest total costs including adjustment cost is another method. In [17], the intraday operation decisions including fast start UC and switching operation modes of combined cycle gas turbines were integrated into the day-ahead scheduling process, by relaxing some of the nonanticipativity constraints based on the two-stage stochastic UC model. In this approach, only the commitment states of fast start units and combined cycle gas turbines can be adjusted in the intraday UC adjustment action. However, such type of units may not be sufficient in most power systems. It means the benefit of integrating intraday adjusting action is limited. Nonetheless, there are usually sufficient conventional thermal units which can start up in 2–6 hours. This type of units is called subfast start unit in this paper. Integrating hours-ahead intraday UC to adjust the commitment states of subfast start units when necessary could also greatly benefit the system reliability and economy, because of the higher accuracy of hours-ahead wind forecast compared with day-ahead forecast. In this regard, a novel three-stage UC, in which a middle stage that determines the intraday hours-ahead UC adjustment decisions is added into the traditional two-stage UC, is developed. The objective of the three-stage UC is to minimize the expected total costs including the expected operation costs as well as the expected startup/shutdown costs according to the final UC decisions, on the premise of satisfying a predefined reliability requirement. It should be noted that in our approach the intraday UC adjustment action is carried out only when the SR capacity is not sufficient according to updated operation and wind forecast data.

The largest challenge of modeling the three-stage UC described above is how to formulate the unrealized next-day hours-ahead forecasted wind power output, which would be used as an input for the intraday UC adjustment stage. When making day-ahead scheduling decisions, the available information about wind power output is its day-ahead forecast value and the statistical forecast error or an uncertain wind forecast result which includes both. The only available information about intraday forecasted wind power in day-ahead scheduling is the statistical forecast error. It can be found that the day-ahead forecasted wind power and intraday hours-ahead forecasted wind power, which are seemingly unable to connect with each other, could build up mathematical relationship based on the possible actual wind power as a medium. The actual wind power output can be formulated as a random variable according to day-ahead forecast data. Considering the random characteristic of intraday wind power forecast errors, the intraday hours-ahead forecasted wind power could also be expressed as a random variable, which takes the value of the stochastic actual wind power output with stochastic hours-ahead forecast errors. It means that the intraday hours-ahead forecasted wind power and intraday UC adjustment event are both with twofold randomness when being considered in day-ahead scheduling. There do exist many scenes of such twofold phenomena in practical situations. In order to build mathematical models that are closer to such actual situations, a so-called birandom variable was proposed by operations research scholars [18]. The birandom variable and birandom programming have been successfully applied to various uncertain programming problems including the vendors selection problem [19], the flow shop scheduling problem [20], the inventory problem [21], and the hydropower station operation [22]. In this paper, the birandom programming is applied to our proposed three-stage UC modeling with wind power uncertainties. To formulate the reliability constraints, chance measures are used in programming formulation.

To solve the UC problems, many methods have been studied, including Lagrangian relaxation algorithm (LR) [23], dynamic programming method (DP) [24], mixed integer programming method (MIP) [25], benders decomposition method [26], genetic algorithm (GA) [27, 28], and some other algorithms. GA is a kind of stochastic search method for optimization problems based on the mechanics of natural selection and natural genetics. It has been successfully used in providing optimal or near optimal solutions to many sophisticated optimization problems. Especially, GA is very effective to solve mathematical programming in an uncertain environment. In [18, 19, 21], the birandom programming problems all were solved by standard or hybrid GA method and obtained satisfactory results. In this paper, a birandom simulation based hybrid GA is designed to solve the proposed three-stage UC model. And to speed up the computation, MILP method is applied to solve each UCED subproblem.

In this paper, an equilibrium chance-constrained three-stage birandom programming UC (ECTBUC) model which integrates expected stochastic intraday UC adjustment event is proposed. The remainder of this paper is organized as follows. Section 2 presents the UC policy and the mathematical formulation of the proposed model. Section 3 designs a birandom simulation based hybrid intelligent algorithm for solving the presented model. In Section 4, some numerical studies are provided to illustrate the effectiveness of the model. Finally, some conclusions of this work are given in Section 5.

#### 2. Mathematical Formulation

##### 2.1. UC Policy

A three-stage decision method is employed for the proposed UC problem. An additional middle stage is contained to modify UC schedule of subfast start units several hours earlier when the reliability requirement cannot be satisfied, estimated using the updated wind realization and the hours-ahead wind power forecasting. Therefore, in the UC policy proposed in this paper, the first stage is making day-ahead UC decisions of nonfast start units considering the stochastic intraday UC adjustment event; the second stage is estimating the reliability level according to the ultra-short-term wind power forecasting and making UC adjustment decisions of the subfast start units when the reliability level was estimated unsatisfactory; the third stage is making UC decisions of fast start units and the dispatching decisions. The timeline of the proposed policy is shown in Figure 1.

##### 2.2. Intraday Hours-Ahead Forecasted Wind Power Output Uncertainty Modeling

In the policy proposed in this paper, the intraday UC adjustment event should be integrated in the day-ahead UC decision-making process. Due to the fact that the intraday UC adjustment decision should be determined several hours earlier because of the minimum uptime/downtime of subfast start units, the intraday hours-ahead wind power forecasting results should be applied in day-ahead UC modeling. How to model the intraday ultra-short-term forecasted wind power output which cannot be realized when making the day-ahead UC decisions is the key.

As mentioned in Section 1, based on its random nature, wind power forecast error can be regarded as a random variable, following a statistical probability distribution which can be obtained by historical forecast error statistics. Assume that the day-ahead forecasted wind power output during time interval is and the day-ahead forecast error is estimated to follow a probability distribution according to statistical analyzing; then the actual wind power output, , also is a random variable which can be expressed as . Similarly, but in turn, if the hours-ahead forecast error is estimated to follow a probability distribution , then, based on each realized actual wind power output , the hours-ahead forecasted wind power output can also be considered as a random variable expressed as . As a result, the hours-ahead forecasted wind power output could be formulated as a birandom variable expressed as , . (The basic concepts on birandom theory can be found in the Appendix.) For example, assume the day-ahead and hours-ahead wind power forecast errors both follow to normal distributions with mean values equal to 0; then the hours-ahead forecasted wind power output could be formulated as and , in which indicates the standard deviation of day-ahead wind forecast during time interval and indicates the stranded deviation of hours-ahead wind forecast during time interval . How to deal with the wind power uncertainty in practical application will be introduced in detail in Section 3.

##### 2.3. UC Mathematical Modeling

In this paper, we develop an equilibrium chance-constrained three-stage birandom unit commitment formulation, which contains an additional middle stage to modify UC schedule of subfast units several hours earlier. In our formulation, the day-ahead UC decisions (, binary variables indicating the status of unit during time interval determined in day-ahead UC) are the first-stage decisions, the intraday UC adjustment decisions (, binary variables indicating the status of subfast start unit during time interval determined in intraday UC adjustment process) are the second-stage decisions, and the economic dispatch decisions (, continuous variables indicating the power output of unit during time interval ) are the third-stage decisions. The commitment of fast start units (, binary variables indicating the status of fast start unit during time interval ) is decided in the third stage, as suggested in [29, 30].

In our formulation, the reliability constraints are considered in the intraday UC adjustment stage and dispatching stage. To avoid frequent startup/shutdown in intraday operating, only the necessary startup adjustment is permitted, which means no shutdown decisions can be determined in the intraday UC adjustment process, except for a startup adjustment scheduled in the former intraday UC adjustment process. In this model, the only uncertainty considered is the wind power output. The objective function is the expected total cost, which includes the expected startup/shutdown cost according to the final UC decisions modified by intraday UC adjustment event, the expected generation cost, and the expected load shedding cost. The proposed model is formulated as follows: where is set of all generation units; is subset of nonfast start units that can start up within the time scale of intraday UC adjustment; is subset of units that cannot start up within the time scale of intraday UC adjustment so that the UC decisions of which are determined completely in the first stage; is set of all time intervals; is startup/shutdown cost function of unit ; is power production cost function of unit ; is unserved energy price; is generation output of unit during time interval ; and is unserved energy during time interval .

In the objective formulation (1), the startup/shutdown cost of subfast start units is included in the objective function as an expected value because the status of subfast start units can be adjusted in the second stage, which is a stochastic event considered in the day-ahead decision. Load shedding is allowed at a high VOLL, in order to assure schedule feasibility.

The first-stage constraints include where is subset of fast start units; is minimum uptimes of unit ; is minimum downtimes of unit ; is startup flag of unit at time interval determined in the first-stage decision; and is shutdown flag of unit at time interval determined in the first-stage decision.

To obtain more economic and flexible UC decisions, only some necessary startup/shutdown constraints for nonfast start units are considered in the first stage. Startup and shutdown flags are summarized in (2) and (3), respectively. Minimum uptime and downtime constraints for nonfast start units are summarized in (4) and (5), respectively.

The second-stage constraints include where is minimum reliability requirement; is startup flag of unit at time interval determined in the second-stage decision; is shutdown flag of unit at time interval determined in the second-stage decision; is adjustment flag indicating the UC decisions during time interval should be adjusted; and is flag indicating unit is scheduled to start up in the second-stage decision.

Constraints (7) and (12) are built up to ensure subfast start units can be adjusted to start up in the second stage only when the reliability index, estimated using the updated hours-ahead wind forecast data, is lower than the required value. Constraint (13) determines the adjustment flag of each unit. Constraint (14) indicates that if some unit is scheduled to start up in the second stage, it should not shut down if this unit is scheduled to start up in the following hours according to the day-ahead UC decisions. To avoid frequent startup/shutdown of subfast start units, constraint (15) is built up to ensure the unit could not turn off if it is on according to the day-ahead decisions. Startup and shutdown flags and minimum uptime/downtime constraints are summarized in (8)–(11). If the commitment state of one unit is off in the remaining intervals according to day-ahead UC, when to shut down is a “wait and see” decision when this unit starts up in the intraday adjustment.

The third-stage constraints include where is minimum output of unit ; is maximum output of unit ; is ramp-up limit of unit ; is ramp-down limit of unit ; and is wind power output during time interval .

Constraint (17) expresses the power balance constraint. Load shedding is allowed to assure schedule feasibility. System reliability constraint is summarized in (22), as an equilibrium chance constraint. Other constraints limit the available space, including the maximum and minimum power capacity, as well as ramp rate limits.

#### 3. Solution Method

GA is a traditional method to solve UC problem and is considered as one of the most effective methods to solve mathematical programming in an uncertain environment, especially in a birandom environment. In [18, 19, 21], the birandom programming problems all were solved by standard or hybrid GA method and obtained satisfactory results. In this regard, GA algorithm is employed to solve the proposed three-stage birandom UC model in this paper. In the proposed model, the employment of birandom variable and birandom programming increases the difficulty of solving. To handle the birandom objective functions and to check the birandom equilibrium chance constraints, a birandom simulation technique, which is similar to stochastic simulation but more complicated, is applied. To speed up the computation, MILP method is used to solve each UCED subproblem. The birandom simulation technique is embedded into a hybrid GA to develop a birandom simulation-based hybrid GA method to solve the proposed CCTSBP UC model. The overall procedure of the applied birandom simulation-based hybrid GA is shown in Figure 2, in which IUC represents intraday UC, and DAUC represents day-ahead UC. The main parts of the algorithm are stated in more detail as follows.

*(a) Wind Scenarios Generation.* Similar to the solving methods of most stochastic UC and birandom programming models, simulation technique is applied. Both the actual wind scenarios and intraday hours-ahead forecasted wind scenarios should be generated as the input of the problem. The wind forecast error distribution feature in the time dimension visibly affects the proposed model. Generating representative actual wind and hours-ahead forecast wind scenarios is the basis for obtaining expected results. Similar to stochastic models, more scenarios can cover much wider uncertainties, however, the computational problems will also show up. In this paper, the initial actual wind scenarios and hours-ahead forecasted wind scenarios are generated using auto regressive moving average (ARMA1,1, as expressed in (24)) approach, according to historical statistic forecast errors on different forecast horizons. And then, simultaneous backward scenario reduction technique is employed to generate the final wind scenarios. The detailed steps are stated as follows. One has
(1)Identify the parameters, , , and , by solving unconstrained nonlinear optimization problem.(2)Randomly generate day-ahead forecast error time series according to (24). Then generate actual wind scenarios by day-ahead forecasted wind power output plus forecast errors.(3)Obtain actual wind power output scenarios and the probability for each scenario using simultaneous backward scenario reduction technique [31, 32].(4)Generate hours-ahead forecasted wind scenarios for each actual wind scenario generated in (3), using the same scenario generation and reduction techniques as generating actual wind scenarios. Then hours-ahead forecasted wind power-actual wind power scenario groups have been generated.

*(b) Hybrid Genetic Algorithm*. In the proposed method, GA is employed to solve the master problem which determines the day-ahead UC decisions, and MILP method is used to solve the subproblem of UCED under each hours-ahead forecasted wind power-actual wind power scenario group. As a result, most of the constraints are considered in solving sub-UCED problem. The minimum on/off hours constraints of conventional units and the reliability constraints are both considered in the master problem solving. The minimum on/off hours of conventional units could be met directly by integer coding in GA algorithm. The reliability constraints are considered by feasibility checking as follows.(1)*Chromosome Definition.* The chromosomes consist of concatenated positive/negative integers that represent the duration of the “ON/OFF” cycles for each unit during the scheduling period [33]. Positive integers represent durations of ON cycles and negative integers represent duration of OFF cycles of the unit.(2)*Initialization*. To improve the quality of initial population, parts of initial individuals are generated by solving UCED problems with one or more wind scenarios using MILP method. And to increase the diversity of the population, other parts of initial individuals satisfying the unit minimum uptime and downtime constraints are randomly generated.(3)*Fitness Function.* Each individual is evaluated by a fitness function as follows:
where represents the expected total costs according to the current UC decision and is a system-dependent constant used to avoid getting too small fitness values.(4)*Selection*. The selection is based on the roulette-wheel mechanism, so that the chromosome owning a higher fitness value should therefore have a higher chance to be selected.(5)*Crossover*. To enhance the exchanges of good genes between different chromosomes, a hybrid crossover composed of two crossover operators is used. One operator selects one or two crossing units in the parent chromosomes and exchanges their whole schedules. The other operator randomly selects one or two ON/OFF cycles of randomly selected units and exchanges them and then adjusts the durations of remaining cycles with the least adjusting time to ensure that the sum of durations of selected units is equal to scheduling period.(6)*Mutation*. Similar to the crossover operators used, a hybrid mutation composed of two mutation operators is applied. One mutation operator changes the whole schedules of selected unit of the parent chromosomes using randomly generated durations of ON/OFF cycles. The other mutation operator changes the cycling duration of one randomly selected position of the selected unit and makes corresponding adjustments to the other ON/OFF cycles of the selected units with the least adjustment times.(7)*Elitism*. To avoid the destruction through a genetic operator during the evolution process, the best individual of each generation is directly copied to the next.(8)*Local Search*. To improve the local search ability of the GA algorithm, a local search algorithm proposed in [34] is applied to the best individual at each generation. The main practice of this local search is increasing/decreasing each ON/OFF cycle duration of each unit by 1 and making corresponding adjustment to the other integers with the least adjusting times and then replacing the best individual with the newly generated one, if its fitness value is higher than the original value.

*(c) Feasibility Checking and UC Decision Evaluation*. For each day-ahead UC decision produced by the crossover and mutation operation, the intraday UC adjustment scheduling and economic dispatching should be carried out under each possible hour-ahead forecasted and actual wind scenario group to check their feasibility (the chance constraints) and evaluate their fitness value. This is in practice a birandom simulation. There are two kinds of chance constraints in the proposed model. One is the constraint (7) which ensures the subfast units can be adjusted to start up in intraday operation only when the reliability index is lower than the required value. This chance constraint is considered in the sub-UCED problem under each wind scenario group. The other one is the reliability constraint being considered in GA by feasibility checking. The feasibility checking and evaluation are done according to the following steps.(1)Set and .(2)Set and .(3)Set . Carry out IUC-ED (intraday UC adjustment-economic dispatching) scheduling assuming the hours-ahead forecasted wind scenario -actual wind scenario group () is realized, and then calculate the total costs and the total hours satisfying ().(4)If , repeat step .(5)Calculate the expected total costs when the scenario being realized, according to (26)
where represents the probability of if is realized; represents the total costs when scenario group is realized.(6)Calculate according to (27). If , set . One has
(7)If , repeat step to step .(8)If , return the current UC decision being feasible, and then calculate the expected total costs according to (28), or else the current UC decision is infeasible. Consider
where represents the probability of the scenario realization; represents the expected total costs according to the current UC decision.

#### 4. Numerical Results

##### 4.1. Illustrative Case

The proposed approach is implemented on a revised 10-unit system presented in [35] first to demonstrate and verify the proposed three-stage UC policy. Units and load data of the 10-unit system are illustrated in Tables 1 and 2, respectively. Table 3 gives the day-ahead forecast wind power output. The wind forecast errors with different forecast horizons are shown in Figure 3. The intraday UC adjustment stage is assumed to be carried out 4 hours earlier before the real time.

In the genetic algorithm, 10 actual wind scenarios and 5 hours-ahead forecasted wind scenarios for each actual wind scenario are generated. The pop size is 20. The probability of crossover was set as 0.7, and probability of mutation was set as 0.2. The initial individuals include 10 UC decisions obtained at each actual wind scenario, 5 UC decisions obtained at randomly grouped 2 actual wind scenarios, 1 UC result obtained with all the 10 actual wind scenarios, 1 UC result considering the day-ahead forecasted wind as a perfect forecasting, and randomly generated 3 UC schedules meeting the minimum uptimes/downtimes of units. The maximum number of generation is 100. The cost of load shedding is assumed to be 3000$/MWh. To compare with the proposed model, the traditional two-stage stochastic UC was also implemented on the test system.

The UCED and two-stage SUC problems in all case studies have been solved using CPLEX 12 under Matlab. An AMD Core computer at 3.01 GHz and 4 GB of RAM has been used.

Table 4 shows the UC decision according to the traditional two-stage stochastic UC. Table 5 shows the day-ahead UC decision according to the proposed three-stage birandom UC, in which the red ones present the different states compared with traditional two-stage UC decision. The optimal objective function value using traditional two-stage stochastic UC model is $485760.87, whereas the optimal objective function value using the proposed three-stage birandom UC model is $483832.80. Compared with the traditional two-stage model, it saves approximately $1928 if the proposed approach is used. Table 6 shows the final UC decision using the proposed approach in wind scenario group 1-1. It can be seen that, during hours 11–14, unit 6 is starting up according to intraday UC adjustment decision, but compared with the UC decision using two-stage stochastic policy, the committed generation capacity is lower, resulting in lower expected total costs. It should be presented that in some wind scenario groups no intraday UC adjustment action should be done. The intraday UC adjustment actions were carried out in 27 simulated scenarios, which were 54 percent of the whole 50 scenarios.

##### 4.2. Test Case

The proposed approach is implemented on a revised IEEE118 bus system with 33 conventional units to test its validity. The load and day-ahead forecasted wind power output data are shown in Figure 4. The algorithm parameters setting and the wind forecast error curve are the same as in the illustrative case. In order to analyze the dispatch in real-time scenarios, the resulting schedules were evaluated in 500 randomly simulated wind profile realizations. When applying the proposed policy, the hours-ahead forecasted wind data were also randomly simulated. The expected total costs are summarized at the bottom of Table 7. Results reveal that the application of proposed policy and model reduced operating costs by about 0.4% with respect to traditional two-stage stochastic policy. However, it can be seen that it needed much longer solving time when using proposed model because of simulation method being used. In practice, the computation performance may be improved by using a parallel algorithm, because the fitness calculation and feasibility checking of individuals are independent of each other.

##### 4.3. Influence of Forecast Accuracy

The main contribution of the proposed UC policy and model is integrating intraday UC adjustment process, on the theoretical basis that the wind forecast accuracy is increased with the forecast length shortening. Another two wind forecast error curves shown in Figure 5 were applied to test the influence of wind forecast accuracy on the cost saving benefit of proposed approach. The two wind forecast error curves both increase the forecast error but in various ways. In forecast error curve a, the ultra-short-term forecast error is the same as the base case; however, when the forecast length is longer than several hours, it gradually increases. In forecast error curve b, the forecast error with longer horizons is the same as the base case, but the ultra-short-term forecast error is higher than that of the base case. 500 randomly simulated wind profile realizations were also used to evaluate the resulting schedules.

Table 8 shows the optimal objective values and the expected total costs of simulation when applying the proposed model and the two-stage stochastic model. It can be seen that the total costs with both simulated wind power forecast error curves and using both UC models are higher than those of base case, correspondingly. Compared with the two-stage stochastic model, the proposed model could reduce the total costs with both two wind power forecast error curves. However, when the wind forecast error follows curve a, the cost savings are higher compared with the base case, whereas when the wind forecast error follows curve b, it saves less. This shows an obvious benefit of higher ultra-short-term wind forecast accuracy if using the proposed model, which means even when the day-ahead forecast accuracy is much lower, the operation costs will not be so high if ultra-short-term forecast accuracy is high, when using the proposed policy and model; however, if the trend of forecast error decreasing with the forecast horizon is not so clear, the cost saving effect of using the proposed model will be reduced.

#### 5. Conclusions

This paper presents a novel three-stage UC policy and a corresponding equilibrium chance-constrained three-stage birandom UC model for the power systems with wind power uncertainty. The main contribution of this paper is to integrate hours-ahead UC adjustment stage into traditional two-stage UC, based on the feature of wind power forecast accuracy that can be increased if the forecast length is shorter. A birandom simulation based hybrid genetic algorithm is designed to solve the proposed model. The following conclusions can be indicated by numerical results.(1)The operation costs of power systems with wind power integration can be reduced by applying the proposed three-stage UC policy and the corresponding birandom UC model.(2)The improvement level of hours-ahead wind power forecast accuracy compared with day-ahead forecast accuracy greatly influences the benefit of applying the proposed UC policy and model. When the day-ahead forecast accuracy is low, the operation costs will not be so high if hours-ahead forecast accuracy is higher, when using the proposed policy and model. However, if the trend of forecast error decreasing with the forecast horizon is not so clear, the cost saving effect of using the proposed model will be reduced.(3)When the day-ahead wind forecast accuracy cannot be satisfactorily improved, improving the ultra-short-term wind forecast accuracy can further reduce the operation costs if using the proposed approach.(4)Solving the proposed birandom UC model needs much longer time. But, in practice, the computation performance may be improved by using a parallel algorithm, because the fitness calculation and feasibility checking of individuals are independent of each other.

#### Appendix

#### A. Some Basic Concepts on Birandom Theory

Stochastic programming was set up independently by Dantzig, Charnes, and Cooper in the 1950s. Over the past few decades, stochastic programming modeling and solving have gotten considerable development. It has been widely applied to the real-life decision making problem in many fields such as finance, production scheduling, certainly, and power system planning and dispatching, especially in the system scheduling with large-scale renewable energy power in recent years. To describe the twofold randomness which is ubiquitously throughout the real life, Peng and Liu proposed birandom variable and birandom programming [18]. In the uncertain theory, a birandom variable is a mapping from a probability space to a collection of random variables. Roughly speaking, it is a “random variable” taking random variable values. Some knowledge of birandom theory is introduced in this section [18].

##### A.1. The Definition of Birandom Variable

A birandom variable is a mapping from a probability space to a collection of random variables for any Borel subset of the real line . The induced function is a measurable function with respect to .

An* n-*dimensional birandom vector is a mapping from the probability space to a collection of* n-*dimensional random vector such that is a measurable function with respect to for any Borel subset of the real space .

##### A.2. Expected Value Operator

The expected value of a birandom variable is somewhat similar to that of a random one.

Let be a birandom variable defined on the probability space . Then the expected value of birandom variable is defined as provided that at least one of the above two integrals is finite.

##### A.3. Chance Measures

For applying to further mathematical analysis, several methods have been suggested to define the chance measures of birandom event, two of which are introduced in this section.

Let be a birandom vector on and a vector-valued Borel measurable function. Then the primitive chance of birandom event characterized by is a function from to , defined as

The equilibrium chance of birandom event characterized by is defined as

It was proved in [21] that

The equilibrium chance of birandom event has been widely applied in the chance-constrained program modeling with birandom parameters in recent years, and some good results have been obtained. The equilibrium chance is employed in the proposed model in this paper to describe the system reliability constraints in birandom environment.

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### References

- L. Soder, “Reserve margin planning in a wind-hydro-thermal power system,”
*IEEE Transactions on Power Systems*, vol. 8, no. 2, pp. 564–570, 1993. View at Publisher · View at Google Scholar · View at Scopus - R. Doherty and M. O'Malley, “A new approach to quantify reserve demand in systems with significant installed wind capacity,”
*IEEE Transactions on Power Systems*, vol. 20, no. 2, pp. 587–595, 2005. View at Publisher · View at Google Scholar · View at Scopus - M. A. Ortega-Vazquez and D. S. Kirschen, “Estimating the spinning reserve requirements in systems with significant wind power generation penetration,”
*IEEE Transactions on Power Systems*, vol. 24, no. 1, pp. 114–124, 2009. View at Publisher · View at Google Scholar · View at Scopus - P. Carpentier, G. Cohen, J. C. Culioli, and A. Renaud, “Stochastic optimization of unit commitment: a new decomposition framework,”
*IEEE Transactions on Power Systems*, vol. 11, pp. 1067–1073, 1996. View at Google Scholar - H. Siahkali and M. Vakilian, “Stochastic unit commitment of wind farms integrated in power system,”
*Electric Power Systems Research*, vol. 80, no. 9, pp. 1006–1017, 2010. View at Publisher · View at Google Scholar · View at Scopus - A. Tuohy, P. Meibom, E. Denny, and M. O'Malley, “Benefits of stochastic scheduling for power systems with significant installed wind power,” in
*Proceedings of the 10th International Conference on Probabilistic Methods Applied to Power Systems (PMAPS '08)*, pp. 18–24, Rincon, Puerto rico, May 2008. View at Scopus - A. Tuohy, P. Meibom, E. Denny, and M. O'Malley, “Unit commitment for systems with significant wind penetration,”
*IEEE Transactions on Power Systems*, vol. 24, no. 2, pp. 592–601, 2009. View at Publisher · View at Google Scholar · View at Scopus - P. A. Ruiz, C. R. Philbrick, and P. W. Sauer, “Wind power day-ahead uncertainty management through stochastic unit commitment policies,” in
*IEEE/PES Power Systems Conference and Exposition (PSCE '09)*, IEEE Computer Society, Seattle, Wash, USA, March 2009. View at Publisher · View at Google Scholar · View at Scopus - U. A. Ozturk, M. Mazumdar, and B. A. Norman, “A solution to the stochastic unit commitment problem using chance constrained programming,”
*IEEE Transactions on Power Systems*, vol. 19, no. 3, pp. 1589–1598, 2004. View at Publisher · View at Google Scholar · View at Scopus - H. S. Wu, M. Shahidehpour, Z. Li, and W. Tian, “Chance-constrained day-ahead scheduling in stochastic power system operation,”
*IEEE Transactions on Power Systems*, 2014. View at Publisher · View at Google Scholar - Q. Wang, J. Wang, and Y. Guan, “Price-based unit commitment with wind power utilization constraints,”
*IEEE Transactions on Power Systems*, vol. 28, no. 3, pp. 2718–2726, 2013. View at Publisher · View at Google Scholar - Q. Wang, Y. Guan, and J. Wang, “A chance-constrained two-stage stochastic program for unit commitment with uncertain wind power output,”
*IEEE Transactions on Power Systems*, vol. 27, no. 1, pp. 206–215, 2012. View at Publisher · View at Google Scholar · View at Scopus - R. Jiang, J. Wang, and Y. Guan, “Robust unit commitment with wind power and pumped storage hydro,”
*IEEE Transactions on Power Systems*, vol. 27, no. 2, pp. 800–810, 2012. View at Publisher · View at Google Scholar · View at Scopus - C. Zhao, J. Wang, J.-P. Watson, and Y. Guan, “Multi-stage robust unit commitment considering wind and demand response uncertainties,”
*IEEE Transactions on Power Systems*, vol. 28, pp. 2708–2717, 2013. View at Google Scholar - B. Venkatesh, P. Yu, H. B. Gooi, and D. Choling, “Fuzzy MILP unit commitment incorporating wind generators,”
*IEEE Transactions on Power Systems*, vol. 23, no. 4, pp. 1738–1746, 2008. View at Publisher · View at Google Scholar · View at Scopus - A. Tuohy, E. Denny, and M. O'Malley, “Rolling unit commitment for systems with significant installed wind capacity,” in
*IEEE Lausanne POWERTECH*, pp. 1380–1385, Inst. of Elec. and Elec. Eng. Computer Society, Lausanne, Switzerland, July 2007. View at Publisher · View at Google Scholar · View at Scopus - E. Pereira-Bonvallet, C. Suazo-Martinez, and R. Palma-Behnke, “A stochastic unit commitment policy for wind power uncertainty integrating corrective actions,” in
*IEEE Power and Energy Society General Meeting*, pp. 1–5, IEEE, Piscataway, NJ, USA, July 2013. View at Publisher · View at Google Scholar - J. Peng and B. Liu, “Birandom variables and birandom programming,”
*Computers and Industrial Engineering*, vol. 53, no. 3, pp. 433–453, 2007. View at Publisher · View at Google Scholar · View at Scopus - J. Xu and C. Ding, “A class of chance constrained multiobjective linear programming with birandom coefficients and its application to vendors selection,”
*International Journal of Production Economics*, vol. 131, no. 2, pp. 709–720, 2011. View at Publisher · View at Google Scholar · View at Scopus - J. Xu and X. Zhou, “A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem,”
*Information Sciences*, vol. 179, no. 17, pp. 2997–3017, 2009. View at Publisher · View at Google Scholar · View at Scopus - Z. M. Tao and J. P. Xu, “An equilibrium chance-constrained multiobjective programming model with birandom parameters and its application to inventory problem,”
*Journal of Applied Mathematics*, vol. 2013, Article ID 382620, 12 pages, 2013. View at Publisher · View at Google Scholar - J. P. Xu and Z. M. Tao, “A class of multi-objective equilibrium chance maximization model with twofold random phenomenon and its application to hydropower station operation,”
*Mathematics and Computers in Simulation*, vol. 85, pp. 11–33, 2012. View at Google Scholar - W. Ongsakul and N. Petcharaks, “Unit commitment by enhanced adaptive Lagrangian relaxation,”
*IEEE Transactions on Power Systems*, vol. 19, no. 1, pp. 620–628, 2004. View at Publisher · View at Google Scholar · View at Scopus - W. L. Snyder Jr., H. D. Powell Jr., and J. C. Rayburn, “Dynamic programming approach to unit commitment,”
*IEEE Transactions on Power Systems*, vol. 2, no. 2, pp. 339–350, 1987. View at Google Scholar · View at Scopus - M. Carrión and J. M. Arroyo, “A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem,”
*IEEE Transactions on Power Systems*, vol. 21, no. 3, pp. 1371–1378, 2006. View at Publisher · View at Google Scholar · View at Scopus - L. F. G. Baptistella and J. C. Geromel, “A decomposition approach to problem of unit commitment schedule for hydrothermal systems,”
*IEE Proceedings D: Control Theory and Applications*, vol. 127, no. 6, pp. 250–258, 1980. View at Google Scholar · View at Scopus - I. G. Damousis, A. G. Bakirtzis, and P. S. Dokopoulos, “A solution to the unit-commitment problem using integer-coded genetic algorithm,”
*IEEE Transactions on Power Systems*, vol. 19, no. 2, pp. 1165–1172, 2004. View at Publisher · View at Google Scholar · View at Scopus - T. Senjyu, A. Y. Saber, T. Miyagi, K. Shimabukuro, N. Urasaki, and T. Funabashi, “Fast technique for unit commitment by genetic algorithm based on unit clustering,”
*IEE Proceedings: Generation, Transmission and Distribution*, vol. 152, pp. 705–713, 2005. View at Google Scholar - P. A. Ruiz, C. R. Philbrick, and P. W. Sauer, “Modeling approaches for computational cost reduction in stochastic unit commitment formulations,”
*IEEE Transactions on Power Systems*, vol. 25, no. 1, pp. 588–589, 2010. View at Publisher · View at Google Scholar · View at Scopus - X. Peng and P. A. Jirutitijaroen, “A stochastic optimization formulation of unit commitment with reliability constraints,”
*IEEE Transactions on Smart Grid*, vol. 4, no. 4, pp. 2200–2208, 2013. View at Publisher · View at Google Scholar - H. Heitsch and W. Römisch, “Scenario reduction algorithms in stochastic programming,”
*Computational Optimization and Applications*, vol. 24, no. 2-3, pp. 187–206, 2003. View at Publisher · View at Google Scholar · View at Scopus - J. Dupačová, N. Gröwe-Kuska, and W. Römisch, “Scenario reduction in stochastic programming: an approach using probability metrics,”
*Mathematical Programming, Series B*, vol. 95, no. 3, pp. 493–511, 2003. View at Publisher · View at Google Scholar · View at Scopus - N. Amjady and A. Shirzadi, “Unit commitment using a new integer coded genetic algorithm,”
*European Transactions on Electrical Power*, vol. 19, no. 8, pp. 1161–1176, 2009. View at Publisher · View at Google Scholar · View at Scopus - G. Xiong, X. Liu, and T. Hashiyama, “Stochastic unit commitment problem considering risk constraints and its improved GA-based solution method,”
*IEEJ Transactions on Electrical and Electronic Engineering*, vol. 8, no. 5, pp. 463–469, 2013. View at Publisher · View at Google Scholar - S. A. Kazarlis, A. G. Bakirtzis, and V. Petridis, “A genetic algorithm solution to the unit commitment problem,”
*IEEE Transactions on Power Systems*, vol. 11, pp. 83–92, 1996. View at Publisher · View at Google Scholar