GraFar - Repository of the Faculty of Civil Engineering
Faculty of Civil Engineering of the University of Belgrade
    • English
    • Српски
    • Српски (Serbia)
  • English 
    • English
    • Serbian (Cyrillic)
    • Serbian (Latin)
  • Login
View Item 
  •   GraFar
  • GraFar
  • Катедра за хидротехнику и водно-еколошко инжењерство
  • View Item
  •   GraFar
  • GraFar
  • Катедра за хидротехнику и водно-еколошко инжењерство
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Network Sectorisation Through Aggregation of Strong Connected Components

Thumbnail
2017
865.pdf (851.3Kb)
Authors
Vasilić, Željko
Stanić, Miloš
Prodanović, Dušan
Kapelan, Zoran
Conference object (Published version)
Metadata
Show full item record
Abstract
This paper presents new algorithm for sectorisation of a Water Distribution Network (WDN) named Water Network Sectorisation (WNS) algorithm. Algorithm relies on Graph Theory to search for the Strong Connected Components (SCCs) in the graph, that are later on topologically sorted and aggregated in the sectors. Aggregation is driven by engineering criteria and heuristics such as sectors of approximately equal size with smallest number of links connecting them. Interventions in the network are not implemented in order to avoid negative effects on the networks' hydraulics. This is important especially for primary stages of sectorisation in which preserving hydraulic performance and minimal investment are the main objectives. Methodology is illustrated on a real size WDN. The results obtained show that the WNS algorithm can be used as an effective support tool in engineering practice.
Keywords:
Water Distribution Network / Sectorisation / Decomposition / Graph Theory
Source:
Xviii International Conference On Water Distribution Systems, Wdsa2016, 2017, 186, 244-251
Publisher:
  • Elsevier Ltd
Funding / projects:
  • Urban Drainage Systems as Key Infrastructure in Cities and Towns (RS-37010)

DOI: 10.1016/j.proeng.2017.03.238

ISSN: 1877-7058

WoS: 000416784200031

Scopus: 2-s2.0-85020782859
[ Google Scholar ]
URI
https://grafar.grf.bg.ac.rs/handle/123456789/867
Collections
  • Катедра за геодезију и геоинформатику
  • Катедра за хидротехнику и водно-еколошко инжењерство
Institution/Community
GraFar
TY  - CONF
AU  - Vasilić, Željko
AU  - Stanić, Miloš
AU  - Prodanović, Dušan
AU  - Kapelan, Zoran
PY  - 2017
UR  - https://grafar.grf.bg.ac.rs/handle/123456789/867
AB  - This paper presents new algorithm for sectorisation of a Water Distribution Network (WDN) named Water Network Sectorisation (WNS) algorithm. Algorithm relies on Graph Theory to search for the Strong Connected Components (SCCs) in the graph, that are later on topologically sorted and aggregated in the sectors. Aggregation is driven by engineering criteria and heuristics such as sectors of approximately equal size with smallest number of links connecting them. Interventions in the network are not implemented in order to avoid negative effects on the networks' hydraulics. This is important especially for primary stages of sectorisation in which preserving hydraulic performance and minimal investment are the main objectives. Methodology is illustrated on a real size WDN. The results obtained show that the WNS algorithm can be used as an effective support tool in engineering practice.
PB  - Elsevier Ltd
C3  - Xviii International Conference On Water Distribution Systems, Wdsa2016
T1  - Network Sectorisation Through Aggregation of Strong Connected Components
EP  - 251
SP  - 244
VL  - 186
DO  - 10.1016/j.proeng.2017.03.238
ER  - 
@conference{
author = "Vasilić, Željko and Stanić, Miloš and Prodanović, Dušan and Kapelan, Zoran",
year = "2017",
abstract = "This paper presents new algorithm for sectorisation of a Water Distribution Network (WDN) named Water Network Sectorisation (WNS) algorithm. Algorithm relies on Graph Theory to search for the Strong Connected Components (SCCs) in the graph, that are later on topologically sorted and aggregated in the sectors. Aggregation is driven by engineering criteria and heuristics such as sectors of approximately equal size with smallest number of links connecting them. Interventions in the network are not implemented in order to avoid negative effects on the networks' hydraulics. This is important especially for primary stages of sectorisation in which preserving hydraulic performance and minimal investment are the main objectives. Methodology is illustrated on a real size WDN. The results obtained show that the WNS algorithm can be used as an effective support tool in engineering practice.",
publisher = "Elsevier Ltd",
journal = "Xviii International Conference On Water Distribution Systems, Wdsa2016",
title = "Network Sectorisation Through Aggregation of Strong Connected Components",
pages = "251-244",
volume = "186",
doi = "10.1016/j.proeng.2017.03.238"
}
Vasilić, Ž., Stanić, M., Prodanović, D.,& Kapelan, Z.. (2017). Network Sectorisation Through Aggregation of Strong Connected Components. in Xviii International Conference On Water Distribution Systems, Wdsa2016
Elsevier Ltd., 186, 244-251.
https://doi.org/10.1016/j.proeng.2017.03.238
Vasilić Ž, Stanić M, Prodanović D, Kapelan Z. Network Sectorisation Through Aggregation of Strong Connected Components. in Xviii International Conference On Water Distribution Systems, Wdsa2016. 2017;186:244-251.
doi:10.1016/j.proeng.2017.03.238 .
Vasilić, Željko, Stanić, Miloš, Prodanović, Dušan, Kapelan, Zoran, "Network Sectorisation Through Aggregation of Strong Connected Components" in Xviii International Conference On Water Distribution Systems, Wdsa2016, 186 (2017):244-251,
https://doi.org/10.1016/j.proeng.2017.03.238 . .

DSpace software copyright © 2002-2015  DuraSpace
About the GraFar Repository | Send Feedback

OpenAIRERCUB
 

 

All of DSpaceCommunitiesAuthorsTitlesSubjectsThis institutionAuthorsTitlesSubjects

Statistics

View Usage Statistics

DSpace software copyright © 2002-2015  DuraSpace
About the GraFar Repository | Send Feedback

OpenAIRERCUB