Aqueduct Route Optimization by Dynamic Programmingby Nathan Buras,
Serial Information: Journal of the Hydraulics Division, 1969, Vol. 95, Issue 5, Pg. 1615-1632
Document Type: Journal Paper
The structure of a regional irrigation project supplying water to a number of villages scattered over a relatively flat area is modeled by a series of straight lines across the contours, representing the laterals, and a main conduit crossing these lines. This model is further formulated as a dynamic programming search technique, which yields the preliminary optimal route of the main conduit. The optimality criterion is the total cost of the aqueduct and the laterals, including the energy necessary for pumping water from the main conduit to supply points above it. The dynamic programming formulation enables the search for minimum cost sections of the aqueduct route, and the application of the principle of optimality insures the attainment of the overall optimum aqueduct route. This analysis is proposed in connection with the planning of the Taleghan Aqueduct, within the Ghazvin Development Project in Iran.
Subject Headings: Aqueducts | Computer programming | Conduits | Structural models | Hydrologic models | Irrigation water | Dynamic models | Asia | Iran | Middle East
Services: Buy this book/Buy this article
Return to search