Modeling of Network Constraints in Large-scale Capacity Expansion Optimization of Power Grids
Yu Weng, Lara Booth, Priya L. Donti, Ruaridh Macdonald
Abstract
Capacity expansion modeling plays a critical role in optimizing the deployment of new generation, storage, and transmission, typically at national and regional levels. To support long-term planning, these models consider a large set of energy technologies and policies, along with decades of weather and demand data. Realistic capacity expansion models thus become high-dimensional optimization problems, with hundreds of millions of variables and constraints, which are challenging to solve. A common strategy to address this complexity is to omit non-linear, non-convex AC optimal power flow (ACOPF) constraints and instead use linearized power balance equations or transport formulations. While these simplifications improve tractability, they limit our understanding of how power flow and the physical properties of power networks impact investment decisions across generation, storage, and transmission infrastructure. This paper addresses this gap by extending the GenX capacity expansion model to incorporate fixed point theorem-based network constraints. These embed ACOPF-based considerations while maintaining the tractability of the planning model, nearly preserving the dimensionality of the transport formulation and incurring only modest runtime increases. This approach is much cheaper than embedding ACOPF directly, making it appropriate for large-scale capacity planning problems. We compare our approach to the original transport-based GenX model as well as a non-linear, non-convex version that incorporates the full ACOPF constraints, for a case study of the ISO New England grid.
Create a lesson
Related papers
Level-Set Geometry and the Theoretical Performance of PDHG for Conic Linear Optimization
Zikai Xiong, Robert M. Freund
Trajectory Manifolds for Nonlinear Data-Enabled Predictive Control
Arda Bayer
Optimizing Lyapunov Certificates via Stability-Preserving Quadratization for Polynomial Systems
Yubo Cai, Gioele Zardini
Regularity of a Multidimensional Principal-Agent Problem with Separable Effort Costs
Shuaijie Qian, Guan Qiao
Near-Optimal Exact-Value Zeroth-Order Complexity for Smooth Strongly Convex Optimization
Wendao Wu, Haihan Zhang, Chenheng Zhang et al.
A VU-calculus for composite functions and the U-Hessian of partly smooth functions
Shuai Liu