Article Dans Une Revue Electronic Notes in Discrete Mathematics Année : 2018

Shortest Path Problem variants for the Hydro Unit Commitment Problem

Résumé

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.

Dates et versions

hal-02098485 , version 1 (12-04-2019)

Identifiants

Citer

Wim van Ackooij, Claudia d'Ambrosio, Leo Liberti, Raouia Taktak, Dimitri Thomopulos, et al.. Shortest Path Problem variants for the Hydro Unit Commitment Problem. Electronic Notes in Discrete Mathematics, 2018, 69, ⟨10.1016/j.endm.2018.07.040⟩. ⟨hal-02098485⟩
107 Consultations
0 Téléchargements

Altmetric

Partager

  • More