Please wait a minute...
浙江大学学报(工学版)
J4  2010, Vol. 44 Issue (8): 1604-1607    DOI: 10.3785/j.issn.1008-973X.2010.08.030
    
Detecting accidental contaminations in municipal water networks
SHEN Cheng, YU Ting-chao, ZHANG Tu-qiao
Department of Civil Engineering, Zhejiang University, Hangzhou 310058, China
Download:   PDF(0KB) HTML
Export: BibTeX | EndNote (RIS)      

Abstract  

In order to detect a random external input of water pollution, this paper builds a model that can optimize the layout of the monitoring stations for the city water supply system. The model is based on defining of the concept of shortest flowtime matrix and pollution coverage matrix. To resolve the computational complexity in shortest flowtime matrix for complicated water distribution systems, the method used dynamic programming to obtain the pollution coverage matrix under a given monitor level. Genetic algorithm was used to optimally allocate the monitoring stations. The method maximized the monitoring coverage considering the duplication of coverage. Case study shows that the shortest flowtime matrix of complicated networks can be efficiently obtained by using dynamic programming, which can be easily coded; genetic algorithm can find the optimal layout of monitoring stations rapidly, which can monitor the accidental contaminations of the whole network by the greatest degree in a given monitor level; comparison between this new method and enumeration method shows the correctness of this method．

Published: 21 September 2010
CLC:  TU 991.33  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
Cite this article:

CHEN Cheng, SHU Ting-Chao, ZHANG Cha-Jiao. Detecting accidental contaminations in municipal water networks. J4, 2010, 44(8): 1604-1607.

URL:

http://www.zjujournals.com/eng/10.3785/j.issn.1008-973X.2010.08.030     OR     http://www.zjujournals.com/eng/Y2010/V44/I8/1604


城市供水系统突发性污染监测

以监测到供水系统中突发性污染为目标,提出一种城市供水系统监测点优化布置的方法.在定义最短水流时间矩阵和污染覆盖矩阵的基础上,针对复杂管网求解最短水流时间矩阵困难的问题,利用动态规划求解最短水流时间矩阵,并由此得到给定监测等级下的污染覆盖矩阵.以监测覆盖范围最大为目标函数,并引入重复覆盖度的概念,运用遗传算法优化布置监测点.算例结果表明，用动态规划求解复杂管网的最短水流时间矩阵易于编程实现,并有较高的时间效率；遗传算法能够快速地搜索到最优监测点的布置方案,达到在给定监测等级下最大限度地监测整个管网突发性污染的目的；通过与穷举法结果的对比,证明了本方法的正确性.

［1］ BOULOS A, ALTMAN T, JARRIGE P A. An eventdriven method for modeling contaminant propagation in water networks ［J］. Applied Mathematical Modeling, 1994, 18(2): 8492．
［2］ ROSSMAN L A, BOULOS P F. Numerical method for modeling water quality In distribution systems: a comparison ［J］. Journal of Water Resources Planning and Management, 1996, 122(2): 137146．
［3］ ROSSMAN L A.EPANET user’s manual \
[M\]. Cincinnati:United States Environmental Protection Agency, 1994.
［4］ LEE B H, DEININGER R A, CLARK R M. Locating monitoring stations in water distribution systems ［J］. Journal of the American Water Works Association, 1991, 83(7): 6066.
［5］ LEE B H, DEININGER R A. Optimal locations of monitoring stations in water distribution system ［J］. Journal of Environmental Engineering, 1992, 118(1): 416．
［6］ 张怀宇,赵洪宾,吴文燕.市政给水管网水质监测点的优化选址［J］.给水排水,1996,22(10):58．
ZHANG Huaiyu, ZHAO Hongbin, WU Wenyan. Optimal locations of water quality,monitoring points in water distribution system ［J］. Water and Wastewater Engineering, 1996, 22(10): 58．
［7］ ARUN K, KANSAL M L, GEETA A. Identification of monitoring stations in water distribution system［J］. Journal of Environmental Engineering, 1997, 123(8): 746752．
［8］ 张土乔,黄亚东,吴小刚.供水管网水质监测点优化选址研究［J］.浙江大学学报：工学版,2007,41（1）:15．
ZHANG Tuqiao, HUANG Yadong, WU Xiaogang. Optimal locations of water quality monitoring stations in water distribution system ［J］. Journal of Zhejiang University： Engineering Science, 2007, 41(1): 15．
［9］ 汪树玉,刘国华.系统分析［M］.杭州：浙江大学出版社,2002:227231．
［10］ GOLDBERG D E, KOZA J R. Genetic algorithms in pipeline optimization ［J］. Journal of Computing in Civil Engineering, 1987, 1(12): 128141.