OPTIMAL SEWER LINE DESIGN

Abstract

Sewer design with the help of design charts and special slide rules is a very tidious 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 the 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 over come these limitations, it would be highly desirable 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 present work addresses it self to some task of development of computer software for optimal design of a sewer line. The sewer line considered here is a collection main. The problem has been formulated as a linear progra-mming problem and is solved using simplex one phase tech-nique, which not only reduces the memory requirements but also reduces the computation work and hence needs a much lesser time in comparision of other methods. It is hoped that the algorithm can directly be applied for the design of main sewer line. The algorithm can also be extended for a sewer network system