Mehmet Melih Koşucu , Enes Albay , Mehmet Cüneyd Demirel
{"title":"Extending EPANET hydraulic solver capacity with rigid water column global gradient algorithm","authors":"Mehmet Melih Koşucu , Enes Albay , Mehmet Cüneyd Demirel","doi":"10.1016/j.jher.2022.04.002","DOIUrl":null,"url":null,"abstract":"<div><p>EPANET is one of the most commonly used open-source programs in hydraulic modelling water distribution networks (WDNs), based on steady-state and extended period simulation approaches. These approaches effectively estimate flow capacity and average pressures in networks; however, EPANET is not yet fully effective in modelling incompressible unsteady flows in WDNs. In this study, the hydraulic solver capacity of EPANET 3 is extended with the Rigid Water Column Global Gradient Algorithm (RWC-GGA) to model incompressible unsteady flow hydraulics in WDNs. Moreover, we incorporated dynamically more accurate valve expressions than the existing ones in the default EPANET code and introduced a new global convergence algorithm, Convergence Tracking Control Method (CTCM), in the solver code. The RWC-GGA, CTCM, and valve expressions are tested and validated in three different WDNs varying from simple to sophisticated set-ups. The results show that incompressible unsteady flows can be modelled with RWC-CGA and dynamic valve representations. Finally, the convergence problem due to the valve motion and the pressure-dependent algorithm (PDA) is solved by the implemented global convergence algorithm, i.e. CTCM.</p></div>","PeriodicalId":49303,"journal":{"name":"Journal of Hydro-environment Research","volume":"42 ","pages":"Pages 31-43"},"PeriodicalIF":2.4000,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Hydro-environment Research","FirstCategoryId":"93","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1570644322000211","RegionNum":3,"RegionCategory":"环境科学与生态学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, CIVIL","Score":null,"Total":0}
引用次数: 2
Abstract
EPANET is one of the most commonly used open-source programs in hydraulic modelling water distribution networks (WDNs), based on steady-state and extended period simulation approaches. These approaches effectively estimate flow capacity and average pressures in networks; however, EPANET is not yet fully effective in modelling incompressible unsteady flows in WDNs. In this study, the hydraulic solver capacity of EPANET 3 is extended with the Rigid Water Column Global Gradient Algorithm (RWC-GGA) to model incompressible unsteady flow hydraulics in WDNs. Moreover, we incorporated dynamically more accurate valve expressions than the existing ones in the default EPANET code and introduced a new global convergence algorithm, Convergence Tracking Control Method (CTCM), in the solver code. The RWC-GGA, CTCM, and valve expressions are tested and validated in three different WDNs varying from simple to sophisticated set-ups. The results show that incompressible unsteady flows can be modelled with RWC-CGA and dynamic valve representations. Finally, the convergence problem due to the valve motion and the pressure-dependent algorithm (PDA) is solved by the implemented global convergence algorithm, i.e. CTCM.
期刊介绍:
The journal aims to provide an international platform for the dissemination of research and engineering applications related to water and hydraulic problems in the Asia-Pacific region. The journal provides a wide distribution at affordable subscription rate, as well as a rapid reviewing and publication time. The journal particularly encourages papers from young researchers.
Papers that require extensive language editing, qualify for editorial assistance with American Journal Experts, a Language Editing Company that Elsevier recommends. Authors submitting to this journal are entitled to a 10% discount.