In this paper, we study a single-reservoir Hydro Unit Commitment Problem in a deterministic price-taker context, where production is assumed to be generated through discrete operational points. Under some hypotheses, we present a time expanded graph representation for the problem, where, at each time step, nodes correspond to the discrete operational points, and arcs refer to possible state changes. Based on the graph representation, we show that our problem reduces to a Constrained Shortest Path Problem.
A path-based formulation for the hydro unit commitment and scheduling problem
Thomopulos D.
;
2020-01-01
Abstract
In this paper, we study a single-reservoir Hydro Unit Commitment Problem in a deterministic price-taker context, where production is assumed to be generated through discrete operational points. Under some hypotheses, we present a time expanded graph representation for the problem, where, at each time step, nodes correspond to the discrete operational points, and arcs refer to possible state changes. Based on the graph representation, we show that our problem reduces to a Constrained Shortest Path Problem.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.