In this article we present a novel nested dynamic programming (nDP) algorithm for multipurpose reservoir optimization with additional decision variables related to different water users. The nDP algorithm is built from two algorithms: (1) dynamic programming (DP) and (2) nested optimization algorithm implemented with Simplex and quadratic Knapsack methods. The novel idea is to include a nested optimization algorithm into the DP transition that reduces the initial problem dimension and alleviates the DP's curse of dimensionality. The nDP can solve multi-objective optimization problems, without significantly increasing the algorithm complexity and the computational expenses. Computationally, the nDP can handle dense and irregular variable discretization; it is coded in Java as a prototype application and has been successfully tested with eight objectives at the Knezevo reservoir in the Republic of Macedonia. The article presents a discussion on comparison of nDP with other DP methods and highlights the advantages of nDP.
A novel nested dynamic programming (nDP) algorithm for multipurpose reservoir optimization
Blagoj Delipetrev, Andreja Jonoski, Dimitri P. Solomatine; A novel nested dynamic programming (nDP) algorithm for multipurpose reservoir optimization. Journal of Hydroinformatics 1 July 2015; 17 (4): 570–583. doi: https://doi.org/10.2166/hydro.2015.066
Download citation file: