Oriol Raventós

Dr. Oriol Raventós

DLR - VE
orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 February 2020 in Energies
Verified
Journal Article
Open access
PDF file
OROriol Raventós
Oriol Raventós
JBJulian Bartels
Julian Bartels
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.

4 May 2022 in Renewable and Sustainable Energy Reviews
Verified
Journal Article
Open access
OROriol Raventós
Oriol Raventós
TDThomas Dengiz
Thomas Dengiz
WMWided Medjroubi
Wided Medjroubi
CUChinonso Unaichi
Chinonso Unaichi
ABAndreas Bruckmeier
Andreas Bruckmeier
RFRafael Finck
Rafael Finck

1 January 2015 in Homology, Homotopy and Applications
Verified
Journal Article
Closed access
OROriol Raventós
Oriol Raventós

1 April 2016 in Advances in Mathematics
Verified
Journal Article
Closed access
FMFernando Muro
Fernando Muro
OROriol Raventós
Oriol Raventós

18 August 2021 in Transactions of the American Mathematical Society
Verified
Journal Article
Closed access
PDF file
CCCarles Casacuberta
Carles Casacuberta
OROriol Raventós
Oriol Raventós
ATAndrew Tonks
Andrew Tonks
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.

20 January 2026 in arXiv
Verified
Preprint
Open access
PDF file
SLSergio López-Baños
Sergio López-Baños
ELElisabeth Lobe
Elisabeth Lobe
OLOntje Lünsdorf
Ontje Lünsdorf
OROriol Raventós
Oriol Raventós
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.