Graph-theoretic approach and sound engineering principles for design of district metered areas

Abstract

The design of district metered areas (DMAs) in existing water distribution networks, especially in urban areas, involves a high number of decision variables, and the effects of implementing them in districts have to be evaluated in order not to affect the quality of the service to customers. A new methodology for designing a given number of districts in looped water distribution networks is proposed here. It is based on graph theory and takes into account some important DMA design criteria: the maximum and minimum size recommended for a district, the connectedness of each district to the water supply source, and the absence of links between the districts. Therefore, it allows the creation of DMAs that are independent from each other. A recursive bisection procedure has been applied to create districts, while an algorithm for graph traversal has been used to verify whether each district can be reached from the water source and connectivity between the nodes. The successful application of the proposed methodology to a case study has proven its effectiveness for district metered areas design in real urban water distribution networks.