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.
翻译:单位承诺(UC)是传输系统操作员寻找最经济、最可行的发电时间表和发送信号的必要工具; 严格筛选一直受到注意,因为它有望减少UC问题中一些不活动或冗余的限制,以便通过考虑减少优化问题来加快大规模UC问题的解决办法进程; 标准约束筛选方法依靠优化负荷和代代以找到具有约束力的线流限制,但筛选是保守的,仍然为UC问题保留了很大比例的制约; 本文提出一个新的机器学习模式,以预测投入的最为经济的成本; 这种ML模型将UC决定的成本观点与基于优化的制约筛选模式联系起来,并能够筛选出更高比例的业务限制; 我们核查拟议的方法在抽样觉察和抽样敏感环境方面的绩效,并说明拟议办法可以进一步缩短为UC问题设置的各种计算时间。