结合图论的供水管网PMA分区方法  

Optimization of water supply network PMA partition by graph theory

作　　者：高金良[1] 姚芳[1] 叶健[1] 

机构地区：[1]哈尔滨工业大学市政环境工程学院,哈尔滨150090

出　　处：《哈尔滨工业大学学报》2016年第8期67-72,共6页Journal of Harbin Institute of Technology

基　　金：国家自然科学基金(51278148);国家水体污染控制与治理科技重大专项(2014ZX07405002);广东省教育部产学研结合项目(2011A090200040)

摘　　要：供水管网压力分区(PMA)以压力调控为主,兼顾区域计量,可有效地控制城市管网漏失,为此,提出结合图论的PMA分区方法,首先运用自适应AP聚类算法结合经济性计算对供水管网进行初步分区,确定分区数目;然后运用迪杰斯特拉(Dijkstra)算法计算各个聚类中心点到水源的最短路径,确定各个分区的供水管段;建立分区边界优化模型,运用模拟退火算法求解该模型;最后结合人工经验对部分分区进行适当合并,形成最终方案并运用于Y市供水管网实例,取得良好结果.该种分区方法是以计算机算法为主体并结合人工经验,很大程度降低分区的工作量,并且比传统的人工试错分区具有更大的搜索空间,可用于指导实际供水管网的PMA分区.The water supply pipe network pressure management area （ PMA） partition, which is pressure-control oriented and regional metrology considered, effectively controls the leakage rate of urban water supply network. PMA partition with graph theory is proposed in this study. First of all, to initially partition the water supply network and set the partition number with adaptive AP clustering algorithm and economic calculation. Secondly, Dijkstra algorithm is adopted to calculate the shortest path of each cluster center point to the source of the water and determine the position of each division of the water supply pipe, and then establish a partition boundary optimization model and apply simulated annealing algorithm to solve the model. Finally, combine some partitions properly with artificial expertise and form the final plan. This partition, computer algorithm oriented and combined with artificial expertise, embraces larger search space than the traditional artificial partition of trial and error and can guide the actual water supply network PMA partition.

关 键 词：PMA分区 图论 AP聚类算法 迪杰斯特拉算法 模拟退火算法 

分 类 号：TU991[建筑科学—市政工程]