Network Flow Programming Model for Multireservoir Sizing

Abstract

The paper describes a network flow programming (NFP) model for sizing of reservoirs in a multiple reservoir design problem. It is a multiperiod model, where all single period networks, representing reservoirs, rivers, canals, and demand points, are interconnected in adjacent periods by reservoir carryover arcs. Flows in carryover arcs represent reservoir storage and the maximum flow in an arc for a reservoir indicates storage capacity requirement for that reservoir. The carryover arcs are split into multiple arcs representing multiple zones in the storage capacity. Reservoir capacities are obtained by optimizing the flow in carryover arcs. The model enables to plan reservoirs for a desirable reliability in fulfillment of demands. The concept of preference matrix (PM) has been introduced to reflect the interreservoir and interzonal competitiveness based on the objective function. Applicability of the model is demonstrated by estimating the capacities of seven reservoirs in a water transfer scheme in India using the criterion of minimization of forest submergence.