Linear Water‐Supply Pipeline Capacity Expansion Model

Abstract

A computational methodology is described for establishing the approximate minimum‐cost engineering design for the initial construction and subsequent capacity expansion of a linear water‐supply pipeline along a specified route. Dynamic programming algorithms are utilized to determine an optimal solution to an approximation of the complete design problem. The selected design specifies the number and size of pump stations and the length, diameter, and pressure class of the pipe, including the addition of parallel pipe, to be added at the beginning of each staging interval over a planning period. Variations in pipe pressure class and the addition of parallel pipe are allowed along the individual sections of the pipeline route. This approximate least‐cost design is the optimal design if parallel pipe is not allowed. The use of the algorithm is illustrated for a potential water conveyance pipeline in the San Antonio River Basin in Texas.