Exact and Heuristic Approaches for the Stochastic N-k Interdiction in Power Grids
arxiv(2024)
摘要
The article introduces the stochastic N-k interdiction problem for power grid
operations and planning that aims to identify a subset of k components (out of
N components) that maximizes the expected damage, measured in terms of load
shed. Uncertainty is modeled through a fixed set of outage scenarios, where
each scenario represents a subset of components removed from the grid. We
formulate the stochastic N-k interdiction problem as a bi-level optimization
problem and propose two algorithmic solutions. The first approach reformulates
the bi-level stochastic optimization problem to a single level, mixed-integer
linear program (MILP) by dualizing the inner problem and solving the resulting
problem directly using a MILP solver to global optimality. The second is a
heuristic cutting-plane approach, which is exact under certain assumptions. We
compare these approaches in terms of computation time and solution quality
using the IEEE-Reliability Test System and present avenues for future research.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要