In this paper, we tackle the hydro unit commitment problem and scheduling in a hydro valley. We first decompose the problem into several simpler subproblems, one for each reservoir/plant. Then, we model each of them as an optimization problem on graphs with or without resource constraints. We compare our method with a commercial solver for mixed integer linear programming, run on a formulation of the problem and show promising results.
Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley
Thomopulos, Dimitri;
2021-01-01
Abstract
In this paper, we tackle the hydro unit commitment problem and scheduling in a hydro valley. We first decompose the problem into several simpler subproblems, one for each reservoir/plant. Then, we model each of them as an optimization problem on graphs with or without resource constraints. We compare our method with a commercial solver for mixed integer linear programming, run on a formulation of the problem and show promising results.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
EJOR___Decomposition_and_Shortest_Path_Problem.pdf
accesso aperto
Descrizione: This final version of the paper, published on the European Journal of Operational Research, is available at the following link: https://www.sciencedirect.com/getaccess/pii/S0377221720310729/pdfft
Tipologia:
Documento in Post-print
Licenza:
Creative commons
Dimensione
341.17 kB
Formato
Adobe PDF
|
341.17 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
