reservoir (version 1.1.5)

dp: Dynamic Programming (Deprecated function; use 'dp_supply' instead)

Description

Determines the optimal sequence of releases from the reservoir to minimise a penalty cost function based on water supply defict.

Usage

dp(Q, capacity, target, S_disc = 1000, R_disc = 10, loss_exp = 2, S_initial = 1, plot = TRUE, rep_rrv = FALSE)

Arguments

Q

vector or time series object. Net inflows to the reservoir.

capacity

numerical. The reservoir storage capacity (must be the same volumetric unit as Q and the target release).

target

numerical. The target release constant.

S_disc

integer. Storage discretization--the number of equally-sized storage states. Default = 1000.

R_disc

integer. Release discretization. Default = 10 divisions.

loss_exp

numeric. The exponent of the penalty cost function--i.e., Cost[t] <- ((target - release[t]) / target) ^ **loss_exp**). Default value is 2.

S_initial

numeric. The initial storage as a ratio of capacity (0

plot

logical. If TRUE (the default) the storage behavior diagram and release time series are plotted.

rep_rrv

logical. If TRUE then reliability, resilience and vulnerability metrics are computed and returned.

Value

Returns the time series of optimal releases and, if requested, the reliability, resilience and vulnerability of the system.

References

Loucks, D.P., van Beek, E., Stedinger, J.R., Dijkman, J.P.M. and Villars, M.T. (2005) Water resources systems planning and management: An introduction to methods, models and applications. Unesco publishing, Paris, France.

See Also

sdp for Stochastic Dynamic Programming