Design of an Irrigation Network System in Terms of Canal Capacity Using Graph Theory

Dimitra Alexiou, Constantin C. Tsouros

Journal of Irrigation and Drainage Engineering · 2017 · 10 citations · 4 references

Concepts

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.

References

4