4.7 Article

Multi-Stage Distributionally Robust Stochastic Dual Dynamic Programming to Multi-Period Economic Dispatch With Virtual Energy Storage

Journal

IEEE TRANSACTIONS ON SUSTAINABLE ENERGY
Volume 13, Issue 1, Pages 146-158

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSTE.2021.3105525

Keywords

Stochastic processes; Uncertainty; Renewable energy sources; Optimization; Power systems; Load modeling; Computational modeling; Distributionally robust optimization; economic dispatch; multi-stage stochastic programming; renewable energy; stochastic dual dynamic programming; virtual energy storage

Funding

  1. National Natural Science Foundation of China [51977166]
  2. Natural Science Foundation of Shaanxi Province [2021GXLH-Z-059]
  3. Science and Technological Project of Northwest Branch of State Grid Corporation ofChina [SGNW0000DKQT2100172]

Ask authors/readers for more resources

This paper proposes a virtual energy storage (VES) model to accommodate renewable energy under a special market regulation. A multi-stage distributionally robust optimization (MSDRO) model is set up to address temporal uncertainties. A stochastic dual dynamic programming method is employed to efficiently solve the model.
A virtual energy storage (VES) model is proposed in this paper to accommodate renewable energy under a special market regulation. Such VESs can provide or consume electricity to the main power grid under the premise that the daily net electricity energy is balanced. Furthermore, a multi-stage distributionally robust optimization (MSDRO) model is set up in this paper to address the temporal uncertainties in the day-ahead economic dispatch model. Compared with the traditional two-stage distributionally robust optimization, the proposed multi-stage approach provides more flexibilities so that the decision variables can be adjusted at each time period, leading to a complex nested formulation. To efficiently solve the MSDRO model, a stochastic dual dynamic programming method is employed to decompose the original large-scale optimization model into several sub-problems in the stages, as two steps: forward pass and backward pass. In the forward pass, the expected cost-to-go function is approximated by piecewise-linear functions and then several samples are used to generate a lower bound; the backward pass will generate Benders' cuts at each stage from the solution of the forward pass. The forward and backward passes are performed iteratively until the convergence is reached. Numerical results on an IEEE 118-bus system and a practical power system in China verify the proposed method.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available