.png){kind=icon}
.png){kind=icon}
Return
A State Transition MIP Formulation for the Unit Commitment Problem
.png){kind=icon}
OA
AI
DOI：10.1109/TPWRS.2017.2695964.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we present the state-transition formulation for the unit commitment (UC) problem. This formulation uses new decision variables that capture the state transitions of the generators, instead of their on/off statuses. We show that this new approach produces a formulation which naturally includes valid inequalities, commonly used to strengthen other formulations. We demonstrate the performance of the state-transition formulation and observe that it leads to improved solution times especially in longer time-horizon instances. As an important consequence, the new formulation allows us to solve realistic instances in less than 12 minutes on an ordinary desktop PC, leading to a speed-up of a factor of almost two, in comparison to the nearest contender. Finally, we demonstrate the value of considering longer planning horizons in UC problems.
Keywords:
Mixed-integer linear programming
unit commitment
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