Optimal booster station design and operation under uncertain load

  • Given industrial applications, the costs for the operation and maintenance of a pump system typically far exceed its purchase price. For finding an optimal pump configuration which minimizes not only investment, but life-cycle costs, methods like Technical Operations Research which is based on Mixed-Integer Programming can be applied. However, during the planning phase, the designer is often faced with uncertain input data, e.g. future load demands can only be estimated. In this work, we deal with this uncertainty by developing a chance-constrained two-stage (CCTS) stochastic program. The design and operation of a booster station working under uncertain load demand are optimized to minimize total cost including purchase price, operation cost incurred by energy consumption and penalty cost resulting from water shortage. We find optimized system layouts using a sample average approximation (SAA) algorithm, and analyze the results for different risk levels of water shortage. By adjusting the risk level, the costs and performance range of the system can be balanced, and thus the system’s resilience can be engineered

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Hui Sun, Lena Altherr, Ji Pei, Peter F. Pelz, Shouqi Yuan
DOI:https://doi.org/10.4028/www.scientific.net/AMM.885.102
ISSN:1662-7482
Parent Title (English):Applied Mechanics and Materials
Publisher:Trans Tech Publications
Place of publication:Bäch
Document Type:Article
Language:English
Year of Completion:2018
Date of the Publication (Server):2021/12/09
Tag:Chance Constraint; Engineering Application; Pump System; Stochastic Programming; Water Distribution
Volume:885
First Page:102
Last Page:115
Link:https://doi.org/10.4028/www.scientific.net/AMM.885.102
Zugriffsart:weltweit
Institutes:FH Aachen / Fachbereich Elektrotechnik und Informationstechnik
collections:Verlag / Trans Tech Publications
Open Access / Hybrid
Licence (German):License LogoCreative Commons - Namensnennung