<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing with OASIS Tables v3.0 20080202//EN" "journalpub-oasis3.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:oasis="http://docs.oasis-open.org/ns/oasis-exchange/table" xml:lang="en" dtd-version="3.0">
  <front>
    <journal-meta><journal-id journal-id-type="publisher">DWES</journal-id><journal-title-group>
    <journal-title>Drinking Water Engineering and Science</journal-title>
    <abbrev-journal-title abbrev-type="publisher">DWES</abbrev-journal-title><abbrev-journal-title abbrev-type="nlm-ta">Drink. Water Eng. Sci.</abbrev-journal-title>
  </journal-title-group><issn pub-type="epub">1996-9465</issn><publisher>
    <publisher-name>Copernicus Publications</publisher-name>
    <publisher-loc>Göttingen, Germany</publisher-loc>
  </publisher></journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.5194/dwes-11-19-2018</article-id><title-group><article-title>Real-time hydraulic interval state estimation for water transport networks: a case study</article-title><alt-title>Real-time hydraulic interval state estimation</alt-title>
      </title-group><?xmltex \runningtitle{Real-time hydraulic interval state estimation}?><?xmltex \runningauthor{S. G. Vrachimis et al.}?>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes" rid="aff1">
          <name><surname>Vrachimis</surname><given-names>Stelios G.</given-names></name>
          <email>vrachimis.stelios@ucy.ac.cy</email>
        <ext-link>https://orcid.org/0000-0001-8862-5205</ext-link></contrib>
        <contrib contrib-type="author" corresp="no" rid="aff1">
          <name><surname>Eliades</surname><given-names>Demetrios G.</given-names></name>
          
        <ext-link>https://orcid.org/0000-0001-6184-6366</ext-link></contrib>
        <contrib contrib-type="author" corresp="no" rid="aff1">
          <name><surname>Polycarpou</surname><given-names>Marios M.</given-names></name>
          
        </contrib>
        <aff id="aff1"><institution>KIOS Research and Innovation Center of Excellence, Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus</institution>
        </aff>
      </contrib-group>
      <author-notes><corresp id="corr1">Stelios G. Vrachimis (vrachimis.stelios@ucy.ac.cy)</corresp></author-notes><pub-date><day>8</day><month>March</month><year>2018</year></pub-date>
      
      <volume>11</volume>
      <issue>1</issue>
      <fpage>19</fpage><lpage>24</lpage>
      <history>
        <date date-type="received"><day>19</day><month>March</month><year>2017</year></date>
           <date date-type="rev-request"><day>6</day><month>June</month><year>2017</year></date>
           <date date-type="rev-recd"><day>5</day><month>December</month><year>2017</year></date>
           <date date-type="accepted"><day>4</day><month>January</month><year>2018</year></date>
      </history>
      <permissions>
        
        
      <license license-type="open-access"><license-p>This work is licensed under the Creative Commons Attribution 3.0 Unported License. To view a copy of this licence, visit <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/3.0/">https://creativecommons.org/licenses/by/3.0/</ext-link></license-p></license></permissions><self-uri xlink:href="https://dwes.copernicus.org/articles/11/19/2018/dwes-11-19-2018.html">This article is available from https://dwes.copernicus.org/articles/11/19/2018/dwes-11-19-2018.html</self-uri><self-uri xlink:href="https://dwes.copernicus.org/articles/11/19/2018/dwes-11-19-2018.pdf">The full text article is available as a PDF file from https://dwes.copernicus.org/articles/11/19/2018/dwes-11-19-2018.pdf</self-uri>
      <abstract>
    <p id="d1e95">Hydraulic state estimation in water distribution networks is the task of
estimating water flows and pressures in the pipes and nodes of the network
based on some sensor measurements. This requires a model of the network as
well as knowledge of demand outflow and tank water levels. Due to modeling
and measurement uncertainty, standard state estimation may result in
inaccurate hydraulic estimates without any measure of the estimation error.
This paper describes a methodology for generating hydraulic state bounding
estimates based on interval bounds on the parametric and measurement
uncertainties. The estimation error bounds provided by this method can be
applied to determine the existence of unaccounted-for water in water
distribution networks. As a case study, the method is applied to a modified
transport network in Cyprus, using actual data in real time.</p>
  </abstract>
    </article-meta>
  </front>
<body>
      

<sec id="Ch1.S1" sec-type="intro">
  <title>Introduction</title>
      <p id="d1e105">Hydraulic state estimation in water distribution networks (WDNs) is a
challenging task due to the presence of modeling uncertainties, such as
structural uncertainty introduced by skeletonization of the network,
parameter uncertainty of pipe roughness coefficients and uncertainty in water
demands. While this last uncertainty can be reduced by the use of real-time
flow measurements, these measurements come with their own instrument
uncertainties and noise <xref ref-type="bibr" rid="bib1.bibx8" id="paren.1"/>.</p>
      <p id="d1e111">In standard state estimation techniques, statistical characterization of
sensor measurement error is needed to give more weight to measurements
originating from more accurate sensors. Using the weighted least squares
method, the nodal demands are adjusted to fit the constraints imposed by the
measurements and produce the most probable state estimate
<xref ref-type="bibr" rid="bib1.bibx5" id="paren.2"/>. Another approach is the Kalman filter (KF) method which
provides a solution for the network state based on the available
measurements. The standard KF performs poorly in nonlinear looped WDN due to
the use of a linearized system model <xref ref-type="bibr" rid="bib1.bibx10" id="paren.3"/>. Overall, the above
methods generate a point in state space and are referred to as <italic>point state estimation</italic> <xref ref-type="bibr" rid="bib1.bibx2" id="paren.4"/>.</p>
      <p id="d1e126">Most point state estimation methods assume a known statistical characterization of the measurement error.
This could lead to significant estimation errors, especially in the case when pseudo-measurements are used, which are estimates determined from population densities and historical data.
The use of pseudo-measurements may be necessary when there are not enough sensors to guarantee the observability of the network.
In this case, no measure of the estimation error is available.
Additionally, in order for point state estimation methods to produce feasible solutions, model calibration is required a priori or during state estimation <xref ref-type="bibr" rid="bib1.bibx14 bib1.bibx9" id="paren.5"/>.</p>
      <p id="d1e132">An alternative approach for the representation of measurement and model parameter uncertainty is the use of bounds.
In contrast to traditional point state estimation methods, the use of bounding uncertainty
can provide upper and lower bounds on the state variables.
This method is referred to as <italic>interval state estimation</italic>.
In this work a hydraulic interval state estimation methodology is described and its use
is demonstrated with a case study of a modified transport network of a water utility in Cyprus.
An application of this<?pagebreak page20?> method for determining the existence of unaccounted-for water in the network is presented.</p>
      <p id="d1e139">The use of measurement bounds for the representation of measurement
uncertainty and their incorporation into the state estimation cost function
was introduced by <xref ref-type="bibr" rid="bib1.bibx3" id="text.6"/>. Interval state estimation was
developed by <xref ref-type="bibr" rid="bib1.bibx7" id="text.7"/> as the so-called set-bounded state estimation
problem. An implicit state estimation technique for leakage detection for an
idealized grid network under steady conditions was presented by
<xref ref-type="bibr" rid="bib1.bibx1" id="text.8"/>. A straightforward method for interval state estimation
is the use of Monte Carlo simulations (MCS), which under some assumptions
converge to the true uncertainty bounds by randomly generating and evaluating
a large number of parameter sets or realizations <xref ref-type="bibr" rid="bib1.bibx6" id="paren.9"/>. The
interval-based approach used in this paper has the advantage of calculating
algorithmically the bounded state estimates in a way that guarantees the
inclusion of the true state. MCS, even with a large number of simulations,
cannot guarantee that all possible cases will be simulated. The applicability
of the proposed algorithm is thus suitable for event and fault-detection
methodologies that require strict bounds on state estimates.</p>
      <p id="d1e154">In many applications, such as leakage detection and contamination detection,
the derivation of a range of possible values for the state of the WDN
provides useful information for event and fault-detection methodologies.
Hydraulic state bounds can be used to generate bounds on chlorine
concentration in the water network or other chemicals in the water, by taking
into consideration the uncertainty in decay rate <xref ref-type="bibr" rid="bib1.bibx16" id="paren.10"/>. When
additionally this bounded estimate is generated in real time, it helps to
reduce the time of detecting water leakages and prevent catastrophic
scenarios such as water contamination.</p>
      <p id="d1e160">The paper is organized as follows:
Sect. <xref ref-type="sec" rid="Ch1.S2"/> formulates the  problem of hydraulic state estimation and describes a methodology to solve this problem based on the <italic>Iterative Hydraulic Interval State Estimation</italic> (IHISE) algorithm.
In Sect. <xref ref-type="sec" rid="Ch1.S3"/>, a case study is presented in which this method is applied to a modified real transport network.
Finally, we discuss the application of this method for determining the existence of unaccounted-for water in the network.</p>
</sec>
<sec id="Ch1.S2">
  <title>Hydraulic interval state estimation</title>
      <p id="d1e176">A water transport network is modeled using a directed graph, for which nodes
represent water sources, junctions of pipes and water demand locations, and
the links represent pipes. Each pipe is indicated by the index <inline-formula><mml:math id="M1" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula>, where <inline-formula><mml:math id="M2" display="inline"><mml:mrow><mml:mi>j</mml:mi><mml:mo>∈</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mtext>p</mml:mtext></mml:msub><mml:mo mathvariant="italic">}</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M3" display="inline"><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mtext>p</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula> is the number of pipes. These are
characterized by pipe length, diameter and roughness coefficient, parameters
which are generally assumed known. Pipe parameters are used to compute the
Hazen–Williams (H–W) resistance coefficients <inline-formula><mml:math id="M4" display="inline"><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, which are in turn used
to formulate the energy conservation equations of a water network
<xref ref-type="bibr" rid="bib1.bibx4" id="paren.11"/>.</p>
      <p id="d1e240">Modeling uncertainty in a WDN is considered in this work to arise from
insufficient knowledge of pipe parameters. The uncertain parameters are
represented using intervals, with the actual value of the parameter being
within a corresponding interval. For notational convenience, the parameters
representing intervals will be denoted with a tilde.
Any uncertain parameters in pipe <inline-formula><mml:math id="M5" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula> will be included
in <inline-formula><mml:math id="M6" display="inline"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>r</mml:mi><mml:mo mathvariant="normal">̃</mml:mo></mml:mover><mml:mi>j</mml:mi></mml:msub><mml:mo>∈</mml:mo><mml:mfenced open="[" close="]"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mi>j</mml:mi><mml:mtext>l</mml:mtext></mml:msubsup><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.25em"/><mml:msubsup><mml:mi>r</mml:mi><mml:mi>j</mml:mi><mml:mtext>u</mml:mtext></mml:msubsup></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>. The
interval parameter <inline-formula><mml:math id="M7" display="inline"><mml:mover accent="true"><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo mathvariant="normal">̃</mml:mo></mml:mover></mml:math></inline-formula> is the uncertain H–W coefficient for pipe
<inline-formula><mml:math id="M8" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula>, with <inline-formula><mml:math id="M9" display="inline"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mi>j</mml:mi><mml:mtext>l</mml:mtext></mml:msubsup></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M10" display="inline"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mi>j</mml:mi><mml:mtext>u</mml:mtext></mml:msubsup></mml:mrow></mml:math></inline-formula> being the lower and upper bounds
of each coefficient, respectively.</p>
      <p id="d1e333">Nodes are indicated by the index <inline-formula><mml:math id="M11" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>, where <inline-formula><mml:math id="M12" display="inline"><mml:mrow><mml:mi>i</mml:mi><mml:mo>∈</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mtext>u</mml:mtext></mml:msub><mml:mo mathvariant="italic">}</mml:mo></mml:mrow></mml:math></inline-formula> and
<inline-formula><mml:math id="M13" display="inline"><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mtext>u</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula> is the number of nodes with an unknown head, thus excluding the
nodes that represent water sources. In this work we consider water transport
networks in which sensors measure all the water demands at nodes, which,
typically, are the inflows of district metered areas (DMAs). Measurements
arrive at a fixed time interval from sensors that may not be accurate, and
each measurement is associated with a certain measurement error. The
uncertainty of each measurement is given as a percent error of the
measurement, and it is modeled as an interval with the measurement being the
mean value of the interval. Measured water demand at node <inline-formula><mml:math id="M14" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula> is then given
by the interval <inline-formula><mml:math id="M15" display="inline"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>q</mml:mi><mml:mo mathvariant="normal">̃</mml:mo></mml:mover><mml:mrow><mml:mi>e</mml:mi><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfenced open="[" close="]"><mml:mrow><mml:msubsup><mml:mi>q</mml:mi><mml:mrow><mml:mtext>ext</mml:mtext><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mtext>l</mml:mtext></mml:msubsup><mml:mo>,</mml:mo><mml:mspace width="0.33em" linebreak="nobreak"/><mml:msubsup><mml:mi>q</mml:mi><mml:mrow><mml:mtext>ext</mml:mtext><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mtext>u</mml:mtext></mml:msubsup></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, where
<inline-formula><mml:math id="M16" display="inline"><mml:mrow><mml:msubsup><mml:mi>q</mml:mi><mml:mrow><mml:mtext>ext</mml:mtext><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mtext>l</mml:mtext></mml:msubsup></mml:mrow></mml:math></inline-formula> is the lower bound on water demand and
<inline-formula><mml:math id="M17" display="inline"><mml:mrow><mml:msubsup><mml:mi>q</mml:mi><mml:mrow><mml:mtext>ext</mml:mtext><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mtext>u</mml:mtext></mml:msubsup></mml:mrow></mml:math></inline-formula> is the upper bound.</p>
      <p id="d1e481">The unknown state vector of the WDN is denoted by <inline-formula><mml:math id="M18" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>=</mml:mo><mml:mo>[</mml:mo><mml:msup><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>⊤</mml:mo></mml:msup><mml:mspace linebreak="nobreak" width="0.33em"/><mml:msup><mml:mi mathvariant="bold-italic">h</mml:mi><mml:mo>⊤</mml:mo></mml:msup><mml:msup><mml:mo>]</mml:mo><mml:mo>⊤</mml:mo></mml:msup><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math id="M19" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">h</mml:mi><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>u</mml:mi></mml:msub></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> are the
unknown heads at nodes, <inline-formula><mml:math id="M20" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> are the water
flows in pipes and <inline-formula><mml:math id="M21" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mtext>p</mml:mtext></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mtext>u</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula>. These are computed by
formulating the conservation of energy and mass equations, as formulated by
<xref ref-type="bibr" rid="bib1.bibx15" id="text.12"/>. The matrix formulation for a general looped water
distribution system, which also includes the uncertain parameters and
variables as intervals (denoted with a tilde), is given by
          <disp-formula id="Ch1.E1" content-type="numbered"><mml:math id="M22" display="block"><mml:mrow><mml:mfenced close="]" open="["><mml:mtable class="array" columnalign="center center"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mo mathvariant="normal">̃</mml:mo></mml:mover><mml:mn mathvariant="normal">11</mml:mn></mml:msub><mml:mo>(</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">̃</mml:mo></mml:mover><mml:mo>)</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mn mathvariant="normal">12</mml:mn></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mn mathvariant="normal">21</mml:mn></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mn mathvariant="bold">0</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:mfenced><mml:mfenced open="[" close="]"><mml:mtable class="array" columnalign="center"><mml:mtr><mml:mtd><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">̃</mml:mo></mml:mover></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mover accent="true"><mml:mi mathvariant="bold-italic">h</mml:mi><mml:mo mathvariant="normal">̃</mml:mo></mml:mover></mml:mtd></mml:mtr></mml:mtable></mml:mfenced><mml:mo>=</mml:mo><mml:mfenced close="]" open="["><mml:mtable class="array" columnalign="center"><mml:mtr><mml:mtd><mml:mrow><mml:mo>-</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">h</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>x</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">̃</mml:mo></mml:mover><mml:mrow><mml:mi>e</mml:mi><mml:mi>x</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mfenced><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
        where <inline-formula><mml:math id="M23" display="inline"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mo mathvariant="normal">̃</mml:mo></mml:mover><mml:mn mathvariant="normal">11</mml:mn></mml:msub><mml:mo>(</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">̃</mml:mo></mml:mover><mml:mo>)</mml:mo><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> is a diagonal matrix containing the nonlinear terms
<inline-formula><mml:math id="M24" display="inline"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>r</mml:mi><mml:mo mathvariant="normal">̃</mml:mo></mml:mover><mml:mi>j</mml:mi></mml:msub><mml:mo>|</mml:mo><mml:msub><mml:mover accent="true"><mml:mi>q</mml:mi><mml:mo mathvariant="normal">̃</mml:mo></mml:mover><mml:mi>j</mml:mi></mml:msub><mml:msup><mml:mo>|</mml:mo><mml:mrow><mml:mi mathvariant="italic">ν</mml:mi><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M25" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mn mathvariant="normal">12</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mn mathvariant="normal">21</mml:mn><mml:mo>⊤</mml:mo></mml:msubsup><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>u</mml:mi></mml:msub></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> is the incidence flow matrix
that indicates the connectivity of nodes with links, <inline-formula><mml:math id="M26" display="inline"><mml:mrow><mml:mi mathvariant="italic">ν</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1.852</mml:mn></mml:mrow></mml:math></inline-formula> is a
constant associated with the H–W coefficient and <inline-formula><mml:math id="M27" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">h</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>x</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> is a vector that contains the known heads in each
equation. For simplicity, we assume that measurements of the tank levels are
available; thus, <inline-formula><mml:math id="M28" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">h</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>x</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is known.</p>
      <p id="d1e852">Equation (<xref ref-type="disp-formula" rid="Ch1.E1"/>) represents a system of nonlinear
equations, which include interval parameters, and it is referred to in the
literature as a nonlinear interval parametric (NIP) problem
<xref ref-type="bibr" rid="bib1.bibx13" id="paren.13"/>. The objective is to find the smallest interval state
vector <inline-formula><mml:math id="M29" display="inline"><mml:mrow><mml:mover accent="true"><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo mathvariant="normal">̃</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mo>[</mml:mo><mml:msup><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">̃</mml:mo></mml:mover><mml:mo>⊤</mml:mo></mml:msup><mml:mspace linebreak="nobreak" width="0.33em"/><mml:msup><mml:mover accent="true"><mml:mi mathvariant="bold-italic">h</mml:mi><mml:mo mathvariant="normal">̃</mml:mo></mml:mover><mml:mo>⊤</mml:mo></mml:msup><mml:msup><mml:mo>]</mml:mo><mml:mo>⊤</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> that contains all the
solutions of this system of equations for every value contained in the
interval parameters. To solve the NIP problem given in
Eq. (<xref ref-type="disp-formula" rid="Ch1.E1"/>),<?pagebreak page21?> an algorithmic technique named
<italic>iterative hydraulic interval state estimation</italic> (IHISE) was developed
by the authors. The IHISE method comprises five steps: (1) find initial
bounds on the state vector <inline-formula><mml:math id="M30" display="inline"><mml:mi mathvariant="bold-italic">x</mml:mi></mml:math></inline-formula>. (2) Use interval linearization to remove
nonlinear terms from Eq. (<xref ref-type="disp-formula" rid="Ch1.E1"/>) and transform them into a
system of linear interval parametric (LIP) equations. (3) Formulate a linear
program (LP) using the system of LIP equations. (4) Solve the LIP problem.
(5) Iteratively tighten the bounds on <inline-formula><mml:math id="M31" display="inline"><mml:mi mathvariant="bold-italic">x</mml:mi></mml:math></inline-formula> and approximate the solution of the
NIP problem.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F1"><caption><p id="d1e921">A diagram illustrating how the IHISE algorithm works in a real-time framework.</p></caption>
        <?xmltex \igopts{width=236.157874pt}?><graphic xlink:href="https://dwes.copernicus.org/articles/11/19/2018/dwes-11-19-2018-f01.png"/>

      </fig>

      <p id="d1e930">Figure <xref ref-type="fig" rid="Ch1.F1"/> illustrates how this technique is implemented
in a real-time framework. At discrete time instant <inline-formula><mml:math id="M32" display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula>, the measurements from
the sensors in the network are received, which include the water outflow
<inline-formula><mml:math id="M33" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>x</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and the water level in tanks. The measured tank level at
each time instant is used to calculate the known head vector
<inline-formula><mml:math id="M34" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">h</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>x</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> of the network. Since these equations only depend on the
current time instant <inline-formula><mml:math id="M35" display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula>, the discrete time notation is omitted. The
uncertainty of these measurements is inserted by converting them into
intervals with the measurement as the mean value. The hydraulic equations of
Eq. (<xref ref-type="disp-formula" rid="Ch1.E1"/>) are then formulated using the new measurements.
Modeling uncertainty is represented by including the interval parameters
<inline-formula><mml:math id="M36" display="inline"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>r</mml:mi><mml:mo mathvariant="normal">̃</mml:mo></mml:mover><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> in the equations.</p>
      <p id="d1e1010">The first step of the IHISE algorithm is to impose initial bounds on the state vector <inline-formula><mml:math id="M37" display="inline"><mml:mi mathvariant="bold-italic">x</mml:mi></mml:math></inline-formula>.
The initial bounds should be an outer interval solution of Eq. (<xref ref-type="disp-formula" rid="Ch1.E1"/>) <xref ref-type="bibr" rid="bib1.bibx13" id="paren.14"/>.
An outer interval solution includes all the point solutions of Eq. (<xref ref-type="disp-formula" rid="Ch1.E1"/>), but it is not the smallest possible interval.
Bounds on the unknown head vector <inline-formula><mml:math id="M38" display="inline"><mml:mi mathvariant="bold-italic">h</mml:mi></mml:math></inline-formula> can be chosen using physical properties of the network such as the minimum head of each node and the maximum head that pumps and water sources can add to the network.
After finding an initial interval for the unknown heads <inline-formula><mml:math id="M39" display="inline"><mml:mrow><mml:msup><mml:mover accent="true"><mml:mi mathvariant="bold-italic">h</mml:mi><mml:mo mathvariant="normal">̃</mml:mo></mml:mover><mml:mrow><mml:mo>(</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula>, the special structure of Eq. (<xref ref-type="disp-formula" rid="Ch1.E1"/>),
in which each equation contains only one flow state <inline-formula><mml:math id="M40" display="inline"><mml:mrow><mml:msub><mml:mi>q</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, allows us to use  <inline-formula><mml:math id="M41" display="inline"><mml:mrow><mml:msup><mml:mover accent="true"><mml:mi mathvariant="bold-italic">h</mml:mi><mml:mo mathvariant="normal">̃</mml:mo></mml:mover><mml:mrow><mml:mo>(</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> and interval arithmetic to find the initial bounds on the flows <inline-formula><mml:math id="M42" display="inline"><mml:mrow><mml:msup><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">̃</mml:mo></mml:mover><mml:mrow><mml:mo>(</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula>.</p>
      <p id="d1e1105">In the second step, the nonlinear terms present in Eq. (<xref ref-type="disp-formula" rid="Ch1.E1"/>) need to be linearized in
order for the system of equations to be transformed into a LIP problem and solved <xref ref-type="bibr" rid="bib1.bibx11" id="paren.15"/>.
This is achieved using interval linearization <xref ref-type="bibr" rid="bib1.bibx12" id="paren.16"/>.
Given a range of values for the state <inline-formula><mml:math id="M43" display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo mathvariant="normal">̃</mml:mo></mml:mover></mml:math></inline-formula> in which interval linearization will be performed, each
of the nonlinear functions is  enclosed between two lines and an interval term represents the linearization uncertainty.
In the third step, the LIP equations are formulated into a LP with constraints.
The interval terms in these equations are transformed into constraints of the LP and a suitable cost
function ensures that the solution of this problem will give either the minimum or maximum of a certain state.</p>
      <p id="d1e1127">To get an interval solution of the whole state vector <inline-formula><mml:math id="M44" display="inline"><mml:mi mathvariant="bold-italic">x</mml:mi></mml:math></inline-formula>, in step four, the
LP formulated is solved for all the states by changing the cost function. At
the end of this step, an interval solution for the linearized system of
equations is derived. The new bounds on state vector <inline-formula><mml:math id="M45" display="inline"><mml:mi mathvariant="bold-italic">x</mml:mi></mml:math></inline-formula> are then checked for
convergence in step five. The criterion for convergence is that the relative
change in bounds <inline-formula><mml:math id="M46" display="inline"><mml:mrow><mml:msup><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>m</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> at iteration <inline-formula><mml:math id="M47" display="inline"><mml:mi>m</mml:mi></mml:math></inline-formula> must be smaller than a specified
small number <inline-formula><mml:math id="M48" display="inline"><mml:mi mathvariant="italic">ϵ</mml:mi></mml:math></inline-formula>, where <inline-formula><mml:math id="M49" display="inline"><mml:mi mathvariant="italic">ϵ</mml:mi></mml:math></inline-formula> defines the largest allowable
absolute error for the calculated bounds of each state, e.g., for flow states
<inline-formula><mml:math id="M50" display="inline"><mml:mrow><mml:mi mathvariant="italic">ϵ</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0.01</mml:mn></mml:mrow></mml:math></inline-formula> (m<inline-formula><mml:math id="M51" display="inline"><mml:msup><mml:mi/><mml:mn mathvariant="normal">3</mml:mn></mml:msup></mml:math></inline-formula> h<inline-formula><mml:math id="M52" display="inline"><mml:msup><mml:mi/><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula>). The relative change in bounds <inline-formula><mml:math id="M53" display="inline"><mml:mrow><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>m</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula>
is computed as follows:
          <disp-formula id="Ch1.E2" content-type="numbered"><mml:math id="M54" display="block"><mml:mrow><mml:msup><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>m</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msub><mml:mfenced open="|" close="|"><mml:mrow><mml:mfenced close=")" open="("><mml:mrow><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mrow><mml:mi>u</mml:mi><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mo>(</mml:mo><mml:mi>m</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msup><mml:mo>-</mml:mo><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mo>(</mml:mo><mml:mi>m</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msup></mml:mrow></mml:mfenced><mml:mo>-</mml:mo><mml:mfenced open="(" close=")"><mml:mrow><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mrow><mml:mi>u</mml:mi><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mo>(</mml:mo><mml:mi>m</mml:mi><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:msup><mml:mo>-</mml:mo><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mo>(</mml:mo><mml:mi>m</mml:mi><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:msup></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
        where <inline-formula><mml:math id="M55" display="inline"><mml:mrow><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>u</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M56" display="inline"><mml:mrow><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>l</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> indicate the upper and lower bounds of
the state <inline-formula><mml:math id="M57" display="inline"><mml:mi mathvariant="bold-italic">x</mml:mi></mml:math></inline-formula>, respectively. The algorithm then gives the final state bounds
calculated as the result. Otherwise, the new bounds are used as initial
bounds and the algorithm re-iterates from step two.</p>
</sec>
<sec id="Ch1.S3">
  <title>Case study</title>
      <p id="d1e1362">This study uses data from a real water transport sub-network in Cyprus. A modified version of the
transport network is used, of which an illustrative diagram is shown in
Fig. <xref ref-type="fig" rid="Ch1.F2"/>. The modified network contains three loops and
comprises <inline-formula><mml:math id="M58" display="inline"><mml:mn mathvariant="normal">9</mml:mn></mml:math></inline-formula> demand nodes, one water tank and <inline-formula><mml:math id="M59" display="inline"><mml:mn mathvariant="normal">12</mml:mn></mml:math></inline-formula> links which represent
pipes. Flow sensors (F) are installed at demand nodes, which represent
aggregated real measurements at entrances to DMAs, and a water level sensor
(L) is installed in the tank. Sensor measurements arrive at fixed 5 min
intervals. The tank's water input originates from four water sources, of
which three are water dams and one is a desalination unit. The water inflow
<inline-formula><mml:math id="M60" display="inline"><mml:mrow><mml:msub><mml:mi>q</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> coming from these sources is measured with a flow sensor. The water
outflow <inline-formula><mml:math id="M61" display="inline"><mml:mrow><mml:msub><mml:mi>q</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> of the tank is not directly measured.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F2"><caption><p id="d1e1405">Illustrative diagram of the water transport network of this case study.</p></caption>
        <?xmltex \igopts{width=236.157874pt}?><graphic xlink:href="https://dwes.copernicus.org/articles/11/19/2018/dwes-11-19-2018-f02.png"/>

      </fig>

<sec id="Ch1.S3.SS1">
  <title>Real-time hydraulic interval state estimation</title>
      <p id="d1e1419">The implementation of this case study in real time is based on a platform for
real-time monitoring of WDN against hydraulic and quality events. A model of
the transport network was created as an EPANET input file. Using the
platform, one can select the dates with available sensor data and request a
state estimation. The available measurements from demand nodes and the level
of the tank are then retrieved and a data validation process takes place
which replaces missing data.</p>
      <p id="d1e1422">Sensor measurements have an uncertainty which is defined by the installed
sensor's specifications. The measurements given by the flow sensors are
within <inline-formula><mml:math id="M62" display="inline"><mml:mrow><mml:mo>±</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:math></inline-formula> % of the actual flow<?pagebreak page22?> at those locations. Modeling uncertainty
is also present in the form of pipe parameter uncertainty. For this case
study we assumed a total uncertainty of <inline-formula><mml:math id="M63" display="inline"><mml:mrow><mml:mo>±</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:math></inline-formula> % in the Hazen–Williams
coefficient. The value of this uncertainty may vary, as it is calculated
using expert-elicited bounds on the modeled pipe parameters. It is assumed
that the network graph is known, and thus structural uncertainty is
neglected. This is a valid assumption in transport networks where the
structure is known, as it is the network in this case study.</p>
      <p id="d1e1445">Using the IHISE algorithm, bounds on water flows and pressures in the network
are generated using the flow measurements at demand nodes and the tank level
measurements, by taking into account measurement and modeling uncertainty.
The algorithm needs approximately <inline-formula><mml:math id="M64" display="inline"><mml:mn mathvariant="normal">4</mml:mn></mml:math></inline-formula> s to calculate bounds for each
hydraulic step, on a personal computer with Intel Core i5-2400 CPU at
3.10 GHz. The bounds converge after eight iterations. The size of bounds
does not increase over time because it depends only on the measurements of
that specific time step. The effect of accumulating uncertainty due to the
dynamic calculation of tank levels does not affect the size of the bounds in
this case study, because the tank level is measurable. For illustration
purposes, flow and pressure estimates using a real-time EPANET-based state
estimator are also generated. The state estimates for a selected pipe and
node, accompanied by its corresponding uncertainty bounds generated by the
IHISE algorithm, are shown in Fig. <xref ref-type="fig" rid="Ch1.F3"/>.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F3"><caption><p id="d1e1459">State estimate (black line) and bounds on this estimate using the IHISE algorithm
(blue area) for the water flow in pipe <inline-formula><mml:math id="M65" display="inline"><mml:mn mathvariant="normal">3</mml:mn></mml:math></inline-formula> <bold>(a)</bold> and the head at node <inline-formula><mml:math id="M66" display="inline"><mml:mn mathvariant="normal">9</mml:mn></mml:math></inline-formula> <bold>(b)</bold>.</p></caption>
          <?xmltex \igopts{width=236.157874pt}?><graphic xlink:href="https://dwes.copernicus.org/articles/11/19/2018/dwes-11-19-2018-f03.pdf"/>

        </fig>

</sec>
<sec id="Ch1.S3.SS2">
  <title>Determining the existence of unaccounted-for water using bounds on state estimates</title>
      <p id="d1e1494">A common practice in water utilities is to use mass balance to determine
whether there is unaccounted-for water exiting the network. In this case
study, since there is no sensor measuring the tank outflow <inline-formula><mml:math id="M67" display="inline"><mml:mrow><mml:msub><mml:mi>q</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, mass
balance can be checked by generating an estimate of <inline-formula><mml:math id="M68" display="inline"><mml:mrow><mml:msub><mml:mi>q</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> using two different
sets of data: the first is by calculating the sum of all the measured outflow
(demands), indicated here by <inline-formula><mml:math id="M69" display="inline"><mml:mrow><mml:msubsup><mml:mi>q</mml:mi><mml:mn mathvariant="normal">1</mml:mn><mml:mi>a</mml:mi></mml:msubsup><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>; the second is the calculation of
the tank outflow using the measured tank inflow <inline-formula><mml:math id="M70" display="inline"><mml:mrow><mml:msub><mml:mi>q</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and tank water
level measurement <inline-formula><mml:math id="M71" display="inline"><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mtext>t</mml:mtext></mml:msub><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, indicated here by <inline-formula><mml:math id="M72" display="inline"><mml:mrow><mml:msubsup><mml:mi>q</mml:mi><mml:mn mathvariant="normal">1</mml:mn><mml:mi>b</mml:mi></mml:msubsup><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, as
follows:
            <disp-formula id="Ch1.E3" content-type="numbered"><mml:math id="M73" display="block"><mml:mtable rowspacing="0.2ex" columnspacing="1em" class="aligned" displaystyle="true" columnalign="right left"><mml:mtr><mml:mtd><mml:mstyle displaystyle="true" class="stylechange"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:msubsup><mml:mi>q</mml:mi><mml:mn mathvariant="normal">1</mml:mn><mml:mi>b</mml:mi></mml:msubsup><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo><mml:mo>-</mml:mo><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="italic">α</mml:mi><mml:mtext>t</mml:mtext></mml:msub><mml:mo>/</mml:mo><mml:mi mathvariant="normal">Δ</mml:mi><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mspace linebreak="nobreak" width="0.33em"/><mml:mi mathvariant="normal">Δ</mml:mi><mml:msub><mml:mi>h</mml:mi><mml:mtext>t</mml:mtext></mml:msub><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mstyle class="stylechange" displaystyle="true"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:mi mathvariant="normal">Δ</mml:mi><mml:msub><mml:mi>h</mml:mi><mml:mtext>t</mml:mtext></mml:msub><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mtext>t</mml:mtext></mml:msub><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo><mml:mo>-</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mtext>t</mml:mtext></mml:msub><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>)</mml:mo><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
          where <inline-formula><mml:math id="M74" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">α</mml:mi><mml:mtext>t</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula> is the base area of the tank and <inline-formula><mml:math id="M75" display="inline"><mml:mrow><mml:mi mathvariant="normal">Δ</mml:mi><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">5</mml:mn></mml:mrow></mml:math></inline-formula> min is the measurement time step.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F4"><caption><p id="d1e1744"><bold>(a)</bold> Comparison of two estimates of the tank outflow,
<inline-formula><mml:math id="M76" display="inline"><mml:mrow><mml:msubsup><mml:mi>q</mml:mi><mml:mn mathvariant="normal">1</mml:mn><mml:mi>a</mml:mi></mml:msubsup><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M77" display="inline"><mml:mrow><mml:msubsup><mml:mi>q</mml:mi><mml:mn mathvariant="normal">1</mml:mn><mml:mi>b</mml:mi></mml:msubsup><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. <bold>(b)</bold> Comparison of the uncertainty
bounds generated by the IHISE algorithm for the same estimates.</p></caption>
          <?xmltex \igopts{width=241.848425pt}?><graphic xlink:href="https://dwes.copernicus.org/articles/11/19/2018/dwes-11-19-2018-f04.pdf"/>

        </fig>

      <p id="d1e1796">Using data from the case study network, the two tank outflow estimates were
calculated for a period of 2 days, from “24 August 2016 23:10” to
“26 August 2016 23:10”. The two estimates are compared in
Fig. <xref ref-type="fig" rid="Ch1.F4"/>a. It can be observed that the two estimates have a
non-zero difference at almost all time steps. This can be due to noisy data,
and thus it cannot be determined with certainty whether there is
unaccounted-for water. A way to deal with this is to calculate the average
difference <inline-formula><mml:math id="M78" display="inline"><mml:mrow><mml:msub><mml:mi>e</mml:mi><mml:mtext>d</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula> between these data for the given period of time,
i.e., <inline-formula><mml:math id="M79" display="inline"><mml:mrow><mml:msub><mml:mi>e</mml:mi><mml:mtext>d</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula> = mean<inline-formula><mml:math id="M80" display="inline"><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>q</mml:mi><mml:mn mathvariant="normal">1</mml:mn><mml:mi>a</mml:mi></mml:msubsup><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo><mml:mo>-</mml:mo><mml:msubsup><mml:mi>q</mml:mi><mml:mn mathvariant="normal">1</mml:mn><mml:mi>b</mml:mi></mml:msubsup><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo><mml:mo>)</mml:mo><mml:mo>,</mml:mo><mml:mo>∀</mml:mo><mml:mspace width="0.33em" linebreak="nobreak"/><mml:mi>k</mml:mi><mml:mo>∈</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mi mathvariant="normal">…</mml:mi><mml:msub><mml:mi>k</mml:mi><mml:mtext>s</mml:mtext></mml:msub><mml:mo mathvariant="italic">}</mml:mo></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math id="M81" display="inline"><mml:mrow><mml:msub><mml:mi>k</mml:mi><mml:mtext>s</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula> is the total number of
measurements from each sensor. This calculation gives a constant
unaccounted-for flow <inline-formula><mml:math id="M82" display="inline"><mml:mrow><mml:msub><mml:mi>e</mml:mi><mml:mtext>d</mml:mtext></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">18.82</mml:mn></mml:mrow></mml:math></inline-formula> (m<inline-formula><mml:math id="M83" display="inline"><mml:msup><mml:mi/><mml:mn mathvariant="normal">3</mml:mn></mml:msup></mml:math></inline-formula> h<inline-formula><mml:math id="M84" display="inline"><mml:msup><mml:mi/><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula>), which may be due to background leakages, or it
may be due to non-uniformly distributed measurement errors. Checking the
water utility leakage reports of the examined period, there was no recorded
leakage for the sub-network of this study.</p>
      <?pagebreak page23?><p id="d1e1932">Using the IHISE algorithm and the given model and measurement uncertainties, bounds on these same estimates can be calculated:
the bounds on tank outflow by simulating the network using the network outflow and tank level measurements are indicated by <inline-formula><mml:math id="M85" display="inline"><mml:mrow><mml:msubsup><mml:mover accent="true"><mml:mi>q</mml:mi><mml:mo mathvariant="normal">̃</mml:mo></mml:mover><mml:mn mathvariant="normal">1</mml:mn><mml:mi>a</mml:mi></mml:msubsup><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>,
and bounds on tank outflow using the tank inflow and tank level measurements are indicated by <inline-formula><mml:math id="M86" display="inline"><mml:mrow><mml:msubsup><mml:mover accent="true"><mml:mi>q</mml:mi><mml:mo mathvariant="normal">̃</mml:mo></mml:mover><mml:mn mathvariant="normal">1</mml:mn><mml:mi>b</mml:mi></mml:msubsup><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>.
The comparison of these two sets of bounds is shown in Fig. <xref ref-type="fig" rid="Ch1.F4"/>b.
The two sets of bounds overlap, indicating that the variance can be explained by measurement and modeling uncertainty.
There are some specific time steps that the bounds do not overlap, which may be due to noisy data that can be eliminated using a suitable data validation strategy.
It can also be observed that bounds generated by the tank level and tank inflow measurements are wider.
This is because these bounds are calculated using the dynamic equation Eq. (<xref ref-type="disp-formula" rid="Ch1.E3"/>) which uses three uncertain measurements for the calculation of the bounds.</p>
</sec>
<sec id="Ch1.S3.SS3">
  <title>Determining the existence of an artificial leakage using bounds on state estimates</title>
      <p id="d1e1990">In this section the potential of the IHISE algorithm to be used for event detection in water distribution systems is demonstrated.
An artificial leakage is added to the network model, an approximate location of which is indicated in Fig. <xref ref-type="fig" rid="Ch1.F2"/>.
The leakage has a magnitude of 20 (m<inline-formula><mml:math id="M87" display="inline"><mml:msup><mml:mi/><mml:mn mathvariant="normal">3</mml:mn></mml:msup></mml:math></inline-formula> h<inline-formula><mml:math id="M88" display="inline"><mml:msup><mml:mi/><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula>) and its time profile is described by an abrupt constant outflow starting at “26 August 2016 00:10”.</p>
      <p id="d1e2016">In order to determine the location of the leak, additional measurements
should be available. Assuming the existence of pressure sensors in the
network, a comparison of the measured pressure with the estimated pressure
could indicate the presence of a leak. However, in this case, the
measurements are affected by not only the sensor uncertainty (as when
calculating mass balance), but also by the network modeling uncertainty,
which may greatly affect the pressure estimates. Using the IHISE algorithm,
the effect of both measurement and modeling uncertainties is considered in
calculating the bounding estimates, and the existence of a leak can be
determined with greater certainty.</p>
      <p id="d1e2019">We assume the existence of a pressure sensor at node <inline-formula><mml:math id="M89" display="inline"><mml:mn mathvariant="normal">9</mml:mn></mml:math></inline-formula> of the network as
shown in Fig. <xref ref-type="fig" rid="Ch1.F2"/>. The pressure sensor reading is compared with
the IHISE bounding estimates, as shown in Fig. <xref ref-type="fig" rid="Ch1.F5"/>a.
The error between the pressure sensor reading and the estimated bounds, which
is defined as the distance of the reading from the bounds when the reading is
outside the bounds, is also calculated, and is shown in
Fig. <xref ref-type="fig" rid="Ch1.F5"/>. It is observed that there is a pressure
sensor reading error after the leakage occurs. The error presents only during
the night hours, when the pressure is higher due to the low demand and thus a
pressure drop due to a leakage is more apparent. Similarly, if we assume the
existence of a flow sensor on pipe <inline-formula><mml:math id="M90" display="inline"><mml:mn mathvariant="normal">12</mml:mn></mml:math></inline-formula>, the same effect can be observed when
the flow reading is compared with the IHISE bounds, as shown in
Fig. <xref ref-type="fig" rid="Ch1.F5"/>b. There is a flow sensor error during the
night hours, while the error persists in smaller magnitude for the rest of
the day. These observations indicate the existence of the leakage despite the
measurement and modeling uncertainties in the network.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F5"><caption><p id="d1e2047">The effect of a leakage occurring in the network at time “26 August 2016 00:10” on a pressure <bold>(a)</bold> and a flow
<bold>(b)</bold> state, compared to the estimated uncertainty bounds for the same states calculated by the IHISE algorithm. Below each
graph, the corresponding error of the state compared to the calculated bounds is presented.</p></caption>
          <?xmltex \igopts{width=241.848425pt}?><graphic xlink:href="https://dwes.copernicus.org/articles/11/19/2018/dwes-11-19-2018-f05.pdf"/>

        </fig>

</sec>
</sec>
<sec id="Ch1.S4" sec-type="conclusions">
  <title>Conclusions</title>
      <p id="d1e2069">In this work we described a methodology for real-time hydraulic interval
state estimation, to monitor water transport networks. Using real-time
uncertain measurements from a real transport network, the proposed
<italic>Iterative Hydraulic Interval State Estimation</italic> (IHISE) algorithm
generates bounds on hydraulic states of the network, by taking into account
the measurement uncertainty and modeling uncertainty in the form of uncertain
pipe parameters. The applicability of this methodology is demonstrated by
using it to determine the existence of unaccounted-for water in the network
and also to detect an artificially created leakage. Extension of this work
will use the generated bounds to apply fault-diagnosis methods to localize
leakages in the network. Additionally, the bounds on hydraulic states of the
network will be used to generate bounds on water quality states, since the
dynamics of hydraulic and quality states of a water network are
interconnected.</p>
</sec>

      
      </body>
    <back><notes notes-type="dataavailability">

      <p id="d1e2080">The EPANET file for the network depicted in Fig. 2, with realistic water demands,
can be found in <ext-link xlink:href="https://doi.org/10.5281/zenodo.1185136" ext-link-type="DOI">10.5281/zenodo.1185136</ext-link>.</p>
  </notes><notes notes-type="competinginterests">

      <p id="d1e2089">The authors declare that they have no conflict of
interest.</p>
  </notes><ack><title>Acknowledgements</title><p id="d1e2095">This research is funded by the European 80 Research Council under ERC
Advanced Grant<?pagebreak page24?> ERC-2011-AdG-291508 (FAULT-ADAPTIVE) and the European Union
Horizon 2020 programme under grant agreement no. 739551 (KIOS
CoE).
<?xmltex \hack{\newline}?><?xmltex \hack{\newline}?> Edited by: Ran Shang<?xmltex \hack{\newline}?>
Reviewed by: two anonymous referees</p></ack><ref-list>
    <title>References</title>

      <ref id="bib1.bibx1"><label>Andersen and Powell(2000)</label><mixed-citation>
Andersen, J. H. and Powell, R. S.: Implicit state-estimation technique for
water network monitoring, Urban Water J., 2, 123–130, 2000.</mixed-citation></ref>
      <ref id="bib1.bibx2"><label>Andersen et al.(2001)Andersen, Powell, and Marsh</label><mixed-citation>
Andersen, J. H., Powell, R. S., and Marsh, J. F.: Constrained state estimation
with applications in water distribution network monitoring, Int.
J. Syst. Sci., 32, 807–816, 2001.</mixed-citation></ref>
      <ref id="bib1.bibx3"><label>Bargiela and Hainsworth(1989)</label><mixed-citation>
Bargiela, A. and Hainsworth, G. D.: Pressure and flow uncertainty in water
systems, Water Resour. Plann. Manage., 115, 212–229, 1989.</mixed-citation></ref>
      <ref id="bib1.bibx4"><label>Boulos et al.(2006)Boulos, Lansey, and Karney</label><mixed-citation>
Boulos, P. F., Lansey, K. E., and Karney, B. W.: Comprehensive water
distribution systems analysis handbook for engineers and planners, American
Water Works Association, 2006.</mixed-citation></ref>
      <ref id="bib1.bibx5"><label>Davidson and Bouchart(2006)</label><mixed-citation>
Davidson, J. W. and Bouchart, F. J.: Adjusting nodal demands in SCADA
constrained real-time water distribution network models, J.
Hydraul. Eng., 132, 102–110, 2006.</mixed-citation></ref>
      <ref id="bib1.bibx6"><label>Eliades et al.(2015)Eliades, Stavrou, Vrachimis, Panayiotou, and
Polycarpou</label><mixed-citation>
Eliades, D. G., Stavrou, D., Vrachimis, S. G., Panayiotou, C. G., and
Polycarpou, M. M.: Contamination event detection using multi-level
thresholds, in: Proceedings of 13th Computing and Control for the Water
Industry Conference, CCWI 2015,  119, 1429–1438, 2015.</mixed-citation></ref>
      <ref id="bib1.bibx7"><label>Gabrys and Bargiela(1997)</label><mixed-citation>Gabrys, B. and Bargiela, A.: Integrated neural based system for state
estimation and confidence limit analysis in water networks, in: Proceedings
of European Simulation Symposium ESS'96,  398–402, 1997.
 </mixed-citation></ref><?xmltex \hack{\newpage}?>
      <ref id="bib1.bibx8"><label>Hutton et al.(2014)Hutton, Kapelan, Vamvakeridou-Lyroudia, and
Savic</label><mixed-citation>
Hutton, C. J., Kapelan, Z., Vamvakeridou-Lyroudia, L., and Savic, D. A.:
Dealing with uncertainty in water distribution system models : A framework
for real-time modeling and data assimilation, Water Resour. Plann.
Manage., 140, 169–183, 2014.</mixed-citation></ref>
      <ref id="bib1.bibx9"><label>Kang and Lansey(2011)</label><mixed-citation>
Kang, D. and Lansey, K.: Demand and roughness estimation in water distribution
systems, Water Resour. Plann. Manage., 137, 20–30, 2011.</mixed-citation></ref>
      <ref id="bib1.bibx10"><label>Kang et al.(2009)Kang, Pasha, and Lansey</label><mixed-citation>
Kang, D. S., Pasha, M. F., and Lansey, K.: Approximate methods for uncertainty
analysis of water distribution systems, Urban Water J., 6, 233–249,
2009.</mixed-citation></ref>
      <ref id="bib1.bibx11"><label>Kolev(2004a)</label><mixed-citation>
Kolev, L. V.: A method for outer interval solution of parametrized systems of
linear interval equations, Reliab. Comput., 10, 227–239,
2004a.</mixed-citation></ref>
      <ref id="bib1.bibx12"><label>Kolev(2004b)</label><mixed-citation>
Kolev, L. V.: An improved interval linearization for solving nonlinear
problems, Numer. Algorithms, 37, 213–224, 2004b.</mixed-citation></ref>
      <ref id="bib1.bibx13"><label>Kolev(2014)</label><mixed-citation>
Kolev, L. V.: Parameterized solution of linear interval parametric systems,
Appl. Math. Comput., 246, 229–246, 2014.</mixed-citation></ref>
      <ref id="bib1.bibx14"><label>Savic et al.(2009)Savic, Kapelan, and Jonkergouw</label><mixed-citation>
Savic, D. A., Kapelan, Z. S., and Jonkergouw, P. M.: Quo vadis water
distribution model calibration?, Urban Water J., 6, 3–22, 2009.</mixed-citation></ref>
      <ref id="bib1.bibx15"><label>Todini and Pilati(1987)</label><mixed-citation>
Todini, E. and Pilati, S.: A gradient algorithm for the analysis of pipe
networks, in: Proceedings of International Conference on Computer
Applications for Water Supply and Distribution,  1–20, 1987.</mixed-citation></ref>
      <ref id="bib1.bibx16"><label>Vrachimis et al.(2015)Vrachimis, Eliades, and
Polycarpou</label><mixed-citation>
Vrachimis, S. G., Eliades, D. G., and Polycarpou, M. M.: The backtracking
uncertainty bounding algorithm for chlorine sensor fault detection, in:
Proceedings of 13th Computing and Control for the Water Industry Conference,
CCWI 2015,  119,  613–622, 2015.</mixed-citation></ref>
      <ref id="bib1.bibx17"><label/><mixed-citation>Vrachimis, S. G.: Dataset for “Real-Time Hydraulic Interval State Estimation for Water Transport Networks: a Case
Study”, Zenodo,
<ext-link xlink:href="https://doi.org/10.5281/zenodo.1185136" ext-link-type="DOI">10.5281/zenodo.1185136</ext-link>, 27 February, 2018.</mixed-citation></ref>

  </ref-list></back>
    <!--<article-title-html>Real-time hydraulic interval state estimation for water transport networks: a case study</article-title-html>
<abstract-html><p>Hydraulic state estimation in water distribution networks is the task of
estimating water flows and pressures in the pipes and nodes of the network
based on some sensor measurements. This requires a model of the network as
well as knowledge of demand outflow and tank water levels. Due to modeling
and measurement uncertainty, standard state estimation may result in
inaccurate hydraulic estimates without any measure of the estimation error.
This paper describes a methodology for generating hydraulic state bounding
estimates based on interval bounds on the parametric and measurement
uncertainties. The estimation error bounds provided by this method can be
applied to determine the existence of unaccounted-for water in water
distribution networks. As a case study, the method is applied to a modified
transport network in Cyprus, using actual data in real time.</p></abstract-html>
<ref-html id="bib1.bib1"><label>Andersen and Powell(2000)</label><mixed-citation>
Andersen, J. H. and Powell, R. S.: Implicit state-estimation technique for
water network monitoring, Urban Water J., 2, 123–130, 2000.
</mixed-citation></ref-html>
<ref-html id="bib1.bib2"><label>Andersen et al.(2001)Andersen, Powell, and Marsh</label><mixed-citation>
Andersen, J. H., Powell, R. S., and Marsh, J. F.: Constrained state estimation
with applications in water distribution network monitoring, Int.
J. Syst. Sci., 32, 807–816, 2001.
</mixed-citation></ref-html>
<ref-html id="bib1.bib3"><label>Bargiela and Hainsworth(1989)</label><mixed-citation>
Bargiela, A. and Hainsworth, G. D.: Pressure and flow uncertainty in water
systems, Water Resour. Plann. Manage., 115, 212–229, 1989.
</mixed-citation></ref-html>
<ref-html id="bib1.bib4"><label>Boulos et al.(2006)Boulos, Lansey, and Karney</label><mixed-citation>
Boulos, P. F., Lansey, K. E., and Karney, B. W.: Comprehensive water
distribution systems analysis handbook for engineers and planners, American
Water Works Association, 2006.
</mixed-citation></ref-html>
<ref-html id="bib1.bib5"><label>Davidson and Bouchart(2006)</label><mixed-citation>
Davidson, J. W. and Bouchart, F. J.: Adjusting nodal demands in SCADA
constrained real-time water distribution network models, J.
Hydraul. Eng., 132, 102–110, 2006.
</mixed-citation></ref-html>
<ref-html id="bib1.bib6"><label>Eliades et al.(2015)Eliades, Stavrou, Vrachimis, Panayiotou, and
Polycarpou</label><mixed-citation>
Eliades, D. G., Stavrou, D., Vrachimis, S. G., Panayiotou, C. G., and
Polycarpou, M. M.: Contamination event detection using multi-level
thresholds, in: Proceedings of 13th Computing and Control for the Water
Industry Conference, CCWI 2015,  119, 1429–1438, 2015.
</mixed-citation></ref-html>
<ref-html id="bib1.bib7"><label>Gabrys and Bargiela(1997)</label><mixed-citation>
Gabrys, B. and Bargiela, A.: Integrated neural based system for state
estimation and confidence limit analysis in water networks, in: Proceedings
of European Simulation Symposium ESS'96,  398–402, 1997.

</mixed-citation></ref-html>
<ref-html id="bib1.bib8"><label>Hutton et al.(2014)Hutton, Kapelan, Vamvakeridou-Lyroudia, and
Savic</label><mixed-citation>
Hutton, C. J., Kapelan, Z., Vamvakeridou-Lyroudia, L., and Savic, D. A.:
Dealing with uncertainty in water distribution system models : A framework
for real-time modeling and data assimilation, Water Resour. Plann.
Manage., 140, 169–183, 2014.
</mixed-citation></ref-html>
<ref-html id="bib1.bib9"><label>Kang and Lansey(2011)</label><mixed-citation>
Kang, D. and Lansey, K.: Demand and roughness estimation in water distribution
systems, Water Resour. Plann. Manage., 137, 20–30, 2011.
</mixed-citation></ref-html>
<ref-html id="bib1.bib10"><label>Kang et al.(2009)Kang, Pasha, and Lansey</label><mixed-citation>
Kang, D. S., Pasha, M. F., and Lansey, K.: Approximate methods for uncertainty
analysis of water distribution systems, Urban Water J., 6, 233–249,
2009.
</mixed-citation></ref-html>
<ref-html id="bib1.bib11"><label>Kolev(2004a)</label><mixed-citation>
Kolev, L. V.: A method for outer interval solution of parametrized systems of
linear interval equations, Reliab. Comput., 10, 227–239,
2004a.
</mixed-citation></ref-html>
<ref-html id="bib1.bib12"><label>Kolev(2004b)</label><mixed-citation>
Kolev, L. V.: An improved interval linearization for solving nonlinear
problems, Numer. Algorithms, 37, 213–224, 2004b.
</mixed-citation></ref-html>
<ref-html id="bib1.bib13"><label>Kolev(2014)</label><mixed-citation>
Kolev, L. V.: Parameterized solution of linear interval parametric systems,
Appl. Math. Comput., 246, 229–246, 2014.
</mixed-citation></ref-html>
<ref-html id="bib1.bib14"><label>Savic et al.(2009)Savic, Kapelan, and Jonkergouw</label><mixed-citation>
Savic, D. A., Kapelan, Z. S., and Jonkergouw, P. M.: Quo vadis water
distribution model calibration?, Urban Water J., 6, 3–22, 2009.
</mixed-citation></ref-html>
<ref-html id="bib1.bib15"><label>Todini and Pilati(1987)</label><mixed-citation>
Todini, E. and Pilati, S.: A gradient algorithm for the analysis of pipe
networks, in: Proceedings of International Conference on Computer
Applications for Water Supply and Distribution,  1–20, 1987.
</mixed-citation></ref-html>
<ref-html id="bib1.bib16"><label>Vrachimis et al.(2015)Vrachimis, Eliades, and
Polycarpou</label><mixed-citation>
Vrachimis, S. G., Eliades, D. G., and Polycarpou, M. M.: The backtracking
uncertainty bounding algorithm for chlorine sensor fault detection, in:
Proceedings of 13th Computing and Control for the Water Industry Conference,
CCWI 2015,  119,  613–622, 2015.
</mixed-citation></ref-html>
<ref-html id="bib1.bib17"><label/><mixed-citation>
Vrachimis, S. G.: Dataset for “Real-Time Hydraulic Interval State Estimation for Water Transport Networks: a Case
Study”, Zenodo,
<a href="https://doi.org/10.5281/zenodo.1185136" target="_blank">https://doi.org/10.5281/zenodo.1185136</a>, 27 February, 2018.
</mixed-citation></ref-html>--></article>
