<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Influence of Virtual Road Traffic Sensors of Oporto for Origin-Destination Matrix Estimation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Luciano U. Pando</string-name>
          <email>luciano.pando@ifpr.edu.br</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ricardo L u¨ders</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Keiko V. O. Fonseca</string-name>
          <email>keiko@utfpr.edu.br</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marcelo O. Rosa</string-name>
          <email>mrosa@utfpr.edu.br</email>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Federal University of Technology - Parana ́ (UTFPR)</institution>
          <addr-line>Postal code 80230-901 - Curitiba - PR -</addr-line>
          <country country="BR">Brazil</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <fpage>49</fpage>
      <lpage>56</lpage>
      <abstract>
        <p>The knowledge of urban mobility patterns is important to maintain good public services as well as to improve city planning. These mobility patterns can be characterized by using expensive fieldwork or analyzing the huge amount of data available from services and environmental monitoring in smart cities. The origin-destination matrix estimation (ODME) aims to estimate the traffic of vehicles between origin and destination areas in the city of OPorto in Portugal from traffic observed from sensors installed at roads. This estimation is stated as an optimization problem and solved by linear programming. The results have shown that the number and location of sensors are important issues to be considered.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
    </sec>
    <sec id="sec-2">
      <title>2. Background</title>
    </sec>
    <sec id="sec-3">
      <title>2.1. Origin-destination matrix estimation (ODME)</title>
      <p>
        The origin-destination matrix (ODM) contains information about flow of vehicles
between two geographical areas in a city. Let assume that there are n origin-destination
(OD) pairs with a flow qw of vehicles in a particular pair w 2 W (the set of
all OD pairs). These OD pairs are usually located at the borders of a region
[
        <xref ref-type="bibr" rid="ref13">Teknomo and Fernandez 2014</xref>
        ]. Moreover, each flow of vehicles for an OD pair
distributes over city roads using different routes. Each route is composed by links (or edges)
identified as city roads. These links are eventually monitored by traffic sensors which
gives the counts of vehicles in each link. As a link can be shared by different routes,
counts in each link can be due to more than one OD pair. Hence, a link count is not a
direct flow measure for a particular OD pair (except if it is not shared).
      </p>
      <p>
        The origin-destination matrix estimation (ODME) can be considered as a dual
problem of the static traffic assignment (STA) [
        <xref ref-type="bibr" rid="ref4">Bierlaire 2002</xref>
        ]. By giving the flow of
vehicles in an OD pair, STA gives the flow of vehicles in each link of a route used by this
pair. ODME on the contrary, provides the flow of vehicles for OD pairs from the flow
observed in links.
      </p>
      <p>The flow of vehicles va in a link a is given by (1). It is the sum of n flows qw
multiplied by a given probability pwa of using link a by an OD pair w. Additionally, (2)
is a non-negativity constraint of qw.</p>
      <p>va = X</p>
      <p>qw.pwa
w2 W
qw</p>
      <p>0
8 z (vz ⇡ vz)
8 w (qw ⇡ qw)</p>
      <p>By assuming that a link z is monitored by sensors, an estimate vz of the flow of
vehicles in z should approximate the measured flow vz according to (3). Similarly, qw is
approximated to qw according to (4).</p>
      <p>
        According to [
        <xref ref-type="bibr" rid="ref4">Bierlaire 2002</xref>
        ], ODME is generally complex because the number
of unknown variables (flow of vehicles in OD pairs) is greater than the number of
equations (flow of vehicles in links). Other references point out different techniques to solve
ODME as [
        <xref ref-type="bibr" rid="ref8">Maher 1983</xref>
        ] for Bayesian inference, [
        <xref ref-type="bibr" rid="ref5">Cascetta 1984</xref>
        ] and [
        <xref ref-type="bibr" rid="ref1">Bell 1991</xref>
        ] for
general least squares, [
        <xref ref-type="bibr" rid="ref12">Spiess 1987</xref>
        ] for maximum likelihood and [
        <xref ref-type="bibr" rid="ref11">Sherali and Hobeika 1994</xref>
        ]
for linear programming applications.
      </p>
    </sec>
    <sec id="sec-4">
      <title>2.2. Network sensor location problem (NSLP)</title>
      <p>
        The network sensor location problem (NSLP) concerns how to define the location and
number of sensors. In [
        <xref ref-type="bibr" rid="ref15">Ye and Wen 2017</xref>
        ], nine rules have been considered for sensor
allocation as follows:
• R1: choose links such that all OD pairs are covered by sensors;
• R2: choose links with high rate qw/va;
• R3: choose links having all routes covered by sensors (route covering rule);
• R4: choose links with high flow va (interception rule);
• R5: choose links with high probability pwa (maximal OD demand fraction rule);
• R6: choose links with big number of routes (maximal net route flow captured);
• R7: choose links with big number of OD pairs (maximal network OD flow);
• R8: avoid redundant links (independence rule);
• R9: minimize the number of sensors (minimal observation rule);
      </p>
      <p>
        The article [
        <xref ref-type="bibr" rid="ref15">Ye and Wen 2017</xref>
        ] considers rules R1, R8 and R9 for all experiments.
Tests are made with rule R2 or R4 and R7 simultaneously. The results show that using R4
and R7 simultaneously is better than R2 only. The considered network has 93 links and
210 OD pairs.
      </p>
      <p>
        In our work, R1 is considered by default. The other rules R2, R4, R7 are tested
separately. Differently from [
        <xref ref-type="bibr" rid="ref15">Ye and Wen 2017</xref>
        ], R4 and R7 are applied separately, and
there is also a combination between R4 and R7, indicated by R4R7 and done due the fact
that preliminary results showed better results in these two rules. Another addition of this
article is the focus on how the number of sensors interferes in different ways depending
on sensor location choice rules.
      </p>
    </sec>
    <sec id="sec-5">
      <title>2.3. Performance metrics</title>
      <p>The following metrics are used to evaluate ODME: mean absolute error (MAE), root
mean square error (RMSE), total demand deviation (TDD), and determination coefficient
(R2) according to (5), (6), (7), and (8), respectively.
(5)
(6)
(7)
(8)
M AE =</p>
      <p>P
w2 W |qw
n</p>
      <p>qw|
RM SE =
T DD = |
r 1 P
n
w2 W (qw
Pw2 W qw</p>
      <p>qw)2
P
w2 W qw</p>
      <p>Pw2 W qw</p>
      <p>P
w2 W qw|
R2 = (
p(n Pw2 W qw2
n(Pw2 W qwqw) (Pw2 W qw)(Pw2 W qw)
(Pw2 W qw)2)(n Pw2 W (qw)2 (Pw2 W qw)2)
)2</p>
      <p>Both MAE and RMSE are error metrics used to evaluate differences between
observed and real flows of OD pairs. On other hand, TDD is an error related to the sum of
observed and real OD flows. All these metrics should be minimized for good results.</p>
      <p>The determination coefficient R2 evaluates the proportion of the variance in the
dependent variable (estimated OD flows qw) that is predictable from the independent
variable (real OD flows qw) variance, resulting in a output between 0 and 1. The dependence
between observed and estimated values is greater as R2 ⇡ 1. in this case, R2 should be
maximized.</p>
    </sec>
    <sec id="sec-6">
      <title>3. MILP for ODME</title>
      <p>
        The ODM is composed by n decision variables representing the traffic flows of n
OD pairs. The MILP model for ODME presented here is similar to the one of
[
        <xref ref-type="bibr" rid="ref11">Sherali and Hobeika 1994</xref>
        ] but using GUSEK 0.2.24 to solve it [
        <xref ref-type="bibr" rid="ref3">Bettoni 2018</xref>
        ].
      </p>
      <p>Variables are shown in Table 1. There are (np + 3 · ns) variables. Decision
variables are qw, estimated flows in links are vz, and Fz+ and Fz are variables used to
quantify matching errors.
The cost function is represented by (9).</p>
      <p>Equation (10) requires that a probability pwz of flow qw should use link z. Each
observable link has a restriction of this kind.</p>
      <p>Equation (11) sets a matching between the observed and estimated traffic in link
z. Fz is positive when the estimated values are larger than the observed ones and Fz+ is
on the other way around. This restriction acts with (9) and (10) in order to find vz ⇡ vz
by adjusting qw decision variables.</p>
      <p>vz = (vz + Fz+</p>
      <p>Fz )</p>
      <p>Restriction (12) is based on the non-negativity constraint specified in (2).
values.</p>
      <p>Restrictions (13) and (14) indicate that Fz+ and Fz+ are bound to non-negative
For every link sensor, there is a restriction as in (11), (13) and (14), and for every
qw, there is a restriction as in (12).</p>
      <p>min X(Fz+ + Fz )
qw z2 Z
vz = X
w2 W</p>
      <p>pwz · qw
qw</p>
      <p>0
Fz+
Fz
0
0</p>
    </sec>
    <sec id="sec-7">
      <title>4. Results</title>
    </sec>
    <sec id="sec-8">
      <title>4.1. Data description</title>
      <p>Section 4.1 describes the data used to the ODME problem formulation. Section 4.2 shows
results for ODME using MILP and different numbers of sensors.</p>
      <p>
        In this work, data comes from the taxi trip database found in [
        <xref ref-type="bibr" rid="ref14">UCI 2015</xref>
        ] and the
geographic database found in [
        <xref ref-type="bibr" rid="ref9">OpenStreetMap contributors 2018</xref>
        ]. After density clustering
city areas and identifying routes (map matching) as shown in [
        <xref ref-type="bibr" rid="ref10">Pando and Luders 2017</xref>
        ],
13 areas of both origins and destinations have been identified in Oporto yielding to 169
OD pairs. Moreover, the true origin-destination matrix and the probability of route choice
have been determined by GPS data of taxi trips.
      </p>
      <p>
        The [
        <xref ref-type="bibr" rid="ref14">UCI 2015</xref>
        ] dataset has eight attributes and 1, 710, 670 instances. Attribute
“polyline” is a sequence of lat-long locations which identifies a taxi trajectory in
the network. The attribute “timestamp” is used to group taxi trips in hourly time
intervals and to join all trips between 8-9 am allowing to get the true ODM. Attributes
“Datatype” and “missing data” are used to select trips for workdays only and
trips without missing data, respectively.
      </p>
      <p>
        The geographic database [
        <xref ref-type="bibr" rid="ref9">OpenStreetMap contributors 2018</xref>
        ] defines the city
network as a directed graph which is composed by GPS-referenced nodes and edges.
      </p>
    </sec>
    <sec id="sec-9">
      <title>4.2. Influence of the number and position of sensors</title>
      <p>The experiments have been made from 200 to 2000 virtual sensors with locations defined
by rules R2, R4, R7 or R4R7. The number of sensors was increased by 100 between 200
and 500 sensors, and by 250 for more than 500 sensors.</p>
      <p>According to Fig. 1 (MAE), rule R7 yields better results for any number of sensors
except 1500 sensors. Particularly, for less than 1500 sensors. The gap between R7 and
R4R7 or R4 is reduced for a large number of sensors. R4R7 has the worst result for 200
sensors, but it is better than R4 until 1500 sensors, where R4 is better. R2 has the worst
result for every number of sensors except for 200 sensors. The results for R2 are close to</p>
      <p>R4 and R4R7 for small number of sensors but R4 and R4R7 are better for a larger number
of sensors than R2.</p>
      <p>In Fig. 2 (RMSE), R7 has better results for 200 sensors and between 400 and
1250 sensors. Results for R7 are worse for 300 sensors than for 200 sensors which is
unexpected since the result was worse with more information added. R4R7 has better
results for 300 sensors, and R4 has better results for 1500 sensors and above. R2 has the
worst result for any number of sensors, showing a slightly decline in RMSE from above
400 to close to 330 for 200 and 2000 sensors, respectively.</p>
      <p>Fig. 3 (R2) has a similar information of Fig. 2. R7 also has better results for 200
sensors and between 400 and 1250 sensors in this metric. Results for R7 are also worse
for 300 sensors than for 200 sensors. R4R7 has better results for 300 sensors, and R4 has
better results for 1500 sensors and above. R2 has the worst result except for 200 or 300
sensors.</p>
      <p>Fig. 4 (TDD) shows different behavior when compared to the three previous
analysis. R4R7 has better results most of the time. R4, R7, and R4R7 are close to zero
between 400 and 800 sensors, while the minimum TDD value for R2 occurs with 1000
sensors, which is exactly the number of sensors used in Section 4.2.</p>
      <p>R7 has the better results in RMSE and R2 metrics between 400 and 1250 sensors.
It has the better results for any number of sensors except with 1500 sensors for MAE as
well as the better results in TDD for 1500 sensors and above. R4 is better above 1250
sensors for RMSE and R2. R4R7 is only better for TDD between 300 and 750 sensors,
and with 300 sensors for RMSE.</p>
    </sec>
    <sec id="sec-10">
      <title>5. Conclusion</title>
      <p>This work presented the effects of using different rules of distribution of sensors at roads
of Oporto in Portugal in the quality of ODME. The quality of ODME was evaluated by
four different metrics: MAE, RMSE, TDD and R2. The better set of rules may vary
depending on the number of sensors and metrics used. For MAE, RMSE and R2 metrics,
experiments with more sensors produced better results using any set of rules. TDD is
better mainly between 400 and 800 sensors, but it presents poor results after 1000 sensors.
Rule R7 is better for two metrics and any number of sensors except for 300 sensors. For
1500 sensors and above, R4 has better results for metrics RMSE and R2 but R7 has better
results for the other two metrics, i.e., a tie occurs between R4 and R7. For 300 sensors,
the best performing set of rules was R4R7 in three of four metrics.</p>
      <p>For future work, the introduction of probe vehicles could add information to
improve ODM and assignment matrix estimations. The influence of number and location
of sensors can also be analyzed for other ODME techniques as for instance general least
squares.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <surname>Bell</surname>
            ,
            <given-names>M. G. H.</given-names>
          </string-name>
          (
          <year>1991</year>
          ).
          <article-title>The estimation of origin-destination matrices by constrained generalised least squares</article-title>
          .
          <source>Transportation Research Part B: Methodological, 25B(1)</source>
          :
          <fpage>13</fpage>
          -
          <lpage>22</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <surname>Bera</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Rao</surname>
            ,
            <given-names>K. V. K.</given-names>
          </string-name>
          (
          <year>2011</year>
          ).
          <article-title>Estimation of origin-destination matrix from traffic counts : the state of the art</article-title>
          .
          <source>European Transport</source>
          ,
          <volume>49</volume>
          :
          <fpage>3</fpage>
          -
          <lpage>23</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <surname>Bettoni</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          (
          <year>2018</year>
          ).
          <article-title>Gusek description</article-title>
          .
          <source>gusek.html. Access in 2018-06-08.</source>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>Bierlaire</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          (
          <year>2002</year>
          ).
          <article-title>The total demand scale : a new measure of quality for static and dynamic origin - destination trip tables</article-title>
          .
          <source>Transportation Research Part B</source>
          ,
          <volume>36</volume>
          :
          <fpage>837</fpage>
          -
          <lpage>850</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>Cascetta</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          (
          <year>1984</year>
          ).
          <article-title>Estimation of trip matrices from traffic counts and survey data. A generalized least squares estimator</article-title>
          .
          <source>Transportation Research Part B, I(415)</source>
          :
          <fpage>289</fpage>
          -
          <lpage>299</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chootinan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Recker</surname>
            ,
            <given-names>W. W.</given-names>
          </string-name>
          (
          <year>2005</year>
          ).
          <article-title>Examining the quality of synthetic Origin Destination Trip table estimated by path flow estimator</article-title>
          .
          <source>Journal of Transportation Engineering</source>
          ,
          <volume>131</volume>
          (July):
          <fpage>506</fpage>
          -
          <lpage>513</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Curitiba</surname>
          </string-name>
          (
          <year>2016</year>
          ).
          <article-title>Pesquisa origem destino curitiba</article-title>
          .
          <source>Access in</source>
          <year>2018</year>
          , May.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <surname>Maher</surname>
            ,
            <given-names>M. J.</given-names>
          </string-name>
          (
          <year>1983</year>
          ).
          <article-title>Inferences on trip matrices from observations on link volumes: A Bayesian statistical approach</article-title>
          . Transportation Research Part B,
          <volume>17</volume>
          (
          <issue>6</issue>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <surname>OpenStreetMap contributors</surname>
          </string-name>
          (
          <year>2018</year>
          ).
          <article-title>Planet dump retrieved from https://planet</article-title>
          .osm.org. Access in 2018, January.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <surname>Pando</surname>
            ,
            <given-names>L. U.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Luders</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          (
          <year>2017</year>
          ).
          <article-title>Estimation of origin-destination matrix from traffic counts in the city of porto with pso and taxi trip data</article-title>
          . volume
          <volume>1</volume>
          , pages
          <fpage>901</fpage>
          -
          <lpage>911</lpage>
          , Uberlandia, Brasil. Encontro Nacional de Inteligeˆncia Artificial.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <surname>Sherali</surname>
            ,
            <given-names>H. D.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Hobeika</surname>
            ,
            <given-names>A. G.</given-names>
          </string-name>
          (
          <year>1994</year>
          ).
          <article-title>A linear programming approach for synthesizing origin-destination trip tables from link traffic volumes</article-title>
          .
          <source>Transportation Research Part B</source>
          ,
          <volume>28</volume>
          (
          <issue>3</issue>
          ):
          <fpage>213</fpage>
          -
          <lpage>233</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <surname>Spiess</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          (
          <year>1987</year>
          ).
          <article-title>A maximum likelihood model for estimating origin-destination matrices</article-title>
          .
          <source>Transportation Research Part B</source>
          ,
          <volume>21</volume>
          (
          <issue>5</issue>
          ):
          <fpage>395</fpage>
          -
          <lpage>412</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <surname>Teknomo</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Fernandez</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          (
          <year>2014</year>
          ).
          <article-title>A theoretical foundation for the relationship between generalized origin-destination matrix and flow matrix based on ordinal graph trajectories</article-title>
          .
          <source>Journal of Advanced Transportation</source>
          ,
          <volume>48</volume>
          (
          <issue>6</issue>
          ):
          <fpage>608</fpage>
          -
          <lpage>626</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <surname>UCI</surname>
          </string-name>
          (
          <year>2015</year>
          ).
          <article-title>Taxi trips dataset of porto, portugal</article-title>
          . Access in
          <year>2016</year>
          , November.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <surname>Ye</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Wen</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          (
          <year>2017</year>
          ).
          <article-title>Optimal traffic sensor location for origin - destination estimation using a compressed sensing framework</article-title>
          .
          <source>Journal of Advanced Transportation</source>
          ,
          <volume>18</volume>
          (
          <issue>7</issue>
          ):
          <fpage>1857</fpage>
          -
          <lpage>1866</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>