Monday, February 21, 2011

OPTIMAL LOCATIONS OF MONITORING STATIONS IN WATER DISTRIBUTIONS SYSTEM

Lee, B.H., and Deininger, R. A., 1992, “OPTIMAL LOCATIONS OF MONITORING STATIONS IN WATER DISTRIBUTIONS SYSTEM,” JOURNAL OF ENVIRONMENTAL ENGINEERING-ASCE, Volume: 118, Issue: 1, Pages: 4-16.

Drinking-water quality should be monitored for public safety. According to the drinking-water regulation, monitor stations need to monitor the sampling frequency and the water-quality parameter. However, specific methods had not been provided for sampling in a distribution system. In this article, a method, how to install monitoring stations in a water network, and a concept of coverage were introduced.
To achieve this method, demand pattern and the flows must be known first. Then, possible locations, called nodes, should be known with the demand. The term ‘covered’ or ‘coverage’ was also used as percentage, which refers to how much demand of the total demand a node covers and which informs the degree of a representative. There is also an assumption that ‘if all the water at the sampled node came from an upstream node, then the water quality of this upstream node would also be known’.

The specific general algorithm is as following.
1. Choose one node.
2. Determine all connected nodes.
3. Calculate water fraction of the flow coming from upstream nodes.
4. In a coverage metrics, the node set to ‘1’ if the value of fraction is above a certain criteria. If it is below the criteria, the node set to zero.
5. As step 2-4, calculate them about all nodes
6. Problem formulation
7. Get result through integer programming

This article also explains that the method can solve multiple scenarios through various examples such as different direction among the node. In result of examples, the author shows the improvements and effectiveness about selecting sampling sites with combining pathway analysis, coverage matrices, and integer programming.

Discussion
This article is interesting because the method provide how to handle pathway when we have to optimize problems relative to road ways or pipes. This is also helpful for me to understand how to solve the third question of our homework. However, although the article provided 2 examples and seemed to simply solve these problems, I think that calculating all the fractions would take longer time if number of nodes increased. If there was a simple method to calculate the fractions, the author should provide the way. If there was not, I would like to study a simple method for estimating the fractions in this article.

1 comment:

  1. I agree with you that the two examples selected were pretty simple. If this research approach is applied to other cities that have a complex network, things could get difficult rather quickly. Overall this paper provided a great example of binary programming and how it can be applied to real world examples.

    ReplyDelete