Graph theory algorithms for real time control of a sewer network

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.