.png){kind=icon}
返回
An improved algorithm for single-unit commitment with ramping limits
.png){kind=icon}
OA
AI
DOI：10.1016/j.epsr.2020.106720.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The single-unit commitment problem (1UC) is the problem of finding a cost optimal schedule for a single generator given a time series of electricity prices subject to generation limits, minimum upand downtime and ramping limits. In this paper we present two efficient dynamic programming algorithms. For each time step we keep track of a set of functions that represent the cost of optimal schedules until that time step. We show that we can combine a subset of these functions by only considering their minimum. We can construct this minimum either implicitly or explicitly. Experiments show both methods scale linear in the amount of time steps and result in a significant speedup compared to the state-of-the-art for piece-wise linear as well as quadratic generation cost. Therefore using these methods could lead to significant improvements for solving large scale unit commitment problems with Lagrangian relaxation or related methods that use 1UC as subproblem.
Keyword:
Dynamic programming
Single-unit commitment problem
Polynomial-time algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.2
论文数:
1.2W
被引数:
2.8W
机构
引用论文
.png){kind=icon}
Tight Mixed Integer Linear Programming Formulations for the Unit Commitment Problem单位承诺问题的紧混合整数线性规划公式
PREAI
分享收藏分享收藏
没有更多内容
没有更多内容