IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-1-4614-9035-7_5.html
   My bibliography  Save this book chapter

On Cutting Plane Algorithms and Dynamic Programming for Hydroelectricity Generation

In: Handbook of Risk Management in Energy Production and Trading

Author

Listed:
  • Andy Philpott

    (University of Auckland)

  • Anes Dallagi

    (EDF R&D)

  • Emmanuel Gallet

    (EDF R&D)

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.

Suggested Citation

  • Andy Philpott & Anes Dallagi & Emmanuel Gallet, 2013. "On Cutting Plane Algorithms and Dynamic Programming for Hydroelectricity Generation," International Series in Operations Research & Management Science, in: Raimund M. Kovacevic & Georg Ch. Pflug & Maria Teresa Vespucci (ed.), Handbook of Risk Management in Energy Production and Trading, edition 127, chapter 0, pages 105-127, Springer.
  • Handle: RePEc:spr:isochp:978-1-4614-9035-7_5
    DOI: 10.1007/978-1-4614-9035-7_5
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:isochp:978-1-4614-9035-7_5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.