000 03315nas|a2200433 i 4500
005 20260817172143.0
008 301198s1984 th uzm rtt 00| a1eng d
035 _a.b10127689
099 9 _aAIT RSPR no. EV-84-3
100 1 _aArora, Harish
245 1 0 _aCapacity expansion of water distribution networks :
_ba comparison of single stage and double stage LP models
260 _aBangkok :
_bAsian Institute of Technology,
_c1984
300 _a137 p.
490 1 _aResearch studies project report ;
_vno. EV-84-3
500 _aA research study submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Environment, Resources and Development
502 _aResearch Studies Project Report (M. Eng.) - Asian Institute of Technology, 1984
520 _aThe study deals with capacity expansion of water distribution networks. a network can be optimized for an increase in capacity in future by two methods. First, it can be designed d tor a time period and for next the time period it is expanded for the required capacity. Secondly, it can be designed tor both the time periods in cons ideation at present and expanded at the beginning of next time period . In this study both these methods are compared in terms of total cost and assumed design criteria . Linear programming, an operational technique, is used in formulation of these two methods. The objective function is cost an minimization whereas hydraulic and pressure conditions to be met act as constraints in the models. Simulation with three networks representing various practical conditions is done. According to the results obtained , the second method comes out to be cheaper than the first. The difference in costs tor d net work in optimization with two methods depends on layouts, topography, local conditions, and assumed design criteria.
650 0 _aWater
_xDistribution
700 1 _aOrth, Hermann M.,
_eChairperson
700 1 _aVigneswaran, Saravanamuthu,
_eExamination Committee
700 1 _aFujiwara, Okitsugu,
_eExamination Committee
710 2 _aThe Royal Danish Government ( DANIDA),
_eScholarship Donor
810 2 _aAsian Institute of Technology.
_tResearch studies project report ;
_vno. EV-84-3
856 _3Full-Text
_uhttp://203.159.5.9/ait-thesis/detail.php?q=B20717
907 _a.b10127689
_bmnait
_cy
902 _a240611
998 _b3
_c951012
_dm
_ea
_fy
_g0
945 _lmnait
945 _lmnait
945 _lmnarc
945 _lmnarc
942 _c20
942 _c40
909 _aBarcode : 30050003124558
_bCREATED : 1995-10-13
_cRECORD # : i10144286
_dLPATRON : 0
_eLCHKIN : -
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 0
_jTOT RENEW : 0
909 _aBarcode : 30050003124574
_bCREATED : 1995-10-13
_cRECORD # : i10144298
_dLPATRON : 0
_eLCHKIN : -
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 0
_jTOT RENEW : 0
909 _aBarcode : 30050003124566
_bCREATED : 1995-10-13
_cRECORD # : i10144304
_dLPATRON : 1029037
_eLCHKIN : 2019-03-05
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 1
_jTOT RENEW : 0
909 _aBarcode : 30050120220834
_bCREATED : 2016-01-04
_cRECORD # : i12919858
_dLPATRON : 0
_eLCHKIN : -
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 0
_jTOT RENEW : 0
999 _c15021
_d15021