Skip to main content

Advertisement

Log in

Stochastic hydro-thermal unit commitment via multi-level scenario trees and bundle regularization

  • Research Article
  • Published:
Optimization and Engineering Aims and scope Submit manuscript

Abstract

For an electric power mix subject to uncertainty, the stochastic unit-commitment problem finds short-term optimal generation schedules that satisfy several system-wide constraints. In regulated electricity markets, this very practical and important problem is used by the system operator to decide when each unit is to be started or stopped, and to define how to generate enough energy to meet the load. For hydro-dominated systems, an accurate description of the hydro-production function involves non-convex relations. This feature, combined with the fine time discretization needed to represent uncertainty of renewable generation, yields a large-scale mathematical optimization model that is nonlinear and has mixed-integer variables. To make the problem tractable, a novel solution strategy, based on multi-horizon scenario trees, is proposed. The approach deals in a first level with the integer decision variables representing whether units are on or off. Once units are committed, the expected operational cost is minimized by solving a continuous second-level problem, which is separable by scenarios. The coordination between the two decision levels is done by means of a bundle-like variant of Benders decomposition that proves very efficient for the considered setting. To assess the quality of the optimal commitment on out-of-sample scenarios, a new simulation technique, based on certain sustainable pseudo-distance is proposed. For the numerical experiments, a mix of hydro, thermal, and wind power plants extracted from the Brazilian power system is considered. The results confirm the interest of the approach, particularly regarding a more efficient management of hydro-plants, because non-convex operational regions are considered by the model.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  • Baena D, Castro J, Frangioni A (2019) Stabilized Benders methods for large-scale combinatorial optimization, with application to data privacy. Manag Sci (to appear)

  • Bonnans J, Gilbert J, Lemaréchal C, Sagastizábal C (2006) Numerical optimization. Theoretical and practical aspects. Universitext, 2nd edn, xiv+490 pp. Springer, Berlin

  • Cadoux F (2010) Computing deep facet-defining disjunctive cuts for mixed-integer programming. Math Program Ser A 122(2):197–223

    Article  MathSciNet  MATH  Google Scholar 

  • de Oliveira W (2016) Regularized optimization methods for convex MINLP problems. TOP 24(3):665–692

    Article  MathSciNet  MATH  Google Scholar 

  • de Oliveira W, Sagastizábal C (2014) Level Bundle methods for oracles with on-demand accuracy. Optim Methods Softw 29(6):1180–1209

    Article  MathSciNet  MATH  Google Scholar 

  • Diniz AL, Maceira MEP (2008) A four-dimensional model of hydro generation for the short-term hydrothermal dispatch problem considering head and spillage effects. IEEE Trans Power Syst 23(3):1298–1308

    Article  Google Scholar 

  • Fábián C, Wolf C, Koberstein A, Suhl L (2015) Risk-averse optimization in two-stage stochastic models: computational aspects and a study. SIAM J Optim 25(1):28–52

    Article  MathSciNet  MATH  Google Scholar 

  • Fredo GLM, Finardi EC, de Matos VL (2019) Assessing solution quality and computational performance in the long-term generation scheduling problem considering different hydro production function approaches. Renew Energy 131:45–54

    Article  Google Scholar 

  • Finardi EC, Scuzziato MR (2013) Hydro unit commitment and loading problem for day-ahead operation planning problem. Int J Electr Power Energy Syst 44(1):7–16

    Article  Google Scholar 

  • Fischetti M, Salvagnin D, Zanette A (2010) A note on the selection of Benders’ cuts. Math Program 124(1):175–182

    Article  MathSciNet  MATH  Google Scholar 

  • Geoffrion AM (1972) Generalized Benders decomposition. J Optim Theory Appl 10:237–260

    Article  MathSciNet  MATH  Google Scholar 

  • Geoffrion AM, Graves GW (1974) Multicommodity distribution system design by Benders decomposition. Manag Sci 20(5):822–844

    Article  MATH  Google Scholar 

  • Gjelsvik A, Hautstad A (2005) Considering head variations in a linear model for optimal hydro scheduling. SINTEF Energy Research, Trondheim

    Google Scholar 

  • IBM: IBM ILOG CPLEX Optimizer, High-performance mathematical programming solver for linear programming, mixed integer programming, and quadratic programming. http://www-01.ibm.com/software/commerce/optimization/cplex-optimizer/

  • Kaut M, Midthun KT, Werner AS, Tomasgard A, Hellemo L, Fodstad M (2014) Multi-horizon stochastic programming. Comput Manag Sci 11(1):179–193

    Article  MathSciNet  MATH  Google Scholar 

  • Kang C, Chen C, Wang J (2018) An effcient linearization method for long-term operation of cascaded hydropower reservoirs. Water Resour Manag 32(10):3391–3404

    Article  Google Scholar 

  • Kiwiel KC (1995) Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities. Math Program 69(1):89–109

    MathSciNet  MATH  Google Scholar 

  • Kall P, Wallace SW (1994) Stochastic programming. Wiley, Hoboken

    MATH  Google Scholar 

  • Li X, Tomasgard A, Barton PI (2011) Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs. J Optim Theory Appl 151(3):425

    Article  MathSciNet  MATH  Google Scholar 

  • McDaniel D, Devine M (1977) A modified Benders’ partitioning algorithm for mixed integer programming. Manag Sci 24(3):312–319

    Article  MATH  Google Scholar 

  • Malick J, de Oliveira W, Zaourar S (2017) Uncontrolled inexact information within bundle methods. EURO J Comput Optim 5(1–2):5–29

    Article  MathSciNet  MATH  Google Scholar 

  • Magnanti TL, Wong RT (1981) Accelerating Benders decomposition: algorithmic enhancement and model selection criteria. Oper Res 29(3):464–484

    Article  MathSciNet  MATH  Google Scholar 

  • Oliveira W, Sagastizábal C, Penna D, Maceira M, Damazio J (2010) Optimal scenario tree reduction for stochastic streamflows in power generation planning problems. Optim Methods Softw 25(6):917–936

    Article  MathSciNet  MATH  Google Scholar 

  • Oliveira W, Sagastizábal C, Scheimberg S (2011) Inexact Bundle methods for two-stage stochastic programming. SIAM J Optim 21(2):517–544

    Article  MathSciNet  MATH  Google Scholar 

  • Papavasiliou A, Oren SS (2012) A stochastic unit commitment model for integrating renewable supply and demand response. In: Power and Energy Society General Meeting, 2012 IEEE. IEEE, pp 1–6

  • Papavasiliou A, Oren SS (2013) Multiarea stochastic unit commitment for high wind penetration in a transmission constrained network. Oper Res 61(3):578–592

    Article  MathSciNet  MATH  Google Scholar 

  • Ruszczyński A (1986) A regularized decomposition method for minimizing a sum of polyhedral functions. Math Program 35(3):309–333

    Article  MathSciNet  MATH  Google Scholar 

  • Sheble GB, Fahd GN (1994) Unit commitment literature synopsis. IEEE Trans Power Syst 9(1):128–135

    Article  Google Scholar 

  • Sioshansi R, Short W (2009) Evaluating the impacts of real-time pricing on the usage of wind generation. IEEE Trans Power Syst 24(2):516–524

    Article  Google Scholar 

  • Silva LM, Zambon RC (2013) Nonlinearities in reservoir operation for hydropower production. In: Patterson CL, Struck SD, Murray DJ (eds) World Environmental and Water Resources Congress 2013. Cincinnati, Ohio, pp 2429–2439

  • Tahanan M, Van Ackooij W, Frangioni A, Lacalandra F (2015) Large-scale unit commitment under uncertainty. 4OR 13(2):115–171

    Article  MathSciNet  MATH  Google Scholar 

  • Tütüncü RH, Toh KC, Todd MJ (2003) Solving semidefinite-quadratic-linear programs using SDPT3. Math Program 95(2):189–217

    Article  MathSciNet  MATH  Google Scholar 

  • Wächter A, Biegler LT (2006) On the implementation of a primal–dual interior point filter line search algorithm for large-scale nonlinear programming. Math Program 106(1):25–57

    Article  MathSciNet  MATH  Google Scholar 

  • Wang J, Shahidehpour M, Li Z (2008) Security-constrained unit commitment with volatile wind power generation. IEEE Trans Power Syst 23(3):1319–1327

    Article  Google Scholar 

  • Zhao B, Conejo AJ, Sioshansi R (2017) Unit commitment under gas-supply uncertainty and gas-price variability. IEEE Trans Power Syst 32(3):2394–2405

    Article  Google Scholar 

  • Zaourar S, Malick J (2014) Quadratic stabilization of Benders decomposition. HALL 01181273 preprint

  • Zakeri G, Philpott AB, Ryan DM (2000) Inexact cuts in Benders decomposition. SIAM J Optim 10(3):643–657 (electronic)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

R. D. Lobato: Research of this author is supported by FAPESP Grants 2015/18053-9 and 2017/05198-4. C. Sagastizábal: Research of this author is supported by CNPq Grant 303905/2015-8 and by CEMEAI.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to C. Sagastizábal.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendices

Appendices

Details for the stochastic unit commitment solver and the test system are given below, respectively in Appendices 1 and 2.

Appendix 1: Algorithm with the full SUC solver

In Algorithm 4 below, the probability of operational scenario j, conditioned to the strategic scenario i is denoted by \({\mathfrak {p}}^{ij}.\)

figure d

Appendix 2: System details

Below we provide the details about the system considered in the experiments presented in Sect. 5. As shown in Fig. 4, the system has three hydro-plants, each of which having a water reservoir. Table 5 presents the initial, minimum, and maximum volume of the reservoirs of the hydro-plants, and the maximum volume of water spilled per hour. All volumes are in \(\hbox {hm}^3\). The hydro-plants numbered 1, 2, and 3 have 3, 5, and 4 units, respectively. Units belonging to the same hydro-plant are identical. Table 6 shows the characteristics of the units of each hydro-plant. The second column shows the maximum number of times each unit can be switched on within the time horizon; the third and fourth columns present the minimum and maximum generation of each unit (in MW); and the fifth and sixth columns show the minimum and maximum outflow of each unit (in \(\hbox {hm}^3\)). Hydro-plant number 1 is upstream to hydro-plant number number 2 and has 1-h water travel time.

Table 5 Characteristics of each hydro-plant
Table 6 Characteristics of each individual unit of each hydro-plant

The system has seven thermal units. The details about each thermal unit are displayed in Tables 7 and 8. The first column of each table shows the unit numbers. In Table 7, the second column shows the buses in which the units are located (see Fig. 4); the third column presents the start-up costs; the fourth and fifth columns show the minimum and maximum power generation (in MW) of each unit when they are on; the sixth and seventh columns exhibit the ramp-up and -down rates (in MW). In Table 8, the second and third columns show the minimum time (in hours) the units must be on (after they are switched on) and off (after they are switched off), respectively; the fourth column indicates whether the units are on or off at the beginning; while the fifth column informs how long (in hours) they are in that state; and, finally, the last column shows the generation (in MW) of the units at the beginning.

Table 7 Characteristics of each thermal unit
Table 8 Characteristics of each thermal unit (continuation)

As shown in Fig. 4, there are four load demands, located at buses 1, 2, 3, and 4. We have considered the same demand for each scenario. Table 9 presents the demand for each time step at each bus.

Table 9 Demand (MW) at each bus

The water inflow at time t in plant h is given by

$$\begin{aligned} \xi ^{\text {inflow}}_{th} = \xi ^{\text {inflow}}_{t-1,h} \max (0, \zeta + \phi ) \end{aligned}$$

where the random variable \(\zeta \) has a normal distribution with mean 1 and standard deviation 0.025, \(\phi \) has a uniform distribution on the interval \([-0.1,0.1]\), and \(\xi ^{\text {inflow}}_{0,1} = 151\), \(\xi ^{\text {inflow}}_{0,2} = 229\), and \(\xi ^{\text {inflow}}_{0,3} = 260\). The wind power produced at time t in bus b is given by

$$\begin{aligned} \xi ^{\text {wind}}_{tb} = \left\{ \begin{array}{ll} \min (0.1 \vartheta , \xi ^{\text {wind}}_{t-1,b} + 0.05 \vartheta \beta ), &{} \text {if this quantity is non-negative},\\ \xi ^{\text {wind}}_{t-1,b} (1 + \varrho ), &{} \text {otherwise}, \end{array} \right. \end{aligned}$$

where \(\vartheta \) is the average of the total demand, \(\xi ^{\text {wind}}_{0,b} = 0.05 \vartheta \), \(\beta \) has a uniform distribution on the interval \([-1,1]\), and \(\varrho \) has a uniform distribution on the interval [1, 2].

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Finardi, E.C., Lobato, R.D., de Matos, V.L. et al. Stochastic hydro-thermal unit commitment via multi-level scenario trees and bundle regularization. Optim Eng 21, 393–426 (2020). https://doi.org/10.1007/s11081-019-09448-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11081-019-09448-z

Keywords

Mathematics Subject Classification

Navigation