.png){kind=icon}
.png){kind=icon}
Return
Which Unit-Commitment Formulation is Best? A Comparison Framework
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2019.2962024.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The Unit Commitment (UC) problem, which determines the day-ahead dispatch of generation units, is one of the critical problems in power systems operation. A long list of formulations that claim to solve this problem more efficiently has been proposed. However, comparing them is not easy due to the different interpretations of constraints (e.g., ramps, reserves, startup/shutdown) and the heuristic component of the solution process of most solvers. This article proposes a general framework to establish a systematic procedure for comparing different formulations. We apply the procedure to the three current state-of-the-art formulations in this context: tight and compact (TC), state transition (ST), and projected two-binary-variable (2bin). We carry out an exhaustive analysis over 54 problem instances of very different sizes (10 to 1888 generators) and time scopes (24 and 168h), for four alternative definitions of additional constraints. Our results favor the TC formulation in general in terms of the integrality gap and CPU time. Stronger ramp constraints improve CPU time in general and depending on the case study and size, the fastest formulation changes, and sometimes the differences among the formulations are almost negligible.
Keywords:
Power systems
Trajectory
Generators
Measurement
Proposals
Statistical analysis
Security
Mixed-Integer Linear Programming (MIP)
unit commitment (UC)
tightness
compactness
reformulations
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.2
Papers:
1.1W
Citations:
5.0W