Skip to main content

On Cutting Plane Algorithms and Dynamic Programming for Hydroelectricity Generation

  • Chapter
  • First Online:
Handbook of Risk Management in Energy Production and Trading

Abstract

We consider dynamic programming (DP) approximations to hydro-electric reservoir scheduling problems. The first class of approximate DP methods uses decomposition and multi-modeling heuristics to produce policies that can be expressed as the sum of one-dimensional Bellman functions. This heuristic allows us to take into account non-convexities (appearing in models with head effect) by solving a MIP at each time stage. The second class of methods uses cutting planes and sampling. It is able to provide multidimensional policies. We show that the cutting plane methods will produce better policies than the first DP approximation on two convex problem formulations of different types. Modifying the cutting plane method to approximate the effect of reservoir head level on generation also yields better results on problems including these effects. The results are illustrated using tests on two river valley systems.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 249.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    A deterministic optimization is operated on the short-term (within a day) using a more accurate model in order to provide the actual feasible releases to be performed.

  2. 2.

    It could be the biggest one or the most valuable one from the operator’s point of view.

  3. 3.

    These restrictions are not in favor of the MORGANE heuristics. In fact the heuristics are able to take into account stochasticity and time dependency on the prices, end non-convexity constraints.

  4. 4.

    For confidentiality purposes, the units of measurement are omitted.

  5. 5.

    This has a different network topology, and so it provides a useful comparison of the effect of river-chain topology on the policies from the two methodologies. As before, DOASA was run for 100 iterations, giving 100 cuts at each stage.

  6. 6.

    An experiment with 200 cuts gave a smaller upper bound of 716.700 and an estimated value of 716.467 with a standard error of 0.833.

References

  1. Archibald T, Buchanan C, McKinnon K, Thomas L (1999) Nested Benders decomposition and dynamic programming for reservoir optimisation. J Oper Res Soc 50(5):468–479

    Google Scholar 

  2. Archibald T, McKinnon K, Thomas L (2006) Modeling the operation of multireservoir systems using decomposition and stochastic dynamic programming. Nav Res Log (NRL) 53(3):217–225

    Article  Google Scholar 

  3. Barty K, Carpentier P (UMA), Cohen G (CERMICS), Girardeau P (UMA, CERMICS) (2010) Price decomposition in large-scale stochastic optimal control. http://arxiv.org/pdf/1012.2092v2 (submitted)

  4. De Matos V, Philpott A, Finardi E, Guan Z (2010) Solving long-term hydro-thermal scheduling problems. Technical report, Electric Power Optimization Centre, University of Auckland

    Google Scholar 

  5. 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 

  6. Dubost L, Gonzalez R, Lemaréchal C (2005) A primal-proximal heuristic applied to the French unit-commitment problem. Math Program (A 104):129–151

    Google Scholar 

  7. Jacobs J, Freeman G, Grygier J, Morton D, Schultz G, Staschus K, Stedinger J (1995) SOCRATES: a system for scheduling hydroelectric generation under uncertainty. Ann Oper Res 59:99–133

    Article  Google Scholar 

  8. Little, J. (1955), The use of storage water in a hydroelectric system, J Oper Res Soc Amer 3(2):187–197.

    Google Scholar 

  9. Masse P (1946) Les réserves et la régulation de l’avenir dans la vie économique. Hermann, Paris

    Google Scholar 

  10. Pereira MVF, Pinto LMVG (1991) Multi-stage stochastic optimization applied to energy planning. Math Program 52:359–375

    Article  Google Scholar 

  11. Philpott A, Guan Z (2008) On the convergence of stochastic dual dynamic programming and other methods. Oper Res Lett 36:450–455

    Article  Google Scholar 

  12. Philpott A, Craddock M, Waterer H (2008) Hydro-electric unit commitment subject to uncertain demand. Eur J Oper Res 125:410–424

    Article  Google Scholar 

  13. Turgeon A (1980) Optimal operation of multireservoir power systems with stochastic inflows. Water Resour Res 16(2):275–283

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Andy Philpott .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this chapter

Cite this chapter

Philpott, A., Dallagi, A., Gallet, E. (2013). On Cutting Plane Algorithms and Dynamic Programming for Hydroelectricity Generation. In: Kovacevic, R., Pflug, G., Vespucci, M. (eds) Handbook of Risk Management in Energy Production and Trading. International Series in Operations Research & Management Science, vol 199. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-9035-7_5

Download citation

Publish with us

Policies and ethics