Although partitioning of water distribution systems (WDSs) into district metered areas (DMAs) is challenging, it can be effectively used for refined management and leakage control. A two-step novel process for DMA partitioning is proposed in this study, i.e. clustering and dividing. The first step is to cluster nodes through an improved METIS graph partitioning method. The second step is to optimize the location of flowmeters and gate valves on boundary pipes by obtaining the feasible solutions. The good solutions that constitute the Pareto front were produced, which could be a tough and time-consuming task. The paper proposes the innovative and efficient dividing phase: (a) selecting the important boundary pipes by hydraulic analysis; (b) using the improved particle swarm optimization algorithm; (c) proposing three objective functions. The proposed method is applied to Modena and EXNET networks to demonstrate its feasibility.

  • The improved METIS algorithm generated DMAs based on the water demand and pipe length.

  • The position of the flowmeter or gate valve in the boundary pipes is optimized through multiple objectives, that is, the minimum number of flowmeters, pressure balance and leakage reduction rate of three aspects.

  • The pressure balance takes into account the node pressure balance in each partition and minimizes the node pressure.

Graphical Abstract

Graphical Abstract

Water distribution systems (WDSs) are an important part of urban infrastructure and indispensable to the stable development of a city. The continuous increase in complexity and scale of WDSs further increases the difficulty of leakage management and control of the pipeline network. The partitioning of the WDS into district metered areas (DMAs) was proposed to control leakage (Burrows et al. 2000) and achieve the purpose of ‘divide and conquer’ effectively. DMA partition management can meet the water demand of users, reduce costs for enterprises, improve economic benefits, and enhance management efficiency (Araujo et al. 2006; Shafiee et al. 2016).

The water supply network can be represented as a simple graph from the perspective of topology and complex network theory, and graph partition algorithms can be used to partition the water supply network in studies on DMA partitioning (Di Nardo & Di Natale 2011; Perelman & Ostfeld 2011; Sela Perelman et al. 2015; Campbell et al. 2016a). The multilevel graph partitioning algorithm is a basic method based on graph theory (Campbell et al. 2016b). A graph partitioning algorithm based on multilevel recursive bisectioning (MLRB) is used to balance the number of users in each DMA partition and minimize the number of DMA partition boundary pipe segments after constructing the topology (Di Nardo et al. 2013, 2015, 2017). The partitioning results of the multilevel graph partitioning algorithm and spectral clustering algorithm are compared (Di Nardo et al. 2018) using an actual pipe network. The SWANP (Smart Water Network Partitioning) software was proposed to achieve automatic network partitioning based on the MLRB graph partitioning algorithm (Di Nardo et al. 2014, 2017, 2020).

Many researchers have recently carried out multi-objective optimization of the water supply network by adding objectives, considering economic factors, hydraulic factors, and other aspects of DMA partition design and operation (Hadka & Reed 2013; Brentan et al. 2017; Di Nardo et al. 2017; Zhang et al. 2017). The genetic algorithm was used to optimize the location of the flowmeter and maximize the total energy of the pipe network (Di Nardo et al. 2014). The simulated annealing algorithm considers scenarios such as future infrastructure with the total investment in the partition (Gomes et al. 2013). In addition, studies have also used iterative methods for the objective optimization of partitions (Giudicianni et al. 2018; Vasilic et al. 2020). Flowmeters have been installed based on the minimum energy dissipation path, and then the number and locations of flowmeters changed alternately to find the best solution (Di Nardo et al. 2020). However, the iterative method does not consider the combined effect of simultaneous closure of multiple pipes compared with the heuristic algorithm. Moreover, the previous studies demonstrated that the increase in the number of boundary pipes led to an explosive growth of the search space. In addition, since the initial solution is random, it is difficult to evolve a feasible solution that satisfies the minimum service head through many iterations. Third, the possibility of installing gate valves or flowmeters is the same for the boundary pipes and the importance of different boundary pipes is not considered in the iterative process, which could cause the poor optimization effect.

A novel two-step optimal method for designing DMAs in WDSs is proposed in this study. The clustering phase is accomplished using an improved METIS graph partition algorithm on the basis of node water demand and pipe length similarity between DMAs. The demand and pipe length are also considered in this study. Second, the dividing phase based on the multi-objective BPSO (Discrete Binary Particle Swarm Optimization algorithm) is put forward from both economic and hydraulic aspects in this work. The paper makes the following contributions to enhance the efficiency of the optimization. The most important pipes among the boundary pipes are selected according to the hydraulic characteristics and the flowmeters are installed on these pipes to reduce the solution vector space dimension of the BPSO. In addition, the improved BPSO is optimized from two aspects: the initial solution and the updated particle position. Specifically, the initial solution generation process is modified. Considering the characteristics of different boundary pipes, the particle position update formula in the iterative process is modified, and the crossover mechanism is introduced to update the particle position again. Two case networks of different scales will allow the demonstration and analysis of the overall DMA design strategy from a hydraulic perspective.

Figure 1 shows the overall process of the proposed method. The following network partition design methods of the water supply network are proposed on the basis of two main stages.
  • (1)

    Clustering phase. This phase primarily divides the large-scale pipe network into several independent partitions with sufficient water supply pressure head. This stage aims to minimize the number of boundary pipes and maximize the distribution balance of hydraulic properties between partitions. The multilevel graph partition algorithm is used in this process to group nodes and determine the boundary pipes.

  • (2)

    Dividing phase. This phase aims to determine the position of flowmeters and closed gate valves in boundary pipes by dividing the topological network of WDSs into partitions. The improved particle swarm algorithm is used to enhance the efficiency in this stage.

Figure 1

Overall methodology of the proposed method.

Figure 1

Overall methodology of the proposed method.

Close modal

Clustering phase

The METIS partitioning method uses a k-way partitioning approach (Karypis & Kumar 1998; Liu et al. 2018) to minimize the number of cuts (i.e., links between two clusters) while balancing the number of nodes belonging to each cluster. If the edges and vertices of the graph are weighted, the goal of the method becomes that of minimizing the sum of the associated weights on the edge cuts and balancing the sum of the node weights. As shown in Figure 2, the multilevel graph partition algorithm includes three stages: coarsening, initial partitioning, and uncoarsening phases.
Figure 2

Three stages of multilevel graph partition algorithm.

Figure 2

Three stages of multilevel graph partition algorithm.

Close modal
The constraint is that the actual unbalance factor is less than or equal to the value of . The number of the boundary pipes is minimized to reduce the cost under the following constraint:
where is the maximum weight among all partitions, and is the weight in the ideal weight of the partition.

Determine hydraulic weights of nodes

Weights of vertices or edges in the graph are very critical in this case because they directly influence the effect of partitioning and constructing pipe network nodes or edge weights suitable for graph segmentation. Particularly, pipe length and node demand are selected as factors for assigning two weights to the nodes. The two weights are the partition basis that affects the partition size and are meaningful for the leakage identification and positioning method based on DMA in the following study. However, pipe length can considerably affect the hydraulic behavior of WDN for a given background leakage (Giustolisi et al. 2008). The hydraulic factors were considered to form a reasonable DMA scheme as follows:
(1)
where E is the set of pipes in the WDS; is the node weight related to the length of the ith pipe; is the total pipe length of all pipes in the WDS; and is the length of the pipe connected between nodes i and j.
(2)
where E is the set of nodes in the WDS; is the number of time steps in the peak water consumption period T, and the length of the time step is 1 h; is the demand of the ith node; is the water demand factor of the tth time step; and T is 8 h in this study, including the two time periods of 6–10 am and 17–21 pm.

Determine evaluation indications

Coefficients of variation of demand (CVD) (Pesantez et al. 2019) and length (CVL) are selected to compare the distribution similarity and pipe length between partitions in scenarios in Equations (4) and (5), respectively:
(4)
(5)
where is the average water demand of DMAs (L/s) and is the average pipe length of DMAs after normalization. The partition scenario is satisfactory when the coefficient of variation is small.

Dividing phase

The bioinspired algorithm can solve the optimization problems and obtain better results in water distribution. At this stage, the paper is based on the classical bionic algorithm BPSO (Kennedy & Eberhart 1997), based on the behavior of a flock of birds to find food. The optimization problem contains binary decision variables by MOBPSO, with one decision variable for each boundary pipe corresponding to the installation location of a flowmeter or a closed gate valve. The following objectives are optimized in this stage from aspects of economic and hydraulic conditions: (1) number of flowmeters, (2) leakage reduction rate, and (3) improved pressure balance. The process of the three-objective dividing phase is presented as follows:

Decision variable

(6)
where X is the vector of the decision variable and N is the number of boundary pipes. Note that = 1 if the ith pipe remains open and a flowmeter is installed in it; otherwise, = 0.

Three objective functions

(7)
(8)
(9)
in objective function is expressed as follows:
(10)
(11)
where is the number of flowmeters; is the leakage amount of node i at the tth time step in the original WDS configuration; is the leakage of node i at the tth time step in the implementation of DMAs; lik is the length of the kth pipe of all pipes connected to node i; α and β are leakage coefficients; is the pressure of node i (m); N is the number of nodes in the WDS; is the number of nodes in the mth partition; T is the time period, T = 24 h; is the node pressure variance of the mth partition at time t; is the number of DMAs; is the pressure of node i at the tth time step; is the average pressure of all nodes at the mth partition at time t; is the minimum service head in the WDS; and is the pressure of node i at the tth time step in the mth partition.

The purchase cost depends on the pipe diameter. The flowmeter quantity minimization does not take into account the purchase cost for two reasons. First, the subsequent management costs are higher than the initial cost (Laucelli et al. 2017). Second, the goal of the quantity minimization drives the search for quantity minimization for flowmeters installed on the pipes with higher flow rate.

Here, the reduction rate of the background leakage in WDS with respect to the original WDS configuration is proposed as the function. The maximization of the background leakage reduction obtained by the positioning of the closed valves is calculated by the extended cycle hydraulic simulation.

The traditional pressure balance within the DMA has been improved by adding the indicator to ensure that the node pressure is low while meeting the constraints. This will further save energy and prevent the occurrence of high pressure in local areas and reduce abnormal events, such as pipe bursts (Zhang et al. 2022). The water supply stability of the pipe network improves and the local excess water head is prevented when the objective is optimized. Pressure-driven analysis (Giustolisi et al. 2008; Giustolisi & Walski 2012) is necessary to run the hydraulic model.

Constraint conditions

(12)
(13)
where and denote the flow into and out of the ith node, respectively; is the demand of the ith node; i and j are the start and end nodes of the ith pipe, respectively; and are pressure of nodes i and j, respectively; and is the head loss of the ith pipe.
(14)
where is the minimum service pressure and is the pressure of the ith node. The pressure at all nodes must be greater than the minimum pressure value.

Improvements for better optimization

In the dividing phase, the main improvements were made. In process 1, the important pipe is selected manually and the flowmeter is installed on it according to the hydraulic characteristics of the boundary pipe segment after clustering in the generated boundary pipe set. In process 2, this paper improves the BPSO used to determine the location of valves and flowmeters. The BPSO is difficult to solve initially during operation, and it is easy to search for solutions that do not satisfy the constraint conditions. Finally, in the optimization process, the location of valves or flowmeters on all pipe sections has the same probability. The improvements improve the computing efficiency and obtain good solutions.

Process 1: initial determination of important pipes

In the process of preliminary identification of important pipes, this paper proposeds the following principles.

First, a flowmeter is installed in the only boundary pipe of certain DMAs. The unique boundary pipe is as the inlet pipe to avoid there being dead zones and guarantee normal water supply. Second, the flowmeters are set on the boundary pipes of DMAs where the water supply sources are located. This will ensure adequate water supply from the water source to other areas. Third, the boundary pipes with large pipe diameter are considered as the transmission trunks of the whole network. In this study, the pipes with diameter of more than 700 mm are considered the main pipes of all boundary pipes and flowmeters are installed on these pipes. Concrete examples of the three principles are shown in Figure 3.
Figure 3

Schematic diagram of the scenarios corresponding to the three principles: (a) DMA with only one boundary pipe; (b) DMA with water source nodes; (c) boundary pipes with large pipe diameter.

Figure 3

Schematic diagram of the scenarios corresponding to the three principles: (a) DMA with only one boundary pipe; (b) DMA with water source nodes; (c) boundary pipes with large pipe diameter.

Close modal

Process 2: the initial solution optimization

  • (a)

    According to their flow rate, the boundary pipes are sorted from smallest to largest. A certain number of boundary pipes corresponding to smaller flow rate constitute the set s, and the remaining is set r. The state of closure is set on the pipes in the set s, and it is judged whether the previously mentioned constraint conditions are satisfied. If the constraint conditions are not satisfied, that is, there is a node smaller than the minimum service head, enter (b).

  • (b)

    In the set s, the pipes with the highest flow rate are opened first, one boundary pipe at a time. If the pipe network satisfies the constraint condition, the pipe sections in the open state constitute the set r, then enter (d); otherwise, update the set s. The boundary pipe segment of the set s is increased by 1, and then proceed to step (b) until all nodes are greater than the minimum service head.

  • (c)

    In the remaining boundary pipe segment set r, from the flow rate of the smallest, only one pipe segment is closed at a time, if there is less than the service head of the node, in the open state of the pipes combined for the combination of (b), enter step (d).

  • (d)

    The pipe segment in the set r will remain open and flowmeter installed, and the remaining pipe segments remain closed.

Process 3: improve the particle update position formula

The original absolute probability of the position update:
(15)
The improved absolute probability of the position update
(16)
where and are the position and the velocity of the d-dimensional particle.

The values of velocity are mapped to the interval 0 to 1. The s(·) is a sigmoid function. is the flow rate of the jth inlet pipe of the ith partition. is the total inflow of the ith partition, and is the number of inlet pipes in the jth partition.

The original algorithm considers the probability of installing a flowmeter to be the same for all boundary pipes, which is improved in this study. The pipe that bears a higher flow rate in the same partition is considered more likely to have a flowmeter installed, which is in line with the hydraulic characteristics of the pipe network.

Process 4: introduction of crossover mechanism

Figure 4 shows a schematic representation of the crossover mechanism introduced based on BPSO. In order to increase the diversity of the population in subsequent iterations, the flowmeter position solution of each iteration is crossed with the global optimal solution or the individual optimal solution to prevent falling into the local optimal solution.
Figure 4

Schematic diagram of the crossover mechanism.

Figure 4

Schematic diagram of the crossover mechanism.

Close modal

Case study

Two different case studies, namely, Modena (Huang et al. 2017) and EXNET networks (Giustolisi et al. 2008; Laucelli et al. 2017), are selected to verify the methodology (Figure 5). The Modena pipe network is small, with 268 nodes, 317 pipes, and four tanks. The total length of the pipe network is about 72 km, the total water demand is 406.94 L/s, and the minimum service water pressure of the pipe network is 14 m. The medium-sized EXNET pipe network is a real water supply pipe network in the United Kingdom that contains 1,894 nodes and 2,471 pipes. All valves of the original EXNET pipe network were removed, and five reservoirs were added at the original inflow nodes 3,003, 3,004, 3,005, 3,006, and 3,007. Heads of all new reservoirs and the original 3,001 were assumed equal to 70 m. Elevations of 1,107, 1,084, 726, 55, 41, 186, 1,092, 120, and 5,555 (near reservoirs 3,001 and 3,002) were set to 10 m, the pipe network serves a population of 400,000 people, and the minimum service pressure of the pipe network is 14 m. The pressure-driven model was used in an extended-period simulation for network partitioning. Relevant information of the two pipeline networks is listed in Table 1.
Table 1

Physical components of two different test-case networks

WDSNodesPipesTanks
Modena 268 317 
EXNET 1,894 2,417 
WDSNodesPipesTanks
Modena 268 317 
EXNET 1,894 2,417 
Figure 5

Two networks with different layouts and sizes: (a) Modena and (b) EXNET.

Figure 5

Two networks with different layouts and sizes: (a) Modena and (b) EXNET.

Close modal

Clustering phase

Node demand and pipe length distribution results with different numbers of DMAs

According to the calculation results, CVD without node weights and with two weights are 0.450 and 0.293. To test the performance of the proposed method on partition, CVL without node weights and with two weights are 0.397 and 0.319.

Figure 6 demonstrates that the partitioning method based on multiple weights can improve the water demand and pipe length distribution similarity to a certain extent. The algorithm has been proven effective in previous research on water distribution systems and the results of this study are consistent with previous studies (Di Nardo et al. 2014, 2017, 2020). Table 2 shows the specific demand and pipe length for each partition.
Table 2

DMAs with the two weights for Modena and EXNET water supply networks

WDSDemand of DMAs (L/s)Pipe length of DMAs (m)Demand of DMAs (L/s)Pipe length of DMAs (m)
Modena 120 16,308 132 19,061 
 131 18,682 106 17,653 
EXNET 75 14,874 182 9,997 
 126 16,026 52 11,789 
 107 18,181 165 16,353 
 160 21,995 162 14,804 
 109 14,166 83 11,705 
 117 19,954 98 17,435 
 163 27,905 137 16,136 
 128 22,633 134 24,293 
 166 27,543 85 17,245 
 177 8,212 77 16,064 
 149 19,087 105 13,840 
 153 22,491 81 15,294 
 119 27,172 93 13,112 
 105 17,051 111 17,048 
 130 29,093 111 19,635 
 179 31,295 96 21,209 
WDSDemand of DMAs (L/s)Pipe length of DMAs (m)Demand of DMAs (L/s)Pipe length of DMAs (m)
Modena 120 16,308 132 19,061 
 131 18,682 106 17,653 
EXNET 75 14,874 182 9,997 
 126 16,026 52 11,789 
 107 18,181 165 16,353 
 160 21,995 162 14,804 
 109 14,166 83 11,705 
 117 19,954 98 17,435 
 163 27,905 137 16,136 
 128 22,633 134 24,293 
 166 27,543 85 17,245 
 177 8,212 77 16,064 
 149 19,087 105 13,840 
 153 22,491 81 15,294 
 119 27,172 93 13,112 
 105 17,051 111 17,048 
 130 29,093 111 19,635 
 179 31,295 96 21,209 
Figure 6

The distribution without weight and with two weights: (a) demand; (b) length.

Figure 6

The distribution without weight and with two weights: (a) demand; (b) length.

Close modal

Dividing phase

Preliminary identification of important pipes

Among 100 boundary pipes generated after 32 DMAs of the EXNET WDS, 23 pipes in Figure 7 are selected for the setting of flowmeters according to the specified criteria and are denoted in red. In the initial boundary pipe importance analysis, the pipes must be in the open state and have flowmeters installed. After eliminating the above 23 boundary pipes, the value of decision variables in the subsequent optimization process is reduced from 100 to 78, and the solution space is also reduced from the original to , which is only 1/8 of the original one. Therefore, this process greatly increases the probability of finding feasible solutions in each iteration of the particle swarm algorithm population.

Optimize the initial solution

Taking the Modena as an example to analyze, the 16 boundary pipes are obtained through the clustering stage. The first initial solution is optimized to close 25% of the total number of boundary pipes. The set s is the pipes 27, 254, 4 and 205; and the set r is the remaining boundary pipes. The initial solution optimization in the dividing phase is shown in Table 3. The valves are closed sequentially from the pipe segment with the smallest flow rate to the larger ones until the previously mentioned minimum service head constraint is not satisfied, as shown in Figure 8.
Figure 7

Preliminary identification of important pipes in the EXNET WDS.

Figure 7

Preliminary identification of important pipes in the EXNET WDS.

Close modal

Discussion of results

In the dividing phase, the original BPSO leads to optimization difficulties in the dividing phase due to not satisfying the minimum service head constraint, and cannot find the particles that satisfy the constraints, which further leads to a smaller set of Pareto solutions. In this paper, we set the population size to 500 particles, and the improved algorithm sets 50 initial solutions after the optimization by the previous analysis. In this process, the set of Pareto solutions and the number of unsatisfied constraints in each iteration are shown in Figure 9, which proves that the original algorithm has limitations in the dividing stage and does not take into account the actual characteristics of the hydraulic properties.
Figure 8

Change in value of minimum node pressure in the process of initial solution optimization.

Figure 8

Change in value of minimum node pressure in the process of initial solution optimization.

Close modal
Figure 9

Variation of the number of Pareto solution sets with the number of iterations.

Figure 9

Variation of the number of Pareto solution sets with the number of iterations.

Close modal
Figures 10 and 11 show the Pareto front of the boundary pipe optimization EXNET pipe networks. Unique solutions are obtained after the optimization and then distributed on the three-dimensional surface. The leakage reduction rate increases and the pressure balance decreases but the variation range of both decreases as the number of flowmeters increases. The original algorithm obtains only two Pareto solutions after 5,000 iterations, and the three objective functions are 78, 0%, 334 and 45, 6.9%, 393, respectively, which are poorer compared with the results of the improved algorithm.
Table 3

Initial solution optimization of Modena water supply network in dividing phase

Pipe272544205562712238233242103154212150192178
… … …            … … … 
11 
Pipe272544205562712238233242103154212150192178
… … …            … … … 
11 
Figure 10

Pareto front diagram of boundary pipes of EXNET networks.

Figure 10

Pareto front diagram of boundary pipes of EXNET networks.

Close modal

Optimal solution of the flowmeter and gate valve location

The layout scheme of the two WDSs is selected on the basis of the three objective functions. The number of flowmeters, leakage reduction rate, and the pressure balance of the solution are listed in Table 4. Table 5 presents the pressure change before and after partitioning. Figure 12 shows the average pressure change before and after partitioning, with a significant decrease in pressure after partitioning occurs.
Table 4

Values of the three objective functions of the optimal solution

WDSNumber of flowmetersLeakage reduction ratePressure balance
EXNET 48 10.03% 400.61 
WDSNumber of flowmetersLeakage reduction ratePressure balance
EXNET 48 10.03% 400.61 
Table 5

Hydraulic performance comparison

EXNETMinimum pressure (m)Maximum pressure (m)Average pressure (m)
Before 24.17 69.99 39.85 
After 12.60 69.99 32.84 
EXNETMinimum pressure (m)Maximum pressure (m)Average pressure (m)
Before 24.17 69.99 39.85 
After 12.60 69.99 32.84 
Figure 11

Two-dimensional projection of the Pareto optimal solution set for boundary pipes: EXNET.

Figure 11

Two-dimensional projection of the Pareto optimal solution set for boundary pipes: EXNET.

Close modal
Figure 12

Average pressure of the DMA before and after partitioning: EXNET.

Figure 12

Average pressure of the DMA before and after partitioning: EXNET.

Close modal

A novel framework and optimization method is proposed in this study to simulate optimal DMA layouts. The optimization process can provide guidance to future studies on burst pipe detection and location based on DMAs. Compared with other partition methods, the proposed method demonstrates improvement in the following aspects of the dividing phase: pipe importance analysis, initial solution optimization, particle update position formula improvement, and crossover mechanism introduction. The improved multiobjective BPSO optimizes flowmeters (i.e., inlet pipes) and gate valve layouts from different objectives and enhances the efficiency of the dividing phase. The improvements solve the problem of not finding a solution that satisfies the constraints. The partition results can be effectively utilized for refined management of water supply, leakage reduction, and overall pressure reduction.

Finally, the proposed method can be used as a template for other DMA design purposes, such as elevation of nodes between DMAs. Additional objectives can be considered in the optimization process of boundary pipe segments, and trade-offs between these objectives can be explored to achieve a rational partition scheme and improve daily infrastructure management.

This work was supported by the National Natural Science Foundation of China (No. 52070167 and No. 52070165) and Zhejiang Provincial Natural Science Foundation of China (No. LHY22E080003).

All relevant data are available from an online repository or repositories: https://github.com/zhangxiangqiu/optimal_design_of_district_metered_areas.

The authors declare there is no conflict.

Araujo
L. S.
,
Ramos
H.
&
Coelho
S. T.
2006
Pressure control for leakage minimisation in water distribution systems management
.
Water Resources Management
20
(
1
),
133
149
.
Brentan
B. M.
,
Campbell
E.
,
Meirelles
G. L.
,
Luvizotto
E.
&
Izquierdo
J.
2017
Social network community detection for DMA creation: criteria analysis through multilevel optimization
.
Mathematical Problems in Engineering
2017
,
9053238
.
Campbell
E.
,
Izquierdo
J.
,
Montalvo
I.
,
Ilaya-Ayza
A.
,
Pérez-García
R.
&
Tavera
M.
2016a
A flexible methodology to sectorize water supply networks based on social network theory concepts and multi-objective optimization
.
Journal of Hydroinformatics
18
(
1
),
62
76
.
Di Nardo
A.
,
Di Natale
M.
,
Santonastaso
G. F.
&
Venticinque
S.
2013
An automated tool for smart water network partitioning
.
Water Resources Management
27
(
13
),
4493
4508
.
Di Nardo
A.
,
Di Natale
M.
,
Santonastaso
G. F.
,
Tzatchkov
V. G.
&
Alcocer-Yamanaka
V. H.
2014
Water network sectorization based on graph theory and energy performance indices
.
Journal of Water Resources Planning and Management
140
(
5
),
620
629
.
Di Nardo
A.
,
Di Natale
M.
,
Musmarra
D.
,
Santonastaso
G. F.
,
Tuccinardi
F. P.
&
Zaccone
G.
2015
Software for partitioning and protecting a water supply network
.
Civil Engineering and Environmental Systems
33
(
1
),
55
69
.
Di Nardo
A.
,
Di Natale
M.
,
Giudicianni
C.
,
Santonastaso
G. F.
,
Tzatchkov
V.
&
Varela
J. M. R.
2017
Economic and energy criteria for district meter areas design of water distribution networks
.
Water
9
(
7
),
463
.
Di Nardo
A. Di.
,
Natale
M.
,
Giudicianni
C.
,
Greco
R.
&
Santonastaso
G. F.
2018
Water distribution network clustering: graph partitioning or spectral algorithms
? In:
Complex Networks & Their Applications VI
(C. Cherifi, H. Cherifi, M. Karsai & M. Musolesi, eds)
,
Springer International Publishing
,
Cham, Switzerland
, pp.
1197
1209
.
Di Nardo
A.
,
Di Natale
M.
,
Di Mauro
A.
,
Díaz
E. M.
,
Garcia
J. A. B.
,
Santonastaso
G. F.
&
Tuccinardi
F. P.
2020
An advanced software to design automatically permanent partitioning of a water distribution network
.
Urban Water Journal
17
(
3
),
259
265
.
Giudicianni
C.
,
Nardo
A. D.
,
Greco
R.
&
Santonastaso
G. F.
2018
Simplified approach for water distribution network dividing
. In:
1st International WDSA/CCWI Joint Conference
,
Kingston, ON, Canada, 23–25 July
.
Giustolisi
O.
&
Walski
T. M.
2012
Demand components in water distribution network analysis
.
Journal of Water Resources Planning and Management
138
(
4
),
356
367
.
Giustolisi
O.
,
Savic
D.
&
Kapelan
Z.
2008
Pressure-driven demand and leakage simulation for water distribution networks
.
Journal of Hydraulic Engineering
134
(
5
),
626
635
.
Gomes
R.
,
Marques
A. S. A.
&
Sousa
J.
2013
District metered areas design under different decision makers’ options: cost analysis
.
Water Resources Management
27
(
13
),
4527
4543
.
Hadka
D.
&
Reed
P.
2013
Borg: an auto-adaptive many-objective evolutionary computing framework
.
Evolutionary Computation
21
(
2
),
231
259
.
Huang
Y.
,
Duan
H.-F.
,
Zhao
M.
,
Zhang
Q.
,
Zhao
H.
&
Zhang
K.
2017
Probabilistic analysis and evaluation of nodal demand effect on transient analysis in urban water distribution systems
.
Journal of Water Resources Planning and Management
143
(
8
),
04017041
.
Karypis
G.
&
Kumar
V.
1998
Multilevel k-way partitioning scheme for irregular graphs
.
Journal of Parallel and Distributed Computing
48
(
1
),
96
129
.
Kennedy
J.
&
Eberhart
R. C.
1997
A discrete binary version of the particle swarm algorithm
. In:
1997 IEEE International Conference on Systems, Man, and Cybernetics: Computational Cybernetics and Simulation, Volume 5
,
IEEE
,
Piscataway, NJ, USA
, pp.
4104
4108
.
Laucelli
D. B.
,
Simone
A.
,
Berardi
L.
&
Giustolisi
O.
2017
Optimal design of district metering areas for the reduction of leakages
.
Journal of Water Resources Planning and Management
143
(
6
),
04017017
.
Perelman
L.
&
Ostfeld
A.
2011
Topological clustering for water distribution systems analysis
.
Environmental Modelling & Software
26
(
7
),
969
972
.
Pesantez
J. E.
,
Berglund
E. Z.
&
Mahinthakumar
G.
2019
Multiphase procedure to design district metered areas for water distribution networks
.
Journal of Water Resources Planning and Management
145
(
8
),
04019031
.
Sela Perelman
L.
,
Allen
M.
,
Preis
A.
,
Iqbal
M.
&
Whittle
A. J.
2015
Automated sub-zoning of water distribution systems
.
Environmental Modelling & Software
65
,
1
14
.
Shafiee
M. E.
, ,
Berglund
A.
,
Berglund
E. Z.
,
Brill
E. D.
Jr.
&
Mahinthakumar
G.
2016
Parallel evolutionary algorithm for designing water distribution networks to minimize background leakage
.
Journal of Water Resources Planning and Management
142
(
5
),
C4015007
.
Vasilic
Ž.
,
Stanic
M.
,
Kapelan
Z.
,
Prodanovic
D.
&
Babic
B.
2020
Uniformity and heuristics-based DeNSE method for sectorization of water distribution networks
.
Journal of Water Resources Planning and Management
146
(
3
),
04019079
.
Zhang
Q.
,
Wu
Z. Y.
,
Zhao
M.
,
Qi
J.
,
Huang
Y.
&
Zhao
H.
2017
Automatic partitioning of water distribution networks using multiscale community detection and multiobjective optimization
.
Journal of Water Resources Planning and Management
143
(
9
),
04017057
.
Zhang
X.
,
Long
Z.
,
Yao
T.
,
Zhou
H.
,
Yu
T.
&
Zhou
Y.
2022
Real-time burst detection based on multiple features of pressure data
.
Water Supply
22
(
2
),
1474
1491
.
This is an Open Access article distributed under the terms of the Creative Commons Attribution Licence (CC BY 4.0), which permits copying, adaptation and redistribution, provided the original work is properly cited (http://creativecommons.org/licenses/by/4.0/).