Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/6278
Authors: Narayan, Pramod
Issue Date: 1994
Abstract: Sewer line is a part and parcel of sewerage system. The sewer line must be properly and skillfully planned and designed, so as to remove the entire sewage effectively and efficiently from the houses and up to the point of disposal. The sewers must be of adequate size so as to avoid their overflow and subsequent damages to properties and health hazards. Sewer design with the help of design charts and special slide rules is a very tedious and time consuming job and hence it can be said that the most economical design of a sewer system is often not obtained because engineers can afford to investigate only a few different design alternatives due to labour involved. The use of computers not only minimizes the cost but also satisfies the various requirements. Recently, sewer design programs have been developed to operate on micro-computers. These programs attempt to find good but not necessarily globally optimal least cost designs. Some of these programs are time consuming to use and some require a considerable memory requirement in the computer. To overcome these limitations, it would be highly imperative to develop a powerful program for micro-computers that can produce an economical design of a sewer network requiring minimum memory location and minimum computation time. The purpose of present study is to develop a optimum method for the design and route alignment of a sewer line keeping in view the cost of sewer line as well as its route alignment. In present study, a formulation of objective functon and constraints have been done and a program is prepared in FORTRAN for optimum route alignment of sewer line.
Other Identifiers: M.Tech
Research Supervisor/ Guide: Swamee, P. K.
metadata.dc.type: M.Tech Dessertation
Appears in Collections:MASTERS' DISSERTATIONS (Civil Engg)

Files in This Item:
File Description SizeFormat 
246695CE.pdf849.64 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.