COMPARISON OF RESERVOIR LINEAR OPERATION RULES USING LINEAR AND DYNAMIC PROGRAMMING1

ABSTRACT: Mathematical optimization techniques are used to study the operation and design of a single, multi-purpose reservoir system. Optimal monthly release policies are derived for Hoover Reservoir, located in Central Ohio, using chance-constrained linear programming and dynamic programming-regression methodologies. Important characteristics of the former approach are derived, discussed, and graphically illustrated using Hoover Reservoir as a case example. Simulation procedures are used to examine and compare the overall performance of the optimal monthly reservoir release policies derived under the two approaches. Results indicate that, for the mean detention time and the corresponding safe yield target water supply release under existing design of Hoover Reservoir, the dynamic programming policies produce lower average annual losses (as defined by a two-sided quadratic loss function) while achieving at least as high reliability levels when compared to policies derived under the chance-constrained linear programming method. In making this comparison, the reservoir release policies, although not identical, are assumed to be linear. This restricted form of the release policy is necessary to make the chance-constrained programming method mathematically tractable.     

A COMPARISON OF TWO METHODS FOR MULTIOBJECTIVE OPTIMIZATION FOR RESERVOIR OPERATION1

ABSTRACT: Two major objectives in operating the multireservoir system of the Upper Colorado River basin are maximization of hydroelectric power production and maximization of the reliability of annual water supply. These two objectives conflict. Optimal operation of the reservoir system to achieve both is unattainable. This paper seeks the best compromise solution for an aggregated reservoir as a surrogate of the multireservoir system by using two methods: the constraint method and the method of combined stochastic and deterministic modeling. Both methods are used to derive the stationary optimal operating policy for the aggregated reservoir by using stochastic dynamic programming but with different objective functions and minimum monthly release constraints. The resulting operating policies are then used in simulated operation of the reservoir with historical inflow records to evaluate their relative effectiveness. The results show that the policy obtained from the combination method would yield more hydropower production and higher reliability of annual water supply than that from the constraint-method policy.     

COMPARISON OF STOCHASTIC AND DETERMINISTIC DYNAMIC PROGRAMMING FOR RESERVOIR OPERATING RULE GENERATION1

ABSTRACT: Two dynamic programming models — one deterministic and one stochastic — that may be used to generate reservoir operating rules are compared. The deterministic model (DPR) consists of an algorithm that cycles through three components: a dynamic program, a regression analysis, and a simulation. In this model, the correlation between the general operating rules, defined by the regression analysis and evaluated in the simulation, and the optimal deterministic operation defined by the dynamic program is increased through an iterative process. The stochastic dynamic program (SDP) describes streamflows with a discrete lag-one Markov process. To test the usefulness of both models in generating reservoir operating rules, real-time reservoir operation simulation models are constructed for three hydrologically different sites. The rules generated by DPR and SDP are then applied in the operation simulation model and their performance is evaluated. For the test cases, the DPR generated rules are more effective in the operation of medium to very large reservoirs and the SDP generated rules are more effective for the operation of small reservoirs.     

A STOCHASTIC DYNAMIC PROGRAMMING BASED APPROACH TO THE OPERATION OF A MULTI-RESERVOIR SYSTEM1

ABSTRACT: 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.     

PRACTICAL IMPLICATIONS IN THE USE OF STOCHASTIC DYNAMIC PROGRAMMING FOR RESERVOIR OPERATION1

ABSTRACT: A stochastic dynamic programming model is applied to a small hydroelectric system. The variation in number of stage iterations and the computer time required to reach steady state conditions with changes in the number of storage states is investigated. The increase in computer time required to develop the storage probability distributions with increase in the number of storage states is reviewed. It is found that for an average of seven inflow states, the largest number of storage states for which it is computationally feasible to develop the storage probability distributions is nine. It is shown that use of the dynamic program results based on a small number of storage states results in unrealistically skewed storage probability distributions. These skewed distributions are attributed to “trapping” states at the low end of the storage range.