用于最优传输切换的紧 Big-M
Tight Big-Ms for Optimal Transmission Switching
AI总结:
针对 OTS 的 MILP 建模中 big-M 松弛影响求解效率的问题,提出结合成本上界与降额线路容量的迭代紧致化方法,在 118 节点系统上获得更紧界并显著降低计算负担。
摘要:
本文研究电力网络中的最优传输切换(Optimal Transmission Switching,OTS)问题,该问题旨在寻找一种最优电网拓扑,在满足物理和运行约束的同时使系统运行成本最小化。现有方法通常使用 big-M 常数将 OTS 问题转化为混合整数线性规划(Mixed-Integer Linear Program,MILP)。然而,这些方法的计算性能在很大程度上依赖于这些 big-M 的紧致性。本文提出一种迭代紧致化策略,通过高效求解一系列界定问题来增强 big-M;这些问题借助发电成本上界来考虑 OTS 目标函数的经济性。本文还讨论了在考虑降低的线路容量时,所提紧致化策略的性能如何得到提升。利用 118 节点测试系统,本文证明所提方法优于现有方法,可提供更紧的界,并显著降低 OTS 问题的计算负担。
英文摘要:
This paper addresses the Optimal Transmission Switching (OTS) problem in electricity networks, which aims to find an optimal power grid topology that minimizes system operation costs while satisfying physical and operational constraints. Existing methods typically convert the OTS problem into a Mixed-Integer Linear Program (MILP) using big-M constants. However, the computational performance of these approaches relies significantly on the tightness of these big-Ms. In this paper, we propose an iterative tightening strategy to strengthen the big-Ms by efficiently solving a series of bounding problems that account for the economics of the OTS objective function through an upper-bound on the generating cost. We also discuss how the performance of the proposed tightening strategy is enhanced if reduced line capacities are considered. Using the 118-bus test system we demonstrate that the proposed methodology outperforms existing approaches, offering tighter bounds and significantly reducing the computational burden of the OTS problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。