Implementation of graph theory based algorithms in water distribution network sectorization projects.

• Main Authors: Velitchko G. Tzatchkov, Víctor Hugo Alcocer Yamanaka
• Format: Article
• Language: Spanish
• Published: Instituto Mexicano de Tecnología del Agua 2011-08-01
• Series: Tecnología y ciencias del agua
• Subjects: sectorización de redes, modelos de redes de distribución, sistemas de abastecimiento de agua, algoritmos sobre grafos
• Online Access: http://www.revistatyca.org.mx/ojs/index.php/tyca/article/view/33
• ISSN: 0187-8336; 2007-2422

Water distribution network sectorization projects currently underway in many Mexican cities consist of dividing the city distribution network into smaller sub-networks, or sectors, with one or at most two water inlets per sector. To design the sectors, water distribution network models are used, which review whether the proposed sectorization can adequately function hydraulically. For large network sectorization projects, however, additional algorithmic capabilities are needed, such as connectivity analisys, zone of influence and the contribution of each source on consumption. This paper discusses efficient algorithms of this type based on graph theory, implemented in a computer system.