.png){kind=icon}
.png){kind=icon}
Return
An Exact Greedy Algorithm for Energy Storage Self-Scheduling Problem Based on Power Decomposition
.png){kind=icon}
PRE
AI
M
Z
M
DOI：10.1109/tpwrs.2026.3674312.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The energy storage self-scheduling (ESSS) problem is typically formulated as a mixed-integer linear programming (MILP) or quadratically constrained programming (QCP) model, reflecting the mutually exclusive nature of charging and discharging. However, as the problem scale increases, these formulations impose significant computational burdens, limiting their practical application. To tackle this challenge, this letter proposes a novel power decomposition (PD) model and an exact greedy (EG) algorithm for efficiently solving the ESSS problem with guaranteed accuracy. Numerical results demonstrate the superior computational efficiency of the proposed PD model and EG algorithm compared with the MILP and QCP models.
Keywords:
Energy storage self-scheduling
complementarity constraints
power decomposition
greedy algorithm
Journal
IF:
7.2
Papers:
1.1W
Citations:
5.0W
Organization
Cited Papers