Energy systems planning models identify least-cost strategies for expansion and operation of energy systems and provide decision support for investment, planning, regulation, and policy. Most are formulated as linear programming (LP) or mixed integer linear programming (MILP) problems. Despite the relative efficiency and maturity of LP and MILP solvers, large scale problems are often intractable without abstractions that impact quality of results and generalizability of findings. We consider a macro-energy systems planning problem with detailed operations and policy constraints and formulate a computationally efficient Benders decomposition separating investments from operations and decoupling operational timesteps using budgeting variables in the master model. This novel approach enables parallelization of operational subproblems and permits modeling of relevant constraints coupling decisions across time periods (e.g., policy constraints) within a decomposed framework. Runtime scales linearly with temporal resolution; tests demonstrate substantial runtime improvement for all MILP formulations and for some LP formulations depending on problem size relative to analogous monolithic models solved with state-of-the-art commercial solvers. Our algorithm is applicable to planning problems in other domains (e.g., water, transportation networks, production processes) and can solve large-scale problems otherwise intractable. We show that the increased resolution enabled by this algorithm mitigates structural uncertainty, improving recommendation accuracy. Funding: Funding for this work was provided by the Princeton Carbon Mitigation Initiative (funded by a gift from BP) and the Princeton Zero-carbon Technology Consortium (funded by gifts from GE, Google, ClearPath, and Breakthrough Energy). Supplemental Material: The e-companion is available at https://doi.org/10.1287/ijoo.2023.0005 .
1 September 2024 in Environmental Research: Energy
Runtime and memory requirements for typical formulations of energy system models increase non-linearly with resolution, computationally constraining large-scale models despite state-of-the-art solvers and hardware. This scaling paradigm requires omission of detail which can affect key outputs to an unknown degree. Recent algorithmic innovations employing decomposition have enabled linear increases in runtime and memory use as temporal resolution increases. Newly tractable, higher resolution systems can be compared with lower resolution configurations commonly employed today in academic research and industry practice, providing a better understanding of the potential biases or inaccuracies introduced by these abstractions. We employ a state-of-the art electricity system planning model and new high-resolution systems to quantify the impact of varying degrees of spatial, temporal, and operational resolution on results salient to policymakers and planners. We find models with high spatial and temporal resolution result in more realistic siting decisions and improved emissions, reliability, and price outcomes. Errors are generally larger in systems with low spatial resolution, which omit key transmission constraints. We demonstrate that high temporal resolution cannot overcome biases introduced by low spatial resolution, and vice versa. While we see asymptotic improvements to total system cost and reliability with increased resolution, other salient outcomes such as siting accuracy and emissions exhibit continued improvement across the range of model resolutions considered. We conclude that modelers should carefully balance resolution on spatial, temporal, and operational dimensions and that novel computational methods enabling higher resolution modeling are valuable and can further improve the decision support provided by this class of models.