PARTICIONAMENTO DINÂMICO PARA PROCESSO DE SETORIZAÇÃO DE REDE DE DISTRIBUIÇÃO DE ÁGUA: UMA ABORDAGEM COMPARATIVA ENTRE OS ALGORITMOS FAST-GREEDY E LOUVAIN

Código

XXV-SBRH0811

Autores

Thomaz Felipe de Freitas Anchieta, Bruno Melo Brentan, GUSTAVO MEIRELLES LIMA

Tema

STE01 - Análise de Sistemas de Abastecimento de Água

Resumo

From the district metered area (DMA) design of water distribution networks (WDN) and flow control in the pipes, it is possible to regulate pressures, improve water quality, reduce leakage and obtain a more uniform distribution of demands. In general, DMA design is done in two steps, characterized, respectively, by the topological partitioning of the system and the allocation of control devices (pressure regulating and isolation valves), which physically guarantee this partitioning. However, several works in the literature show that the resilience of the supply system may be reduced and water quality may worsen with the implementation of fixed sectors, due to the increase of fluid paths in the pipes that are longer from the sources to the final consumers. However, a possible way to solve this increase in water residence time is to dynamically designed the WDN and, in this sense, in a first step, to develop dynamic partitions, i.e., to vary the partition configurations and positioning of the boundary pipes in order to form partitions of higher connectivity to subsequently, with the allocation of control devices, make the sectors of the supply systems more resilient to failures and anomalous events. Therefore, given this context, this research developed dynamic partitions from the implementation, via Python programming language, of two partitioning algorithms established in the literature, Fast-Greedy and Louvain. Both algorithms are compared and each one presented advantages and disadvantages regarding its implementation and the partitioning process.