Resource constrained shortest path algorithm for EDF short-term thermal production planning problem
Abstract
Unit commitment problem on an electricity network consists in choosing the production plan of the plants (units) of a company in order to meet demand constraints. It is generally solved using a decomposition approach where demand constraints are relaxed, resulting in one pricing subproblem for each unit. In this paper we focus on the pricing subproblem for thermal units at EDF, a major French electricity producer. Our objective is to determine an optimal two-day production plan that minimizes the overall cost while respecting several non-linear operational constraints. The pricing problem is generally solved by dynamic programming. However, due to the curse of dimensionality, dynamic programming reaches its limits when extra-constraints have to be enforced. We model the subproblem as a resource constrained shortest path (RCSP) problem. Leveraging on RCSP algorithms recently introduced by the second author, we obtain an order of magnitude speed-up with respect to traditional RCSP algorithms.
Cite
@article{arxiv.1809.00548,
title = {Resource constrained shortest path algorithm for EDF short-term thermal production planning problem},
author = {Markus Kruber and Axel Parmentier and Pascal Benchimol},
journal= {arXiv preprint arXiv:1809.00548},
year = {2018}
}