论文标题
通过学习成本模型启用快速单位承诺约束筛查
Enabling Fast Unit Commitment Constraint Screening via Learning Cost Model
论文作者
论文摘要
单位承诺(UC)是传输系统操作员的重要工具,以查找最经济和可行的生成计划和调度信号。约束筛查一直引起人们的注意,因为它具有减少UC问题中许多非活动或冗余约束的希望,因此可以通过考虑减少优化问题来加速大规模UC问题的解决方案过程。标准约束筛选方法依赖于优化负载和世代以查找绑定线流量约束,但是筛选是保守的,其中很大一部分的约束仍用于UC问题。在本文中,我们提出了一种新型的机器学习(ML)模型,以预测给定负载输入的最经济成本。这样的ML模型将UC决策的成本视角桥接到了基于优化的约束筛选模型中,并可以筛选出更高的操作约束比例。我们验证了在样本感知和样本不可屈服的设置上验证所提出的方法的性能,并说明了所提出的方案可以进一步减少UC问题的各种设置的计算时间。
Unit commitment (UC) are essential tools to transmission system operators for finding the most economical and feasible generation schedules and dispatch signals. Constraint screening has been receiving attention as it holds the promise for reducing a number of inactive or redundant constraints in the UC problem, so that the solution process of large scale UC problem can be accelerated by considering the reduced optimization problem. Standard constraint screening approach relies on optimizing over load and generations to find binding line flow constraints, yet the screening is conservative with a large percentage of constraints still reserved for the UC problem. In this paper, we propose a novel machine learning (ML) model to predict the most economical costs given load inputs. Such ML model bridges the cost perspectives of UC decisions to the optimization-based constraint screening model, and can screen out higher proportion of operational constraints. We verify the proposed method's performance on both sample-aware and sample-agnostic setting, and illustrate the proposed scheme can further reduce the computation time on a variety of setup for UC problems.