.png){kind=icon}
.png){kind=icon}
Return
A Fast Solution Method for Large-Scale Unit Commitment Based on Lagrangian Relaxation and Dynamic Programming
.png){kind=icon}
OA
AI
DOI：10.1109/TPWRS.2023.3287199.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The unit commitment problem (UC) is crucial for the operation and market mechanism of power systems. With the development of modern electricity, the scale of power systems is expanding, and solving the UC problem is also becoming more and more difficult. To this end, this article proposes a new fast solution method based on Lagrangian relaxation and dynamic programming. Firstly, the UC solution is estimated to be an initial trial UC solution by a fast method based on Lagrangian relaxation. This initial trial UC solution fully considers the system-wide constraints. Secondly, a dynamic programming module is introduced to adjust the trial UC solution to make it satisfy the unit-wise constraints. Thirdly, a method for constructing a feasible UC solution is proposed based on the adjusted trial UC solution. Specifically, a feasibility-testing model and an updating strategy for the trial UC solution are established in this part. Numerical tests are implemented on IEEE 24-bus, IEEE 118-bus, Polish 2383-bus, and French 6468-bus systems, which verify the effectiveness and efficiency of the proposed method.
Keywords:
Dynamic programming
fast solution
Lagrangian relaxation
large-scale unit commitment
Journal
IF:
7.2
Papers:
1.1W
Citations:
5.0W