arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2602.03977math.OCcs.MS
收藏

快速放松-圆润单位启停决策与子小时机械和爬坡约束

Fast Relax-and-Round Unit Commitment with Sub-hourly Mechanical and Ramp Constraints

Oak Ridge National Laboratory(橡树岭国家实验室)

Shaked Regev, Eve Tsybina, Slaven Peles

AI总结:

本文提出一种新型计算方法,用于单位启停决策,无需线性近似,显著提升性能。通过定制启发式方法,利用现有连续优化求解器,适用于不同应用场景,解决大规模电力系统挑战。

摘要:

我们提出了一种新的计算方法用于单位启停决策(UC),该方法不需要线性化近似,并在性能上比当前最先进的方法提高了多个数量级。性能提升是通过引入一种针对UC问题定制的启发式方法实现的。该方法可以利用现有的连续优化求解器进行实现,并适应于不同的应用。我们通过在大规模UC分析中的示例展示了新方法的价值,其中使用当前最先进的工具是不可行的。我们预计本文中展示的能力将对解决新兴电力系统挑战至关重要,这些挑战包括更具波动性的大负载,如数据中心,以及由更多小型单元组成的发电,包括显著的户内发电。

英文摘要:

We propose a novel computational method for unit commitment UC, which does not require linearized approximation and provides several orders of magnitude performance improvement over current state-of-the-art. The performance improvement is achieved by introducing a heuristic tailored for UC problems. The method can be implemented using existing continuous optimization solvers and adapted for different applications. We demonstrate value of the new method in examples of advanced UC analyses at the scale where use of current state-of-the-art tools is infeasible. We expect that the capability demonstrated in this paper will be critical to address emerging power systems challenges with more volatile large loads, such as data centers, and generation that is composed of larger number of smaller units, including significant behind-the-meter generation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑