.png){kind=icon}
返回
Learning-Assisted Variables Reduction Method for Large-Scale MILP Unit Commitment
.png){kind=icon}
OA
AI
DOI：10.1109/OAJPE.2023.3247989.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The security-constrained unit commitment (SCUC) challenge is solved repeatedly several times every day, for operations in a limited time. Typical mixed-integer linear programming (MILP) formulations are intertemporal in nature and have complex and discrete solution spaces that exponentially increase with system size. Improvements in the SCUC formulation and/or solution method that yield a faster solution hold immense economic value, as less time can be spent finding the best-known solution. Most machine learning (ML) methods in the literature either provide a warm start or convert the MILP-SCUC formulation to a continuous formulation, possibly leading to sub-optimality and/or infeasibility. In this paper, we propose a novel ML-based variables reduction method that accurately determines the optimal schedule for a subset of trusted generators, shrinking the MILP-SCUC formulation and dramatically reducing the search space. ML indicators sets are created to shrink the MILP-SCUC model, leading to improvement in the solution quality. Test results on IEEE systems with 14, 118, and 300 busses, the Ontario system, and Polish systems with 2383 and 3012 busses report significant reductions in solution times in the range of 48% to 98%. This is a promising tool for system operators to solve the MILP-SCUC with a lower optimality gap in a limited-time operation, leading to economic benefits.
Keyword:
Generators
Power systems
Costs
Spinning
Machine learning
Programming
Power transmission lines
mixed-integer linear programming
UC variables reduction
unit commitment
期刊
I
IF:
3.2
论文数:
391
被引数:
826
机构
引用论文
.png){kind=icon}
分享收藏Tight and Compact MILP Formulation for the Thermal Unit Commitment Problem用于热单元承诺问题的紧密而紧凑的MILP公式
PREAI
分享收藏A Tighter Piecewise Linear Approximation of Quadratic Cost Curves for Unit Commitment Problems单位承诺问题的二次成本曲线的更严格的分段线性逼近
PREAI
分享收藏Revealing the Chemistry and Morphology of Buried Donor/Acceptor Interfaces in Organic Photovoltaics揭示有机光伏中埋藏的供体/受体界面的化学和形态
PREAI
分享收藏
查看更多内容