Topology-distance-based clustering method for water distribution network partitioning

IF 2.1 4区 环境科学与生态学 Q2 ENGINEERING, CIVIL
Kun Du, Jiangyun Li, Wei Xu, Zilian Liu, Feifei Zheng
{"title":"Topology-distance-based clustering method for water distribution network partitioning","authors":"Kun Du, Jiangyun Li, Wei Xu, Zilian Liu, Feifei Zheng","doi":"10.2166/aqua.2023.301","DOIUrl":null,"url":null,"abstract":"Abstract Partitioning water distribution networks (WDNs) into district metered areas offers benefits including reduced nonrevenue water and simplified pressure management. However, current research in this field tends to narrowly focus on the topological relationships among nodes, often overlooking the influence of pressure reducing valves (PRVs) and pump stations on clustering results. To address this limitation, this study introduces a topology-distance-based clustering (TDBC) method that enhances the accuracy of partitioning by explicitly considering the impact of PRVs and pump stations. In the TDBC method, the Floyd algorithm is initially employed to construct a topological distance matrix that quantifies the degree of node connectivity. By amplifying topological distances for links including PRVs and pump stations, their effect on clustering results is incorporated. Subsequently, nodes are clustered using the K-means algorithm based on the resulting topology-distance matrix. The proposed TDBC approach is applied to four network cases, and its outcomes are compared with those of two traditional methods. The comparative analysis indicates that the TDBC algorithm achieves precise partitioning results for networks incorporating PRVs or pump stations, while ensuring a harmonious balance between modularity and the uniformity of the partitioning results, even in networks with complex structures and highly interconnected loops.","PeriodicalId":34693,"journal":{"name":"AQUA-Water Infrastructure Ecosystems and Society","volume":null,"pages":null},"PeriodicalIF":2.1000,"publicationDate":"2023-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"AQUA-Water Infrastructure Ecosystems and Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2166/aqua.2023.301","RegionNum":4,"RegionCategory":"环境科学与生态学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, CIVIL","Score":null,"Total":0}
引用次数: 0

Abstract

Abstract Partitioning water distribution networks (WDNs) into district metered areas offers benefits including reduced nonrevenue water and simplified pressure management. However, current research in this field tends to narrowly focus on the topological relationships among nodes, often overlooking the influence of pressure reducing valves (PRVs) and pump stations on clustering results. To address this limitation, this study introduces a topology-distance-based clustering (TDBC) method that enhances the accuracy of partitioning by explicitly considering the impact of PRVs and pump stations. In the TDBC method, the Floyd algorithm is initially employed to construct a topological distance matrix that quantifies the degree of node connectivity. By amplifying topological distances for links including PRVs and pump stations, their effect on clustering results is incorporated. Subsequently, nodes are clustered using the K-means algorithm based on the resulting topology-distance matrix. The proposed TDBC approach is applied to four network cases, and its outcomes are compared with those of two traditional methods. The comparative analysis indicates that the TDBC algorithm achieves precise partitioning results for networks incorporating PRVs or pump stations, while ensuring a harmonious balance between modularity and the uniformity of the partitioning results, even in networks with complex structures and highly interconnected loops.
基于拓扑距离的配水网络划分聚类方法
将配水网络(wdn)划分为区域计量区域可以减少非收入用水和简化压力管理。然而,目前该领域的研究往往局限于节点之间的拓扑关系,往往忽略了减压阀和泵站对聚类结果的影响。为了解决这一限制,本研究引入了一种基于拓扑距离的聚类(TDBC)方法,该方法通过明确考虑prv和泵站的影响来提高分区的准确性。在TDBC方法中,首先采用Floyd算法构造一个量化节点连通性的拓扑距离矩阵。通过放大包括prv和泵站在内的链路的拓扑距离,考虑了它们对聚类结果的影响。随后,基于得到的拓扑距离矩阵,使用K-means算法对节点进行聚类。将提出的TDBC方法应用于四种网络案例,并与两种传统方法的结果进行了比较。对比分析表明,对于包含prv或泵站的网络,TDBC算法可以实现精确的划分结果,同时保证了划分结果的模块化和均匀性之间的和谐平衡,即使在结构复杂、环路高度互联的网络中也是如此。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
4.10
自引率
21.10%
发文量
0
审稿时长
20 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信