Download PDFOpen PDF in browser

Graph Theory Algorithms for Real Time Control of a Sewer Network

9 pagesPublished: September 20, 2018

Abstract

Many Dutch sewer networks are combined sewer systems, they carry both storm water and foul water. They consist of multiple sub-networks, linked by pumps into a tree structure with the Waste Water Treatment Plant as its root. Within sub-networks sewage transport is by gravity driven flow. Usually the original design assumed local control. Later changes, additions and extensions sometimes reduced the effectiveness of the original design. In these cases central control can improve the performance of the system without costly new construction. We apply two algorithms from graph theory, one is based on stable flows in time, the other on quickest evacuation flows. Results on local control are included to provide a lower bound on performance. A linear programming problem based of a perfect forecast of the whole event provides an upper bound on performance.

Keyphrases: graph theory, Optimization, real-time control, sewer system

In: Goffredo La Loggia, Gabriele Freni, Valeria Puleo and Mauro De Marchis (editors). HIC 2018. 13th International Conference on Hydroinformatics, vol 3, pages 2127--2135

Links:
BibTeX entry
@inproceedings{HIC2018:Graph_Theory_Algorithms_for,
  author    = {Ronald R. P. van Nooijen and Alla Kolechkina},
  title     = {Graph Theory Algorithms for Real Time Control of a Sewer Network},
  booktitle = {HIC 2018. 13th International Conference on Hydroinformatics},
  editor    = {Goffredo La Loggia and Gabriele Freni and Valeria Puleo and Mauro De Marchis},
  series    = {EPiC Series in Engineering},
  volume    = {3},
  pages     = {2127--2135},
  year      = {2018},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2516-2330},
  url       = {https://easychair.org/publications/paper/9fPV},
  doi       = {10.29007/6d72}}
Download PDFOpen PDF in browser