IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v18y2025i5p1073-d1597389.html
   My bibliography  Save this article

Security-Constrained Multi-Stage Robust Dynamic Economic Dispatch with Bulk Storage

Author

Listed:
  • Li Dai

    (Changjiang Institute of Survey, Planning, Design and Research, Wuhan 430010, China)

  • Renshi Ye

    (Changjiang Institute of Survey, Planning, Design and Research, Wuhan 430010, China)

  • Dahai You

    (State Key Laboratory of Advanced Electromagnetic Engineering and Technology, School of Electrical and Electronic Engineering, Huazhong University of Science and Technology, Wuhan 430000, China)

  • Xianggen Yin

    (State Key Laboratory of Advanced Electromagnetic Engineering and Technology, School of Electrical and Electronic Engineering, Huazhong University of Science and Technology, Wuhan 430000, China)

Abstract

As wind penetration rates continue to increase, the main challenge faced by operators is how to schedule flexible resources, such as traditional generation and storage, in the future to ensure the safe and stable operation of power grids under multiple uncertainties. In this paper, a security-constrained multi-stage robust dynamic economic dispatch model with storage (SMRDEDS) is proposed to address multiple uncertainties of wind power outputs and N-1 contingencies. Compared to the traditional two-stage robust dynamic economic dispatch model, the proposed multi-stage dispatch model yields sequential operation decisions with uncertainties revealed gradually over time. What is more, a combined two-stage Benders’ decomposition and relaxed approximation–robust dual dynamic programming (RA-RDDP) is proposed to handle the computational issue of multi-stage problems due to large-scale post-contingency constraints and the convergence issue of the stochastic dual dynamic programming (SDDP) algorithm. First, a two-stage Benders’ decomposition algorithm is applied to relax the SMRDEDS model into a master problem and sub-problem. The master problem determines the generator output and storage charge and discharge, and the sub-problem determines the total generation and storage reserve capacity to cover all the generator N-1 contingencies. Second, a relaxed approximation–RDDP algorithm is proposed to solve the multi-stage framework problem. Compared to the traditional SDDP algorithm and RDDP algorithm, the proposed RA-RDDP algorithm uses the inner relaxed approximation and outer approximation methods to approximate the upper and lower bounds of the future cost-to-go function, which overcomes the convergence issue of the traditional SDDP algorithm and solution efficiency of the RDDP algorithm. We tested the proposed algorithm on the IEEE-3 bus, IEEE-118 bus, and the German power system. The simulation results verify the effectiveness of the proposed model and proposed algorithm.

Suggested Citation

  • Li Dai & Renshi Ye & Dahai You & Xianggen Yin, 2025. "Security-Constrained Multi-Stage Robust Dynamic Economic Dispatch with Bulk Storage," Energies, MDPI, vol. 18(5), pages 1-21, February.
    • Handle: RePEc:gam:jeners:v:18:y:2025:i:5:p:1073-:d:1597389
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/18/5/1073/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1996-1073/18/5/1073/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Angelos Georghiou & Angelos Tsoukalas & Wolfram Wiesemann, 2019. "Robust Dual Dynamic Programming," Operations Research, INFORMS, vol. 67(3), pages 813-830, May.
    2. Weng, Haoen & Hu, Yongli & Liang, Min & Xi, Jiayang & Yin, Baocai, 2025. "Optimizing bidding strategy in electricity market based on graph convolutional neural network and deep reinforcement learning," Applied Energy, Elsevier, vol. 380(C).
    Full references (including those not matched with items on IDEAS)

    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. Haodong Yu & Jie Sun & Yanjun Wang, 2021. "A time-consistent Benders decomposition method for multistage distributionally robust stochastic optimization with a scenario tree structure," Computational Optimization and Applications, Springer, vol. 79(1), pages 67-99, May.
    2. Park, Jangho & Bayraksan, Güzin, 2023. "A multistage distributionally robust optimization approach to water allocation under climate uncertainty," European Journal of Operational Research, Elsevier, vol. 306(2), pages 849-871.
    3. Xiong, Houbo & Yan, Mingyu & Guo, Chuangxin & Ding, Yi & Zhou, Yue, 2023. "DP based multi-stage ARO for coordinated scheduling of CSP and wind energy with tractable storage scheme: Tight formulation and solution technique," Applied Energy, Elsevier, vol. 333(C).
    4. Sixiang Zhao, 2023. "Decision rule-based method in solving adjustable robust capacity expansion problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 97(2), pages 259-286, April.
    5. Luyu Wang & Houbo Xiong & Yunhui Shi & Chuangxin Guo, 2023. "Rolling Horizon Robust Real-Time Economic Dispatch with Multi-Stage Dynamic Modeling," Mathematics, MDPI, vol. 11(11), pages 1-20, June.
    6. Qiu, Haifeng & Sun, Qirun & Lu, Xi & Beng Gooi, Hoay & Zhang, Suhan, 2022. "Optimality-feasibility-aware multistage unit commitment considering nonanticipative realization of uncertainty," Applied Energy, Elsevier, vol. 327(C).
    7. Yıldıran, Uğur, 2023. "Robust multi-stage economic dispatch with renewable generation and storage," European Journal of Operational Research, Elsevier, vol. 309(2), pages 890-909.
    8. Xiong, Houbo & Zhou, Yue & Guo, Chuangxin & Ding, Yi & Luo, Fengji, 2023. "Multi-stage risk-based assessment for wind energy accommodation capability: A robust and non-anticipative method," Applied Energy, Elsevier, vol. 350(C).
    9. Ren, Chao & Wang, Kai & Han, Jie & Sun, Lin & Yang, Chunhua, 2024. "Deterministic scenarios guided K-Adaptability in multistage robust optimization for energy management and cleaning scheduling of heat transfer process," Energy, Elsevier, vol. 312(C).
    10. Angelos Georghiou & Angelos Tsoukalas & Wolfram Wiesemann, 2020. "A Primal–Dual Lifting Scheme for Two-Stage Robust Optimization," Operations Research, INFORMS, vol. 68(2), pages 572-590, March.
    11. Dimitris Bertsimas & Shimrit Shtern & Bradley Sturt, 2023. "A Data-Driven Approach to Multistage Stochastic Linear Optimization," Management Science, INFORMS, vol. 69(1), pages 51-74, January.
    12. Wentao Ma & Zhiping Chen, 2024. "Multi-stage distributionally robust convex stochastic optimization with Bayesian-type ambiguity sets," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 100(2), pages 553-600, October.
    13. François Clautiaux & Boris Detienne & Henri Lefebvre, 2023. "A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty," Journal of Scheduling, Springer, vol. 26(2), pages 169-191, April.
    14. Glomb, Lukas & Liers, Frauke & Rösel, Florian, 2022. "A rolling-horizon approach for multi-period optimization," European Journal of Operational Research, Elsevier, vol. 300(1), pages 189-206.

    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:gam:jeners:v:18:y:2025:i:5:p:1073-:d:1597389. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.