Optimal Design of Water Conveyance Systems

Abstract

A computational methodology is described for establishing the minimum cost route location and engineering design for a water conveyance system delivering a fixed flow rate to a single delivery point from one of a number of possible water sources. The possible route sections are represented as arcs in a network. A dynamic programming algorithm is utilized to establish the optimal number and size of pumping stations; the bottom width and depth dimensions and surface lining of open channels; the diameter, pressure class and number of parallel lines of installed pipes; and the height of embankment dams along the route sections in the conveyance system. The design and cost of associated appurtenances and structures are considered. The application of the algorithm, as coded in the CANAL-I computer program, is illustrated for several potential water conveyance projects in Texas.