Thumbnail - Request a copy

Shortest Path Problem variants for the Hydro Unit Commitment Problem

Ackooij, Wim van; D'Ambrosio, Claudia; Liberti, Leo; Taktak, Raouia; Thomopulos, Dimitri; Toubaline, Sónia (2018), Shortest Path Problem variants for the Hydro Unit Commitment Problem, Electronic Notes in Discrete Mathematics, 69, p. 309-316. 10.1016/j.endm.2018.07.040

Type
Article accepté pour publication ou publié
Date
2018
Journal name
Electronic Notes in Discrete Mathematics
Volume
69
Publisher
Elsevier
Pages
309-316
Publication identifier
Metadata
Show full item record
Author(s)
Ackooij, Wim van
Optimisation, Simulation, Risque et Statistiques pour les Marchés de l’Energie [EDF R&D OSIRIS]
D'Ambrosio, Claudia cc
Laboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
Liberti, Leo cc
Laboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
Taktak, Raouia
Institut Supérieur d'Informatique et de Multimédia de Sfax [ISIMS]
Thomopulos, Dimitri
Laboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
Toubaline, Sónia
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
In this paper, we study the deterministic single-reservoir Hydro Unit Commitment Problem. Under some hypotheses, we present a time expanded graph representation for the problem, where, at each time step, nodes correspond to discrete operational points, and arcs refer to possible state changes. We show that our problem reduces to a Constrained Shortest Path Problem, propose and compare different approaches to solve the HUCP, based on mixed integer linear or dynamic programming.
Subjects / Keywords
Hydro Unit Commitment Problem; time expanded graph representation; Constrained Shortest Path Problem