Feasible Sanitary Sewer Network Generation Using Graph Theory

Simple item page
dc.contributor.authorTuran, ME
dc.contributor.authorBacak-Turan, G
dc.contributor.authorCetin, T
dc.contributor.authorAslan, E
dc.date.accessioned2024-07-18T11:40:11Z
dc.date.available2024-07-18T11:40:11Z
dc.description.abstractA graph theory-based methodology is proposed for the sewer system optimization problem in this study. Sewer system optimization includes two subproblems: layout optimization and hydraulic design optimization, which can be solved independently or solved simultaneously. No matter which method is chosen for the solution of the optimization problem, a feasible layout that satisfies the restrictions of the sewer system must be obtained in any step of the solution. There are two different layout options encountered: the layouts containing all sewer links and the layouts not containing all sewer links. The method proposed in this study generates a feasible sewer layout that contains all sewer links and satisfies all restrictions of a sanitary sewer system by using graph theory without any additional strategies unlike other studies. The method is applied to two different case studies. The results of the case studies have shown that graph theory is well applicable to sewer system optimization and the methodology proposed based on it is capable of generating a feasible layout. This study is expected to stimulate the use of graph theory on similar studies.
dc.identifier.issn1687-8086
dc.identifier.other1687-8094
dc.identifier.urihttp://akademikarsiv.cbu.edu.tr:4000/handle/123456789/2224
dc.language.isoEnglish
dc.publisherHINDAWI LTD
dc.subjectOPTIMIZATION
dc.subjectLAYOUT
dc.titleFeasible Sanitary Sewer Network Generation Using Graph Theory
dc.typeArticle

Files

Collections

Web of Science Koleksiyonu