Sampling design is often required for an appropriate assessment of monitoring points in water distribution networks to increase the effectiveness of measured data in calibrating the hydraulic model. Although many methods are available in the literature, they may be inadequate for reliable network calibration. This paper proposes a new method for the optimal collocation of monitoring points using a shortest path based approach. The monitoring points are identified by minimizing the sum of node distances from the closest sensor-node. Node distances were taken to be a weighted sum of the dimensionless arc length and the absolute head loss along arc. To ensure robustness with respect to the presence of outliers among pipe lengths and/or pressure drops, adequate reference measures were chosen for normalization. The optimization problem was solved using Mixed Integer Programming and a variant of the K-Means algorithm. Alternative formulations considering different path blending and distance norms were also analyzed. Numerical experiments carried out on both theoretical and real water distribution networks showed the reliability of the proposed approach and a greater effectiveness compared to similar methods available in the literature.

Shortest path criterion for sampling design of water distribution networks / N., Fontana; Giugni, Maurizio; S., Gliozzi; M., Vitaletti. - In: URBAN WATER JOURNAL. - ISSN 1573-062X. - (2015). [10.1080/1573062X.2013.868498]

Shortest path criterion for sampling design of water distribution networks

GIUGNI, MAURIZIO;
2015

Abstract

Sampling design is often required for an appropriate assessment of monitoring points in water distribution networks to increase the effectiveness of measured data in calibrating the hydraulic model. Although many methods are available in the literature, they may be inadequate for reliable network calibration. This paper proposes a new method for the optimal collocation of monitoring points using a shortest path based approach. The monitoring points are identified by minimizing the sum of node distances from the closest sensor-node. Node distances were taken to be a weighted sum of the dimensionless arc length and the absolute head loss along arc. To ensure robustness with respect to the presence of outliers among pipe lengths and/or pressure drops, adequate reference measures were chosen for normalization. The optimization problem was solved using Mixed Integer Programming and a variant of the K-Means algorithm. Alternative formulations considering different path blending and distance norms were also analyzed. Numerical experiments carried out on both theoretical and real water distribution networks showed the reliability of the proposed approach and a greater effectiveness compared to similar methods available in the literature.
2015
Shortest path criterion for sampling design of water distribution networks / N., Fontana; Giugni, Maurizio; S., Gliozzi; M., Vitaletti. - In: URBAN WATER JOURNAL. - ISSN 1573-062X. - (2015). [10.1080/1573062X.2013.868498]
File in questo prodotto:
File Dimensione Formato  
Fontana (2015) - Shortest path criterion for sampling design of water distribution networks.pdf

non disponibili

Tipologia: Documento in Post-print
Licenza: Accesso privato/ristretto
Dimensione 773.08 kB
Formato Adobe PDF
773.08 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11588/585582
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 4
social impact