Open access
Technical Papers
Nov 3, 2022

Fractal Analysis of the Optimal Hydraulic Gradient Surface in Water Distribution Networks

Publication: Journal of Water Resources Planning and Management
Volume 149, Issue 1

Abstract

This study aimed to examine the fractal properties of the optimal hydraulic gradient surface (OHGS), a geometrical body that describes the way in which the available energy should be spent within a water distribution network to ensure the calculation of a minimum capital cost design. For this purpose, multiple benchmark and Colombian systems were optimized and then analyzed to compute the fractal dimension of the OHGS and of the underlying structure of each network, which included the examination of randomly generated nonoptimal designs to recognize the differences in the fractal behavior of a least-cost and a more expensive solution. The results showed a dependency between the fractal properties of the OHGS and those of the topological structure, flow, and energy distribution inside the corresponding optimized network. Moreover, it was found that the degree of irregularity of the OHGS tended to be higher compared to a nonoptimal energy dissipation pattern. This suggests the applicability of the fractal analysis in optimization and operational improvement procedures.

Practical Applications

The design of a least-cost water distribution network, which refers to the process of calculating appropriate pipe diameters that ensure the fulfilment of water demands and reduce the required investment to a minimum, has been of interest due to its complexity and importance for the viability of water supply infrastructure projects. In this study, the inherent characteristics of a least-cost design were explored by involving fractal analysis, a novel technique that has been used to solve several problems in the management and operation of water supply systems. The results show that the hydraulic features of a minimum-cost water distribution network, analyzed by considering the behavior of pressure and water flow throughout the system, exhibit certain fractal properties that can be used to distinguish it from more expensive alternatives. These findings lead to the recommendation to use fractal analysis in prospective water distribution network planning and management applications, such as new design and operational improvement strategies. Furthermore, fractal analysis may be useful in identifying the proper hydraulic behavior of a water distribution network so as to maximize its reliability, water quality, and other desirable features that improve its performance and level of service.

Introduction

The design of water distribution networks (WDNs) may be defined as the selection of a certain configuration of commercially available diameter sizes, in such a way that a group of hydraulic constraints are satisfied and a set of operational conditions are achieved (Bragalli et al. 2012; Qiu et al. 2021). In its traditional formulation, the optimized capital cost design of WDNs seeks to establish the least-cost set of diameter sizes that ensures the supply of nodal flow demands and a suitable water pressure without violating the law of conservation of mass and energy (Geem 2008; Ezzeldin et al. 2013; Saldarriaga 2016). However, additional criteria can be included, for example, water quality, reliability, and resilience (Prasad and Park 2004; Bi and Dandy 2014; Moosavian and Lence 2020; Sirsant and Reddy 2020). The complexity of the problem could be attributed to the nonlinear relationship between head loss and discharge (Saldarriaga 2016), the discrete nature of the available pipe diameters, and the extensive quantity of feasible solutions (Kadu et al. 2008). Consequently, the optimization of WDNs is a highly indeterminate problem (Reca and Martínez 2006; Saldarriaga et al. 2013).
Numerous stochastic and deterministic strategies have been applied for WDN minimum-cost optimization. The first approaches involved the use of traditional deterministic gradient-based techniques, such as linear and nonlinear programming (Alperovits and Shamir 1977; Lansey and Mays 1989), that are prone to local-optima entrapment and culminate in split-pipe sizes (Lin et al. 2007; Zheng et al. 2011; Qiu et al. 2021). Evolutionary algorithms (EAs) made it possible to overcome these disadvantages (Zheng et al. 2011). The use of metaheuristic alternatives offered a broader exploration of the search space by developing guided stochastic procedures with the use of learning functions based upon fitness measures (Saldarriaga et al. 2013; Marchi et al. 2014) yet tackling the problem from a mathematical perspective without considering the underlying fluid dynamics inside a WDN (Saldarriaga et al. 2010, 2015). One of the most prominent EAs are genetic algorithms (GAs), which are bioinspired procedures that recreate natural selection (Sivanandam and Deepa 2008). GAs generate an initial random population of possible solutions (individuals) that undergo an iterative process of recombination and mutation until a satisfactory configuration of diameter sizes is found (Dandy et al. 1996; Savic and Walters 1997; Montesinos et al. 1999; Mitchell 1999). Based on their fitness, the best individuals are selected to yield an improved offspring in terms of the objective function (Sivanandam and Deepa 2008). Note that the technique is applicable for demand-driven models, i.e., networks in which the nodal demands are known and independent of the hydraulic behavior of the system, or pressure-driven models, i.e., networks in which the nodal flow rates show a dependency on the available pressure (Farmani et al. 2007; Páez et al. 2014). Simulated annealing (Cunha and Sousa 1999; Reca et al. 2008; Cunha et al. 2019), harmony search (Geem 2008), and Tabu search (Sung et al. 2007; Cunha and Ribeiro 2004) are additional examples of metaheuristic approaches.
Within this framework, hydraulic-based power use methodologies introduced the physical phenomena inside the optimization process and lessened the computational effort by reducing the number of iterations to reach convergence (Saldarriaga et al. 2014, 2015). One of the first approaches in this matter was documented by Wu (1975) for main drip irrigation lines. Wu (1975) observed that the minimum-cost diameter size configuration in a system of pipes in series with constant and known flow demands could be obtained by predefining a parabolic hydraulic gradient line (HGL) with a sag of 15% of the total head loss. As a result, objective head loss values could be calculated for each pipe, providing enough information to determine the desired diameters (Wu 1975; Saldarriaga et al. 2010). Subsequently, Featherstone and El-Jumaily (1983) extended Wu’s criterion to looped networks, and the idea was further developed when the optimal power use surface (OPUS) methodology was introduced (Saldarriaga et al. 2010). OPUS requires the calculation of the optimal hydraulic gradient surface (OHGS), a discontinuous three-dimensional (3D) geometrical entity formed by the nodal piezometric head values that guarantee the calculation of a least-cost set of diameter sizes (Saldarriaga et al. 2005, 2010, 2013, 2020). In a similar manner to Wu’s (1975) observations, the OHGS establishes the way in which the available energy should be spent within the system to ensure an optimal design while satisfying the minimum water pressure and nodal flow demands (Saldarriaga et al. 2005, 2010, 2013). Although the resulting initial design is given in continuous pipe sizes, OPUS executes rounding procedures so that the final design is consistent with the commercial diameters and meets the hydraulic constraints (Saldarriaga et al. 2010, 2020). Several tests with benchmark networks have shown that OPUS can obtain high-quality solutions with very slight differences when compared to the minimum cost solutions reported in the literature (Saldarriaga et al. 2010). Nevertheless, it should be noted that optimization methodologies that use hydraulic-based power rely on the assumption that Wu’s criterion is fulfilled (Saldarriaga 2016). In pressure-driven models, the flow demands are unknown prior to the optimization of the WDN, thereby impeding the applicability of OPUS without supplemental adjustments (Saldarriaga 2016). In this regard, integer linear programming has been combined with some main features of OPUS, showing successful results (Páez et al. 2013, 2014). Furthermore, hydraulic-based methodologies may also be used for preconditioning purposes or as feedback to improve the performance of metaheuristic algorithms as shown by Páez et al. (2020) and Liu et al. (2020).
From a mathematical perspective, the OHGS may encompass interesting properties that could provide additional details of the underlying physics inside the optimization process (Jaramillo 2020). In terms of its structure, the OHGS exhibits a highly irregular appearance that suggests that it may not be described by Euclidean geometry, which is suitable for the characterization of regular objects. Therefore, given the mathematical complexity of the OHGS, a non-Euclidean approach, such as fractal analysis, may be used to provide a characterization of its main geometrical properties. Several works have stated that many of the amorphous surfaces found in nature or in biological and engineering applications can be analyzed under the postulates of fractal theory (Mandelbrot 1983; Zhou and Lam 2005; Ju and Lam 2009; Persson 2014; Spasic 2014). Treating the OHGS as an approximate fractal body widens the spectrum of possible examination viewpoints. For this purpose, it is necessary to understand the main concepts that are generally used when involving fractals. In a few words, a fractal can be defined as a complex and highly irregular mathematical entity whose geometrical characteristics are self-similar at any arbitrary scale (Falconer 1990). Although perfect fractals must show this property, the fractal behavior can be present in a statistical or approximate manner in real-life phenomena (Mandelbrot 1977; Falconer 1990). Measuring these entities is usually done by estimating the fractal dimension, a noninteger parameter that describes how a fractal fills space and its degree of irregularity (Falconer 1990; Jian-Hua et al. 2009). Different definitions of fractal dimension have been used in the literature, such as the Hausdorff, packing, or box-counting dimension (Edgar 2008). The latter is appealing because of its simplicity and applicability for computational purposes (Falconer 1990, 1997). In brief, the box-counting fractal dimension is based on the smallest number of sets of size δ that are required to cover the fractal (Falconer 1997). It has been stated that a scaling or power law relationship may exist between the number of sets Mδ(F) and the scale of analysis δ, involving the fractal dimension as the exponent (Mandelbrot 1977; Falconer 1990, 1997):
Mδ(F)δD
(1)
where D = fractal dimension; Mδ(F) = measurement of any fractal F at arbitrary scale δ; and δ = scale of analysis. Plentiful numerical strategies have been adopted in the field of landscape, remote sensing, and physical geography to estimate the box-counting fractal dimension of rugged surfaces using this concept (Clarke 1986; Zhou and Lam 2005; Sun et al. 2006). Some examples of these techniques include the triangular prism, differential box counting, variogram, robust fractal estimator, probability, and variation estimator methods (Clarke 1986; Sarkar and Chaudhuri 1992; Lam et al. 2002; Zhou and Lam 2005; Sun et al. 2006; Ju and Lam 2009). Furthermore, fractal behavior is not restricted to rough surfaces. It has been shown that a WDN may show fractal properties in its topological structure that may be applied in the analysis of the resilience, reliability, water quality, and operational conditions, as well as in classification, risk assessment, and sectorization procedures (Diao et al. 2017; Di Nardo et al. 2017; Vargas et al. 2019; Kowalski et al. 2019; Iwanek et al. 2020; Kowalska et al. 2020; Giudicianni et al. 2021). In this context, WDNs have been examined employing graph theory concepts by modeling their underlying topological structure as directed or undirected graphs whose vertices must be covered with the smallest number of boxes or clusters of a certain size (Diao et al. 2017; Vargas and Saldarriaga 2019). In this case, Mδ(F) is understood as a set of junctions or nodes that meet certain conditions, such as proximity (Song et al. 2007; Diao et al. 2017). It should be noted that the calculation of the minimum required covering units Mδ(F) is usually achieved with box-covering algorithms (Diao et al. 2017). Some of the most prominent box-covering methodologies include greedy and burning algorithms that differ in the way and order in which the nodes of a network are packed (Song et al. 2007; Wen and Cheong 2021). Moreover, the calculation of the minimum number of covering units can be restricted to involve the topological properties of the network only, such as the way vertices are linked, or include hydraulic criteria, such as the flow distribution or nodal piezometric heads (Kim et al. 2007; Song et al. 2007; Vargas and Saldarriaga 2019; Vargas et al. 2019).
In this study, a numerical modeling methodology was used to conduct the fractal analysis of several benchmark and Colombian WDNs and their corresponding OHGS. For this purpose, a least-cost design and several nonoptimal designs were generated for each system. Subsequently, the designs were analyzed using the variation estimation method and a greedy box-covering algorithm to compute the fractal dimension of the OHGS and of the underlying structure of each WDN design, respectively. In terms of the OHGS, the fractal dimension is employed as a spatial metric that translates the complex morphology of the surface into numerical data that can be used to understand the relationship between the geometrical properties of the OHGS and the inherent energy dissipation phenomenon of a least-cost design. In relation to the underlying structure of the WDNs, the fractal dimension is used as a parameter that reveals the degree of irregularity in the topology, flow, and energy distribution inside a given network to characterize the intrinsic mathematical properties of the hydraulic behavior of each design. The use of several nonoptimal designs was of interest to analyze the mathematical and physical differences between the hydraulic behavior of a least-cost design and a more expensive solution. Finally, this study also intended to consider the applicability of fractal analysis as a novel approach to solving WDN capital cost optimization problems and to guide operational improvement procedures. In the context of optimization, the fractal analysis of a hydraulic gradient surface (HGS) may be used to guide the calculation of pipe diameters by considering the inherent fractal properties in the hydraulic behavior of a least-cost design. In the case of WDN operational improvement, the fractal dimension may be used as a parameter that suggests the proper fractal properties of the hydraulic behavior of a network for achieving better performance in terms of operational cost, reliability, or water quality.

Methodology

Design and Hydraulic Modeling

The first step in the analysis of a given WDN is to calculate an optimized design. The optimization problem is formulated as the determination of a least-cost set of diameter sizes in compliance with the minimum pressure requirement and nodal flow demands. All WDNs are treated as new water supply systems in which pipe diameters need to be calculated. Therefore, the objective function to minimize was defined in terms of the capital cost required to install a new WDN depending on its diameter sizes. A commonly used mathematical expression for this purpose is a summation of the individual cost of each pipe, calculated as follows according to its diameter and cost per unit length (Wu 1975; Saldarriaga et al. 2020):
CT=i=1NPKlidin
(2)
where CT = total water pipe cost of a WDN; di = diameter of pipe i; K = coefficient; li = length of pipe i; NP = total number of pipes; and n = exponent. The capital cost of a new WDN, as defined by Eq. (2), considers the hypothetical required initial investment to acquire the WDN pipes and to install them (Saldarriaga 2016; Qiu et al. 2021). In addition, it is important to clarify that Eq. (2) does not consider operational, renewal, or asset management costs. The objective function coefficient (K) and exponent (n) were obtained from an exponential regression according to the unit costs of the available commercial diameters. The exponential regression was also visually depicted in a cost curve, as exemplified in Fig. 1. A Python algorithm to generate these graphs can be found in Jaramillo (2022).
Fig. 1. Cost curve for Colombian networks.
The optimization process was achieved using REDES, a hydraulic modeling and design software for pressurized pipe flows developed by the Water Distribution and Sewer Systems Research Center (CIACUA) (Saldarriaga 2016; Saldarriaga et al. 2017). The flow demands in every WDN were modeled by establishing a constant flow rate value per node in accordance with the peak hourly flow rate. If a WDN was modeled as a demand-driven system, the least-cost design was assumed to be the one calculated by OPUS due to its closeness to the global optima (Saldarriaga et al. 2010). Since conventional power use methods assume constant and known nodal demands prior to the optimization process (Saldarriaga 2016), the design of pressure-driven WDNs had to be executed using the available GA in REDES (Lopez-Giraldo and Saldarriaga 2004). In this case, the optimized design was obtained by carrying out multiple iterations until the capital costs did not vary in successive runs. Following calculation of a least-cost design, the computation of random nonoptimal solutions was of interest to analyze the differences in the fractal behavior when compared with the optimal solution. For a given WDN, 10 nonoptimal designs were randomly chosen using the GA, regardless of how nodal flow demands were modeled (demand-driven or pressure-driven systems). It should be noted that the nonoptimal solutions are valid designs that supply the required discharge and the minimum pressure but do not meet the least-cost criterion. Once the designing process was done, the diameter sizes and capital costs were stored.
An additional aspect to specify is how the hydraulic calculations were conducted, i.e., the process in which the piezometric head values on the nodes and the flow inside pipes were obtained in accordance with the nodal flow demands and diameter sizes. Since the design process is carried out considering the maximum nodal flow demands in a day, described by the peak hourly flow rate value, the corresponding discharge rates remain constant. Therefore, the hydraulic calculations were performed considering snapshot analyses only. Both OPUS and the employed GA are needed to perform a snapshot hydraulic computation for every required iteration to reach the desired optimal and nonoptimal solutions. In this case, the hydraulic computations were carried out using the EPANET calculation engine based on the gradient method presented by Todini and Pilati (1987) owing to its computational efficiency and speed in reaching convergence, allowing the reader to compare results if needed. In terms of head losses, the Darcy–Weisbach and Colebrook–White equations were preferred over the Hazen–Williams equation owing to their applicability and robustness. It has been shown that the accuracy of the Hazen–Williams equation deteriorates when the flow regime is outside a narrow range of Reynolds numbers and relative roughness, when the pipe diameter is smaller than 5 cm and the flow velocity is greater than 3  m/s (Ormsbee and Walski 2016). Since these limitations are hard to control due to the complexity of some WDNs, it was concluded that the Darcy–Weisbach and Colebrook–White equations were more suitable for this study. In addition, given its physically based nature, it has been stated that the Darcy–Weisbach and Colebrook–White equations have a more robust theoretical background than the Hazen–Williams equation (Ormsbee and Walski 2016; Saldarriaga 2016). Once the design process was completed, a final single period (snapshot) analysis was calculated for each optimal and nonoptimal design to store the definitive set of piezometric head values on nodes and flow rate values inside pipes.

Calculation of HGSs

The following step is to construct the OHGS for the calculated optimal designs. The goal is to acquire a raster representation or digital elevation model (DEM) of the OHGS with enough detail to perform the fractal analysis. As explained in a previous section, the concept of OHGS refers to a 3D surface formed by the piezometric head values on nodes that describe the way in which the available energy should be spent to assure the calculation of a least-cost design. Therefore, since the optimal piezometric head values on the nodes were known from the snapshot hydraulic calculation of the optimized network, a Python script was written to take this set of values as an input and perform an interpolation procedure to obtain the unknown values over the void space inside loops and between branches. The script can be consulted in Jaramillo (2022). In addition, it is important to highlight that interpolation has been extensively used to recreate rough surfaces by computational means. Some examples include the works of Przestacki et al. (2016), Erkal and Hajjar (2017), Abdalfattah et al. (2019), and Bishop-Taylor et al. (2019).
First, the algorithm determined several additional piezometric head values along the axis of the pipes to ensure better results during the OHGS building procedure. Since the discharge remained constant through an individual pipe, the corresponding decrease in the available energy due to the frictional effects was assumed to behave as a straight line (Saldarriaga 2016). Therefore, these additional values were computed with a linear interpolation method between connected nodes. Then a mesh grid with square cells of equal side lengths was generated over the WDN using the numpy function mgrid (Harris et al. 2020). The side length was defined to ensure enough detail in the corresponding OHGS. An interpolation procedure was carried out next with the scipy interpolate function griddata over the generated mesh grid (Virtanen et al. 2020). Griddata computes a Delaunay triangulation over the convex hull that circumscribes the WDN, followed by a linear barycentric interpolation on each triangle to provide the unknown piezometric head values, according to the scattered piezometric head data points, as established during the hydraulic snapshot simulation and the linear interpolation procedure between connected nodes (Barber et al. 1996; Bishop-Taylor et al. 2019). The convex hull was determined using the Quickhull algorithm, as included in scipy (Barber et al. 1996). In addition, it is worth noting that a linear barycentric interpolation was chosen to resemble the nature of the energy dissipation phenomenon inside pressurized ducts. Ultimately, the estimated surface was plotted in a 3D graph using matplotlib (Hunter 2007). Figs. 2 and 3 exemplify the output of the explained interpolation method if applied in the calculated least-cost design of the Balerma network.
Fig. 2. Three-dimensional view of OHGS of Balerma network.
Fig. 3. DEM of OHGS of Balerma network.
Although the concept of the OHGS was originally conceived considering the optimal designs exclusively, an analogous concept can be applied to describe how energy is used throughout a nonoptimal design. If the interpolation algorithm is applied over a nonoptimal design of a given network, the script generates a HGS that does not ensure the calculation of a least-cost design but shows how the available power is spent in the nonoptimized network. The calculation of the HGSs of the nonoptimal designs was of interest to compare the differences in the fractal behavior when compared to the OHGS. Therefore, after applying the interpolation algorithm to the optimal and nonoptimal designs, 11 surfaces were generated for a given WDN: the OHGS and 10 nonoptimal HGSs.

Fractal Analysis of HGSs

Once the OHGS and the nonoptimal HGSs were calculated, a numerical procedure was employed to proceed with the calculation of the fractal dimension of the surfaces. For this purpose, the same Python script involved during the interpolation algorithm was used; it can be found in Jaramillo (2022). In the present study, the calculation of the fractal dimension of the surfaces was carried out by an adaptation of the variation estimation method as stated by Tolle et al. (2003) and Zhou and Lam (2005), chosen because of its simplicity and because it involves the influence of the energy dissipation phenomenon in a straightforward manner. The method is explained as follows for an arbitrary HGS.
First, the Python script stores the interpolated piezometric head values in a two-dimensional (2D) numpy array (matrix) that can be understood as a raster representation of the HGS (as exemplified in Fig. 3). Each position (i,j) of the matrix represents a specific location inside the plan view of the HGS and stores the corresponding piezometric head value. Now, take a gliding square window or box of side length L that can be slid over the raster data set. The side length L of the moving element is defined by the radius ε as L=2ε+1. Note that L is always an odd number. For each iteration, the algorithm moves the sliding box to a new position, thereby enclosing a set of piezometric head values. The variation is defined as the difference between the maximum and minimum piezometric head values within the box. Therefore, a variation value is stored for each position of the moving window. When the whole surface is examined, the mean variation V(ε) is computed by averaging the calculated variation values. The algorithm iterates over a range of ε values to obtain a V(ε) versus ε data set. This range is defined according to the resolution of the raster data set (matrix size) and to avoid infringing on the image borders as defined by the 2D array.
As stated in Eq. (1), a fractal can be described by a scaling or power law. Since the moving window is extensively used to cover or enclose the fractal body of interest (HGS), the variation method is a box-covering algorithm that makes it possible to empirically compute the fractal dimension of a HGS. In this case, the mean variation V(ε) is understood as a measured quantity Mδ(F) over the fractal, whereas the radius ε can be understood as the scale of analysis δ. Therefore, the following expression is stated to describe the relationship between V(ε) and ε:
V(ε)ε(D3)
(3)
where D = fractal dimension; ε = radius of moving box; and V(ε) = mean variation of HGS at scale ε. If Eq. (3) is rewritten by taking the common logarithm of both sides, the following alternative equation is found:
logV(ε)=(D3)logε
(4)
At this point, a V(ε) versus ε data set is known, so a new log-transformed logV(ε) versus logε data set can be established to obtain the fractal dimension of the surface (Zhou and Lam 2005). Eq. (4) shows that the fractal dimension can be estimated as D=3m, where m is the slope of the least-squares regression line that better describes the log V(ε) versus logε data set (Zhou and Lam 2005). The process to obtain the fractal dimension of a HGS is summarized in Fig. 4.
Fig. 4. Fractal analysis methodology for HGSs.

Fractal Analysis of WDN Structure

The final step is to calculate the fractal dimension of the underlying structure of the WDNs. For this purpose, two different Python scripts are proposed: one for small networks, assumed to be systems with less than 250 nodes, and one for large networks, assumed to be systems with 250 or more nodes. Both files can be found in Jaramillo (2022). The scripts run a greedy box-covering algorithm that estimates the minimum number of boxes of an odd size lB to cover the WDN nodes considering the procedure proposed by Diao et al. (2017), Vargas and Saldarriaga (2019), and Vargas et al. (2019). Note that the box size lB establishes the required number of nodes to fill up a box. The algorithm works as follows. First, the network is modeled as a directed graph in which the orientation of its edges is defined according to the water flow direction inside pipes as established by the output of the single period hydraulic analysis. Then every node is marked as uncovered or free. Next, the individual weight wj of each node is computed depending on the desired analysis criterion. In this case, four options were included: a topologic, flow, energy, and infrastructure criterion. The first option considers how nodes are interconnected [Eq. (5)]. The second option estimates the individual weight as the sum of all flows that converge to the examined node [Eq. (6)]. The third criterion involves the piezometric head over the node as the individual weight [Eq. (7)]. The latter requires adding the diameters of the surrounding connected pipes to the examined node [Eq. (8)]. The following equations summarize each of the proposed criteria:
wj=1
(5)
wj=iQCij
(6)
wj=HGLj
(7)
wj=idCij
(8)
where dCij = diameter of pipe i that converges in node j; HGLj = piezometric head over node j; QCij = flow rate from pipe i that enters node j; and wj = individual weight of node j. After the individual weights are computed, the mass of each uncovered node is calculated by adding the individual weight of the uncovered neighboring nodes located at a distance less than (lB1)/2. This distance is measured over the shortest path between nodes according to the outline of the pipes. For this purpose, the scipy shortest_path function was employed, obtaining the shortest path by applying Dijkstra’s algorithm with Fibonacci heaps (Virtanen et al. 2020). Later, the node with the highest mass is selected as the new center of a box and the neighboring uncovered nodes located at a distance less than (lB1)/2 are marked as covered. The process is repeated until every node belongs to a box. Once the network is fully covered, the algorithm computes the total number of boxes or sets NB.
The procedure is repeated for a suitable range of lB values to obtain a NB versus lB data set. This range is defined in a similar way to that proposed by Vargas and Saldarriaga (2019). For small networks, the minimum lB is equal to one, whereas the maximum lB is the value that ensures enclosing the whole network with only one box. For large networks, it is suggested to choose a reduced number of box sizes lB considering that the obtained fit does not vary significantly if a few sample points are included and considering that the box-covering algorithm requires a long computational time to be performed (Vargas and Saldarriaga 2019). In this case, seven lB values were considered: lB=1, a maximum lB defined as the odd integer closest to the square root of the total number of nodes, and the five last odd lB values before the maximum lB (Vargas and Saldarriaga 2019).
Finally, the algorithm computes the fractal dimension by applying the main concepts of fractal theory. A WDN is considered a fractal object if the number of covering units NB and their size lB are related by a power or scaling law as established by Eq. (1) (Diao et al. 2017). In this case, the number of covering units NB is understood as a measured quantity Mδ(F) over the fractal, whereas the box size lB can be understood as the scale of analysis δ. Therefore, the following expression is used to describe the relationship between NB and lB (Diao et al. 2017):
NB=K0lBD
(9)
where D = fractal dimension; K0 = total number of nodes in the WDN; lB = box size; and NB = minimum number of required boxes of size lB to cover WDN. If Eq. (9) is rewritten by taking the common logarithm of both sides, an alternative equation is found (Vargas and Saldarriaga 2019):
logNB=DloglB+logK0
(10)
At this point, an NB versus lB data set is known, so a new log-transformed log NB versus log lB data set can be established to obtain the fractal dimension (Diao et al. 2017; Vargas et al. 2019). Eq. (10) shows that the fractal dimension can be estimated as D=m, where m is the slope of the least-squares regression line that better describes the log NB versus log lB data set (Vargas et al. 2019). According to Diao et al. (2017), a WDN can be assumed to be a fractal entity if a coefficient of determination of over 0.95 can be established when a least-squares linear regression is performed. The procedure is summarized in Fig. 5.
Fig. 5. Fractal analysis methodology for WDNs.

Case Studies

The aforementioned methodology was applied to 28 WDNs. Thirteen of the chosen systems have been widely studied in the literature and are usually conceived as benchmark networks with a well-known hydraulic behavior and a reported least-cost design. The remaining 15 networks are real water supply infrastructure located in various Colombian towns and cities that were analyzed in previously published dissertations and research projects. All case studies are treated as new water supply systems in which pipe diameters need to be calculated. The networks were chosen in such a way that different topographical, topological, and energy availability conditions were tested so as to identify differences in the fractal behavior. Therefore, the 28 selected systems include demand- and pressure-driven models with flat and steep topographical conditions, one or more reservoirs, and branched and looped structures. Nevertheless, it should be noted that the analysis was restricted to gravity-driven networks, i.e., without pumping devices. As stated by Saldarriaga et al. (2020), the OPUS methodology was originally made to be applied to gravity-driven WDNs. Coding adjustments of the original algorithm are required if networks with pumps will be included in the analysis (Saldarriaga et al. 2020). Consequently, so as to maintain the current OPUS version unaltered, the analysis was only conducted in gravity-driven networks. The main properties of each network are presented in Table 1.
Table 1. Case studies
NetworkInfrastructure propertiesDesign parameterReference
IDName (demand type)PipesNodesReservoirsPmin (m)Kn
1Two loops (DD)87130.001.31861.59Alperovits and Shamir (1977)
2Two reservoirs (DD)1710215.000.02981.46Gessler (1985)
3Taichung (DD)3120115.001.94821.26Sung et al. (2007)
4Jilin (DD)3427115.000.01041.53Bi and Dandy (2014)
Kyriakou and Vrachimis (2016)
5Hanoi (DD)3432130.000.00851.50Fujiwara and Khang (1990)
6Blacksburg (DD)3530130.000.00082.00Sherali et al. (2001)
7New York Tunnels (DD)4219177.723.60921.24Schaake and Lai (1969)
8BakRyan (DD)5835115.000.37850.99Lee and Lee (2001)
9Fossolo (DD)5836140.000.00151.95Bragalli et al. (2012)
10R28 (DD)6739120.001.50001.45Saldarriaga et al. (2015)
11Pescara (DD)9968320.000.07281.27Bragalli et al. (2012)
12Modena (DD)317268420.000.07281.27Bragalli et al. (2012)
13Balerma (DD)454443420.000.00042.06Reca and Martínez (2006)
14La Uribe (DD)4949110.006.75341.87CIACUAa
15El Overo (DD)676719.006.75341.87CIACUA
16San Vicente (DD)7162110.006.75341.87CIACUA
17Cazucá (DD)150145115.006.75341.87CIACUA
18Elevada (DD)26325513.006.75341.87CIACUA
19Andalucía Alta (DD)360329110.006.75341.87CIACUA
20La Cumbre (DD)378339115.006.75341.87CIACUA
21Andalucía Baja (PD)394358115.006.75341.87CIACUA
22Toro (DD)42336315.006.75341.87CIACUA
23Candelaria (PD)567464215.006.75341.87CIACUA
24Bugalagrande (PD)656583115.006.75341.87CIACUA
25Carmen del Viboral (DD)894716115.006.75341.87CIACUA
26Morrorico Bajo (DD)762666115.006.75341.87CIACUA
27Chinú (DD)1,089828215.006.75341.87CIACUA
28La Enea (DD)1,5921,413115.006.75341.87CIACUA

Note: DD = demand driven; ID = network identification; and PD = pressure driven.

a
This CIACUA material is not published.
Each of the analyzed networks was modeled using an EPANET data file that contained all the necessary information about the spatial locations of nodes, pipes, valves, and reservoirs, as well as minor loss coefficients, emitter coefficients, maximum nodal flow rate values, and the available head on each reservoir. Most of the EPANET data files corresponding to the benchmark networks were retrieved from Wang et al. (2015), available online in the University of Exeter Centre for Water Systems. EPANET Colombian network data files were retrieved from CIACUA. Although many of the benchmark networks were originally conceived using a Hazen–Williams empirical equation to describe frictional losses, Darcy–Weisbach and Colebrook–White physical equations were preferred, as described in the proposed hydraulic calculation methodology. In this regard, an absolute roughness of 0.0015 mm was assumed for all networks, excluding Balerma in which a roughness of 0.0025 mm was used according to the literature. Furthermore, even though some of the selected benchmark networks were originally conceived to include pipes with fixed diameters and a maximum and minimum pressure requirement, every model was optimized assuming that every diameter had to be found in a completely new system and that the minimum pressure was the only piezometric head constraint. Lastly, it is important to mention that the unit cost information used to specify the coefficient (K) and exponent (n) in the capital cost equation [Eq. (2)] was obtained from different sources. For benchmark networks, the information was retrieved from the literature, whereas for Colombian networks the unit costs were retrieved from PAVCO Wavin, a pipe manufacturing company (Bogotá, Colombia). All the unit cost information is summarized in Tables S1S14, the corresponding cost curves are showcased from Figs. S1S13, and the resulting K and n values for each network are presented in Table 1.

Results

The optimization process culminated in 28 least-cost designs, one for each WDN, and 280 nonoptimal designs, 10 for each WDN. An EPANET data file was generated for each design and is available in Jaramillo (2022). All solutions were established in agreement with the minimum pressure constraint and the fulfillment of the nodal flow demands. In addition, nonoptimal solutions were chosen to ensure a progressive increase in the capital pipe cost; therefore, nonoptimal solutions were found near the achieved least-cost design as well as much more expensive designs. As an example, the evolution of Toro network capital cost is presented in Fig. 6. The remaining capital cost information can be consulted in Tables S15S17. Given that some modifications were carried out in the problem formulation of many of the analyzed benchmark networks in terms of the friction equation and the involved constraints, the achieved least-cost design may differ if compared with the reported record optimal design. The mean and standard deviation were also calculated for the set of diameter values of each design. The general tendency of the quantified statistical parameters is exemplified in Fig. 7 for some of the studied networks. The figure shows that the mean and standard deviation of the diameter values were generally higher in the nonoptimal designs. All mean and standard deviation values are included in Tables S18 and S19. Furthermore, Figs. 810 exemplify the application of the interpolation algorithm that computes the HGSs by illustrating the cases of R28, Cazucá, and New York Tunnels networks.
Fig. 6. Cost evolution in proposed designs of Toro network.
Fig. 7. General tendency of mean and standard deviation of diameter values.
Fig. 8. HGSs of (a) optimal; and (b) most expensive nonoptimal design for R28 network.
Fig. 9. HGSs of (a) optimal; and (b) most expensive nonoptimal design for Cazucá network.
Fig. 10. HGSs of (a) optimal; and (b) most expensive nonoptimal design for New York Tunnels network.
The calculated fractal dimensions of the OHGSs are summarized in Table 2 with their corresponding coefficients of determination from the least-squares linear regressions over the analyzed log V(ε) versus log ε data sets. Fig. 11 exemplifies the application of the fractal analysis over the OHGS and nonoptimal HGSs of El Overo network by illustrating the approximate linear behavior between log V(ε) and log ε. The remaining log V(ε) and log ε graphs are presented from Figs. S14S40. A box and whisker plot (Fig. 12) is presented to display the fractal dimension values of the OHGSs and of the nonoptimal HGSs for each of the analyzed networks and to depict the range and variability in the corresponding data sets. Eleven fractal dimension values were calculated for each WDN: one for the optimal design and one for each of the nonoptimal solutions. Fig. 12 also illustrates the interval where the 11 coefficients of determination were found for each WDN, denoting the maximum and minimum R2 coefficients from the 11 analyzed HGSs in each case. If the R2 coefficients were all the same in a specific network, a single R2 value is specified instead of an interval. Both Table 2 and Fig. 12 show that the OHGSs and nonoptimal HGSs are fractal objects given that the R2 coefficients are, in general, very close to 1.00; thus, the results reveal that the nature of the energy dissipation phenomenon in a WDN has an approximate self-similar behavior that can be characterized by the fractal dimension. In terms of the variability, Fig. 12 reveals little statistical dispersion in the data sets considering that outliers were not common and that the interquartile range (IQR) was narrow. If the computed fractal dimensions are compared with the theoretical feasible range between 2.00 and 3.00 (Bisoi and Mishra 2001), it is possible to identify that the estimated values are slightly below the lower limit in a few of the studied networks. This issue can be attributed to the numerical performance of the chosen algorithm and should be addressed in future work to avoid underestimating the fractal dimension of the surfaces. All fractal dimension values and coefficients of determination for each WDN can be individually consulted in Tables S20 and S21.
Table 2. Fractal analysis results of OHGSs and optimized networks
IDOHGSOptimized network
Topological criterionFlow criterionEnergy criterionInfrastructural criterion
DR2DR2DR2DR2DR2
12.03331.001.19811.000.94280.901.13940.921.09770.81
22.10291.001.23190.981.05170.951.23190.981.03170.95
32.07231.001.31340.971.09080.961.27680.961.29960.98
42.13431.001.39440.941.16860.961.37550.961.25170.95
52.02141.001.21080.971.06980.971.21070.971.22080.97
62.33880.981.41580.931.43070.951.41580.931.40590.93
72.03811.001.05370.941.05240.961.06170.941.02960.97
82.08941.001.30180.971.08990.971.30180.971.30730.96
92.21210.971.43960.971.29400.971.44950.971.44950.97
102.06471.001.34640.951.27380.961.32200.961.29800.96
112.31250.960.59230.960.92520.840.61050.960.88670.84
122.32040.961.23620.991.20850.991.24890.981.26760.98
132.29820.990.58620.990.57120.990.58770.990.57870.99
142.00641.001.07200.951.15750.961.12740.971.11910.94
152.21100.971.22560.971.24430.971.21630.971.19020.95
161.93861.000.11410.990.61920.360.11200.980.65580.30
172.17540.991.17590.961.23970.981.16520.951.13920.92
182.03381.001.03840.990.98160.991.01080.991.00160.99
192.07030.981.27350.971.30540.951.27470.971.23470.96
202.19710.971.16650.991.11530.971.15410.991.14560.98
212.06171.001.18680.991.18630.931.18300.991.12350.98
222.12021.001.23860.961.05820.931.23510.981.17360.97
231.92830.991.23691.001.20841.001.24411.001.21671.00
242.13940.981.34100.981.28060.991.34350.991.31841.00
252.08520.990.41800.990.46570.990.41920.990.41670.99
262.05830.920.20410.980.40300.980.20410.980.20420.98
271.86220.991.46311.001.45330.991.47931.001.44820.99
282.08341.001.13120.991.08711.001.13210.991.11590.99

Note: D = fractal dimension; ID = network identification; and R2 = coefficient of determination.

Fig. 11. Output of fractal analysis of OHGS and of nonoptimal HGSs for El Overo network.
Fig. 12. Fractal dimension values of OHGSs and nonoptimal HGSs.
Fig. 12 also suggests that each WDN can be classified into two groups depending on the fractal dimension of their corresponding OHGS. On the one hand, it was found that in 64.29% of the case studies, the fractal dimension of the OHGS was greater than or approximately equal to the third quartile of the data set. This means that the fractal dimension of the OHGS was greater than at least 75% of the fractal dimension values of the nonoptimal HGSs in these cases. Two Loops, Two Reservoirs, Taichung, Jilin, Hanoi, Blacksburg, Fossolo, R28, Pescara, Modena, El Overo, San Vicente, Cazucá, Toro, Bugalagrande, Carmen del Viboral, Morrorico Bajo, and La Enea are among this first group. On the other hand, it was found that in 35.71% of the case studies the fractal dimension of the OHGS was between the first quartile and the median of the data set. This means that the fractal dimension of the OHGS was only greater than 25%–50% of the fractal dimension values of the nonoptimal HGSs in these cases. New York Tunnels, BakRyan, Balerma, La Uribe, Elevada, Andalucía Alta, La Cumbre, Andalucía Baja, Candelaria, and Chinú are among this second group.
Moreover, the fractal dimension of the underlying structure of the optimized networks, for each calculation criterion, are also presented in Table 2 with their corresponding coefficients of determination from the least-squares linear regressions over the analyzed log NB versus log lB data sets. Table 2 shows that the underlying structure of the optimized WDNs exhibits a fractal behavior since a strong linear relationship was found between log NB and log lB for the four calculation criteria. Although the R2 coefficients were not always over 0.95, this was not interpreted as a complete absence of the fractal behavior but as the presence of self-similarity to a lesser extent. Fig. 13 shows the relationship between the fractal dimension of the OHGSs and the fractal dimension of the corresponding optimized networks, including Pearson correlation coefficients and distance correlation coefficients to characterize the statistical dependency between both quantities. The distance correlation coefficients were calculated as explained by Székely et al. (2007). Two important findings can be identified in Fig. 13. First, although the calculated Pearson correlation coefficients showed a weak linear relationship between the two parameters, a positive correlation was also identified. Second, since the distance correlation coefficients were greater than zero, neither quantity was independent, and a nonlinear relationship existed between the two.
Fig. 13. Comparison between fractal dimension of OHGS and fractal dimension of optimized networks.
Lastly, the fractal dimension of the underlying structure of the nonoptimal designs was calculated involving the flow, energy, and infrastructure criterion. Since the computed fractal dimension by the topological criterion does not change between the optimal and nonoptimal designs for a given network, this criterion was not used to analyze the nonoptimal solutions. Table 3 presents a summary of the main features of this data set by including the cumulative frequency at the fractal dimension of the optimized network, i.e., the number of nonoptimal designs in which the fractal dimension of their underlying structure is less than or equal to the fractal dimension of the optimized network, the standard deviation of the data set, and the minimum and maximum computed fractal dimensions for each WDN to illustrate the statistical range of the data. The cumulative frequencies show that in 64.29%, 75%, and 57.14% of the case studies, the fractal dimension of the optimized network was greater than or equal to at least six of the fractal dimension values of the nonoptimal networks when using the flow, energy, and infrastructure calculation criterion, respectively. The individual fractal dimension values and coefficients of determination for each WDN design are presented in Tables S22S27.
Table 3. Summary of main outcomes from fractal analysis of underlying structure of nonoptimal designs
IDFlow criterionEnergy criterionInfrastructure criterion
CFσDminDmaxCFσDminDmaxCFσDminDmax
190.0510.92211.097740.0311.13941.198170.0850.92211.1981
2100.0540.93111.051720.0031.23191.2386100.0430.93821.0317
320.0141.07451.1126100.0001.27681.2768100.0531.13681.2996
490.0141.15381.208880.0061.37551.394420.0631.25171.3944
580.0071.06051.0794100.0041.19981.210760.0061.21421.2274
690.0681.25371.4391100.0031.40591.415840.0601.23271.4391
7100.0470.93121.052480.0101.03891.068310.0101.02961.0617
890.0681.07341.3098100.0001.30181.3018100.0361.19341.3073
980.0091.27601.3039100.0041.43961.449570.0391.35081.4670
1070.0331.18071.294440.0141.31141.354900.0171.29801.3549
1100.0370.92521.0354100.0050.59560.610510.0440.85400.9949
1270.0121.19161.228370.0111.23221.2596100.0161.21681.2676
1320.0010.56960.5728100.0030.58160.587750.0020.57440.5816
14100.0011.15421.1575100.0111.10711.127460.0161.08421.1285
15100.0001.24431.244350.0041.21631.225620.0221.18351.2636
16100.0000.61920.619280.0020.10860.1141100.0830.42800.6558
1740.0261.15361.243120.0031.16521.174230.0341.09611.2030
1870.0150.93930.998320.0121.00161.039280.0160.97431.0280
1970.0141.27941.3363100.0061.25541.274730.0421.22871.3286
2010.0081.11411.143050.0121.15191.191270.0281.06151.1623
2120.0341.17581.267480.0021.18091.187200.0201.12351.1880
2240.0381.03171.131880.0041.22391.235320.0341.15171.2573
23100.0111.17171.208490.0011.24101.245570.0101.18981.2278
24100.0201.20511.280690.0011.34351.347570.0301.24031.3376
25100.0200.41520.4657100.0000.41840.419260.0020.41250.4191
2680.0000.40230.403370.0000.20410.204290.0000.20360.2043
2720.0261.44891.523980.0151.45221.488250.0081.43371.4588
2810.0321.08711.179570.0011.13211.135270.0081.09361.1182

Note: CF = cumulative frequency; D = fractal dimension; ID = network identification; and σ = standard deviation.

Discussion

Some important points can be made based on the trends depicted in Fig. 7. As for the mean, the observed behavior was expected considering that a more expensive design implies larger diameters. In relation to the standard deviation, the observed behavior can be explained considering that the calculated least-cost designs consist of a homogeneous set of smaller available diameters, while the nonoptimal solutions exhibit a greater dispersion considering that the corresponding sets of diameters involve a mix of small and large diameter values as randomly selected by the GA. The only two exceptions were Hanoi and Jilin. In these cases, the standard deviation was smaller in the nonoptimal designs considering that these solutions consisted of homogeneous sets of the larger available diameters.
Relevant findings were identified in the fractal analysis of the HGSs (Table 2, Figs. 11 and 12). In this context, the presence of self-similarity in the HGS means that the energy dissipation pattern that characterizes a specific WDN design tends to repeat itself throughout the network regardless of the scale on which the networks are analyzed. A greater fractal dimension in this context means a rougher and more tortuous energy dissipation pattern. In terms of the WDN classification suggested by Fig. 12, the observed behaviors can be explained as follows. On the one hand, for the cases in which the fractal dimension of the OHGS was generally greater than the fractal dimension of the nonoptimal HGSs, the OHGSs showed a higher degree of irregularity in accordance with the nature of the energy use in a least-cost design. Given that an optimal design is characterized by the predominance of the smaller available diameters and considering that the friction slope in a pipe is inversely related to its diameter (Saldarriaga 2016), it was expected that steeper hydraulic gradients would be found in the optimal solutions considering that smaller diameters induce higher frictional losses. As a result, the OHGSs exhibited a rougher and more tortuous morphology with sharper peaks, concavities, and abrupt head losses that translate into a higher fractal dimension. Figs. 8 and 9 display these observations for R28 and Cazucá networks by depicting the attenuation of the irregular morphology between the OHGS and the HGS of the most expensive design due to the increase of the pipe diameters and the consequent decrease of the energy losses throughout the network.
On the other hand, for the cases in which the fractal dimension of the OHGS was generally smaller than the fractal dimension of the nonoptimal HGSs, four features of these systems may be involved in the observed results. First, an elongated and stretched appearance was typical in the topological structure of these networks. Second, the nodal flow demands and pipe diameters in the corresponding designs induced the generation of HGSs with a flat structure, like a geometrical plane, as exemplified in Fig. 10. It is plausible that the performance of the variation estimation method may be compromised when no significant peaks or concavities are present in the HGSs. Third, some of these networks had an atypical connectivity, for instance, New York Tunnels and La Uribe. Finally, some of these networks had an atypical flow pattern, for instance, Balerma and Elevada, with the same flow demands in almost all nodes.
The fractal analysis of the underlying structure of the WDNs (Table 2 and Fig. 13) provided additional details to discuss. The identified self-similar behavior, as shown by the fractal dimensions of the network and the R2 coefficients, can be understood as the presence of scale invariance in the spatial arrangement of nodes and pipes and how they are connected (topological criterion) (Di Nardo et al. 2017), in the way in which the available discharge (flow criterion) and piezometric head (energy criterion) were distributed throughout the networks, and in the spatial distribution of the calculated diameters (infrastructural criterion). Another aspect to consider is that a greater fractal dimension in this context should be understood as a more dispersed spatial distribution of the nodes and pipes, a more uneven distribution of the available flow and energy or a more heterogeneous set of pipe sizes, depending on the chosen calculation criterion. In addition, the positive correlation between the fractal dimension of the OHGSs and the fractal dimension of the corresponding optimized networks, as shown by the Pearson coefficients, imply that an increase in the irregularity of the cost-optimized network, in terms of its hydraulic behavior, spatial arrangement, and its diameter values, translates into a rougher energy dissipation pattern, as depicted in the corresponding OHGS. In terms of the distance correlation coefficients, the existence of a nonlinear relationship shows that the fractal behavior in the topological structure, flow, energy, and diameter size distribution in the optimized network somehow influences the energy dissipation phenomenon exhibited in the OHGS.
These findings provide a hint as to some possible applications of the fractal analysis of HGSs in the context of WDNs. First, the fractal dimension may be used as an additional fitness measure to include in new or existing WDN capital cost-optimization algorithms. Since it was found that a higher degree of irregularity in the HGS was associated with a least-cost design, the fractal dimension may be used as a parameter to maximize during the calculation of the optimal set of pipe diameters. Moreover, optimization algorithms may also take advantage of the fact that the fractal dimension of the OHGS is influenced by the fractal properties in the hydraulic behavior of the WDNs, as shown in Fig. 13, to search for suitable diameter configurations that induce a higher degree of irregularity or unevenness in the flow and energy distribution inside a given WDN. Second, the fractal analysis of the HGS may be used in the operational improvement of WDNs. Prospective work can be done to identify how the fractal behavior of the HGS of a given network should be to accomplish a better performance in terms of water quality, reliability, reduction of water leakage, and operational cost. In this case, the fractal dimension of the HGS can be used as a parameter to guide the adjustment of a given WDN via valve operation, asset management, and renewal planning to establish the ideal hydraulic behavior.
Finally, there is Table 3. The cumulative frequencies show a similar outcome to what was found in the case of the OHGS, where the least-cost design presented a higher fractal dimension in comparison with the nonoptimal HGSs. In terms of the flow and energy criterion, the results may imply that a greater degree of irregularity or unevenness in the distribution of the available discharge and energy is associated with an optimal design. In relation to the infrastructure criterion, one would suspect that the higher dispersion in diameter values for the nonoptimal designs, as established in Fig. 7, would translate into a greater fractal dimension; however, the opposite was found. This can be explained considering that the individual weight of a node, when the infrastructure criterion is used, is affected not only by the magnitude of the surrounding diameters but also by the number of pipes connected to the node, thereby inducing a spatial irregularity in the individual weights when nodes with a different number of connected pipes are present in the network. Nevertheless, it is very important to mention that, in many of the analyzed case studies, multiple designs presented the same fractal dimension. The standard deviation values, as presented in Table 3, support this statement considering that a very small dispersion was found in each data set. This situation may be attributed to two feasible causes. First, it is possible that the proposed box-covering algorithm may have difficulty detecting the difference between one design and another in terms of their fractal properties and their corresponding hydraulic behavior. Second, it is plausible that there are no noticeable differences between the fractal properties of the involved network designs whatsoever. This issue should be addressed in future work before applying these findings to the optimal design and operational improvement of WDNs.

Conclusions

In this paper, a fractal analysis methodology for the OHGS and the underlying structure of a WDN was presented. Multiple gravity-driven benchmark and Colombian networks with different topographical, topological, and energy availability conditions were designed so as to identify a least-capital-cost solution and several nonoptimal alternatives in accordance with the minimum pressure requirements and nodal flow demands. The OHGS and nonoptimal HGSs were successfully calculated for each network by conducting a numerical interpolation procedure, whereas the calculation of the corresponding fractal dimension was accomplished by the employment of the variation estimation method. Moreover, the fractal dimension of the underlying structure of each network design was estimated using an adapted greedy box-covering algorithm in which topological and hydraulic criteria were involved. Although the overall performance of the proposed fractal analysis algorithms was satisfactory, prospective work could be done to improve the accuracy and sensitivity of the chosen procedures. In addition, future work should also include the analysis of additional networks in which pumping devices are included.
The results show that the OHGS exhibited fractal properties that suggested a self-similar behavior in the energy dissipation pattern of least-cost design. In 64.29% of the case studies, the fractal dimension of the OHGS was greater than at least 75% of the fractal dimension values of the nonoptimal HGS; thus, the way in which the available energy is used in the least-cost design of these systems favors a steeper and sharper hydraulic gradient that translates to OHGSs with a rougher morphology. The behavior in the remaining 35.71% case studies, where the fractal dimension of the OHGS was only greater than 25%–50% of the fractal dimension values of the nonoptimal HGS, may be explained by the topological structure, nodal flow demand pattern, and the planelike morphology of the corresponding HGSs. However, prospective work should be done to identify additional details to explain the occurrence of these exceptions. In addition, the results also indicate a growing nonlinear relationship between the fractal dimension of the OHGS and the fractal dimension of the optimized networks for any of the four calculation criteria: topological, flow, energy, and infrastructure. Hence, the sparseness of the nodes and pipes, the heterogeneity in the diameter values, and the unevenness in the distribution of the available flow and energy in an optimized design affect the geometrical properties of the OHGS. Furthermore, the results show that the fractal dimension of the underlying structure of the optimized networks using the flow, energy, and infrastructure calculation criterion was greater than or equal to six or more fractal dimension values of the nonoptimal designs in 64.29%, 75%, and 57.14% of the case studies, respectively. This implies that the hydraulic behavior of a least-cost design exhibited, in most of the case studies, a higher degree of irregularity in the distribution of the available flow and energy and in the diameter values compared to a more expensive design. However, it is also necessary to consider that, in many networks, some designs exhibited an identical fractal dimension. This suggests either that the chosen algorithm may be incapable of identifying the differences between some designs or that there is no difference in the fractal behavior of the involved designs at all. Prospective work should address this issue.
The principal outcomes of this study suggest that the fractal analysis of the HGS and of the underlying structure of a given network may have useful applications in the context of WDN capital cost optimization and operational improvement. Since a least-cost WDN design exhibits a particular fractal behavior that is related to its inherent hydraulic properties, the fractal dimension may be used as an additional fitness measure to guide new or existing optimization algorithms. In relation to operational improvement applications, forthcoming research may use the fractal analysis as a tool to identify how a given WDN design should be operated, modified, or renewed in order to enhance the hydraulic performance of the network and reduce the operational cost.

Notation

The following symbols are used in this paper:
CT
total water pipe cost of water distribution network;
D
fractal dimension;
dCor
distance correlation coefficient;
dCij
diameter of pipe i that converges in node j in water distribution network;
di
diameter of pipe i in water distribution network;
HGLj
piezometric head over node j in water distribution network;
K
coefficient for water pipe cost calculation;
K0
total number of nodes in water distribution network;
L
side length of moving box in fractal analysis of hydraulic gradient surface;
LC
least-cost design of water distribution network;
lB
box size in fractal analysis of water distribution network;
li
length of pipe i in water distribution network;
Mδ(F)
measurement of any fractal F at arbitrary scale δ;
m
slope of least-squares regression line;
NO
nonoptimal design of water distribution network;
NP
total number of pipes in water distribution network;
NB
minimum number of required boxes of size lB to cover water distribution network;
n
exponent for water pipe cost calculation;
QCij
flow rate from pipe i that enters node j in water distribution network;
R2
coefficient of determination;
s
sample standard deviation;
V(ε)
mean variation of hydraulic gradient surface at scale ε;
wj
individual weight of node j in water distribution network;
δ
scale of analysis;
ε
radius of moving box in fractal analysis of an hydraulic gradient surface;
μ
mean value;
ρ
Pearson correlation coefficient; and
σ
standard deviation.

Supplemental Materials

File (supplemental_materials_wr.1943-5452.0001608_jaramillo.pdf)

Data Availability Statement

Some or all data, models, and code generated or used during the study are available in a repository online in accordance with funder data retention policies. The available materials are EPANET data files, Excel data files, and Python scripts to generate figures and tables. The materials can be found in the following repository: https://doi.org/10.5281/zenodo.6634751.

Reproducible Results

Figs. 1–3, 6–12, and S1S40 and Tables 2, 3, and S15S19 can be reproduced by accessing the uploaded material in Jaramillo (2022). Arturo Rodriguez (Research Assistant, Master’s Student in Structural Engineering, Universidad de los Andes) ran all scripts and reproduced all tables and figures.

Acknowledgments

The authors would like to thank PAVCO Wavin for providing essential information for the development of the research work as well as for their constant support in investigation activities concerning water supply.

References

Abdalfattah, S. F., Y. M. Makeen, I. Abdulbariu, and H. A. Ayinla. 2019. “Basic gravity geophysical processing and display in MATLAB: Application on NE African Sudanese Red Sea Province.” J. Afr. Earth. Sci. 150 (Nov): 346–354. https://doi.org/10.1016/j.jafrearsci.2018.10.018.
Alperovits, E., and U. Shamir. 1977. “Design of optimal water distribution systems.” Water Resour. Res. 13 (6): 885–900. https://doi.org/10.1029/WR013i006p00885.
Barber, C. B., D. P. Dobkin, and H. Huhdanpaa. 1996. “The quickhull algorithm for convex hulls.” ACM Trans. Math. Software 22 (4): 469–483. https://doi.org/10.1145/235815.235821.
Bi, W., and G. C. Dandy. 2014. “Optimization of water distribution systems using online retrained metamodels.” J. Water Resour. Plan. Manage. 140 (11): 04014032. https://doi.org/10.1061/(ASCE)WR.1943-5452.0000419.
Bishop-Taylor, R., S. Sagar, L. Lymburner, and R. J. Beaman. 2019. “Between the tides: Modelling the elevation of Australia´s exposed intertidal zone at continental scale.” Estuarine Coastal Shelf Sci. 223 (31): 115–128. https://doi.org/10.1016/j.ecss.2019.03.006.
Bisoi, A. K., and J. Mishra. 2001. “On calculation of fractal dimension of images.” Pattern Recognit. Lett. 22 (6–7): 631–637. https://doi.org/10.1016/S0167-8655(00)00132-X.
Bragalli, C., C. D’Ambrosio, J. Lee, A. Lodi, and P. Toth. 2012. “On the optimal design of water distribution networks: A practical MINLP approach.” Optim. Eng. 13 (2): 219–246. https://doi.org/10.1007/s11081-011-9141-7.
Clarke, K. C. 1986. “Computation of the fractal dimension of topographic surfaces using the triangular prism surface area method.” Comput. Geosci. 12 (5): 713–722. https://doi.org/10.1016/0098-3004(86)90047-6.
Cunha, M., J. Marques, E. Creaco, and D. Savic. 2019. “A dynamic adaptive approach for water distribution network design.” J. Water Resour. Plan. Manage. 145 (7): 04019026. https://doi.org/10.1061/(ASCE)WR.1943-5452.0001085.
Cunha, M. C., and L. Ribeiro. 2004. “Tabu search algorithms for water network optimization.” Eur. J. Oper. Res. 157 (3): 746–758. https://doi.org/10.1016/S0377-2217(03)00242-X.
Cunha, M. C., and J. Sousa. 1999. “Water distribution network design optimization: Simulated annealing approach.” J. Water Resour. Plan. Manage. 125 (4): 215–221. https://doi.org/10.1061/(ASCE)0733-9496(1999)125:4(215).
Dandy, G. C., A. R. Simpson, and L. J. Murphy. 1996. “An improved genetic algorithm for pipe network optimization.” Water Resour. Res. 32 (2): 449–458. https://doi.org/10.1029/95WR02917.
Diao, K., D. Butler, and B. Ulanicki. 2017. “Fractality in water distribution networks.” In Proc., 15th Int. Computing and Control for the Water Industry (CCWI). Sheffield, England: Univ. of Sheffield.
Di Nardo, A., M. Di Natale, C. Giudicianni, R. Greco, and G. F. Santonastaso. 2017. “Complex network and fractal theory for the assessment of water distribution network resilience to pipe failures.” Water Sci. Technol. Water Supply 18 (3): 767–777. https://doi.org/10.2166/ws.2017.124.
Edgar, G. 2008. Measure, topology and fractal geometry. New York: Springer.
Erkal, B. G., and J. F. Hajjar. 2017. “Laser-based surface damage detection and quantification using predicted surface properties.” Autom. Constr. 83 (Oct): 285–302. https://doi.org/10.1016/j.autcon.2017.08.004.
Ezzeldin, R., B. Djebedjian, and T. Saafan. 2013. “Integer discrete particle swarm optimization of water distribution networks.” J. Pipeline Syst. Eng. 5 (1): 04013013. https://doi.org/10.1061/(ASCE)PS.1949-1204.0000154.
Falconer, K. 1990. Fractal geometry: Mathematical foundations and applications. West Sussex, England: Wiley.
Falconer, K. 1997. Techniques in fractal geometry. West Sussex, England: Wiley.
Farmani, R., R. Abadia, and D. Savic. 2007. “Optimum design and management of pressurized branched irrigation networks.” J. Irrig. Drain. Eng. 133 (6): 528–537. https://doi.org/10.1061/(ASCE)0733-9437(2007)133:6(528).
Featherstone, R. E., and K. K. El-Jumaily. 1983. “Optimal diameter selection for pipe networks.” J. Hydraul. Eng. 109 (2): 221–234. https://doi.org/10.1061/(ASCE)0733-9429(1983)109:2(221).
Fujiwara, O., and D. Khang. 1990. “A two-phase decomposition methods for optimal design of looped water distribution networks.” Water Resour. Res. 26 (4): 539–549. https://doi.org/10.1029/WR026i004p00539.
Geem, Z. W. 2008. “Particle-swarm harmony search for water network design.” Eng. Optim. 41 (4): 297–311. https://doi.org/10.1080/03052150802449227.
Gessler, J. 1985. “Pipe network optimization by enumeration.” In Proc., Computer Applications in Water Resources, 572–581. New York: ASCE.
Giudicianni, C., A. Di Nardo, R. Greco, and A. Scala. 2021. “A community-structure-based method for estimating the fractal dimension, and its application to water networks for the assessment of vulnerability to disasters.” Water Resour. Manage. 35 (4): 1197–1210. https://doi.org/10.1007/s11269-021-02773-y.
Harris, C. R., K. J. Millman, S. J. van der Walt, R. Gommers, P. Virtanen, and D. Cournapeau. 2020. “Array programming with NumPy.” Nature 585 (Feb): 357–362. https://doi.org/10.1038/s41586-020-2649-2.
Hunter, J. D. 2007. “Matplotlib: A 2D graphics environment.” Comput. Sci. Eng. 9 (3): 90–95. https://doi.org/10.1109/MCSE.2007.55.
Iwanek, M., D. Kowalski, B. Kowalska, and P. Suchorab. 2020. “Fractal geometry in designing and operating water networks.” J. Ecol. Eng. 21 (6): 229–236. https://doi.org/10.12911/22998993/123501.
Jaramillo, A. 2020. Análisis de la geometría fractal de la superficie óptima de presiones en el diseño optimizado de redes de distribución de agua potable [Analysis of the fractal geometry of the Optimal Pressure Surface in the optimized design of water distribution networks]. [In Spanish.] Bogotá, Colombia: Universidad de los Andes.
Jaramillo, A. 2022. FractalAnalysis_OHGS_v3: v.4. Bogotá, Colombia: Universidad de los Andes. https://doi.org/10.5281/zenodo.6634751.
Jian-Hua, L., Y. Bo-Ming, and Z. Ming-Qing. 2009. “A model for fractal dimension of rough surfaces.” Chin. Phys. Lett. 26 (11): 116101. https://doi.org/10.1088/0256-307X/26/11/116101.
Ju, W., and N. S.-N. Lam. 2009. “An improved algorithm for computing local fractal dimension using the triangular prism method.” Comput. Geosci. 35 (6): 1224–1233. https://doi.org/10.1016/j.cageo.2008.09.008.
Kadu, M. S., R. Gupta, and P. R. Bhave. 2008. “Optimal design of water distribution networks using a modified genetic algorithm with reduction in search space.” J. Water Resour. Plan. Manage. 134 (2): 147–160. https://doi.org/10.1061/(ASCE)0733-9496(2008)134:2(147).
Kim, J. S., K. I. Goh, G. Salvi, E. Oh, B. Kahng, and D. Kim. 2007. “Fractality in complex networks: Critical and supercritical skeletons.” Phys. Rev. E 75 (1): 016110. https://doi.org/10.1103/PhysRevE.75.016110.
Kowalska, B., D. Kowalski, and H. Ewa. 2020. “Fractal-heuristic method of water quality sensor locations in water supply network.” Water 12 (3): 832. https://doi.org/10.3390/w12030832.
Kowalski, D., B. Kowalska, T. Blawucki, P. Suchorab, and K. Gaska. 2019. “Impact assessment of distribution network layout on the reliability of water delivery.” Water 11 (3): 480. https://doi.org/10.3390/w11030480.
Kyriakou, M. S., and S. G. Vrachimis. 2019. “EPANET-benchmarks.” Accessed July 25, 2020. https://github.com/KIOS-Research/EPANET-Benchmarks.
Lam, N. S. N., H. Qium, D. A. Quattrochi, and C. W. Emerson. 2002. “An evaluation of fractal methods for characterizing image complexity.” Cartogr. Geogr. Inf. Sci. 29 (1): 25–35. https://doi.org/10.1559/152304002782064600.
Lansey, K. E., and L. W. Mays. 1989. “Optimization model for water distribution system design.” J. Hydraul. Eng. 115 (10): 1401–1418. https://doi.org/10.1061/(ASCE)0733-9429(1989)115:10(1401).
Lee, S. C., and S. I. Lee. 2001. “Genetic algorithms for optimal augmentation of water distribution networks.” J. Korea Water Resour. Assoc. 34 (5): 567–575.
Lin, M. D., Y. H. Liu, G. F. Liu, and C. W. Chu. 2007. “Scatter search heuristic for least-cost design of water distribution networks.” Eng. Optim. 39 (7): 857–876. https://doi.org/10.1080/03052150701503611.
Liu, H., C. A. Shoemaker, Y. Jiang, G. Fu, and C. Zhang. 2020. “Preconditioning water distribution network optimization with head loss-based design method.” J. Water Resour. Plan. Manage. 146 (12): 04020093. https://doi.org/10.1061/(ASCE)WR.1943-5452.0001299.
Lopez-Giraldo, S., and J. Saldarriaga. 2004. “Optimal cost potable water network distribution design with genetic algorithms.” In Proc., World Water and Environmental Resources Congress 2004. Reston, VA: ASCE.
Mandelbrot, B. 1977. Fractals: Form, chance and dimension. San Francisco: W.H. Freeman and Company.
Mandelbrot, B. 1983. The fractal geometry of nature. New York: W.H. Freeman and Company.
Marchi, A., G. Dandy, A. Wilkins, and H. Rohrlach. 2014. “Methodology for comparing evolutionary algorithms for optimization of water distribution systems.” J. Water Resour. Plan. Manage. 140 (1): 22–31. https://doi.org/10.1061/(ASCE)WR.1943-5452.0000321.
Mitchell, M. 1999. An introduction to genetic algorithm. Cambridge, MA: Massachusetts Institute of Technology.
Montesinos, P., A. Garcia-Guzman, and J. L. Ayuso. 1999. “Water distribution network optimization using a modified genetic algorithm.” Water Resour. Res. 35 (11): 3467–3473. https://doi.org/10.1029/1999WR900167.
Moosavian, N., and B. J. Lence. 2020. “Flow-uniformity index for reliable-based optimal design of water-distribution networks.” J. Water Resour. Plan. Manage. 146 (3): 04020005. https://doi.org/10.1061/(ASCE)WR.1943-5452.0001161.
Ormsbee, L., and T. Walski. 2016. “Darcy-Weisbach versus Hazen-Williams: No Calm in West Palm.” In Proc., World Environmental and Water Resources Congress 2016. Reston, VA: ASCE.
Páez, D., D. Hernández, and J. Saldarriaga. 2013. “Optimal design of pipes in series with pressure driven demands.” In Proc., World Environmental and Water Resources Congress 2013: Showcasing the Future, 857–868. Reston, VA: ASCE.
Páez, D., C. Salcedo, A. Garzón, M. A. González, and J. Saldarriaga. 2020. “Use of energy-based domain knowledge as feedback to evolutionary algorithms for the optimization of water distribution networks.” Water 12 (11): 3101. https://doi.org/10.3390/w12113101.
Páez, D., J. Saldarriaga, L. López, and C. Salcedo. 2014. “Optimal design of water distribution systems with pressure driven demands.” Procedia Eng. 89 (Nov): 839–847. https://doi.org/10.1016/j.proeng.2014.11.515.
Persson, B. N. J. 2014. “On the fractal dimension of rough surfaces.” Tribol. Lett. 54 (1): 99–106. https://doi.org/10.1007/s11249-014-0313-4.
Prasad, T. D., and N. S. Park. 2004. “Multiobjective genetic algorithms for design of water distribution networks.” J. Water Resour. Plan. Manage. 130 (1): 73–82. https://doi.org/10.1061/(ASCE)0733-9496(2004)130:1(73).
Przestacki, D., R. Majchrowski, and L. Marciniak-Podsadna. 2016. “Experimental research of surface roughness and surface texture after laser cladding.” Appl. Surf. Sci. 388 (Apr): 420–423. https://doi.org/10.1016/j.apsusc.2015.12.093.
Qiu, M., M. Housh, and A. Ostfeld. 2021. “Analytical optimization approach for simultaneous design and operation of water distribution-systems optimization.” J. Water Resour. Plan. Manage. 147 (3): 06020014. https://doi.org/10.1061/(ASCE)WR.1943-5452.0001330.
Reca, J., and J. Martínez. 2006. “Genetic algorithms for the design of looped irrigation water distribution networks.” Water Resour. Res. 42 (5): W05416. https://doi.org/10.1029/2005WR004383.
Reca, J., J. Martínez, C. Gil, and R. Baños. 2008. “Application of several meta-heuristic techniques to the optimization of real looped water distribution networks.” Water Resour. Manag. 22 (10): 1367–1379. https://doi.org/10.1007/s11269-007-9230-8.
Saldarriaga, J. 2016. Hidráulica de Tuberías: Abastecimiento de Agua, Redes y Riegos [Pipeline Hydraulics: Water Supply, Networks and Irrigation]. [In Spanish.] Bogotá, Colombia: Alfaomega.
Saldarriaga, J., D. Páez, P. Cuero, and N. León. 2013. “Optimal design of water distribution networks using mock open tree topology.” In Proc., World Environmental and Water Resources Congress 2013: Showcasing the Future, 869–880. Reston, VA: ASCE.
Saldarriaga, J., D. Páez, N. León, L. López, and P. Cuero. 2014. “Historical development of power used methods for WDS design and their evolution towards optimization metaheuristics.” Procedia Eng. 70 (Feb): 1470–1484. https://doi.org/10.1016/j.proeng.2014.02.162.
Saldarriaga, J., D. Páez, N. León, L. López, and P. Cuero. 2015. “Power use methods for optimal design of WDS: History and their use as post-optimization warm starts.” J. Hydroinfor. 17 (3): 404–421. https://doi.org/10.2166/hydro.2014.013.
Saldarriaga, J., D. Páez, C. Salcedo, P. Cuero, L. L. López, N. León, and D. Celeita. 2020. “A direct approach for the near-optimal design of water distribution networks based on power use.” Water 12 (4): 1037. https://doi.org/10.3390/w12041037.
Saldarriaga, J., L. Pulgarín, P. Cuero, and N. Duque. 2017. “Pipeline hydraulics academic software.” [In Spanish.] In Proc., IBERO-American Seminar on Water and Drainage Networks (SEREA 2017). Bogotá, Colombia: Universidad de los Andes.
Saldarriaga, J., S. Takahashi, F. Hernández, D. M. Díaz, and S. Ochoa. 2010. “An energy methodology for the design of water distribution systems.” In Proc., World Environmental and Water Resources Congress 2010: Challenges of Change. Reston, VA: ASCE.
Saldarriaga, J., G. Villalba, and S. Takahashi. 2005. “Algorithms of combinatorial optimization applied to water distribution networks design.” In Proc., World Water and Environmental Resources Congress 2005. Reston, VA: ASCE.
Sarkar, N., and B. B. Chaudhuri. 1992. “An efficient approach to estimate fractal dimension of textural images.” Pattern Recognit. 25 (9): 1035–1041. https://doi.org/10.1016/0031-3203(92)90066-R.
Savic, D. A., and G. A. Walters. 1997. “Genetic algorithms for least-cost design of water distribution networks.” J. Water Resour. Plan. Manage. 123 (2): 67–77. https://doi.org/10.1061/(ASCE)0733-9496(1997)123:2(67).
Schaake, J., and D. Lai. 1969. Linear programming and dynamic programming application to water distribution network design, 69. Cambridge, MA: Massachusetts Institute of Technology.
Sherali, H. D., S. Subramanian, and G. V. Loganathan. 2001. “Effective relaxations and partitioning schemes for solving water distribution network design problems to global optimality.” J. Glob. Optim. 19 (1): 1–26. https://doi.org/10.1023/A:1008368330827.
Sirsant, S., and M. J. Reddy. 2020. “Assessing the performance of surrogate measures for water distribution network reliability.” J. Water Resour. Plan. Manage. 146 (7): 04020048. https://doi.org/10.1061/(ASCE)WR.1943-5452.0001244.
Sivanandam, S. N., and S. N. Deepa. 2008. Introduction to genetic algorithms. New York: Springer.
Song, C., L. K. Gallos, S. Havlin, and H. A. Makse. 2007. “How to calculate the fractal dimension of a complex network: The box covering algorithm.” J. Stat. Mech: Theory Exp. 2007 (3): P03006. https://doi.org/10.1088/1742-5468/2007/03/P03006.
Spasic, S. 2014. “On 2D generalization of Higuchi’s fractal dimension.” Chaos Solitons Fractals 69 (Sep): 179–187. https://doi.org/10.1016/j.chaos.2014.09.015.
Sun, W., G. Xu, P. Gong, and S. Liang. 2006. “Fractal analysis of remotely sensed images: A review of methods and applications.” Int. J. Remote Sens. 27 (22): 4963–4990. https://doi.org/10.1080/01431160600676695.
Sung, Y. H., M. D. Lin, Y. H. Lin, and Y. L. Liu. 2007. “Tabu search solution of water distribution network optimization.” J. Environ. Manage. 17 (3): 177–187.
Székely, G. J., M. L. Rizzo, and N. K. Bakirov. 2007. “Measuring and testing dependence by correlation of distances.” Ann. Stat. 35 (6): 2769–2794. https://doi.org/10.1214/009053607000000505.
Todini, E., and S. Pilati. 1987. “A gradient algorithm for the analysis of pipe networks.” In Computer applications in water supply: Volume 1—Systems analysis and simulation, 1–20. New York: Wiley.
Tolle, C. R., T. R. McJunkin, and D. J. Gorsich. 2003. “Suboptimal minimum cluster volume cover-based method for measuring fractal dimension.” IEEE Trans. Pattern Anal. Mach. Intell. 25 (1): 32–41. https://doi.org/10.1109/TPAMI.2003.1159944.
Vargas, K., C. Salcedo, and J. Saldarriaga. 2019. “Dimensión fractal e identificación de potenciales sectores de servicio en redes de distribución de agua potable utilizando criterios hidráulicos. [Fractal dimension and identification of potential service sectors in water distribution networks using hydraulic criteria].” [In Spanish.] Revista Recursos Hídricos 40 (2): 27–38. https://doi.org/10.5894/rh40n2-cti3.
Vargas, K., and J. Saldarriaga. 2019. “Analysis of fractality in water distribution networks using hydraulic criteria.” In Proc., World Environmental and Water Resources Congress 2019. Reston, VA: ASCE.
Virtanen, P., et al.2020. “SciPy 1.0: Fundamental algorithms for scientific computing in Python.” Nat. Methods 17 (3): 261–272. https://doi.org/10.1038/s41592-019-0686-2.
Wang, Q., M. Guidolin, D. Savic, and Z. Kapelan. 2015. “Two-objective design of benchmark problems of a water distribution system via MOEAs: Towards the best-known approximation of the true Pareto front.” J. Water Resour. Plan. Manage. 141 (3): 04014060. https://doi.org/10.1061/(ASCE)WR.1943-5452.0000460.
Wen, T., and K. H. Cheong. 2021. “The fractal dimension of complex networks: A review.” Inform. Fusion 73 (Jan): 87–102. https://doi.org/10.1016/j.inffus.2021.02.001.
Wu, I. 1975. “Design of drip irrigation main lines.” J. Irrig. Drain. Div. 101 (4): 265–278. https://doi.org/10.1061/JRCEA4.0001064.
Zheng, F., A. R. Simpson, and C. Zecchin. 2011. “A combined NLP-differential evolution algorithm approach for the optimization of looped water distribution systems.” Water Resour. Res. 47 (8): 10394. https://doi.org/10.1029/2011WR010394.
Zhou, G., and N. S.-N. Lam. 2005. “A comparison of fractal dimension estimators based on multiple surface generation algorithms.” Comput. Geosci. 31 (10): 1260–1269. https://doi.org/10.1016/j.cageo.2005.03.016.

Information & Authors

Information

Published In

Go to Journal of Water Resources Planning and Management
Journal of Water Resources Planning and Management
Volume 149Issue 1January 2023

History

Received: Mar 4, 2021
Accepted: Jun 27, 2022
Published online: Nov 3, 2022
Published in print: Jan 1, 2023
Discussion open until: Apr 3, 2023

Authors

Affiliations

Researcher, Water Distribution and Sewerage Systems Research Center (CIACUA), Universidad de los Andes, Carrera 1 Este No. 19A-40, Bogotá 111711018, Colombia. ORCID: https://orcid.org/0000-0002-8035-935X. Email: [email protected]
Professor, Dept. of Civil and Environmental Engineering, Water Distribution and Sewerage Systems Research Center (CIACUA), Universidad de los Andes, Carrera 1 Este No. 19A-40, Bogotá 111711018, Colombia (corresponding author). ORCID: https://orcid.org/0000-0003-1265-2949. Email: [email protected]

Metrics & Citations

Metrics

Citations

Download citation

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited by

  • Two Iterative Methods for Sizing Pipe Diameters in Gas Distribution Networks with Loops, Computation, 10.3390/computation12020025, 12, 2, (25), (2024).
  • Journal of Water Resources Planning and Management’s Reproducibility Review Program: Accomplishments, Lessons, and Next Steps, Journal of Water Resources Planning and Management, 10.1061/JWRMD5.WRENG-6559, 150, 8, (2024).
  • A review of graph and complex network theory in water distribution networks: Mathematical foundation, application and prospects, Water Research, 10.1016/j.watres.2024.121238, 253, (121238), (2024).

View Options

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share