An Improved ADP Algorithm for Multistage Unit Commitment of Renewable Energy Integrated Power System

With the continuous penetration of renewable energy sources (RESs), the unit commitment (UC), as a key operational problem in power system, is facing increasingly challenges due to the uncertainties. This paper proposes a decomposed optimization algorithm for the multistage UC with the uncertainties of RESs. The Wasserstein metric-based distribution ally robust optimization (DRO) is extensively applied to handle the uncertainties in UC, and the UC is decomposed into a series of nested subproblems by improved approximate dynamic programming (ADP). Compared with traditional ADP algorithm, the proposed algorithm improves Lagrange cut-based value function to adaptively tackle integer variables, while provides tractable and favorable robust commitment strategies. Moreover, a parallel technique is further used to accelerate the algorithm in both scenario and stage levels. Case studies on several test systems illustrate that the proposed algorithm is favorable in terms of computational accuracy and efficiency.

Authors

Institutions

Publication Details

Published
2024-11-06
DOI
https://doi.org/10.1109/scems63294.2024.10756480
Primary Topic
Power Systems and Renewable Energy
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Improved ADP Algorithm for Multistage Unit Commitment of Renewable Energy Integrated Power System

Jing Lan, Yu Chen, Wenkai Zhu
Power Systems and Renewable Energy
article

An Improved ADP Algorithm for Multistage Unit Commitment of Renewable Energy Integrated Power System

Jing Lan, Yu Chen, Wenkai Zhu
article en

Abstract

With the continuous penetration of renewable energy sources (RESs), the unit commitment (UC), as a key operational problem in power system, is facing increasingly challenges due to the uncertainties. This paper proposes a decomposed optimization algorithm for the multistage UC with the uncertainties of RESs. The Wasserstein metric-based distribution ally robust optimization (DRO) is extensively applied to handle the uncertainties in UC, and the UC is decomposed into a series of nested subproblems by improved approximate dynamic programming (ADP). Compared with traditional ADP algorithm, the proposed algorithm improves Lagrange cut-based value function to adaptively tackle integer variables, while provides tractable and favorable robust commitment strategies. Moreover, a parallel technique is further used to accelerate the algorithm in both scenario and stage levels. Case studies on several test systems illustrate that the proposed algorithm is favorable in terms of computational accuracy and efficiency.

Minzu University of China (CN), China Southern Power Grid (China) (CN), South China University of Technology (CN)
Affordable and clean energy
Openalex Percentile: Top 79%
Power Systems and Renewable Energy
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.