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

Li Dai (), Renshi Ye, Dahai You and Xianggen Yin
Additional contact information
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

Energies, 2025, vol. 18, issue 5, 1-21

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.

Keywords: dynamic economic dispatch; energy storage; N-1 contingency; relaxed approximation robust dual dynamic programming (RA-RDDP); two-stage Benders’ decomposition (search for similar items in EconPapers)
JEL-codes: Q Q0 Q4 Q40 Q41 Q42 Q43 Q47 Q48 Q49 (search for similar items in EconPapers)
Date: 2025
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/1996-1073/18/5/1073/pdf (application/pdf)
https://www.mdpi.com/1996-1073/18/5/1073/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jeners:v:18:y:2025:i:5:p:1073-:d:1597389

Access Statistics for this article

Energies is currently edited by Ms. Agatha Cao

More articles in Energies from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().