arXiv subjects

Baptiste Rabecq

Publications and source records attributed to Baptiste Rabecq.

3 recordsLinked to original sources

arXiv2026

Stochastic Optimization for Resource Adequacy in Capacity Markets with Storage and Renewables

The integration of storage and renewable resources fundamentally alters resource-adequacy analysis. Because storage couples decisions across time, it invalidates the traditional reliability models that are based on time-independent capacity demand curves. Moreover, renewables introduce temporally correlated intermittency. To address this, we formulate the capacity procurement problem as a two-stage stochastic program, where the capacity decision is made in the first stage, while the expected unserved energy is evaluated by a second-stage dispatch problem that considers uncertainties such as generator failures via Markov chains, temporally correlated renewable output, and stochastic load. We implement the resulting stochastic capacity procurement (SCP) model on a New England system with 305 generators, including conventional, renewable, and storage units. Using the stochastic decomposition (SD) algorithm, we solve the SCP with up to 20,000 Monte Carlo samples, each representing a six-month trajectory of more than 4,300 hours of uncertainty across all units. We analyze the convergence behavior of SD and show that convergence for the stochastic program happens faster than reliable estimation of the reliability metrics, which require more samples than are used in typical stochastic programs. These results show that chronologically detailed Monte Carlo sampling can be integrated into capacity procurement optimization in a computationally tractable manner, enabling reliability evaluation with controlled statistical accuracy at realistic system scales.

math.OC↗

arXiv2025

Dynamic Line Ratings in AC Optimal Power Flow: Transient Temperature, Decomposition, and Large-scale Evaluation

As power grids experience increasing renewable penetration and rapid load growth from AI data centers and electrification, alleviating line congestion becomes critical to unlocking additional grid capacity. This work investigates Dynamic Line Rating (DLR), a congestion mitigation method that adjusts power line current limits in response to meteorological conditions. Unlike traditional approaches that impose predefined time-varying limits, we propose a novel optimization framework that embeds the transient-state heat equation governing conductor temperature dynamics, enabling direct constraints on conductor temperature rather than simplified steady-state approximations. We derive a closed-form solution to the heat equation, enabling a finite-dimensional reformulation of the dynamics. We then leverage a distributed decomposition method, a bi-level Alternating Direction Method of Multipliers (ADMM) algorithm with provable convergence, aided by regularity properties of the heat equation solution. These modeling and algorithmic innovations allow us to conduct the first large-scale evaluation of DLR using multi-period AC optimal power flow. Numerical experiments on the 2000-bus Texas grid demonstrate that DLR allows significant reduction in generation cost in congested systems over Static Line Rating (SLR) and Ambient Adjusted Ratings (AAR). The transient temperature formulation provides additional grid flexibility and headroom benefits with minimal computational overhead.

math.OC↗

arXiv2023

A deep learning Attention model to solve the Vehicle Routing Problem and the Pick-up and Delivery Problem with Time Windows

SNCF, the French public train company, is experimenting to develop new types of transportation services by tackling vehicle routing problems. While many deep learning models have been used to tackle efficiently vehicle routing problems, it is difficult to take into account time related constraints. In this paper, we solve the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) and the Capacitated Pickup and Delivery Problem with Time Windows (CPDPTW) with a constructive iterative Deep Learning algorithm. We use an Attention Encoder-Decoder structure and design a novel insertion heuristic for the feasibility check of the CPDPTW. Our models yields results that are better than best known learning solutions on the CVRPTW. We show the feasibility of deep learning techniques for solving the CPDPTW but witness the limitations of our iterative approach in terms of computational complexity.

cs.AI↗