Technical note: Graph theory-based heuristics to aid in the implementation of optimized drinking water network sectorization

Q2 Engineering
M. M. Rokstad, Karel A van Laarhoven
{"title":"Technical note: Graph theory-based heuristics to aid in the implementation of optimized drinking water network sectorization","authors":"M. M. Rokstad, Karel A van Laarhoven","doi":"10.5194/dwes-2021-11","DOIUrl":null,"url":null,"abstract":"Abstract. Drinking water distribution networks form an essential part of modern-day critical infrastructure. Sectorizing a network into district metered areas is a key technique for pressure management and water loss reduction. Sectorizing an existing network from scratch is, however, an exceedingly complex design task that designs in a well-studied general mathematical problem. Numerical optimization techniques such as evolutionary algorithms can be used to search for near-optimal solutions to such problems, but doing so within a reasonable timeframe remains an ongoing challenge. In this work, we introduce two heuristic tricks that use information of the network structure and information of the operational requirements of the drinking water distribution network to modify the basic evolutionary algorithm used to solve the general problem. These techniques not only reduce the time required to find good solutions, but also ensure that these solutions better match the requirements of drinking water practice. Both techniques were demonstrated by applying them in the sectorization of the actual distribution network of a large city.\n","PeriodicalId":53581,"journal":{"name":"Drinking Water Engineering and Science","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Drinking Water Engineering and Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5194/dwes-2021-11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

Abstract

Abstract. Drinking water distribution networks form an essential part of modern-day critical infrastructure. Sectorizing a network into district metered areas is a key technique for pressure management and water loss reduction. Sectorizing an existing network from scratch is, however, an exceedingly complex design task that designs in a well-studied general mathematical problem. Numerical optimization techniques such as evolutionary algorithms can be used to search for near-optimal solutions to such problems, but doing so within a reasonable timeframe remains an ongoing challenge. In this work, we introduce two heuristic tricks that use information of the network structure and information of the operational requirements of the drinking water distribution network to modify the basic evolutionary algorithm used to solve the general problem. These techniques not only reduce the time required to find good solutions, but also ensure that these solutions better match the requirements of drinking water practice. Both techniques were demonstrated by applying them in the sectorization of the actual distribution network of a large city.
技术说明:基于图论的启发式方法,以帮助实现优化的饮用水网络分区
摘要饮用水分配网络是现代重要基础设施的重要组成部分。将管网划分为区域计量区是压力管理和减少水损失的关键技术。然而,从零开始对现有网络进行分区是一项极其复杂的设计任务,需要在经过充分研究的一般数学问题中进行设计。进化算法等数值优化技术可以用于搜索此类问题的接近最优解,但在合理的时间内这样做仍然是一个持续的挑战。在这项工作中,我们介绍了两种启发式技巧,即使用网络结构的信息和饮用水分配网络的操作要求的信息来修改用于解决一般问题的基本进化算法。这些技术不仅减少了找到好的解决方案所需的时间,而且确保这些解决方案更好地符合饮用水实践的要求。通过将这两种技术应用于大城市实际配电网的分区,对其进行了验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Drinking Water Engineering and Science
Drinking Water Engineering and Science Environmental Science-Water Science and Technology
CiteScore
3.90
自引率
0.00%
发文量
3
审稿时长
40 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学术官方微信