Show simple item record

contributor authorJure Zevnik
contributor authorMarjeta Kramar Fijavž
contributor authorDaniel Kozelj
date accessioned2019-09-18T10:38:24Z
date available2019-09-18T10:38:24Z
date issued2019
identifier other%28ASCE%29WR.1943-5452.0001100.pdf
identifier urihttp://yetl.yabesh.ir/yetl1/handle/yetl/4259685
description abstractThis study present an efficient graph-theoretical method for automatic design of district metered areas (DMAs) in water distribution networks (WDNs). The proposed method consists of two main parts, WDN partitioning and DMA connection, and is tested on a real-life WDN for which three spectral partitioning methods, multiple weight cases, and two clustering criteria are compared. The efficiency of the proposed DMA connection algorithm with respect to the traditional combinatorial approach is shown for different numbers of established DMAs. The final solution is selected according to a multicriteria evaluation model, which was developed in order to reduce the subjective influence in the selection process and considers hydraulic, cost, and topological criteria. The results show that all three tested spectral partitioning methods, i.e., the ratio cut, normalized cut, and newly proposed generalized normalized cut, are suitable for WDN partitioning and that the quality of the obtained solutions can be further improved by considering appropriate topological and cost-based WDN information in the partitioning process.
publisherAmerican Society of Civil Engineers
titleGeneralized Normalized Cut and Spanning Trees for Water Distribution Network Partitioning
typeJournal Paper
journal volume145
journal issue10
journal titleJournal of Water Resources Planning and Management
identifier doi10.1061/(ASCE)WR.1943-5452.0001100
page04019041
treeJournal of Water Resources Planning and Management:;2019:;Volume ( 145 ):;issue: 010
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record