A Greedy Sampling Design Algorithm for the Modal Calibration of Nodal Demand in Water Distribution Systems

1Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents a greedy optimization algorithm for sampling design to calibrate WDS hydraulic model. The proposed approach starts from the existing sensors and sequentially adds one new sensor at each optimization simulation step. In each step, the algorithm tries to minimize the calibration prediction uncertainty. The new sensor is installed in the location where the uncertainty is greatest but also sensitive to other nodes. The robustness of the proposed approach is tested under different spatial and temporal demand distribution. We found that both the number of sensors and the perturbation ratio affect the calibration accuracy as defined by the average nodal pressure deviation itself and its variability. The plot of the calibration accuracy versus the number of sensors can reasonably guide the trade-off between model calibration accuracy and number of sensors placed or the cost. This proposed approach is superior in calibration accuracy and modeling efficiency when compared to the standard genetic algorithm (SGA) and Monte Carlo Sampling algorithm (MCS).

Cite

CITATION STYLE

APA

Shao, Y., Chu, S., Zhang, T., Yang, Y. J., & Yu, T. (2019). A Greedy Sampling Design Algorithm for the Modal Calibration of Nodal Demand in Water Distribution Systems. Mathematical Problems in Engineering, 2019. https://doi.org/10.1155/2019/3917571

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free