Efficient Approach for the Sectorization of Water Distribution Systems: Integrating Graph Theory and Binary Particle Swarm Optimization

The accelerated expansion of urban areas has significantly increased the complexity of managing water distribution systems. Network sectorization into smaller, independently controlled areas is often highlighted as an important measure to enhance operational security and reduce water losses in networks. However, identifying the optimal sectorization strategy is challenging due to the vast number of possible combinations, and existing methods still present practical limitations. This study proposes a hybrid model for the optimal design of district-metered areas in water distribution systems. The methodology combines graph theory, the Dijkstra shortest path algorithm (DSP), and the meta-heuristic binary particle swarm optimization (BPSO) algorithm. Structuring the topology of the water distribution network using graphs allows the identification of existing connections between the network components. By DSP, the shortest paths from the reservoir to the consumption points were determined, while the proposed BPSO sought the best combination of pipe conditions (open or closed) while meeting the constraint conditions. The application of the model to three real water distribution systems in João Pessoa, in northeastern Brazil, demonstrated its efficiency in sectorization projects, providing optimal solutions that meet the imposed constraints. The results highlight the model’s potential to optimize costs and enhance decision-making in water utility projects.