Design of an Irrigation Network System in Terms of Canal Capacity Using Graph Theory
Publication: Journal of Irrigation and Drainage Engineering
Volume 143, Issue 6
Abstract
The problem posed here concerns water distribution from a main source to discrete demand locations through irrigation canals. A network is designed where the demand locations express the nodes of the network, which are connected by arcs that represent canals to be constructed. The construction cost of each canal depends on various factors such as land structure, topography, etc. The amount of water conveyed per unit of time down a canal path from the main source to a specific demand location is equal to the minimum capacity of a canal in the corresponding path. The objective here is to determine a subset of canals that distributes per unit of time the maximum possible amount of water to every demand location at the minimum possible construction cost, taking into account canal capacity limitations. The problem is dealt with in the context of graph theory and a corresponding algorithm has been developed.
Get full access to this article
View all available purchase options and get full access to this article.
References
Aho, A., Hopcroft, J., and Ullman, J. (1987). Data structures and algorithms, Addison-Wesley, Boston.
Christofides, N. (1975). Graph theory, an algorithmic approach, Academic Press, London.
Cormen, H. T., Leiserson, E. C., and Rivest, L. R. (1998). Introduction to algorithms, MIT Press, Cambridge, MA.
Deo, N. (1975). Graph theory with applications to engineering and computer science, Prentice-Hall, Englewood Cliffs, NJ.
Harary, F. (1969). Graph theory, Addison-Wesley, Boston.
Irrigation Pipe Price. (2016). “Alibaba global trade.” ⟨http://www.alibaba.com/showroom/irrigation-pipe-price.html⟩ (Dec. 2016).
Johnson, L. E. (2008). “GIS for water-supply and irrigation system.” Geographic Information Systems in Water Resources Engineering, CRC Press, London, 137–162.
Kaibel, V., and Peinhardt, M. A. F. (2006). “On the bottleneck shortest path problem.”, Konrad-Zuse-Zentrum für Informationstechnik, Berlin.
Punnen, A. P., and Ruonan, Z. (2009). “Bottleneck flows in unit capacity networks.” Inf. Processing Lett., 109(6), 334–338.
Renjie, S., Qinggang, J., Yanyan, L., and Jing, Z. (2012). “Identify the bottleneck of water network by using graph theory.” Adv. Mater. Res., 433–440, 4794–4797.
Information & Authors
Information
Published In
Journal of Irrigation and Drainage Engineering
Volume 143 • Issue 6 • June 2017
Copyright
©2017 American Society of Civil Engineers.
History
Received: Jun 9, 2016
Accepted: Oct 31, 2016
Published online: Feb 10, 2017
Published in print: Jun 1, 2017
Discussion open until: Jul 10, 2017
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.