Oriol Raventós
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Oriol Raventós has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Andrew Tonks
Department of Mathematics, University of Leicester, United Kingdom
2 shared publications - Carles Casacuberta
Departament de Matemàtiques i Informàtica, Universitat de Barcelona, Barcelona, Spain
2 shared publications - Fernando Muro
Facultad de Matemáticas, Departamento de Álgebra, Universidad de Sevilla, Sevilla, Spain
2 shared publications - Wided Medjroubi
University of Groningen, Energy and Sustainability Research Institute Groningen (ESRIG), Energy Academy Building
2 shared publications Andreas Bruckmeier
1 shared publication- Andreas Bruckmeier
Forschungsstelle für Energiewirtschaft (FfE) e.V Research Center for Energy Economics 80995 Munich Germany
1 shared publication
Latest Publications
- Open Access
- 17 July 2026
- Published by Elsevier in SSRN Electronic Journal
Dynamic grid fees for Germany and their effect on the system friendliness of decentral storage
The energy transition increases the share of decentralized and weather-dependent generation. This makes the synchronization of supply and demand more complex and raises the need for local price signals. Dynamic grid fees are a politically realistic instrument to provide such signals in Germany. However, their exact design and their quantitative contribution to the system remain unclear. We propose nine dynamic grid fee structures derived from local grid utilization and apply them across three German regions with vastly different characteristics based on a sustainable scenario. We use the system friendliness framework to assess the impact of each fee structure on the operation of decentral storage and its influence on system-wide grid and storage capacity requirements. This framework allows data-driven comparisons independent of regulatory conditions or technology assumptions. We find that market-only operation, which reflects the current situation in Germany, reduces system-wide storage needs to the maximum extent but causes significant grid extension in all regions. Dynamic grid fees reduce this grid extension demand, but always at the cost of less temporal synchronization. The grid reduction potential is highest in wind-dominated regions due to the high volatility of renewable feed-in. It is lowest in demand and industry-heavy regions, where grid extension is driven by the regular load profile rather than generation. The daily repetitive grid fees published by distribution system operators perform well in solar-dominated regions but cause additional grid extension in wind-dominated areas. Our method provides a foundation for the analysis of cost-effective regulation to synchronize generation, transport and demand in the electricity grid in Germany.
- 17 July 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessDynamic grid fees for Germany and their effect on the system friendliness of decentral storage
The energy transition increases the share of decentralized and weather-dependent generation. This makes the synchronization of supply and demand more complex and raises the need for local price signals. Dynamic grid fees are a politically realistic instrument to provide such signals in Germany. However, their exact design and their quantitative contribution to the system remain unclear. We propose nine dynamic grid fee structures derived from local grid utilization and apply them across three German regions with vastly different characteristics based on a sustainable scenario. We use the system friendliness framework to assess the impact of each fee structure on the operation of decentral storage and its influence on system-wide grid and storage capacity requirements. This framework allows data-driven comparisons independent of regulatory conditions or technology assumptions. We find that market-only operation, which reflects the current situation in Germany, reduces system-wide storage needs to the maximum extent but causes significant grid extension in all regions. Dynamic grid fees reduce this grid extension demand, but always at the cost of less temporal synchronization. The grid reduction potential is highest in wind-dominated regions due to the high volatility of renewable feed-in. It is lowest in demand and industry-heavy regions, where grid extension is driven by the regular load profile rather than generation. The daily repetitive grid fees published by distribution system operators perform well in solar-dominated regions but cause additional grid extension in wind-dominated areas. Our method provides a foundation for the analysis of cost-effective regulation to synchronize generation, transport and demand in the electricity grid in Germany.
- Open Access
Performance enhancing of hybrid quantum-classical Benders approach for MILP optimization
Mixed-integer linear programming problems are extensively used in industry for a wide range of optimization tasks. However, as they get larger, they present computational challenges for classical solvers within practical time limits. Quantum annealers can, in principle, accelerate the solution of problems formulated as quadratic unconstrained binary optimization instances, but their limited scale currently prevents achieving practical speedups. Quantum-classical algorithms have been proposed to take advantage of both paradigms and to allow current quantum computers to be used in larger problems. In this work, a hardware-agnostic Benders' decomposition algorithm and a series of enhancements with the goal of taking the most advantage of quantum computing are presented. The decomposition consists of a master problem with integer variables, which is reformulated as a quadratic unconstrained binary optimization problem and solved with a quantum annealer, and a linear subproblem solved by a classical computer. The enhancements consist, among others, of different embedding processes that substantially reduce the pre-processing time of the embedding computation without compromising solution quality, a conservative handling of cut constraints, and a stopping criterion that accounts for the limited size of current quantum computers and their heuristic nature. The proposed algorithm is benchmarked against classical approaches using a D-Wave quantum annealer for a scalable family of transmission network expansion planning problems.
Open AccessPerformance enhancing of hybrid quantum-classical Benders approach for MILP optimization
Mixed-integer linear programming problems are extensively used in industry for a wide range of optimization tasks. However, as they get larger, they present computational challenges for classical solvers within practical time limits. Quantum annealers can, in principle, accelerate the solution of problems formulated as quadratic unconstrained binary optimization instances, but their limited scale currently prevents achieving practical speedups. Quantum-classical algorithms have been proposed to take advantage of both paradigms and to allow current quantum computers to be used in larger problems. In this work, a hardware-agnostic Benders' decomposition algorithm and a series of enhancements with the goal of taking the most advantage of quantum computing are presented. The decomposition consists of a master problem with integer variables, which is reformulated as a quadratic unconstrained binary optimization problem and solved with a quantum annealer, and a linear subproblem solved by a classical computer. The enhancements consist, among others, of different embedding processes that substantially reduce the pre-processing time of the embedding computation without compromising solution quality, a conservative handling of cut constraints, and a stopping criterion that accounts for the limited size of current quantum computers and their heuristic nature. The proposed algorithm is benchmarked against classical approaches using a D-Wave quantum annealer for a scalable family of transmission network expansion planning problems.
- Open Access
- 4 May 2022
- Published by Elsevier in Renewable and Sustainable Energy Reviews
- Vol. 163
Comparison of different methods of spatial disaggregation of electricity generation and consumption time series
- 4 May 2022
- Published by Elsevier in Renewable and Sustainable Energy Reviews
- Vol. 163
Open AccessComparison of different methods of spatial disaggregation of electricity generation and consumption time series
- Open Access
Comparison of different methods of spatial disaggregation of electricity
Energy system models involve various input data sets representing the generation, consumption and transport infrastructure of electricity. Especially energy system models with a focus on the transmission grid require time series of electricity feed-in and consumption in a high spatial resolution. In general, there are two approaches to obtain regionalized time series: top-down and bottom-up. In many cases, both methodologies may be combined to aggregate or disaggregate input data. Furthermore, there exist various approaches to assign regionalized feed-in of renewable energy sources and electrical load to the model's grid connection points. The variety in the regionalization process leads to significant differences on a regional scope, even if global values are the same. We develop a methodology to compare regionalization techniques of input data for photovoltaics, wind and electrical load between various models as well as data assignment techniques to the power grid nodes. We further define two invariants to evaluate the outcome of the regionalization process at the NUTS 3 level, one invariant for the annual profiles and one for the installed capacities. This methodology enabled us to compare different regionalization and assignment workflows using simple parameters, without explicit knowledge of grid topology. Our results show that the resolution of the input data and the use of a top-down or a bottom-up approach are the most determinant factors in the regionalization process.
Open AccessComparison of different methods of spatial disaggregation of electricity
Energy system models involve various input data sets representing the generation, consumption and transport infrastructure of electricity. Especially energy system models with a focus on the transmission grid require time series of electricity feed-in and consumption in a high spatial resolution. In general, there are two approaches to obtain regionalized time series: top-down and bottom-up. In many cases, both methodologies may be combined to aggregate or disaggregate input data. Furthermore, there exist various approaches to assign regionalized feed-in of renewable energy sources and electrical load to the model's grid connection points. The variety in the regionalization process leads to significant differences on a regional scope, even if global values are the same. We develop a methodology to compare regionalization techniques of input data for photovoltaics, wind and electrical load between various models as well as data assignment techniques to the power grid nodes. We further define two invariants to evaluate the outcome of the regionalization process at the NUTS 3 level, one invariant for the annual profiles and one for the installed capacities. This methodology enabled us to compare different regionalization and assignment workflows using simple parameters, without explicit knowledge of grid topology. Our results show that the resolution of the input data and the use of a top-down or a bottom-up approach are the most determinant factors in the regionalization process.
- 18 August 2021
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 374 (11) , 7811-7865
Comparing localizations across adjunctions
We show that several apparently unrelated formulas involving left or right Bousfield localizations in homotopy theory are induced by comparison maps associated with pairs of adjoint functors. Such comparison maps are used in the article to discuss the existence of functorial liftings of homotopical localizations and cellularizations to categories of algebras over monads acting on model categories, with emphasis on the cases of module spectra and algebras over simplicial operads. Some of our results hold for algebras up to homotopy as well; for example, if T T is the reduced monad associated with a simplicial operad and f f is any map of pointed simplicial sets, then f f -localization coincides with T f Tf -localization on spaces underlying homotopy T T -algebras, and similarly for cellularizations.
- 18 August 2021
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 374 (11) , 7811-7865
Comparing localizations across adjunctions
We show that several apparently unrelated formulas involving left or right Bousfield localizations in homotopy theory are induced by comparison maps associated with pairs of adjoint functors. Such comparison maps are used in the article to discuss the existence of functorial liftings of homotopical localizations and cellularizations to categories of algebras over monads acting on model categories, with emphasis on the cases of module spectra and algebras over simplicial operads. Some of our results hold for algebras up to homotopy as well; for example, if T T is the reduced monad associated with a simplicial operad and f f is any map of pointed simplicial sets, then f f -localization coincides with T f Tf -localization on spaces underlying homotopy T T -algebras, and similarly for cellularizations.
- Open Access
Evaluation of Temporal Complexity Reduction Techniques Applied to Storage Expansion Planning in Power System Models
The growing share of renewable energy makes the optimization of power flows in power system models computationally more complicated, due to the widely distributed weather-dependent electricity generation. This article evaluates two methods to reduce the temporal complexity of a power transmission grid model with storage expansion planning. The goal of the reduction techniques is to accelerate the computation of the linear optimal power flow of the grid model. This is achieved by choosing a small number of representative time periods to represent one whole year. To select representative time periods, a hierarchical clustering is used to aggregate either adjacent hours chronologically or independently distributed coupling days into clusters of time series. The aggregation efficiency is evaluated by means of the error of the objective value and the computational time reduction. Further, both the influence of the network size and the efficiency of parallel computation in the optimization process are analysed. As a test case, the transmission grid of the northernmost German federal state of Schleswig-Holstein with a scenario corresponding to the year 2035 is considered. The considered scenario is characterized by a high share of installed renewables.
Open AccessEvaluation of Temporal Complexity Reduction Techniques Applied to Storage Expansion Planning in Power System Models
The growing share of renewable energy makes the optimization of power flows in power system models computationally more complicated, due to the widely distributed weather-dependent electricity generation. This article evaluates two methods to reduce the temporal complexity of a power transmission grid model with storage expansion planning. The goal of the reduction techniques is to accelerate the computation of the linear optimal power flow of the grid model. This is achieved by choosing a small number of representative time periods to represent one whole year. To select representative time periods, a hierarchical clustering is used to aggregate either adjacent hours chronologically or independently distributed coupling days into clusters of time series. The aggregation efficiency is evaluated by means of the error of the objective value and the computational time reduction. Further, both the influence of the network size and the efficiency of parallel computation in the optimization process are analysed. As a test case, the transmission grid of the northernmost German federal state of Schleswig-Holstein with a scenario corresponding to the year 2035 is considered. The considered scenario is characterized by a high share of installed renewables.
- Open Access
Comparing localizations across adjunctions
We show that several apparently unrelated formulas involving left or right Bousfield localizations in homotopy theory are induced by comparison maps associated with pairs of adjoint functors. Such comparison maps are used in the article to discuss the existence of functorial liftings of homotopical localizations and cellularizations to categories of algebras over monads acting on model categories, with emphasis on the cases of module spectra and algebras over simplicial operads. Some of our results hold for algebras up to homotopy as well; for example, if $T$ is the reduced monad associated with a simplicial operad and $f$ is any map of pointed simplicial sets, then $f$-localization coincides with $Tf$-localization on spaces underlying homotopy $T$-algebras, and similarly for cellularizations.Open AccessComparing localizations across adjunctions
We show that several apparently unrelated formulas involving left or right Bousfield localizations in homotopy theory are induced by comparison maps associated with pairs of adjoint functors. Such comparison maps are used in the article to discuss the existence of functorial liftings of homotopical localizations and cellularizations to categories of algebras over monads acting on model categories, with emphasis on the cases of module spectra and algebras over simplicial operads. Some of our results hold for algebras up to homotopy as well; for example, if $T$ is the reduced monad associated with a simplicial operad and $f$ is any map of pointed simplicial sets, then $f$-localization coincides with $Tf$-localization on spaces underlying homotopy $T$-algebras, and similarly for cellularizations. - 1 December 2016
- Published by Springer Nature
- p. 133-136
Phantom Maps and Representability
- 1 April 2016
- Published by Elsevier in Advances in Mathematics
- Vol. 292, 111-180
Transfinite Adams representability
- 1 April 2016
- Published by Elsevier in Advances in Mathematics
- Vol. 292, 111-180
Transfinite Adams representability
- Open Access
Transfinite Adams representability
In a well generated triangulated category T, given a regular cardinal a, we consider the following problems: given a functor from the category of a-compact objects to abelian groups that preserves products of <a objects and takes exact triangles to exact sequences, is it the restriction of a representable functor in T? Is every natural transformation between two such restricted representable functors induced by a map between the representatives? If the answer to both questions is positive we say that T satisfies a-Adams representability. A classical result going back to Brown and Adams shows that the stable homotopy category satisfies Adams representability for the first infinite cardinal. For that cardinal, Adams representability is well understood thanks to the work of Christensen, Keller and Neeman. In this paper, we develop an obstruction theory to decide when T satisfies a-Adams representability. We derive necessary and sufficient conditions of homological nature, and we compute several examples. In particular, we show that there are rings satisfying a-Adams representability for all non-countable cardinals a and rings which do not satisfy a-Adams representability for any infinite cardinal a. Moreover, we exhibit rings for which the answer to both questions is no for infinite many cardinals. As a side result, we give an example of an infinite phantom map.
Open AccessTransfinite Adams representability
In a well generated triangulated category T, given a regular cardinal a, we consider the following problems: given a functor from the category of a-compact objects to abelian groups that preserves products of <a objects and takes exact triangles to exact sequences, is it the restriction of a representable functor in T? Is every natural transformation between two such restricted representable functors induced by a map between the representatives? If the answer to both questions is positive we say that T satisfies a-Adams representability. A classical result going back to Brown and Adams shows that the stable homotopy category satisfies Adams representability for the first infinite cardinal. For that cardinal, Adams representability is well understood thanks to the work of Christensen, Keller and Neeman. In this paper, we develop an obstruction theory to decide when T satisfies a-Adams representability. We derive necessary and sufficient conditions of homological nature, and we compute several examples. In particular, we show that there are rings satisfying a-Adams representability for all non-countable cardinals a and rings which do not satisfy a-Adams representability for any infinite cardinal a. Moreover, we exhibit rings for which the answer to both questions is no for infinite many cardinals. As a side result, we give an example of an infinite phantom map.