Next Article in Journal
A Novel GIS-SWMM-ABM Approach for Flood Risk Assessment in Data-Scarce Urban Drainage Systems
Previous Article in Journal
Occurrence, Fate, and Mass Balance Analysis of Organophosphate Flame Retardants in a Municipal Wastewater Treatment Plant in Hunan Province, China
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Improved DeNSE Methodology for Optimal Sectorization of Water Distribution Networks

1
Department of Hydraulic and Environmental Engineering, Faculty of Civil Engineering, University of Belgrade, Bul. Kralja Aleksandra 73, 11120 Belgrade, Serbia
2
Department of Water Management, Faculty of Civil Engineering and Geosciences, Delft University of Technology (TU Delft), Building 23, Stevinweg 1, 2628 CN Delft, The Netherlands
*
Author to whom correspondence should be addressed.
Water 2024, 16(11), 1463; https://doi.org/10.3390/w16111463
Submission received: 19 April 2024 / Revised: 14 May 2024 / Accepted: 18 May 2024 / Published: 21 May 2024
(This article belongs to the Section Water Resources Management, Policy and Governance)

Abstract

:
Sectorization of a water distribution network (WDN) into district meter areas (DMAs) is considered a key strategy for an efficient management of WDNs. Typically, it involves a two-stage procedure: a clustering stage, in which the division of the WDN into clusters is performed, and a dividing stage, which involves the placement of valves and flow meters on the cluster’s boundary pipes to define the DMAs. While recently published methods attempt to enhance both the clustering and dividing stages, they fail to provide decision-making flexibility. They also neglect to consider the presence of existing valves in the WDN, which can significantly affect the evaluated implementation cost, often considered the primary decision-driving factor. This paper presents improvements to the previously introduced DeNSE method for sectorization of WDNs, aiming to address these deficiencies. The methodology consists of a clustering stage, based on the network uniformity index, and a dividing stage, in which the originally used heuristic procedure is replaced with Genetic Algorithm (GA) optimization, minimizing implementation cost. Consideration of existing valves in WDN and criteria for water supply security are also included in the dividing stage to offer a better estimate of implementation costs and post-sectorized operational efficiency of the WDN. Finally, GIS visualization is implemented, and a hydraulic model of the sectorized WDN (EPANET file) is generated, providing practitioners with valuable insights and decision-making flexibility. The methodology is tested on a part of the Amsterdam WDN in the Netherlands, serving as a pilot for methodology evaluation. A range of feasible sectorization solutions is generated and compared based on implementation cost and three performance indicators (PIs). The paper provides an in-depth discussion on the selection of preferable sectorization solution. The reported results demonstrate the method’s efficiency in optimizing sectorization solutions with minimum implementation cost whilst preserving the WDN operational efficiency and meeting the local design criteria.

Graphical Abstract

1. Introduction

Sectorization of a water distribution network (WDN) into district meter areas (DMAs) is proven to be a key strategy for an efficient management of WDNs. The concept, introduced in the late 1980s in the United Kingdom, allows for (1) simplified leak and water-loss detection, (2) more efficient management of network pressure, (3) better control of flows to improve water balance, and (4) more efficient control of contaminant spread [1]. A DMA is a distinct hydraulic area of the WDN, separated from the rest of the supply system by isolation valves and one or more metered inlets and outlets [2]. Changes introduced in the network topology by partitioning the WDN can yield a range of drawbacks regarding reliability of the water supply and water quality. The closure of pipes reduces pipe redundancy in the network, which negatively impacts network resilience, and the reduction of available flow-paths could negatively impact water quality [3]. However, most researchers agree that the benefits gained with WDN sectorization outweigh the associated potential drawbacks [1].
The complexity of the WDN implies that redesigning to include the DMAs will pose a challenging task. Historically, sectorization of the WDN into DMAs has been governed by general criteria of manageable-sized DMAs in terms of number of connections, links, or network length. This set of criteria is provided by a series of guidelines offered by the literature and different regulatory authorities [4,5,6,7]. Sectorization solutions are commonly derived through a “trial and error” approach carried out by a local expert knowledgeable about the specifics of the water distribution network. This approach is illustrated in Grayman et al. [8], where two large case study networks underwent a redesign to incorporate DMA designs as per guidelines outlined in Baker [9]. The need for the analysis of alternative sectorization solutions, in order to reduce subjectivity in the sectorization process, was recognized early [10]. Today, many algorithms for automated sectorization of WDNs are available that consider different sets of sectorization constraints and objectives.
Sectorization is usually carried out as a two-stage procedure, as presented by most authors in the literature [1,11,12,13]: (1) the clustering stage and (2) the dividing stage. The clustering stage includes the division of the WDN into clusters based on the network topology, minimizing the number of connecting links. The dividing stage involves the placement of valves and flow meters on the cluster’s boundary pipes to define the DMAs.
Different methods for the clustering procedure are recognized in the literature: (1) graph theory algorithms [10,13,14,15,16,17], (2) modularity metrics [12,18,19,20,21], (3) community structure metrics [11,18,22,23,24,25], (4) multilevel partitioning [26,27], and (5) graph spectral technique [11,28,29,30]. Bui et al. [3] gives a comprehensive review of the available clustering methods.
The dividing stage of the sectorization procedure involves optimization of device placement (i.e., valves and flow meters) on the previously identified clusters’ boundary links. Required sectorization interventions must not worsen the operational performance of the WDN and reliability in terms of water supply; hence, many alternatives for the device placement are not feasible. To search for an optimal solution, the sectorization algorithm is usually coupled with some type of optimization method, including (1) single objective optimization, (2) multi-objective optimization, or (3) the iterative approach [3]. Single objective optimization procedures are mostly based on the use of evolutionary genetic algorithms (GAs) or simulated annealing (SA) employed to maximize the selected objective function (OF). The list of OFs reported in the literature is extensive—maximizing available power in the network [25,26,31], maximizing the system resilience as described in Todini [14,24,32,33,34], minimizing the cost of interventions [35,36], etc. Multi-objective optimization is introduced to accommodate additional sectorization goals and compare trade-offs between different criteria. Widely used optimization algorithms in multi-objective analysis are (1) NSGA-II [37,38,39], (2) multi-objective GA [19], and (3) swarm optimization [40,41]. The iterative approach [22,28] is used to reduce the solution search space and consequently the computational expense associated with optimization procedures. It is based on a feasible initial guess used to generate a sequence of feasible solutions.
In recent years, many automated algorithms for WDN partitioning have been introduced, with improvements made in both clustering and dividing stages. Clustering procedures are tailored in various manners to accommodate the specific characteristics of WDNs, while different OFs and heuristic procedures in the dividing stage are explored to enhance the reliability of DMA design. However, scope still exist for further improvement in WDN sectorization procedures, particularly in terms of practical application and usability for practitioners.
Some of the recognized shortcomings include (1) the clustering and dividing stages are mainly unsupervised, i.e., practitioners lack control over the selection of the final solution; (2) limited application to real life examples of WDNs is somewhat lacking, i.e., methodology application is typically illustrated on highly skeletonized networks or benchmarks from the literature [8,15,16,22,23,28,42], which may not reflect varying case-specific local design criteria and raise questions about its application to real life case studies; (3) the evaluated solution cost, usually the main decision-driving factor, does not consider the presence of existing valves in the network, which can skew the solution in the wrong direction.
This paper presents the upgraded DeNSE (Distribution Network SEctorization) sectorization method [42], in which the network clustering is achieved based on the network uniformity index, which drives WDN decomposition into clusters that are not only within predefined size limits but also uniform in size as much as possible. Engineering heuristics were originally used in the dividing stage to place the valves and flow meters on clusters’ boundary links and define DMAs. In the research presented here, several improvements are made to the original DeNSE method: (1) in the clustering stage, the user can opt to use the number of connections or total demand as a measure of a cluster’s size, giving the user more control in this process; (2) pure heuristics are replaced with GA optimization in the dividing stage to determine the position of valves and flow meters and to ensure finding the (sub)optimal sectorization solution within the broader spectrum of feasible sectorization solutions; (3) GIS visualization is implemented to verify the practical feasibility of the solution, addressing the non-measurable factors that influence decision making (e.g., ability to access certain pipes). The novelty reported in this research includes (1) consideration of already existing valves (if available) in the dividing stage, consequently allowing better estimation of implementation costs; (2) incorporation of a criterion for water supply security, expressed as a required number of direct feed lines to DMA in respect to its size.
The methodology is tested on a part of the Amsterdam WDN with 45,000 connections, operated by the Waternet public utility company, serving as a pilot for methodology evaluation. The minimum investment for field implementation while simultaneously maintaining the same level of the WDN’s operational efficiency are adopted as the sectorization’s main design criteria. Additional local design criteria, addressing the security of the water supply specific for the Amsterdam WDN, have also been included. Three performance indicators (PIs), related to pressure, resilience, and water age, are adopted to measure the post-sectorization state of the WDN and validate preservation of its operational efficiency. The generated range of feasible sectorization solutions and implemented GIS visualization give decision makers the flexibility in selecting the preferable solution, which is illustrated and supported by the results presented in the paper.

2. Methodology

2.1. Overview

The DeNSE method used in this research is based on the Graph Theory for identification of Strong Connected Components (SCCs) and their aggregation into clusters based on the network uniformity index [43]. The originally presented method [42] is significantly improved in this research, particularly in the network dividing stage procedure and practical usability for practitioners. These improvements include (1) the ability to estimate implementation costs more accurately, (2) the addition of a criterion for ensuring the security of the water supply, and (3) the integration of GIS visualization, enabling better-informed decision making.
The method runs through 3 stages to identify the desired number of feasible sectorization solutions, as shown in Figure 1. The first stage is a pre-processing stage in which all the relevant network data are obtained from the WDN model and prepared for the following run of the network clustering algorithm. WDN clustering is done in the second stage, based on the uniformity index (U), which will yield a number of clustering solutions with different values of the network uniformity index. At this point, the following user input is required: (a) selection of the preferable clustering solution (e.g., the one with the highest value of uniformity index—UMAX) and (b) the number of desired alternate solutions (N) for positioning of flow meters and valves on the clusters’ boundary links. In the third stage, the selected clustering solution is subjected to the Genetic Algorithm (GA)-based optimization procedure, employed to divide the WDN, i.e., to determine the (sub)optimal positioning of the valves and flow meters on the clusters’ boundary links. An integral part of the third stage is the extended period of hydraulic analysis of the obtained solutions and evaluation of the performance indicators (PIs) adopted for measuring the post-sectorization state of the WDN, determining the quality of the solution. Bearing in mind that the GA optimization is a stochastic procedure, it is advisable to run the GA multiple times, as each run (stage 3) will yield a different positioning of flow meters and valves on clusters’ boundary links, thus giving a different connectivity of DMAs and implementation cost. Therefore, the number of runs of the third stage is equal to the desired number of optimized solutions to be compared (N). Ultimately, the user can rank and compare the optimized solutions based on calculated values of PIs and various output data (e.g., connectivity plots, pressure plots, GIS visualization, etc.), enabling a more informed selection of the preferable feasible solution.
It should be emphasized that the user is not constrained to the selection of only one clustering solution from stage 2 to be subjected to optimization in stage 3. In other words, multiple clustering solutions can be optimized in stage 3 to yield the desired number of feasible solutions for comparison.
Each of the three stages will be explained in more detail in the following sections. For a full description of the methodology and mathematical background the reader is referred to the relevant publications [42,43].

2.2. Input Data

The DeNSE sectorization method requires the following input data:
  • A calibrated WDN network model in the form of an EPANET input file, containing all relevant data (topology, hydraulic characteristics, demand data, etc.).
  • The minimum ( n c min ) and maximum ( n c max ) number of property connections per DMA, along with the total number of connections in the network (nc), if the number of connections per node is not available within the network model (which is usually the case). Available guidelines for DMA definition typically suggest that the number of connections should be in the range of 500–5000 [6,7].
  • The transmission main threshold diameter (DMAIN). Pipes with a diameter above this value serve as the main supply paths in the network, and they are excluded from any interventions in this method. The transmission main could also be selected manually.
  • The minimum required and maximum allowed pressures in the network, denoted as pMIN and pMAX.
  • The minimum required number of direct feed lines, (fREQ), to the DMA, reflecting security of water supply, defined according to the number of connections in the zone.
  • The unit cost of devices to be installed in order to divide the network (flow meters and isolation valves). If not supplied by the user, default unit cost functions are taken from [37].
  • The desired number of alternate solutions for the definition of DMAs (N). This number is the number of runs of the optimization algorithm (stage 3). Each run will yield a different optimized solution, characterized by a different number of valves and flow meters as well as their different positioning. Thus, the cost and other indicators will vary between solutions. It is generally recommended to have at least 10 solutions for a representative multi-criteria ranking, although users can opt for a larger set of solutions for comparison.
It should be noted that the preferable DMA size (2), transmission main threshold diameter (3), and the required number of direct feed lines (5) are network specific, influenced by many factors and often defined by the local act of the utility company managing the WDN. Therefore, these input data should be determined based on a thorough analysis of the specific data relevant to the network under consideration.

2.3. Pre-Processing

The pre-processing stage (stage 1) has two phases:
  • In the first phase, transmission mains are defined, based on the DMAIN value, and excluded from the sectorization process. For this purpose, the network is explored using a slightly modified Breadth First Search (BFS) algorithm [44], simultaneously starting from all main source nodes (reservoirs). The BFS algorithm is modified to prioritize propagation through the links with diameters equal to or greater than DMAIN.
  • In the second phase, a 24 h Maximum Day Demand (MDD) hydraulic simulation of the analyzed WDN is performed to determine the orientation of pipes (based on water flow directions obtained in the simulation). As a result, a directional graph (DIGRAPH) is defined. Network links with changing flow directions are identified as non-oriented (or links that can have both flow directions).

2.4. Network Clustering

In the second stage of the DeNSE method, partitioning of the WDN into clusters is performed. This is done in three phases, which are outlined here but not described in detail. For a full description, please refer to [42,43]. These phases are as follows:
  • The first phase is the identification of Strongly Connected Components (SCCs) [45] within the directed graph DIGRAPH, created previously in the pre-processing stage (stage 1). An SCC is a directed cyclic component in which flow direction within that component can reverse [46]. Therefore, SCCs are parts of the network where water is circulating during the simulation [47]. The resulting graph, made of SCCs connected to the transmission main (Figure 2a), is called DAG—Directed Acyclic Graph.
  • The second phase is the topological sorting of the DAG identified in the previous phase. DAG nodes, represented with SCCs, are sorted from the downstream end, and this order will be used to drive aggregation of the DAG from the most peripheral SCCs.
  • The third phase is the aggregation of the sorted DAG into clusters, composed of the SCCs connected between each other and connected to the transmission main. Aggregation is conducted based on the network uniformity index (U) [42], defined as follows:
    U = u n e t × u v × w a g g
    where unet is the network uniformity in terms of cluster size, uv is the uniformity of the cluster’s size vector, and wagg is the relative weight of aggregated links.
Each cluster is characterized by its size (Si), which can be either the total demand within the cluster ( S i = j = 1 N n i q j ) or the total number of connections within the cluster ( S i = j = 1 N n i n c o n n j ), where N n i is the number of nodes in i-th cluster, qj is nodal demand, and n c o n n j is the number of connections in j-th node. In the input data, the user specifies which characteristic will be used for measuring the size of the cluster. If the number of connections for each node in the mathematic model is available, this should be used; otherwise, the total demand should be used. Network uniformity (unet) measures the average deviation of cluster size from the preferred DMA size (Spref), calculated as the average of minimum and maximum cluster size (Spref = 0.5(Smin + Smax)). The maximum value of unet is 1 if all clusters have a size equal to Spref and in the range of [0, 1) otherwise. Maximizing the value of unet implies sizing the clusters in the range of Smin—Smax and as close to Spref as possible. The normalized cluster’s size vector is S n = S 1 n ,   S 2 n ,   S 3 n ,   , where S i n = S i i = 1 N c l S i and Ncl is the number of clusters. Uniformity of this vector (uv) is calculated as its Euclidian norm, and its maximum value is 1 if all clusters have a size equal to Spref and in the range of [0, 1) otherwise. Maximizing the value of uv implies equal/uniform sizing of the clusters. The relative weight of aggregated links is calculated as the ratio of aggregated links’ weight and the total weight of links in the network, with the diameter being used as the link’s weight. The minimum value of wagg is 0 if no aggregation is performed and 1 if all SCCs are aggregated into one cluster.
Aggregation of SCCs into clusters, based on the uniformity index metrics described above, is conducted in a step-by-step manner, propagating upstream through the topologically sorted DAG made of SCCs and aggregating in each step the SCCs whose aggregation will contribute the most to the network uniformity (ΔUMAX). All three measures contained in equation (1), which defines the network uniformity index, take values in the range from 0 to 1; hence, the uniformity index (U) also takes a value in the same range. A higher value of the network uniformity index indicates that better uniformity is achieved. Figure 2b shows the evolution of the network uniformity index through the aggregation process of the simple schematic example. The uniformity index (U) is plotted against the number of clusters corresponding to each aggregation step. The highest uniformity index value (UMAX) corresponds to the network sectorization into 3 clusters in this case. In the next aggregation step, there is no positive gain to network uniformity (ΔUMAX < 0), meaning that a sub-optimal aggregation solution is reached in the previous step. The aggregation procedure will continue until no further aggregation is possible. Clusters 1 and 3 are aggregated next, yielding a sectorization solution with 2 clusters, having a slightly lower uniformity value (Figure 2b). Finally, all SCCs will be aggregated into one cluster connected to the transmission main, and the network uniformity index will drop to zero.

2.5. Network Division

After the second stage (i.e., network clustering), the user is required to select the preferred clustering solution that will be optimized and analyzed further. After the selection of the solution, stage 3 is evoked. To divide the WDN (i.e., convert clusters into DMAs), flow meters and isolation valves must be positioned on clusters’ boundary edges. This is achieved by using the optimization procedure based on the Genetic Algorithm (GA), aided with engineering heuristics to narrow the solution search space, as explained below.
Following the simple example from Figure 2, in Figure 3, the cluster’s boundary edges are labelled as L1 through L8. Flow orientations during the 24 h MDD hydraulic simulation, obtained in Phase 1 of Stage 1, are indicated with arrows. Link L2 is a single pipe with a changing flow direction, i.e., a non-oriented pipe. Non-oriented pipes are only those connecting clusters with the transmission main, as identified clusters resulting from the DAG analysis.
It is clear from Figure 3 that there are 8 links in total that should be equipped either with valves or with flow meters in order to fully define the DMAs. Prior to GA optimization itself, a two-step engineering heuristic procedure is employed in the DeNSE method to reduce the number of pipes whose status should be determined (i.e., open meter or closed valve):
  • Non-oriented pipes are identified, and all such pipes in which the absolute difference between the maximum and minimum flow rate is less than 0.2 L/s are marked for closure, which is considered as a negligible flow rate (let us assume that the only non-oriented link in example L2 does not satisfy this condition).
  • Boundary pipes that always return water from the clusters to the transmission main are closed. These pipes are not on the supply paths and, as such, can be considered redundant and closed without an effect on the system’s reliability (in this example, in Figure 3, there is one such pipe—L8).
After applying this two-step heuristic procedure, the number of pipes whose status should be determined in the GA optimization algorithm is reduced from 8 to 6. This reduction in search space is even more emphasized in real-sized networks, where there are several tens or hundreds of boundary pipes, and this heuristic procedure can result in significantly lower computational times.
In the GA, solutions are coded into chromosomes represented with a string of bits (Figure 3), with each representing a single gene. A string of 1 bit is sufficient for representation of each gene, as there are only two possibilities for the status of the pipe (e.g., 1—closed or 0—opened). Parameters that must be defined for the application of GA optimization are population size (ps); crossover probability—usually 0.8–0.9; mutation probability—usually <0.05; and number of generations to evolve (ng). The efficiency of GA will depend on the adopted values for the previously listed parameters. These values are case specific, since different OFs will require different sets of values for parameters to achieve the same efficiency.
The objective function for the proposed implementation of the GA considers only the economical aspect—the solution’s cost. The informal definition of GA could be that it is an optimization method that searches for an optimum solution in discrete multidimensional space without constraints. However, the network sectorization problem is constrained with the request that any implemented interventions do not endanger the network’s operating reliability, providing feasible a sectorization solution. In the DeNSE methodology, feasibility of the solution is imposed through several penalty functions used within the OF, penalizing each solution with a proportional penalty value (CiPi), with Ci being the penalty unit cost and Pi the proportional penalty amount:
OF = Cost + i = 1 4 C i P i
Penalty types, their unit cost (Ci), and calculation of the proportional penalty amount (Pi) are summarized in Table 1:

2.6. Sectorization Performance Indicators

After the network dividing stage (third stage), the solutions have been optimized and the user can analyze and investigate all of the desired N solutions and decide which is the preferred one. The decision should be made based on the solution’s cost and the following three performance indicators (PIs) for ranking of the solutions, which measure the effects of interventions made in the network to define the DMAs:
  • Cost (EUR)—Cost of the solution is calculated based on the unit cost of devices installed to create the DMAs (flow meters and isolation valves), supplied by the user as an input data.
  • ΔpAV (%)—Relative change in the average network pressure caused by the interventions, calculated as follows:
    Δ p A V = i = 1 n j t = 1 24 p i t p i t i = 1 n j t = 1 24 p i t × 100   [ % ]
    where p i t is the pressure in the i-th node at time t in the original network, and p i t is the pressure in that same node at the same time, but in the network with implemented interventions.
  • ΔRes (%)—Relative change in the average network resilience index [32] after the sectorization compared to the network’s original layout. The resilience index is calculated as a mean value over the simulation period (T) and is represented as the ratio of the residual amount of power in the network after the satisfaction of nodal demands and the maximum amount of power that can be dissipated in the network internally, while satisfying the nodal demands and minimal pressure constraints:
    Res = m e a n T i = 1 n j q i h i h i j = 1 n r Q j H j + k = 1 n p P k γ + l = 1 n t Q l H l i = 1 n j q i h i
    where nj is the number of junctions, nr is the number of reservoirs, np is the number of pumps, nt is the number of tanks, qi is the nodal demand at node i, hi is the nodal head at node i, hi* is the minimum nodal head at node i, Qj is the discharge from the reservoir j, Hj is the head in reservoir j, Pk is the amount of power introduced in the network by pump k, γ is the specific weight of the water, Ql is the demand of tank l, and Hl is the head in tank l.
  • ΔWA (%)—Relative change in the average water age in the network after the sectorization compared to the network’s original layout. Water age is defined as the time spent by a parcel of water in the network, providing a simple measure of the overall quality of the delivered drinking water [48]. Water age (WA) is calculated over the last 24 h of the extended period simulation, as follows:
    W A = i = 1 n j t = T 24 T W A i t 24 n j
    where WAit is the result of the EPANET simulation and presents the water age in junction i at time t.
In addition to the cost and above-listed PIs, other parameters characterizing solutions should also be considered, such as the connectivity between the clusters, the number of flow meters and valves, and the location of the existing valves intended for closure, as the methodology considers already existing valves in the network. These additional parameters are automatically generated in tabular and graphical form at the end of the optimization procedure (see Section 3.3), providing the user with flexibility in selection of the preferable solution.

2.7. Visualization

After the user selects the preferable solution, a set of graphical and tabular results are generated, detailing the characteristics of the adopted solution (see Section 3.4). The following output files are produced at the end:
  • Four Google Earth files (.kml files) showing the whole network and the position of flow meters and valves. These files are convenient, as the network is displayed against a satellite background and georeferenced.
  • An EPANET file (.inp file) in which all required interventions are implemented (i.e., all pipes that should be equipped with valves are closed in this model). This enables the user to produce additional results independently and further investigate the hydraulic model of the solution.

2.8. Implementation

The implementation of the improved DeNSE methodology is carried out in a Matlab programming environment [49], serving as the central processor, with some parts of the methodology developed in different programing environments for computational efficiency. The 2nd Stage of the algorithm (Network clustering algorithm) is written in C++ programing language to ensure high computational efficiency. It is compiled as a dynamic link library (DLL) that can be used externally to perform clustering. For hydraulic simulations (in stages 1 and 3), EPANET 2 DLL is used [50], as it is a reference hydraulic solver and can be easily invoked from Matlab.

3. Results and Discussion

3.1. Case Study

The DeNSE sectorization method, in the form presented in this paper, resulted from the research conducted as part of the Horizon 2020 research project No. 778136, named “Wat-Qual”. Research was conducted in cooperation with Waternet—the public utility company operating the water distribution network of the city of Amsterdam. Waternet personnel provided the necessary data for the development and testing of the proposed methodology on a real-sized WDN. This paper presents the results obtained for the Amstelveen WDN, which is a suburban part of the Amsterdam metropolitan area (Figure 4). The Amstelveen part of the network was chosen as it can be easily hydraulically isolated from the rest of the Amsterdam WDN and, with roughly 45,000 connections, is large enough to allow the proper evaluation of the methodology. This network could serve as an example for potential sectorization of other parts of Amsterdam’s WDN. The characteristics of Amstelveen WDN are as follows: number of links—N_l = 12,479; number of nodes—N_n = 11,729; number of demand nodes—N_dn = 5510; number of reservoirs—N_r = 4 (not real, but established as source nodes on locations where the network connects to the rest of the WDN); number of tanks—N_t = 0; number of pumps—N_p = 0; number of valves—N_v = 2144; number of connections—N_c = 44,429; total average demand in the network—Q = 521.3 m3/h. The peak demand hour is 8:00 a.m., with the demand of 1008.0 m3/h, with another peak from 7:00 to 8:00 p.m., with the demand of 720.0 m3/h. The minimum demand hours are from 1:00 to 6:00 a.m., with the demand of 273.6 m3/h.
The input data used for the sectorization of Amstelveen network are supplied by the Waternet company. The data are primarily adopted through interpretation of the local act document “Design Criteria for Drinking Water Distribution Networks” [51], containing the local design criteria. The estimated total number of connections in the network is nc = 44,429, calculated based on the average lot occupation of 2.1 person/connection, water use per person of 134 L/person/day (adopted from [51]), and nodal demands taken from the mathematical model. The input data includes the following:
  • The calibrated WDN network model in the form of the EPANET input file.
  • The minimum ( n c min ) and maximum ( n c max ) number of property connections per DMA are set equal to n c min   = 2500 and n c max   = 8000. These slightly differ from the general recommendations about the size of DMAs provided in guidelines [6,7]. This is because of the size of the Amstelveen network. It is more appropriate that sectorization of such networks is done in phases. First, coarse sectorization should be implemented, and after that each large DMA, the network should be sectorized further. Given the adopted values for n c min and n c max , the preferred size of a DMA is n c pref = 5250 connections, which is adopted as an upper boundary for a DMA in many guidelines. Given the total number of connections in the Amstelveen network, it Is expected that the optimal sectorization derived with the DeNSE method will have 7 to 9 DMAs.
  • The Transmission main threshold diameter used in preprocessing to identify the main pipeline is DMAIN = 250 mm.
  • The adopted minimum required and maximum allowed pressures in the network are pMIN = 1.8 bar and pMAX = 6.0 bar. Local network design criteria define the minimum pressure to be at least 2.0 bar; however, in the case of the Amstelveen network, the absolute minimum pressure in the original network layout, which occurs during the 24 h simulation, is 20.15 m. Because this is very close to the 2.0 bar constraint, it was decided to slightly relax the minimum pressure constraint and adopt a 1.8 bar value instead. This is still well above the legal minimum of 1.5 bar, as mentioned in [51].
  • The minimum required number of direct feed lines (fREQ) to an area (DMA) is adopted from the local act document [51] according to Table 2, defining the requests in normal operating conditions:
    Table 2. Required number of feeds for an area to secure water supply.
    Table 2. Required number of feeds for an area to secure water supply.
    Number of Delivery PointsfREQ
    Up to 200 connections1 feed
    200 to 2000 connections2 feeds
    More than 2000 connections3 feeds
  • The local unit cost of the equipment (i.e., valves and flow meters) is supplied directly by the Waternet asset management department. Prices include all-in installation (i.e., includes purchase, transport, and labor costs). Prices are given in Table 3:
    Table 3. Installation prices for valves and flow meters.
    Table 3. Installation prices for valves and flow meters.
    Diameter (mm)Valve Placement Cost
    (All-In)
    Flow Meter Placement Cost (All-In)
    75EUR 1575EUR 2093
    90EUR 1575EUR 2421
    100EUR 2260EUR 2690
    110EUR 1785EUR 3412
    150EUR 2850EUR 3587
    160EUR 2124EUR 3635
    200EUR 3119EUR 4200
    315EUR 3975EUR 6899
    400EUR 4335EUR 8761
  • The desired number of alternate solutions for the definition of DMAs, which will be ranked and analyzed, is N = 10.
  • The parameters used in GA optimization are the number of generations ng = 35 and population size ps = 30.

3.2. Network Clustering Results

Table 4 shows the evolution of the network uniformity index (U) and its three components (unet, uv and wagg) during the last 15 steps of the aggregation procedure. Additionally, this table shows the following characteristics for each sectorization solution: number of clusters (n_cl), number of connecting links (n_c_links), number of clusters smaller than n c min (NS), and number of clusters larger than n c max (NL). The maximum uniformity index value of UMAX = 0.7818 is reached for the clustering solution with eight (8) clusters. Clustering solutions corresponding to one aggregation step before (with 9 clusters) and one aggregation step after (with 7 clusters) have a similar network uniformity index value. Therefore, they can also be considered as candidates for the optimization procedure in the following step. Table 4 is automatically generated after the clustering procedure is finished, and the user can generate a network plot for any desired clustering solution.
The solution with seven clusters shown in Figure 5 is selected as the preferable clustering solution in this case, as it completely satisfies the predefined sizing range ( n c min n c max ). Although the network uniformity index value is slightly lower than UMAX, the value of uv, measuring the uniformity of the DMAs’ size vector, is the highest. There are 107 connecting links in total subjected to the GA optimization procedure in the following step to determine the positions of flow meters and valves and define the DMAs.

3.3. Network Division

To divide the WDN, i.e., place devices on clusters’ boundary edges, the optimization procedure was run 10 times on the selected clustering solution with seven clusters. Ten (10) alternate dispositions of flow meters and valves are obtained. Figure 6 and Figure 7 show the values of cost and the three adopted PIs for ranking of the optimized solutions with the implemented interventions in the network: (1) Cost, (2) relative change of average network pressure (ΔpAV), (3) change of resilience index (ΔRes), and (4) change of water age (ΔWA). Values are given relative to the original network layout without interventions, and rankings are shown with numbers at the bottom of the bar graph, where appropriate (i.e., 1—best, 10—worst). Additionally, Table 5 shows the absolute values of the adopted PIs together with (1) the absolute minimum pressure ( p A B S M I N ) occurring in demand nodes, (2) the total number of flow meters to be installed (NFM), (3) the number of new valves to be installed (NNV), and (4) the number of existing valves to be closed (NEV), if possible. A comparison of PIs (Figure 6), the characteristics of optimized solutions (Table 5), and DMAs’ schematic connectivity plots for each optimized solution (Figure 8) are automatically generated and displayed after the optimization procedure, to assist the user in the selection process.
The least expensive solution is SOL-2 (Table 5, Figure 6), with solutions SOL-9, SOL-4, and SOL-6 having comparable prices while being slightly more expensive (by up to 2.58%). The remaining solutions are noticeably more expensive than SOL-2. These differences are due to the number of expensive flow meters that must be installed, i.e., the more expensive solutions have more pipes equipped with these. The positive effect of using existing valves on cost estimation (implemented in this methodology) is highlighted here, as for all solutions, the number of existing valves is significantly higher than the number of new valves.
Based on the relative change of average network pressure (Figure 6, ΔpAV), it is concluded that the network pressure distribution due to sectorization is not significantly affected by any solution. The minimum impact on pressure distribution is solution SOL-10, in which the average pressure is reduced by 0.24 m (−0.85%). The greatest reduction of average pressure occurs in solution SOL-8, where pressure is reduced by 0.55 m (−1.93%). These reductions are considered negligible, and all solutions are feasible from this point of view.
The relative change of resilience index (ΔRes), compared to the original network layout, also reflects the negligible changes in pressure distribution in the network (Figure 7). The resilience index value decreased the most in solution SOL-1, by 2.39%. An increase in resilience index occurs in solutions SOL-2 and SOL-9, in which it is increased by 0.75%.
Water age, compared to the original layout of the network (ΔWA), is expectedly increased with the implemented network interventions—from 6.85% for solution SOL-10 up to 10.97% for solution SOL-4 (Figure 6). These percentages may seem high at first, but the absolute values of WA, given in Table 5, indicate that an increase in WA in the range of 1.40–2.25 h can be considered insignificant.
Comparison of the absolute minimum pressures ( p A B S M I N ) in the demand nodes before and after sectorization shows that minimum pressures for all solutions are slightly decreased (Table 5). The lowest decrease of 0.01 m (0.05%) occurs in SOL-5, and the minimum pressure is decreased the most in solution SOL-8, by 1.49 m (7.39%). The minimum pressure for all solutions is still above the allowed minimum pressure used as input data, set to 18 m (1.8 bar).
Based on the presented results, it can be concluded that all sectorization solutions are hydraulically feasible and minimally affect the original state of the network, as expressed through small changes in the three PIs measuring the network’s operational efficiency (ΔpAV, ΔRes and ΔWA). This leaves the cost of the solution as the main driving factor in the selection of the preferred sectorization solution. In addition to cost, the DMAs’ schematic connectivity plots for each optimized solution could be investigated to make a better-informed decision. The connectivity plot for the least expensive solution, SOL-2, is shown in Figure 8, in which DMAs are represented as the points of different colors connected to the main pipeline and between each other. Blue links with arrows indicate the feed lines, while red links are links in which water flows in both directions during the simulation. The thickness of the lines corresponds to their diameter, while diameters are also indicated in the middle of each link. All DMAs satisfy the requirement for the number of feeds, i.e., the achieved number of feeds is equal to or larger than the requirement, with most of them supplying water directly from the main distribution pipeline. Furthermore, an investigation of connectivity plots for other solutions reveals that all of them satisfy the feed requirement, but this is not reported here.
To gain full insight into DMA connectivity and layout, both connectivity plots (Figure 8) and network plots, with the exact positions of flow meters and valves (Figure 9), should be investigated. In Figure 9, flow meters are shown as (1) flow meters on direct feeds (marked with dark blue square markers)—i.e., flow meters on pipes where water does not change its flow direction during simulation—and (2) flow meters on other pipes (marked with light blue square markers)—i.e., flow meters on pipes that do change flow direction. Two types of valves are marked as (1) existing valves (marked with yellow triangle markers), i.e., a valve already exists on the pipe marked for closure, so there is no need to install a new one, and (2) new valves to be installed (marked with red triangle markers).
After investigating these plots for all solutions, solution SOL-2 is selected as the preferable one in this case, as it has the best perceived DMA connectivity, based on discussion with experts familiar with all network specifics, and, coincidentally, is the least expensive.

3.4. Discussion on Seleected Solution

After the adoption of the sectorization solution SOL-2 as the preferred one, several graphical and tabular outputs are automatically generated, showing detailed results for each DMA. For the adopted solution, an EPANET model and several Google Earth files are generated as well.
Figure 10 shows the generated Google Earth plot of the adopted sectorization solution. One kml file is generated for each type of object of interest—(1) DMAs, (2) position of flow meters, (3) position of new valves, and (4) position of existing valves. From the menu on the left window, the user can select which object layer will be displayed. Object IDs displayed in Google Earth files correspond to those in the generated EPANET model. This allows the user to (1) investigate the real spatial positioning of devices and assess the possibility for field implementation and (2) make modifications to the EPANET hydraulic model to further investigate network hydraulics.
Table 6 was automatically generated and shows the following characteristics of DMAs in the adopted sectorization solution SOL-2: (1) number of connections (NCONN); (2) average consumption (Q); (3) total length of pipeline (L); (4) average pressure before sectorization (pAVORIG),( p A V O R I G ); (5) average pressure after sectorization ( p A V S E C T ); (6) number of feed lines (NFEEDS); (7) number of flow meters required for installation to set up DMA (NFM); (8) number of new valves required for installation to set up DMA (NNV); (9) number of existing valves to set up DMA (NEV); (10) cost of setting up each DMA (Cost). The DMAs in Table 6 are sorted according to the recommended implementation phase, which is based on the criterion that in each phase the least expensive DMA is implemented first. The total pricing of setting up DMAs in the whole network for the adopted sectorization solution SOL-2 is EUR 144,307 (see Table 5).
Figure 11 shows a comparison of the average pressure in DMAs during the simulation, before and after sectorization. The pressure is lowered in all DMAs as expected due to the implemented interventions, but the pressure trend remains mainly unchanged. The highest disruptions occur in peak-hour demands, between 6:00 and 8:00 a.m. The least impacted DMA is DMA 2, in which the average pressure at 8:00 a.m. is lowered from 27.35 m to 26.84 m, or by 1.86%. The most impacted DMA is DMA 7 in which the average pressure at 8:00 a.m. is lowered from 27.04 m to 24.52 m, or by 9.32%. In all other DMAs, this reduction is less than 5.0%. Bearing in mind the minimum network pressure from the local guideline document of 20.0 m, it can be concluded that these reductions will not affect the water supply in DMAs. However, if desired, the pressure in the worst-performing DMA, DMA 7, could probably be increased by opening an additional connecting link from the main or omitting one of the new valves.

4. Conclusions

A number of different WDN sectorization methodologies have been presented to date, introducing innovative approaches and improving either the clustering or dividing stage of the sectorization procedure. This paper introduced the upgraded DeNSE method for the sectorization of WDN, highlighting the improvements aimed at addressing the recognized shortcomings of existing methodologies. The following conclusions are drawn:
  • Incorporated improvements such as added criteria for water supply security and consideration of existing valves in the network contribute to a better estimate of the implementation costs and post-sectorized operational efficiency of the WDN.
  • The generated range of feasible sectorization solutions using GA optimization, the implemented GIS visualization, and the generated EPANET model of the sectorized network provide practitioners with valuable insights and flexibility in the decision-making procedure.
  • Tested on a segment of Amsterdam WDN used as a pilot network, the DeNSE method demonstrated efficiency in optimizing sectorization solutions with minimum implementation cost, while preserving the WDN operational efficiency and meeting the local design criteria.
  • The reported results prove that the DeNSE method can be used as a decision support methodology, valuable to practicing engineers dealing with the implementation of sectorization strategies in WDNs.
Despite the upgrades presented in this research, there is still room for methodology improvement. Future work should address the following:
  • Implementation of a pressure-driven approach (PDA) in hydraulic simulations, as pressure deficient conditions in the network cannot be accurately represented with the current implementation of the demand-driven approach (DDA).
  • Introduction of node elevation as a measure of uniformity in the clustering stage, which could be appropriate for WDNs with high variations in terrain elevation.
  • Consideration of dynamic DMAs, self-adapting to abnormal conditions in the network, which could provide better dynamic control of WDNs. The hierarchical characterization of the clustering algorithm implemented in the DeNSE methodology should easily enable this.
  • Investigation of the influence of hydraulic model uncertainties on DMA design.
The case study analyzed in this paper, however, is not influenced by any of the limitations listed above (due to network topology, low level of leakage, and uniform terrain elevation).

Author Contributions

Methodology, Z.V., M.S. and B.B.; software—Z.V. and M.S.; writing—original draft preparation, Z.V.; writing—review and editing, D.I.; supervision—Z.K., M.S. and B.B. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by EXCELLENT SCIENCE—Marie Skłodowska-Curie Actions, grant number 778136. Horizon 2020 Marie Skłodowska-Curie Research and Innovation Staff Exchange project “Wat-Qual”.

Data Availability Statement

The data presented in this study are available on request from the corresponding author. The data are not publicly available because they are water utility’s sensitive data.

Acknowledgments

The authors thank Waternet company personnel, especially Ralf de Groot and Arne Bosch, for providing the case study data and assistance in the realization of research goals.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Saldarriaga, J.; Bohorquez, J.; Celeita, D.; Vega, L.; Paez, D.; Savic, D.; Dandy, G.; Filion, Y.; Grayman, W.; Kapelan, Z. Battle of the Water Networks District Metered Areas. J. Water Resour. Plan. Manag. 2019, 145, 04019002. [Google Scholar] [CrossRef]
  2. Burrows, R.; Crowder, G.; Zhang, J. Utilisation of Network Modelling in the Operational Management of Water Distribution Systems. Urban Water 2000, 2, 83–95. [Google Scholar] [CrossRef]
  3. Bui, X.K.; Marlim, M.S.; Kang, D. Water Network Partitioning into District Metered Areas: A State-of-the-Art Review. Water 2020, 12, 1002. [Google Scholar] [CrossRef]
  4. Leakage Control Policy and Practice; The Water Authorities Association (WAA) and Water Research Centre (WRC): London, UK, 1985.
  5. Butler, D. Leakage Detection and Management; Palmer Environmental Ltd.: Cwambran, UK, 2000. [Google Scholar]
  6. Farley, M. Leakage Management and Control: A Best Practice Training Manual; World Health Organization: Geneva, Switzerland, 2001; pp. 1–169. [Google Scholar]
  7. Morrison, J.; Tooms, S.; Rogers, D. DMA Management Guidance Notes; IWA: London, UK, 2007. [Google Scholar]
  8. Grayman, W.; Murray, R.; Savic, D. Effects of Redesign of Water Systems for Security and Water Quality Factors. In Proceedings of the World Environmental and Water Resources Congress 2009, Kansas City, Missouri, 17–21 May 2009; pp. 504–514. [Google Scholar]
  9. Baker, M. Municipal Water Distribution System Security Study: Recommendations for Science and Technology Investments; U.S. Department of Homeland Security: Washington, DC, USA, 2007. [Google Scholar]
  10. Tzatchkov, V.; Alcocer-Yamanaka, V.; Bourguett Ortíz, V. Graph Theory Based Algorithms for Water Distribution Network Sectorization Projects. In Proceedings of the Water Distribution Systems Analysis Symposium 2006, Cincinnati, OH, USA, 27–30 August 2006; pp. 1–15. [Google Scholar] [CrossRef]
  11. Spizzo, F.; Venaruzzo, G.; Nicolini, M.; Goi, D. Water Distribution Network Partitioning Based on Complex Network Theory: The Udine Case Study. Water 2023, 15, 1621. [Google Scholar] [CrossRef]
  12. Creaco, E.; Giudicianni, C.; Tosco, A. Service Pressure and Energy Consumption Mitigation-Oriented Partitioning of Closed Water Distribution Networks. Water 2023, 15, 3218. [Google Scholar] [CrossRef]
  13. Perelman, L.S.; Allen, M.; Preis, A.; Iqbal, M.; Whittle, A.J. Automated Sub-Zoning of Water Distribution Systems. Environ. Model. Softw. 2015, 65, 1–14. [Google Scholar] [CrossRef]
  14. Alvisi, S.; Franchini, M. A Heuristic Procedure for the Automatic Creation of District Metered Areas in Water Distribution Systems. Urban Water J. 2014, 11, 137–159. [Google Scholar] [CrossRef]
  15. Ferrari, G.; Savic, D.; Becciu, G. A Graph Theoretic Approach and Sound Engineering Principles for Design of District Metered Areas. J. Water Resour. Plan. Manag. 2014, 140, 04014036. [Google Scholar] [CrossRef]
  16. Hajebi, S.; Roshani, E.; Cardozo, N.; Barrett, S.; Clarke, A.; Clarke, S. Water Distribution Network Sectorisation Using Graph Theory and Many-Objective Optimisation. J. Hydroinform. 2016, 18, 77–95. [Google Scholar] [CrossRef]
  17. Scarpa, F.; Lobba, A.; Becciu, G. Elementary DMA Design of Looped Water Distribution Networks with Multiple Sources. J. Water Resour. Plan. Manag. 2016, 142, 04016011. [Google Scholar] [CrossRef]
  18. Ciaponi, C.; Murari, E.; Todeschini, S. Modularity-Based Procedure for Partitioning Water Distribution Systems into Independent Districts. Water Resour. Manag. 2016, 30, 2021–2036. [Google Scholar] [CrossRef]
  19. Giustolisi, O.; Ridolfi, L. New Modularity-Based Approach to Segmentation of Water Distribution Networks. J. Hydraul. Eng. 2014, 140, 04014049. [Google Scholar] [CrossRef]
  20. Laucelli, D.B.; Simone, A.; Berardi, L.; Giustolisi, O. Optimal Design of District Metering Areas. Procedia Eng. 2016, 162, 403–410. [Google Scholar] [CrossRef]
  21. Zhou, H.; Liu, Y.; Yao, H.; Yu, T.; Shao, Y. Comparative Analysis on the DMA Partitioning Methods Whether Trunk Mains Participated. Water 2022, 14, 3876. [Google Scholar] [CrossRef]
  22. Diao, K.; Zhou, Y.; Rauch, W. Automated Creation of District Metered Area Boundaries in Water Distribution Systems. J. Water Resour. Plan. Manag. 2013, 139, 184–190. [Google Scholar] [CrossRef]
  23. Zhang, Q.; Wu, Z.; Zhao, M.; Qi, J. Automatic Partitioning of Water Distribution Networks Using Multiscale Community Detection and Multiobjective Optimization. J. Water Resour. Plan. Manag. 2017, 143, 04017057. [Google Scholar] [CrossRef]
  24. Campbell, E.; Ayala-Cabrera, D.; Izquierdo, J.; Pérez-García, R.; Tavera, M. Water Supply Network Sectorization Based on Social Networks Community Detection Algorithms. Procedia Eng. 2014, 89, 1208–1215. [Google Scholar] [CrossRef]
  25. Di Nardo, A.; Di Natale, M.; Giudicianni, C.; Musmarra, D.; Santonastaso, G.F.; Simone, A. Water Distribution System Clustering and Partitioning Based on Social Network Algorithms. Procedia Eng. 2015, 119, 196–205. [Google Scholar] [CrossRef]
  26. Di Nardo, A.; Di Natale, M.; Santonastaso, G.F.; Venticinque, S. An Automated Tool for Smart Water Network Partitioning. Water Resour. Manag. 2013, 27, 4493–4508. [Google Scholar] [CrossRef]
  27. Alvisi, S. A New Procedure for Optimal Design of District Metered Areas Based on the Multilevel Balancing and Refinement Algorithm. Water Resour. Manag. 2015, 29, 4397–4409. [Google Scholar] [CrossRef]
  28. Liu, J.; Han, R. Spectral Clustering and Multicriteria Decision for Design of District Metered Areas. J. Water Resour. Plan. Manag. 2018, 144, 04018013. [Google Scholar] [CrossRef]
  29. Di Nardo, A.; Di Natale, M.; Giudicianni, C.; Greco, R.; Santonastaso, G.F. Weighted Spectral Clustering for Water Distribution Network Partitioning. Appl. Netw. Sci. 2017, 2, 19. [Google Scholar] [CrossRef] [PubMed]
  30. Di Nardo, A.; Giudicianni, C.; Greco, R.; Santonastaso, G.F. Applications of Graph Spectral Techniques to Water Distribution Network Management. Water 2018, 10, 45. [Google Scholar] [CrossRef]
  31. Di Nardo, A.; Di Natale, M.; Santonastaso, G.; Tzatchkov, V.; Alcocer-Yamanaka, V. Water Network Sectorization Based on Graph Theory and Energy Performance Indices. J. Water Resour. Plan. Manag. 2014, 140, 620–629. [Google Scholar] [CrossRef]
  32. Todini, E. Looped Water Distribution Networks Design Using a Resilience Index Based Heuristic Approach. Urban Water 2000, 2, 115–122. [Google Scholar] [CrossRef]
  33. Giudicianni, C.; Herrera, M.; di Nardo, A.; Adeyeye, K. Automatic Multiscale Approach for Water Networks Partitioning into Dynamic District Metered Areas. Water Resour. Manag. 2020, 34, 835–848. [Google Scholar] [CrossRef]
  34. Creaco, E.; Franchini, M. Low Level Hybrid Procedure for the Multi-Objective Design of Water Distribution Networks. Procedia Eng. 2014, 70, 369–378. [Google Scholar] [CrossRef]
  35. Gomes, R.; Marques, A.S.A.; Sousa, J. District Metered Areas Design Under Different Decision Makers’ Options: Cost Analysis. Water Resour. Manag. 2013, 27, 4527–4543. [Google Scholar] [CrossRef]
  36. Di Nardo, A.; Di Natale, M.; Giudicianni, C.; Santonastaso, G.F.; Tzatchkov, V.; Rodriguez, M. Economic and Energy Criteria for District Meter Areas Design of Water Distribution Networks. Water 2017, 9, 463. [Google Scholar] [CrossRef]
  37. De Paola, F.; Fontana, N.; Galdiero, E.; Giugni, M.; Savic, D.; Sorgenti Degli Uberti, G. Automatic Multi-Objective Sectorization of a Water Distribution Network. Procedia Eng. 2014, 89, 1200–1207. [Google Scholar] [CrossRef]
  38. Hajebi, S.; Temate, S.; Barrett, S.; Clarke, A.; Clarke, S. Water Distribution Network Sectorisation Using Structural Graph Partitioning and Multi-Objective Optimization. Procedia Eng. 2014, 89, 1144–1151. [Google Scholar] [CrossRef]
  39. Zhang, K.; Yan, H.; Zeng, H.; Xin, K.; Tao, T. A Practical Multi-Objective Optimization Sectorization Method for Water Distribution Network. Sci. Total Environ. 2019, 656, 1401–1412. [Google Scholar] [CrossRef] [PubMed]
  40. Gilbert, D.; Abraham, E.; Montalvo, I.; Piller, O. Iterative Multistage Method for a Large Water Network Sectorization into DMAs under Multiple Design Objectives. J. Water Resour. Plan. Manag. 2017, 143, 04017067. [Google Scholar] [CrossRef]
  41. Montalvo, I.; Izquierdo, J.; Pérez-García, R.; Herrera, M. Water Distribution System Computer-Aided Design by Agent Swarm Optimization. Comput. Civ. Infrastruct. Eng. 2014, 29, 433–448. [Google Scholar] [CrossRef]
  42. Vasilic, Z.; Stanic, M.; Kapelan, Z.; Prodanovic, D.; Babic, B. Uniformity and Heuristics-Based DeNSE Method for Sectorization of Water Distribution Networks. J. Water Resour. Plan. Manag. 2020, 146, 04019079. [Google Scholar] [CrossRef]
  43. Vasilic, Z. Decision Support Algorithms for Sectorization of Water Distribution Networks. PhD Thesis, University of Belgrade, Belgrade, Serbia, 2018. [Google Scholar]
  44. Jungnickel, D. Graphs, Networks and Algorithms, 2nd ed.; Bronstein, M., Cohen, A., Cohen, H., Eisenbud, D., Sturmfels, B., Eds.; Springer: Berlin, Germany, 2005; ISBN 3-540-21905-6. [Google Scholar]
  45. Gabow, H.N. Path-Based Depth- Rst Search for Strong and Biconnected Components 1 Introduction 2 Strong Components. Inf. Process. Lett. 2000, 74, 107–114. [Google Scholar] [CrossRef]
  46. Perelman, L.; Ostfeld, A. Water-Distribution Systems Simplifications through Clustering. J. Water Resour. Plan. Manag. 2012, 138, 218–229. [Google Scholar] [CrossRef]
  47. Vasilić, Ž.; Stanić, M.; Prodanović, D.; Kapelan, Z. Network Sectorisation Through Aggregation of Strong Connected Components. In Proceedings of the 18th Conference on Water Distribution System Analysis, WDSA 2016, Cartagena, Columbia, 24–28 July 2016. [Google Scholar]
  48. Rossman, L.A. EPANET 2: Users Manual; National Risk Management Research Laboratory, U.S. Environmental Protection Agency: Cincinnati, OH, USA, 2000; Volume 38, 200p. [Google Scholar] [CrossRef]
  49. The MathWorks, Inc. MATLAB, Version 9.13.0 (R2022b); The MathWorks Inc.: Natick, MA, USA, 2022; Available online: https://www.mathworks.com (accessed on 2 May 2024).
  50. EPANET 2 Programmer’s Toolkit. Available online: https://www.epa.gov/water-research/epanet (accessed on 2 May 2024).
  51. Waternet. Design Criteria for Drinking Water Distribution Networks; Waternet: Amsterdam, The Netherlands, 2017. [Google Scholar]
Figure 1. Flow chart of the DeNSE sectorization method.
Figure 1. Flow chart of the DeNSE sectorization method.
Water 16 01463 g001
Figure 2. (a) Network clustering procedure—identified SCCs and DAG representation of the graph; (b) aggregation of the sorted DAG and evolution of the network uniformity index (U).
Figure 2. (a) Network clustering procedure—identified SCCs and DAG representation of the graph; (b) aggregation of the sorted DAG and evolution of the network uniformity index (U).
Water 16 01463 g002
Figure 3. Heuristically placed valves and pipes subjected to the GA optimization.
Figure 3. Heuristically placed valves and pipes subjected to the GA optimization.
Water 16 01463 g003
Figure 4. Case study network.
Figure 4. Case study network.
Water 16 01463 g004
Figure 5. Clustering solutions corresponding to sectorization into 7 clusters.
Figure 5. Clustering solutions corresponding to sectorization into 7 clusters.
Water 16 01463 g005
Figure 6. Values of ranking indicators for optimized solutions—Cost and ΔpAV.
Figure 6. Values of ranking indicators for optimized solutions—Cost and ΔpAV.
Water 16 01463 g006
Figure 7. Values of ranking indicators for optimized solutions—ΔRes and ΔWA.
Figure 7. Values of ranking indicators for optimized solutions—ΔRes and ΔWA.
Water 16 01463 g007
Figure 8. Schematic plot of DMA connectivity in solution SOL-2.
Figure 8. Schematic plot of DMA connectivity in solution SOL-2.
Water 16 01463 g008
Figure 9. Interventions layout in the network in SOL-2.
Figure 9. Interventions layout in the network in SOL-2.
Water 16 01463 g009
Figure 10. Generated Google Earth files illustrating adopted sectorization solution.
Figure 10. Generated Google Earth files illustrating adopted sectorization solution.
Water 16 01463 g010
Figure 11. Average pressure in DMAs during the 24 h simulation, before and after sectorization.
Figure 11. Average pressure in DMAs during the 24 h simulation, before and after sectorization.
Water 16 01463 g011
Table 1. Penalty functions used within the objective function (OF).
Table 1. Penalty functions used within the objective function (OF).
iType of PenaltyDescriptionCiPi
1Unfeasible solutionIf there are negative pressures in the network or the hydraulic model cannot be solved 107 EURPi = 1
2Number of feed linesDMA must have minimum number of feed lines defined according to the number of connections 5 × 105 EUR P i = n cl + j = 1 n cl ( f j   req   f j )
3Pressure below minimum allowedIf pressure in any node is below the minimum allowed, that solution is penalized proportional to the number of such nodes5 × 104 EURPi = nj
4Lowered pressures in the networkIf average pressures in the network are lowered compared to the original network state, that solution is penalized proportional to that lowering of the pressure1 × 104 EUR/mPi = p av _ min orig p av _ min
Notes: ncl—number of clusters that have lower number of feeds than required; fjreq—requested number of feeds for j-th cluster; fj*—achieved number of feeds for j-th cluster; nj—number of junctions with minimum pressures lower than minimum allowable in the network; p av _ min orig —minimum average pressure during 24 h in the original network; p av _ min —minimum average pressure during 24 h in the network with implemented interventions.
Table 4. Evolution of the network uniformity index (U) during the aggregation process.
Table 4. Evolution of the network uniformity index (U) during the aggregation process.
Agg. Stepn_cln_c_linksu_netu_vw_aggUNLNS
6529171250.46490.93020.97350.421008
6530161240.49200.93830.97370.449507
6531151230.52240.94730.97380.481906
6532141220.55970.95190.97390.518905
6533131210.60280.95330.97400.559704
6534121200.64620.96540.97410.607703
6535111180.70370.96780.97430.663502
6536101170.76070.98200.97440.727801
653791150.80390.98270.97460.769901
653881140.81610.98270.97480.781801
653971070.80650.99140.97550.780000
65406970.69150.96730.97650.653210
65415890.66700.87870.97720.572710
65424850.59050.78750.97760.454610
65433830.60350.58760.97780.346710
Table 5. Characteristics of optimized solutions for definition of DMAs.
Table 5. Characteristics of optimized solutions for definition of DMAs.
Costp_avResWA p A B S M I N NFMNNVNEV
(EUR)(m)(-)(h)(m)(-)(-)(-)
original network/28.270.74520.4920.15///
SOL-1165,87027.980.72722.0919.39371654
SOL-2144,30727.850.74922.3018.98291860
SOL-3153,75727.960.73522.1319.49331757
SOL-4146,03727.750.74522.7318.94321560
SOL-5189,19327.990.74021.9720.14422045
SOL-6148,03327.920.74422.3319.86341459
SOL-7161,16727.890.72922.2718.90381455
SOL-8166,58127.730.73522.4018.66342152
SOL-9145,19627.940.75022.3819.48321758
SOL-10162,29328.030.74521.8919.56361655
Table 6. Characteristics of DMAs in adopted sectorization solution.
Table 6. Characteristics of DMAs in adopted sectorization solution.
Imp. PhaseDMANCONNQL p A V O R I G p A V S E C T NFEEDSNFMNNVNEVCost
(-)(-)(-)(L/s)(km)(m)(m)(-)(-)(-)(-)(EUR)
1DMA 1792225.8554.1627.9527.55440914,444
2DMA 4532217.3329.2428.0527.76352918,496
3DMA 6648621.1445.5229.0428.483551121,766
4DMA 5464715.1124.9228.5828.283351120,941
5DMA 7740024.1355.1928.2227.393381716,252
6DMA 3614020.0349.7427.7827.465631023,078
7DMA 2583519.0031.8928.2428.046941129,330
Σ144,307
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Vasilic, Z.; Babic, B.; Ivetic, D.; Kapelan, Z.; Stanic, M. An Improved DeNSE Methodology for Optimal Sectorization of Water Distribution Networks. Water 2024, 16, 1463. https://doi.org/10.3390/w16111463

AMA Style

Vasilic Z, Babic B, Ivetic D, Kapelan Z, Stanic M. An Improved DeNSE Methodology for Optimal Sectorization of Water Distribution Networks. Water. 2024; 16(11):1463. https://doi.org/10.3390/w16111463

Chicago/Turabian Style

Vasilic, Zeljko, Branislav Babic, Damjan Ivetic, Zoran Kapelan, and Milos Stanic. 2024. "An Improved DeNSE Methodology for Optimal Sectorization of Water Distribution Networks" Water 16, no. 11: 1463. https://doi.org/10.3390/w16111463

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop