Name
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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.endm.2018.07.040 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Hydro Unit Commitment Problem,time expanded graph representation,Constrained Shortest Path Problem | Integer,Discrete mathematics,Dynamic programming,Shortest path problem,Power system simulation,Graph (abstract data type),Mathematics | Journal |
Volume | ISSN | Citations |
69 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 4 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wim Van Ackooij | 1 | 131 | 12.33 |
| Claudia D'Ambrosio | 2 | 159 | 20.07 |
| Leo Liberti | 3 | 1280 | 105.20 |
| Raouia Taktak | 4 | 3 | 3.44 |
| Dimitri Thomopulos | 5 | 0 | 1.01 |
| Sonia Toubaline | 6 | 60 | 7.54 |