Debunking the Speed-Fidelity Trade-Off: Speeding-up Large-Scale Energy Models while Keeping Fidelity
Diego A. Tejada-Arango, German Morales-Espana, Juha Kiviluoma

TL;DR
This paper introduces a graph-theoretic reformulation of large-scale energy system models that significantly speeds up computation while maintaining accuracy, addressing the common trade-off between speed and fidelity.
Contribution
It proposes a novel single-building-block formulation inspired by graph theory, reducing variables and constraints without sacrificing model fidelity.
Findings
26% reduction in variables
35% reduction in constraints
1.27x average speedup in solving time
Abstract
Energy system models are essential for planning and supporting the energy transition. However, increasing temporal, spatial, and sectoral resolutions have led to large-scale linear programming (LP) models that are often (over)simplified to remain computationally tractable-frequently at the expense of model fidelity. This paper challenges the common belief that LP formulations cannot be improved without sacrificing their accuracy. Inspired by graph theory, we propose to model energy systems using energy assets (vertices), as a single building-block, and flows to connect between them. This reduces the need for additional components such as nodes and connections. The resulting formulation is more compact, without sacrificing accuracy, and leverages the inherent graph structure of energy systems. To evaluate performance, we implemented and compared four common modelling approaches varying…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPower Systems and Technologies · Distributed and Parallel Computing Systems · Optimal Power Flow Distribution
