Volume 19, Issue 1 (7-2000)
2000, 19(1): 199-208 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
N. Talebbeydokhti and R. V. Rohani. Optimum Design of Sewer Collection Networks. Computational Methods in Engineering 2000; 19 (1) :199-208
URL: http://jcme.iut.ac.ir/article-1-191-en.html
URL: http://jcme.iut.ac.ir/article-1-191-en.html
Abstract: (3312 Views)
Various methods have been used to economically design wastewater and stormwater collection systems. In this article, Discrete Differential Dynamic Programming (DDDP) which is a subsection of dynamic programming (DP) was used. For each pipe network, various alternatives such as depth and slope of pipe laying and various diameters could be considered to satisfy hydraulic and engineering constraints. From an economic viewpoint, however there are few alternatives to minimize the costs. Planning algorithm for DDDP is based on determination of one initial answer for network and modifying the answers in continous trials which satisfy economic and engineering considerations. To limit the range of answers in each trial, a corridor of solutions was defined. This range in each trial will converge to an optimum solution. In this regard, a computer program called SNOP (Sewer Network Optimization) has been developed. Several design examples have been run with this program. The results show the suitability of the program.
Keywords: -
