Deterministic hydropower management of large power systems

Abstract

In this paper, we present a new algorithm framework for the robust solution of a deterministic hydropower management problem, where the objective is to maximize the potential energy of the reservoirs while satisfying all operating constraints over a short-term planning horizon. The algorithm is based on the discrete maximum principle. In order to improve the performances of the proposed algorithm, we have suggested subdividing the short term planning horizon to shorter study horizons so shorter study periods are embedded in a longer one. Afterward, the objective becomes maximizing the value of potential energy stored at the end of the shorter horizon. The final state of the shorter horizon will be regarded as the initial state of the next shorter horizon and so on. Hence, a reduced size problem is solved in each shorter horizon. Consequently, the calculation effort is decreased considerably and moreover it makes easy the adjustment of the parameters of the methods used.