Sectoral and spatial decomposition methods for multi-sector capacity expansion models

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Parolin, Federico, Weng, Yu, Colbertaldo, Paolo, Macdonald, Ruaridh
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866915236995399680
author Parolin, Federico
Weng, Yu
Colbertaldo, Paolo
Macdonald, Ruaridh
author_facet Parolin, Federico
Weng, Yu
Colbertaldo, Paolo
Macdonald, Ruaridh
contents Multi-sector capacity expansion models play a crucial role in energy planning by providing decision support for policymaking in technology development. To ensure reliable support, these models require high technological, spatial, and temporal resolution, leading to large-scale linear programming problems that are often computationally intractable. To address this challenge, conventional approaches rely on simplifying abstractions that trade accuracy for computational efficiency. Benders decomposition has been widely explored to improve computational efficiency in electricity capacity expansion models. Specifically, state-of-the-art methods have primarily focused on improving performance through temporal decomposition. However, multi-sector models introduce additional complexity, requiring new decomposition strategies. In this work, we propose a budget-based formulation to extend decomposition to the sectoral and spatial domains. We test the developed sectoral and spatial Benders decomposition algorithms on case studies of the continental United States, considering different configurations in terms of spatial and temporal resolution. Results show that our algorithms achieve substantial performance improvement compared to existing decomposition algorithms, with runtime reductions within 15%-70%. The proposed methods leverage the generic structure of multi-sector capacity expansion models, and can thus be applied to most existing energy planning models, ensuring computational tractability without sacrificing resolution.
format Preprint
id arxiv_https___arxiv_org_abs_2504_08503
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Sectoral and spatial decomposition methods for multi-sector capacity expansion models
Parolin, Federico
Weng, Yu
Colbertaldo, Paolo
Macdonald, Ruaridh
Optimization and Control
Systems and Control
Multi-sector capacity expansion models play a crucial role in energy planning by providing decision support for policymaking in technology development. To ensure reliable support, these models require high technological, spatial, and temporal resolution, leading to large-scale linear programming problems that are often computationally intractable. To address this challenge, conventional approaches rely on simplifying abstractions that trade accuracy for computational efficiency. Benders decomposition has been widely explored to improve computational efficiency in electricity capacity expansion models. Specifically, state-of-the-art methods have primarily focused on improving performance through temporal decomposition. However, multi-sector models introduce additional complexity, requiring new decomposition strategies. In this work, we propose a budget-based formulation to extend decomposition to the sectoral and spatial domains. We test the developed sectoral and spatial Benders decomposition algorithms on case studies of the continental United States, considering different configurations in terms of spatial and temporal resolution. Results show that our algorithms achieve substantial performance improvement compared to existing decomposition algorithms, with runtime reductions within 15%-70%. The proposed methods leverage the generic structure of multi-sector capacity expansion models, and can thus be applied to most existing energy planning models, ensuring computational tractability without sacrificing resolution.
title Sectoral and spatial decomposition methods for multi-sector capacity expansion models
topic Optimization and Control
Systems and Control
url https://arxiv.org/abs/2504.08503