Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley

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.