NETWORK FLOW PROGRAMMING-MODEL FOR MULTIRESERVOIR SIZING

The paper describes a network flow programming (NFP) model for sizing of reservoirs in a multiple reservoir design problem. It is a multiper iod model, where all single period networks, representing reservoirs, rivers, canals, and demand points, are interconnected in adjacent peri ods by reservoir carryover arcs. Plows in carryover arcs represent res ervoir storage and the maximum flow in an are for a reservoir indicate s storage capacity requirement for that reservoir. The carryover arcs are split into multiple arcs representing multiple zones in the storag e capacity. Reservoir capacities are obtained by optimizing the flow i n carryover arcs. The model enables to plan reservoirs for a desirable reliability in fulfillment of demands. The concept of preference matr ix (PM) has been introduced to reflect the interreservoir and interzon al competitiveness based on the objective function. Applicability of t he model is demonstrated by estimating the capacities of seven reservo irs in a water transfer scheme in India using the criterion of minimiz ation of forest submergence.