.png){kind=icon}
返回
A Systematic Formulation Tightening Approach for Unit Commitment Problems
.png){kind=icon}
OA
AI
DOI：10.1109/TPWRS.2019.2935003.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Unit Commitment is usually formulated as a Mixed Binary Linear Programming (MBLP) problem. When considering a large number of units, state-of-the-art methods such as branch-and-cut may experience difficulties. To address this, an important but much overlooked direction is formulation transformation since if the problem constraints can be transformed to directly delineate the convex hull in the data pre-processing stage, then a solution can be obtained by using linear programming methods without combinatorial difficulties. In the literature, a few tightened formulations for single units with constant ramp rates were reported without presenting how they were derived. In this paper, a systematic approach is developed to tighten formulations in the data pre-processing stage. The idea is to derive vertices of the convex hull without binary requirements. From them, vertices of the original convex hull can be innovatively obtained. These vertices are converted to tightened constraints, which are then parameterized based on unit parameters for general use, tremendously reducing online computational requirements. By analyzing short-time horizons, e.g., two or three hours, tightened formulations for single units with constant and generation-dependent ramp rates are obtained, beyond what is in the literature. Results based on the IEEE 118-bus and Polish 2383-bus systems demonstrate computational efficiency and solution quality benefits of formulation tightening. The approach is general and has great potential for tightening complicated MBLP problems in power systems and beyond.
Keyword:
Systematics
Linear programming
Time factors
Computational efficiency
ISO
Power systems
Table lookup
Unit commitment
mixed binary linear programming
branch-and-cut
formulation tightening
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
引用论文
.png){kind=icon}
Tight and Compact MILP Formulation for the Thermal Unit Commitment Problem用于热单元承诺问题的紧密而紧凑的MILP公式
PREAI
分享收藏A Scalable Solution Methodology for Mixed-Integer Linear Programming Problems Arising in AutomationOAAI
OAAI分享收藏Tight Mixed Integer Linear Programming Formulations for the Unit Commitment Problem单位承诺问题的紧混合整数线性规划公式
PREAI
分享收藏A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem用于热单位承诺问题的计算有效的混合整数线性公式
PREAI
分享收藏
查看更多内容