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.

Shortest Path Problem variants for the Hydro Unit Commitment Problem

Thomopulos, Dimitri;
2018-01-01

Abstract

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.
2018
van Ackooij, Wim; D'Ambrosio, Claudia; Liberti, Leo; Taktak, Raouia; Thomopulos, Dimitri; Toubaline, Sonia
File in questo prodotto:
File Dimensione Formato  
SPP-HUCPpreprint.pdf

accesso aperto

Tipologia: Documento in Pre-print
Licenza: Creative commons
Dimensione 391.26 kB
Formato Adobe PDF
391.26 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11568/956792
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? ND
social impact