Procedia Engineering · 2014 · 32 citations · 13 references
EngineeringCivil EngineeringWater Resources ManagementIntegrated Water Resources ManagementWater Resources EngineeringWater Resources PlanningCombinatorial OptimizationDistribution Network PlanningGraph AlgorithmsNetwork OptimizationWater Distribution SystemsWater Supply System AnalysisConstraintsGraph PartitioningNetwork PartitioningNetwork SectorizationOptimization Of Distribution NetworksPartitioningWater Distribution Network AnalysisWater Distribution System Optimization
Partitioning a water distribution network (WDN) into smaller sub-networks (called district metered areas, or DMAs) is a strategy to manage its complexity. A number of requirements for WDN partitioning make existing graph partitioning techniques inefficient at finding a good solution. There are also other structural and hydraulic constraints, such as partition size, minimum nodes’ elevation difference in partitions, and water velocity in pipes that make the identification of an efficient partitioning a challenging problem. In this paper, we propose a technique called WDN-Cluster to solve this partitioning problem for gravity-driven water distribution networks. WDN-Cluster applies a combination of structural graph partitioning and multi-objective optimization based on NSGA-II to find a good arrangement of nodes into DMAs.
13
Depth-First Search and Linear Graph Algorithms
Robert E. Tarjan · SIAM Journal on Computing · 1972 · 6K citations
Water Network Sectorization Based on Graph Theory and Energy Performance Indices
Armando Di Nardo, Michele Di Natale, Giovanni Francesco Santonastaso et al. · Journal of Water Resources Planning and Management · 2013 · 142 citations
Engineering, Water Resources Management, Water Resource Management +16