A State Transition Mip Formulation For The Unit Commitment Problem
IEEE TRANSACTIONS ON POWER SYSTEMS(2018)
摘要
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.
更多查看译文
关键词
Mixed-integer linear programming, unit commitment
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络