Network analysis, control valve placement and optimal control of flow velocity for self-cleaning water distribution systems
File(s)1-s2.0-S187770581731425X-main.pdf (237.58 KB)
Published version
Author(s)
Abraham, E
Blokker, EJM
Stoiano, I
Type
Conference Paper
Abstract
In this paper, we consider the proactive control of flow velocities to maximise the self-cleaning capacity of the drinking water
distribution systems under normal operations both through a change of the network topology and through an optimal control of
pressure reducing valve (PRV) settings. Inspired by line outage flow distribution in electrical networks, we show how a fast network
graph analysis of link closures can be used to estimate the potential changes in flow velocities, which are then used to determine
the most favourable pipes for closure. Where closing of pipes cannot be used because of other conflicting objectives, we consider
the optimal control of PRVs to maximise self-cleaning at peak demand periods. We formulate a novel optimisation problem to
maximise the network operations for increased self-cleaning capacity, while satisfying hydraulic and regulatory pressure constraints
at demand nodes. A new smooth objective function approximation for cleaning capacity of the network is proposed along with a
scalable sequential convex programming method to solve the resulting valve optimization problems. We use a published benchmark
network as a case study to show the efficacy of these new approaches.
distribution systems under normal operations both through a change of the network topology and through an optimal control of
pressure reducing valve (PRV) settings. Inspired by line outage flow distribution in electrical networks, we show how a fast network
graph analysis of link closures can be used to estimate the potential changes in flow velocities, which are then used to determine
the most favourable pipes for closure. Where closing of pipes cannot be used because of other conflicting objectives, we consider
the optimal control of PRVs to maximise self-cleaning at peak demand periods. We formulate a novel optimisation problem to
maximise the network operations for increased self-cleaning capacity, while satisfying hydraulic and regulatory pressure constraints
at demand nodes. A new smooth objective function approximation for cleaning capacity of the network is proposed along with a
scalable sequential convex programming method to solve the resulting valve optimization problems. We use a published benchmark
network as a case study to show the efficacy of these new approaches.
Date Issued
2017-05-09
Date Acceptance
2016-03-18
Citation
Procedia Engineering, 2017, 186, pp.576-583
ISSN
1877-7058
Publisher
Elsevier
Start Page
576
End Page
583
Journal / Book Title
Procedia Engineering
Volume
186
Copyright Statement
© 2016 Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license. (http://creativecommons.org/licenses/by-nc-nd/4.0/
Source
18th Conference on Water Distribution System Analysis, WDSA2016
Subjects
MD Multidisciplinary
Publication Status
Published
Start Date
2016-07-24
Finish Date
2016-07-28
Coverage Spatial
Cartagena, Colombia