Linear Water‐Supply Pipeline Capacity Expansion Model
Publication: Journal of Hydraulic Engineering
Volume 116, Issue 5
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.
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
Bellman, R. (1957). Dynamic programming. 1st Ed., Princeton University Press, Princeton, N.J.
2.
Bhave, P. R. (1979). “Selecting pipe sizes in network optimization by LP.” J. Hydr. Div., ASCE, 105(8), 1019–1025.
3.
CAPEX‐I program description. (1972). Texas Water Development Board, Systems Engrg. Div., Austin, Tex.
4.
Chow, V. T., ed. (1964). Handbook of applied hydrology. 1st Ed., McGraw‐Hill Book Co., Inc., New York, N.Y., 7–18.
5.
“Cost of transporting water by pipeline.” (1967). Report 42, Texas Water Development Board, Austin, Tex.
6.
Kally, E. (1968). “Pipeline planning by dynamic computer programming.” J. American Water Works Assoc., 61(3), 114–118.
7.
Kareliotis, S. J. (1984). “Optimization of a tree‐like water supply system.” J. Hydr., 68, 419–426.
8.
Lai, F., and Schaake, J., Jr. (1970). A model for capacity expansion planning of water distribution networks. Massachusetts Inst. of Tech., Cambridge, Mass.
9.
Liang, T. (1971). “Design conduit system by dynamic programming.” J. Hydr. Div., ASCE, 97(3), 383–393.
10.
Martin, Q. W. (1977). “Pipeline design model—PIPEX‐I program description and documentation.” Report UM‐3, Texas Dept. of Water Resour., Austin, Tex.
11.
Oron, G., and Karmeli, D. (1979). “Procedure for economic evaluation of water networks parameters.” Water Resour. Bulletin, 15(4), 1050–1060.
12.
Reclamation instruction—Appendix A: Estimating data. (1969). United States Bureau of Reclamation, Denver, Colo.
13.
Robinson, R. B., and Austin, T. A. (1976). “Cost optimization of rural water systems.” J. Hydr. Div., ASCE, 102(8), 1119–1132.
14.
Sniedovich, M. (1978). “Dynamic programming and the principle of optimality: A systematic approach.” Advances in Water Resour., 1(4), 183–190.
15.
Walski, T. (1985a). “State‐of‐the‐art pipe network optimization.” Proc. of the ASCE Specialty Conference on Computer Applications in Water Resources, Division of Water Resources Planning and Management, ASCE, Buffalo; N.Y.
16.
Walski, T. (1985b). “Cleaning and lining versus parallel mains.” J. Water Resour. Planning and Mgmt., ASCE, 111(1), 43–53.
17.
Wond, P., and Larson, R. (1968). “Optimization of natural‐gas pipeline systems via dynamic programming.” IEEE Trans. on Automatic Control, Institute of Electrical and Electronics Engineering, 13(5).
Information & Authors
Information
Published In
Journal of Hydraulic Engineering
Volume 116 • Issue 5 • May 1990
Pages: 675 - 690
Copyright
Copyright © 1990 ASCE.
History
Published online: May 1, 1990
Published in print: May 1990
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.