IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v15y2018i1d10.1007_s10287-017-0297-2.html
   My bibliography  Save this article

Stochastic dynamic programming approach to managing power system uncertainty with distributed storage

Author

Listed:
  • Luckny Zéphyr

    (Cornell University)

  • C. Lindsay Anderson

    (Cornell University)

Abstract

Wind integration in power grids is challenging because of the uncertain nature of wind speed. Forecasting errors may have costly consequences. Indeed, power might be purchased at highest prices to meet the load, and in case of surplus, power may be wasted. Energy storage may provide some recourse against the uncertainty of wind generation. Because of their sequential nature, in theory, power scheduling problems may be solved via stochastic dynamic programming. However, this scheme is limited to small networks by the so-called curse of dimensionality. This paper analyzes the management of a network composed of conventional power units and wind turbines through approximate dynamic programming, more precisely stochastic dual dynamic programming. A general power network model with ramping constraints on the conventional generators is considered. The approximate method is tested on several networks of different sizes. The numerical experiments also include comparisons with classical dynamic programming on a small network. The results show that the combination of approximation techniques enables to solve the problem in reasonable time.

Suggested Citation

  • Luckny Zéphyr & C. Lindsay Anderson, 2018. "Stochastic dynamic programming approach to managing power system uncertainty with distributed storage," Computational Management Science, Springer, vol. 15(1), pages 87-110, January.
    • Handle: RePEc:spr:comgts:v:15:y:2018:i:1:d:10.1007_s10287-017-0297-2
    DOI: 10.1007/s10287-017-0297-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10287-017-0297-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10287-017-0297-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Zéphyr, Luckny & Lang, Pascal & Lamond, Bernard F. & Côté, Pascal, 2017. "Approximate stochastic dynamic programming for hydroelectric production planning," European Journal of Operational Research, Elsevier, vol. 262(2), pages 586-601.
    2. Shapiro, Alexander & Tekaya, Wajdi & da Costa, Joari Paulo & Soares, Murilo Pereira, 2013. "Risk neutral and risk averse Stochastic Dual Dynamic Programming method," European Journal of Operational Research, Elsevier, vol. 224(2), pages 375-391.
    3. Keane, Michael P & Wolpin, Kenneth I, 1994. "The Solution and Estimation of Discrete Choice Dynamic Programming Models by Simulation and Interpolation: Monte Carlo Evidence," The Review of Economics and Statistics, MIT Press, vol. 76(4), pages 648-672, November.
    4. Nils Löhndorf & David Wozabal & Stefan Minner, 2013. "Optimizing Trading Decisions for Hydro Storage Systems Using Approximate Dual Dynamic Programming," Operations Research, INFORMS, vol. 61(4), pages 810-823, August.
    5. Anthony Papavasiliou & Shmuel S. Oren, 2013. "Multiarea Stochastic Unit Commitment for High Wind Penetration in a Transmission Constrained Network," Operations Research, INFORMS, vol. 61(3), pages 578-592, June.
    6. Yekini Suberu, Mohammed & Wazir Mustafa, Mohd & Bashir, Nouruddeen, 2014. "Energy storage systems for renewable energy power sector integration and mitigation of intermittency," Renewable and Sustainable Energy Reviews, Elsevier, vol. 35(C), pages 499-514.
    7. Sharon A. Johnson & Jery R. Stedinger & Christine A. Shoemaker & Ying Li & José Alberto Tejada-Guibert, 1993. "Numerical Solution of Continuous-State Dynamic Programs Using Linear and Spline Interpolation," Operations Research, INFORMS, vol. 41(3), pages 484-500, June.
    8. Shapiro, Alexander, 2011. "Analysis of stochastic dual dynamic programming method," European Journal of Operational Research, Elsevier, vol. 209(1), pages 63-72, February.
    9. C. Russell Philbrick & Peter K. Kitanidis, 2001. "Improved Dynamic Programming Methods for Optimal Control of Lumped-Parameter Stochastic Systems," Operations Research, INFORMS, vol. 49(3), pages 398-412, June.
    10. Succar, Samir & Denkenberger, David C. & Williams, Robert H., 2012. "Optimization of specific rating for wind turbine arrays coupled to compressed air energy storage," Applied Energy, Elsevier, vol. 96(C), pages 222-234.
    11. Moura, Pedro S. & de Almeida, Aníbal T., 2010. "The role of demand-side management in the grid integration of wind power," Applied Energy, Elsevier, vol. 87(8), pages 2581-2588, August.
    12. Bradbury, Kyle & Pratson, Lincoln & Patiño-Echeverri, Dalia, 2014. "Economic viability of energy storage systems based on price arbitrage potential in real-time U.S. electricity markets," Applied Energy, Elsevier, vol. 114(C), pages 512-519.
    13. Luckny Zéphyr & Pascal Lang & Bernard Lamond, 2015. "Controlled approximation of the value function in stochastic dynamic programming for multi-reservoir systems," Computational Management Science, Springer, vol. 12(4), pages 539-557, October.
    14. Wee, Jung-Ho, 2013. "A review on carbon dioxide capture and storage technology using coal fly ash," Applied Energy, Elsevier, vol. 106(C), pages 143-151.
    15. Huseyin Topaloglu & Warren B. Powell, 2006. "Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 31-42, February.
    16. PAPAVASILIOU, Anthony & OREN, Schmuel S., 2013. "Multiarea stochastic unit commitment for high wind penetration in a transmission constrained network," LIDAM Reprints CORE 2500, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    17. Philpott, A.B. & de Matos, V.L., 2012. "Dynamic sampling algorithms for multi-stage stochastic programs with risk aversion," European Journal of Operational Research, Elsevier, vol. 218(2), pages 470-483.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Luckny Zephyr & Bernard F. Lamond & Pascal Lang, 2024. "Hybrid simplicial-randomized approximate stochastic dynamic programming for multireservoir optimization," Computational Management Science, Springer, vol. 21(1), pages 1-44, June.
    2. Raimund M. Kovacevic, 2019. "Valuation and pricing of electricity delivery contracts: the producer’s view," Annals of Operations Research, Springer, vol. 275(2), pages 421-460, April.
    3. Fang, Xin & Hodge, Bri-Mathias & Jiang, Huaiguang & Zhang, Yingchen, 2019. "Decentralized wind uncertainty management: Alternating direction method of multipliers based distributionally-robust chance constrained optimal power flow," Applied Energy, Elsevier, vol. 239(C), pages 938-947.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. de Queiroz, Anderson Rodrigo, 2016. "Stochastic hydro-thermal scheduling optimization: An overview," Renewable and Sustainable Energy Reviews, Elsevier, vol. 62(C), pages 382-395.
    2. Daniel F. Salas & Warren B. Powell, 2018. "Benchmarking a Scalable Approximate Dynamic Programming Algorithm for Stochastic Control of Grid-Level Energy Storage," INFORMS Journal on Computing, INFORMS, vol. 30(1), pages 106-123, February.
    3. Zhou, Shaorui & Zhang, Hui & Shi, Ning & Xu, Zhou & Wang, Fan, 2020. "A new convergent hybrid learning algorithm for two-stage stochastic programs," European Journal of Operational Research, Elsevier, vol. 283(1), pages 33-46.
    4. Powell, Warren B., 2019. "A unified framework for stochastic optimization," European Journal of Operational Research, Elsevier, vol. 275(3), pages 795-821.
    5. D. Ávila & A. Papavasiliou & N. Löhndorf, 2022. "Parallel and distributed computing for stochastic dual dynamic programming," Computational Management Science, Springer, vol. 19(2), pages 199-226, June.
    6. Davi Valladão & Thuener Silva & Marcus Poggi, 2019. "Time-consistent risk-constrained dynamic portfolio optimization with transactional costs and time-dependent returns," Annals of Operations Research, Springer, vol. 282(1), pages 379-405, November.
    7. Rudloff, Birgit & Street, Alexandre & Valladão, Davi M., 2014. "Time consistency and risk averse dynamic decision models: Definition, interpretation and practical consequences," European Journal of Operational Research, Elsevier, vol. 234(3), pages 743-750.
    8. Schur, Rouven & Gönsch, Jochen & Hassler, Michael, 2019. "Time-consistent, risk-averse dynamic pricing," European Journal of Operational Research, Elsevier, vol. 277(2), pages 587-603.
    9. Dias, Bruno Henriques & Tomim, Marcelo Aroca & Marcato, André Luís Marques & Ramos, Tales Pulinho & Brandi, Rafael Bruno S. & Junior, Ivo Chaves da Silva & Filho, João Alberto Passos, 2013. "Parallel computing applied to the stochastic dynamic programming for long term operation planning of hydrothermal power systems," European Journal of Operational Research, Elsevier, vol. 229(1), pages 212-222.
    10. Wim Ackooij & Welington Oliveira & Yongjia Song, 2019. "On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems," Computational Optimization and Applications, Springer, vol. 74(1), pages 1-42, September.
    11. Daniel R. Jiang & Warren B. Powell, 2018. "Risk-Averse Approximate Dynamic Programming with Quantile-Based Risk Measures," Mathematics of Operations Research, INFORMS, vol. 43(2), pages 554-579, May.
    12. Löhndorf, Nils & Wozabal, David, 2021. "Gas storage valuation in incomplete markets," European Journal of Operational Research, Elsevier, vol. 288(1), pages 318-330.
    13. Lorenzo Reus & Rodolfo Prado, 2022. "Need to Meet Investment Goals? Track Synthetic Indexes with the SDDP Method," Computational Economics, Springer;Society for Computational Economics, vol. 60(1), pages 47-69, June.
    14. Luckny Zephyr & Bernard F. Lamond & Pascal Lang, 2024. "Hybrid simplicial-randomized approximate stochastic dynamic programming for multireservoir optimization," Computational Management Science, Springer, vol. 21(1), pages 1-44, June.
    15. W. Ackooij & X. Warin, 2020. "On conditional cuts for stochastic dual dynamic programming," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(2), pages 173-199, June.
    16. Liu, Rui Peng & Shapiro, Alexander, 2020. "Risk neutral reformulation approach to risk averse stochastic programming," European Journal of Operational Research, Elsevier, vol. 286(1), pages 21-31.
    17. Jitka Dupačová & Václav Kozmík, 2017. "SDDP for multistage stochastic programs: preprocessing via scenario reduction," Computational Management Science, Springer, vol. 14(1), pages 67-80, January.
    18. Michelle Bandarra & Vincent Guigues, 2021. "Single cut and multicut stochastic dual dynamic programming with cut selection for multistage stochastic linear programs: convergence proof and numerical experiments," Computational Management Science, Springer, vol. 18(2), pages 125-148, June.
    19. Soares, Murilo Pereira & Street, Alexandre & Valladão, Davi Michel, 2017. "On the solution variability reduction of Stochastic Dual Dynamic Programming applied to energy planning," European Journal of Operational Research, Elsevier, vol. 258(2), pages 743-760.
    20. Bakker, Hannah & Dunke, Fabian & Nickel, Stefan, 2020. "A structuring review on multi-stage optimization under uncertainty: Aligning concepts from theory and practice," Omega, Elsevier, vol. 96(C).

    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:comgts:v:15:y:2018:i:1:d:10.1007_s10287-017-0297-2. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.