Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems
- 169 Downloads
We consider the problem of optimizing a novel acoustic leakage detection system for urban water distribution networks. The system is composed of a number of detectors and transponders to be placed in a choice of hydrants such as to provide a desired coverage under given budget restrictions. The problem is modeled as a particular Prize-Collecting Steiner Arborescence Problem. We present a branch-and-cut-and-bound approach taking advantage of the special structure at hand which performs well when compared to other approaches. Furthermore, using a suitable stopping criterion, we obtain approximations of provably excellent quality (in most cases actually optimal solutions). The test bed includes the real water distribution network from the Lausanne region, as well as carefully randomly generated realistic instances.
KeywordsPrize-collecting Steiner problem Branch and cut Network leakage detection
Mathematics Subject Classification (2000)90C27 90C57 90C90
Unable to display preview. Download preview PDF.
- 7.Goemans M., Williamson D.: The primal-dual method for approximation algorithms and its application to network design problems. In: Hochbaum, D. (eds) Approximation Algorithms for NP-hard Problems, pp. 144–191. PWS Publishing Company, Boston (1997)Google Scholar
- 8.Johnson, D.S., Minkoff, M., Phillips, S.: The prize collecting steiner tree problem: theory and practice. In: Proceedings of the 11th symposium on discrete algorithms, pp. 760–769 (2000)Google Scholar