网络拓扑重构：最优过渡规划
Network Topology Reconfiguration: Optimal Transition Planning
浏览论文内容
中文总结 AI 辅助
该研究针对网络拓扑重构的过渡难题，提出最优过渡规划问题，采用后退时域框架求解，在1354节点系统上实现最高18.4%的运行成本降低。
中文摘要 AI 辅助
网络拓扑重构（NTR）可通过联合优化发电调度与变电站开关操作降低电力系统运行成本，但已报道的节约量仅对应目标运行点，未说明如何达到该点。要到达该目标运行点需一系列中间运行点，每个点需满足交流潮流方程和热极限；由于每种拓扑对应各自可行的调度区域，若先开关或先重新调度的简单过渡会导致中间潮流超过热极限。现有方法存在这一缺陷：快照式NTR仅确定目标，未给出到达路径。我们提出最优过渡规划（OTP）问题，联合优化开关序列和调度轨迹，要求每个中间点满足交流可行性。我们采用后退时域框架求解该问题：直流规划器提出的轨迹经交流可行性过滤器验证，不可行拓扑通过可重用组合割集排除。在规模达1354节点的拥堵PGLib-OPF系统上的案例研究表明，该方法生成的交流可行过渡，在普通硬件上相比无开关的ACOPF解可降低高达18.4%的运行成本。
英文摘要
Network topology reconfiguration (NTR) can reduce power system operating costs by co-optimizing generation dispatch and substation switching, but the reported savings describe a target operating point rather than a way to reach it. Reaching this operating point requires a sequence of intermediate operating points, each satisfying the AC power flow equations and thermal limits; because each topology admits its own feasible dispatch region, a naive transition that switches or redispatches first can drive intermediate flows past their thermal limits. Existing methods leave this gap open: snapshot NTR identifies a target but not a route. We formulate the Optimal Transition Planning (OTP) problem, co-optimizing the switching sequence and dispatch trajectory subject to AC feasibility at every intermediate point. We solve this problem with a receding-horizon framework: a DC planner proposes a trajectory that is certified against an AC feasibility filter, and infeasible topologies are excluded using reusable combinatorial cuts. Case studies on congested PGLib-OPF systems up to 1354-bus show that the method produces AC-feasible transitions that reduce operating cost by up to 18.4% compared to the no-switching ACOPF solution on commodity hardware.
