# Pipe network analysis

In fluid dynamics, pipe network analysis is the analysis of the fluid flow through a hydraulics network, containing several or many interconnected branches. The aim is to determine the flow rates and pressure drops in the individual sections of the network. This is a common problem in hydraulic design.

## Description

To direct water to many users, municipal water supplies often route it through a water supply network. A major part of this network will consist of interconnected pipes. This network creates a special class of problems in hydraulic design, with solution methods typically referred to as pipe network analysis. Water utilities generally make use of specialized software to automatically solve these problems. However, many such problems can also be addressed with simpler methods, like a spreadsheet equipped with a solver, or a modern graphing calculator.

## Deterministic network analysis

Once the friction factors of the pipes are obtained (or calculated from pipe friction laws such as the Darcy-Weisbach equation), we can consider how to calculate the flow rates and head losses on the network. Generally the head losses (potential differences) at each node are neglected, and a solution is sought for the steady-state flows on the network, taking into account the pipe specifications (lengths and diameters), pipe friction properties and known flow rates or head losses.

The steady-state flows on the network must satisfy two conditions:

1. At any junction, the total flow into a junction equals the total flow out of that junction (law of conservation of mass, or continuity law, or Kirchhoff's first law)
2. Between any two junctions, the head loss is independent of the path taken (law of conservation of energy, or Kirchhoff's second law). This is equivalent mathematically to the statement that on any closed loop in the network, the head loss around the loop must vanish.

If there are sufficient known flow rates, so that the system of equations given by (1) and (2) above is closed (number of unknowns = number of equations), then a deterministic solution can be obtained.

The classical approach for solving these networks is to use the Hardy Cross method. In this formulation, first you go through and create guess values for the flows in the network. These initial guesses must satisfy the Kirchhoff laws (1). That is, if Q7 enters a junction and Q6 and Q4 leave the same junction, then the initial guess must satisfy Q7 = Q6 + Q4. After the initial guess is made, then, a loop is considered so that we can evaluate our second condition. Given a starting node, we work our way around the loop in a clockwise fashion, as illustrated by Loop 1. We add up the head losses according to the Darcy–Weisbach equation for each pipe if Q is in the same direction as our loop like Q1, and subtract the head loss if the flow is in the reverse direction, like Q4. In other words, we add the head losses around the loop in the direction of the loop; depending on whether the flow is with or against the loop, some pipes will have head losses and some will have head gains (negative losses).

To satisfy the Kirchhoff's second laws (2), we should end up with 0 about each loop at the steady-state solution. If the actual sum of our head loss is not equal to 0, then we will adjust all the flows in the loop by an amount given by the following formula, where a positive adjustment is in the clockwise direction.

${\displaystyle \Delta Q=-{\frac {\sum {\scriptstyle {\text{head loss}}_{c}}-\sum {\scriptstyle {\text{head loss}}_{cc}}}{n\cdot (\sum {\frac {{\text{head loss}}_{c}}{Q_{c}}}+\sum {\frac {{\text{head loss}}_{cc}}{Q_{cc}}})}},}$

where

The clockwise specifier (c) means only the flows that are moving clockwise in our loop, while the counter-clockwise specifier (cc) is only the flows that are moving counter-clockwise.

This adjustment doesn't solve the problem, since most networks have several loops. It is okay to use this adjustment, however, because the flow changes won't alter condition 1, and therefore, the other loops still satisfy condition 1. However, we should use the results from the first loop before we progress to other loops.

An adaptation of this method is needed to account for water reservoirs attached to the network, which are joined in pairs by the use of 'pseudo-loops' in the Hardy Cross scheme. This is discussed further on the Hardy Cross method site.

The modern method is simply to create a set of conditions from the above Kirchhoff laws (junctions and head-loss criteria). Then, use a Root-finding algorithm to find Q values that satisfy all the equations. The literal friction loss equations use a term called Q2, but we want to preserve any changes in direction. Create a separate equation for each loop where the head losses are added up, but instead of squaring Q, use |QQ instead (with |Q| the absolute value of Q) for the formulation so that any sign changes reflect appropriately in the resulting head-loss calculation.

## Probabilistic network analysis

In many situations, especially for real water distribution networks in cities (which can extend between thousands to millions of nodes), the number of known variables (flow rates and/or head losses) required to obtain a deterministic solution will be very large. Many of these variables will not be known, or will involve considerable uncertainty in their specification. Furthermore, in many pipe networks, there may be considerable variability in the flows, which can be described by fluctuations about mean flow rates in each pipe. The above deterministic methods are unable to account for these uncertainties, whether due to lack of knowledge or flow variability.

For these reasons, a probabilistic method for pipe network analysis has recently been developed,[1] based on the maximum entropy method of Jaynes.[2] In this method, a continuous relative entropy function is defined over the unknown parameters. This entropy is then maximized subject to the constraints on the system, including Kirchhoff's laws, pipe friction properties and any specified mean flow rates or head losses, to give a probabilistic statement (probability density function) which describes the system. This can be used to calculate mean values (expectations) of the flow rates, head losses or any other variables of interest in the pipe network. This analysis has been extended using a reduced-parameter entropic formulation, which ensures consistency of the analysis regardless of the graphical representation of the network.[3] A comparison of Bayesian and maximum entropy probabilistic formulations for the analysis of pipe flow networks has also been presented, showing that under certain assumptions (Gaussian priors), the two approaches lead to equivalent predictions of mean flow rates.[4]

Other methods of stochastic optimization of water distribution systems rely on metaheuristic algorithms, such as simulated annealing[5] and genetic algorithms.[6]

## References

1. ^ S.H. Waldrip, R.K. Niven, M. Abel, M. Schlegel (2016), Maximum entropy analysis of hydraulic pipe flow networks, J. Hydraulic Eng ASCE, 142(9): 04016028, https://dx.doi.org/10.1061/(ASCE)HY.1943-7900.0001126#sthash.5ecR2Gts.dpuf
2. ^ Jaynes, E.T. (2003). Probability Theory: The Logic of Science. Cambridge University Press.
3. ^ Waldrip, S.H., Niven, R.K., Abel, M., Schlegel, M. (2017), Reduced-parameter method for maximum entropy analysis of hydraulic pipe flow networks, J. Hydraulic Eng ASCE, in press
4. ^ Waldrip, S.H., Niven, R.K. (2017), Comparison between Bayesian and maximum entropy analyses of flow networks, Entropy, 19(2): 58, https://dx.doi.org/10.3390/e19020058
5. ^ Cunha, Maria da Conceio; Sousa, Joaquim (1999). "Water Distribution Network Design Optimization: Simulated Annealing Approach". Journal of Water Resources Planning and Management. doi:10.1061/(asce)0733-9496(1999)125:4(215). ISSN 0733-9496.
6. ^ Montesinos, Pilar; Garcia‐Guzman, Adela; Ayuso, Jose Luis (1999). "Water distribution network optimization using a modified genetic algorithm". Water Resources Research. 35 (11): 3467–3473. doi:10.1029/1999WR900167. ISSN 1944-7973.