Premium
A STOCHASTIC DYNAMIC PROGRAMMING BASED APPROACH TO THE OPERATION OF A MULTI‐RESERVOIR SYSTEM 1
Author(s) -
Tai F.K.,
Goulter I. C.
Publication year - 1987
Publication title -
jawra journal of the american water resources association
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.957
H-Index - 105
eISSN - 1752-1688
pISSN - 1093-474X
DOI - 10.1111/j.1752-1688.1987.tb00815.x
Subject(s) - upstream (networking) , downstream (manufacturing) , hydroelectricity , inflow , dynamic programming , heuristic , computer science , stochastic programming , mathematical optimization , process (computing) , upstream and downstream (dna) , environmental science , petroleum engineering , geology , mathematics , engineering , algorithm , operations management , computer network , oceanography , electrical engineering , operating system
An heuristic iterative technique based upon stochastic dynamic programming is presented for the analysis of the operation of a three reservoir ‘Y’ shaped hydroelectric system. The technique is initiated using historical inflow data for the downstream reservoir. At each iteration the optimal policies for the downstream hydroelectric generating unit are used to provide relative weightings or targets for operation of upstream reservoirs. New input inflows to the downstream reservoir are then obtained by running the historical streamflow record through the optimal policies for the upstream reservoirs. These flows are then used to develop a new operating policy for the downstream reservoir and hence new targets for the upstream reservoirs. The process is continued until the operating policies for each reservoir provide the same overall system benefit for two successive iterations. Results obtained from the procedure are compared to the results obtained by historical operation of the system. The procedure is shown to develop operating policies which give benefits which are as close to the historical benefits as can be expected given the choice of the number of storage state variables.