Security-Constrained Multi-Stage Robust Dynamic Economic Dispatch with Bulk Storage
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-constr...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-02-01
|
| Series: | Energies |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1996-1073/18/5/1073 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| ISSN: | 1996-1073 |