Network Sectorisation Through Aggregation of Strong Connected Components

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.