顶点引导的机组组合冗余约束识别
Vertex-Guided Redundant Constraints Identification for Unit Commitment
AI总结:
针对机组组合问题中基于LP的约束筛选计算繁琐问题,提出顶点引导的冗余约束识别方法,通过构建外部近似并设计矩阵运算,在找到相同冗余约束的同时最高实现8.8倍加速。
摘要:
电力系统机组组合(UC)问题确定发电机组的启停计划与调度决策,以实现电网可靠且经济的运行。随机性可再生能源和需求行为的渗透率不断提高,使得及时求解UC问题变得必要。通过约束筛选消除冗余约束,可以推导出轻量级、求解更快的UC模型。然而,由于需要求解大量线性规划(LP)问题,筛选过程在计算上仍然繁琐。为了减少需要求解的LP数量,我们为这种经典的基于LP的筛选引入了新视角。我们的关键洞察在于冗余约束将被筛选可行域的所有顶点所满足这一原则。利用通过求解少得多的LP而收紧的UC决策变量边界,我们构建了UC可行域的外部近似作为筛选区域。随后设计了一种矩阵运算,并将其应用于外部近似的顶点,以即时识别所有冗余约束。通过考虑负荷运行范围以及从UC成本和离散机组状态预测推导出的割平面,进一步探索了对外部近似的调整,以提高筛选效率。在规模高达2,383个节点的测试床上进行了广泛仿真,以验证所提方案的有效性。与经典的基于LP的筛选相比,我们的方案在找到相同冗余约束的同时,最高可实现8.8倍的加速。
英文摘要:
Power systems Unit Commitment (UC) problem determines the generator commitment schedule and dispatch decisions to realize the reliable and economic operation of power networks. The growing penetration of stochastic renewables and demand behaviors makes it necessary to solve the UC problem timely. It is possible to derive lightweight, faster-to-solve UC models via constraint screening to eliminate redundant constraints. However, the screening process remains computationally cumbersome due to the need of solving numerous linear programming (LP) problems. To reduce the number of LPs to solve, we introduce a novel perspective on such classic LP-based screening. Our key insights lie in the principle that redundant constraints will be satisfied by all vertices of the screened feasible region. Using the UC decision variables' bounds tightened by solving much fewer LPs, we build an outer approximation for the UC feasible region as the screened region. A matrix operation is then designed and applied to the outer approximation's vertices to identify all redundant constraints on-the-fly. Adjustments for the outer approximation are further explored to improve screening efficiency by considering the load operating range and cutting planes derived from UC cost and discrete unit status prediction. Extensive simulations are performed on a set of testbeds up to 2,383 buses to substantiate the effectiveness of the proposed schemes. Compared to classic LP-based screening, our schemes can achieve up to 8.8x acceleration while finding the same redundant constraints.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。