Modelling flow and pressure controlled pump stations with application to optimal pump scheduling

Abstract Many pressurized water distribution systems use pumps for the transport of water and tank filling. Modelling groups of parallel pumps with a common control target remains an open problem in hydraulic modelling. In this article, the authors show how to model flow- and pressure-controlled pumping stations in the analysis of hydraulic pipe networks. The process comprises two distinct phases. In the first phase, the pump station is regarded as a single surrogate link connected to the remainder of the network. The flow and head gain at the active pump stations are computed to ensure satisfaction of the network load requirements. In the second phase, an energy minimization problem is formulated for each local pump station to ascertain the optimal pump speed and which pumps should be active. For real-time applications, very significant improvements are possible by hybrid modelling, such as coupling deterministic modelling, surrogate modelling and neural networks. This can lead to performance improvement with a magnitude of the order of $ {10}^5 $ . The application to optimal pump scheduling in the context of strongly varying electricity tariffs is summarized.

Authors

Institutions

Publication Details

Journal
Cambridge Prisms Water
Published
2025-01-01
DOI
https://doi.org/10.1017/wat.2025.10005
Citations
1
Primary Topic
Water Systems and Optimization
Type
article
Field-Weighted Citation Impact
0.95
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Modelling flow and pressure controlled pump stations with application to optimal pump scheduling

Sylvan Elhay, Olivier Piller, Jochen Deuerlein, Michael J. Fischer et al.
1 citations
Cambridge Prisms Water
Water Systems and Optimization
0.95
article

Modelling flow and pressure controlled pump stations with application to optimal pump scheduling

Sylvan Elhay, Olivier Piller, Jochen Deuerlein, Michael J. Fischer, Angus R. Simpson
article en
1 citations

Abstract

Abstract Many pressurized water distribution systems use pumps for the transport of water and tank filling. Modelling groups of parallel pumps with a common control target remains an open problem in hydraulic modelling. In this article, the authors show how to model flow- and pressure-controlled pumping stations in the analysis of hydraulic pipe networks. The process comprises two distinct phases. In the first phase, the pump station is regarded as a single surrogate link connected to the remainder of the network. The flow and head gain at the active pump stations are computed to ensure satisfaction of the network load requirements. In the second phase, an energy minimization problem is formulated for each local pump station to ascertain the optimal pump speed and which pumps should be active. For real-time applications, very significant improvements are possible by hybrid modelling, such as coupling deterministic modelling, surrogate modelling and neural networks. This can lead to performance improvement with a magnitude of the order of $ {10}^5 $ . The application to optimal pump scheduling in the context of strongly varying electricity tariffs is summarized.

Cambridge Prisms WaterVol. 3
Centre National de la Recherche Scientifique (FR), Université de Bordeaux (FR), Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement (FR), Derma Consult (Germany) (DE), Institut Polytechnique de Bordeaux (FR), The University of Adelaide (AU)
Affordable and clean energy
Openalex Percentile: Top 23%
Water Systems and Optimization
0.95
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.