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

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.

Citation:

van Ackooij, W., D’Ambrosio, C., Thomopulos, D., & Trindade, R. S. (2021). Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley. In European Journal of Operational Research, Vol. 291, Issue 3, pp. 935–943. Elsevier BV. https://doi.org/10.1016/j.ejor.2020.12.029