Inflow Aggregation and Run-of-the-River Inflow Energy for Reducing Dimensionality in the Long-Term Generation Scheduling Problem

The long-term generation scheduling (LTGS) problem aims to build an operating policy over a multi-year planning horizon, correlating thermal generation and deficit costs with water storage. The LTGS is modeled as a linear multistage stochastic program, whose state-of-art solution is the stochastic dual dynamic programming (SDDP). One critical challenge is to represent the time-dependency of river inflows accurately. Despite recent advances, modeling simplifications are needed to allow the LTGS computational tractability via SDDP since it is necessary to increase the state space to include the time-dependent variables properly. Thus, most works simplify the hydro production function (HPF) to represent the inflows in detail to overcome this negative aspect. However, the literature lacks this trade-off, i.e., finding a balance between stochastic inflow modeling and HPF representation. Thus, this paper proposes an alternative approach to analyzing this trade-off, using the inflow aggregation and run-of-the-river energy inflow instead of individual inflow in SDDP. The proposed approach drastically reduces the number of state variables in SDDP, allowing a detailed HPF representation in the LTGS. We employ a one-sided confidence interval for expected cost estimation to show that our approach provides better performance than the individualized inflows. The analysis is performed in several large-scale computational instances using a power system with 53 geographically widespread hydro plants. The numerical results demonstrate that inflow aggregation provides, on average, a 4 % reduction on the operating cost, whereas for the run-of-the-river inflow energy, the reduction is, on average, 2 %.