<!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>Performance comparison of machine learning methods in the bus arrival time prediction problem</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>A A Agafonov</string-name>
          <email>ant.agafonov@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>A S Yumaganov</string-name>
          <email>yumagan@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Samara National Research University</institution>
          ,
          <addr-line>Moskovskoye shosse, 34, Samara, Russia, 443086</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2019</year>
      </pub-date>
      <fpage>57</fpage>
      <lpage>62</lpage>
      <abstract>
        <p>The problem of predicting the movement of public transport is one of the most popular problems in the eld of transport planning due to its practical signi cance. Various parametric and non-parametric models are used to solve this problem. In this paper, heterogeneous information a ecting the prediction value is used to predict the arrival time of public transport, and a comparison of the main machine learning algorithms for the public transport arrival time forecasting is given: neural networks, support vector regression. An experimental analysis of the algorithms was carried out on real tra c information about busroutes in Samara, Russia.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Public passenger transport is an important part of the transport system. E cient use of
passenger transport will help to reduce road congestion by reducing the use of personal vehicles,
as well as cut down fuel consumption and reduce environmental pollution. To improve the
quality of passenger transport service, among other things, it is necessary to provide passengers
with information about the exact arrival time of vehicles at stops. This information is important
for passengers because it allows them to choose alternative routes and reduce the waiting time
for vehicles.</p>
      <p>The arrival time of vehicles at stops can be considered as stochastic, since it depends on many
factors, including the passing time of road segments, the time spent at stops and the delay time at
intersections. Furthermore, such factors as tra c congestion, incidents and weather conditions
must be taken into account to predict the arrival time. Thus, the development of prediction
model that takes into account various spatial-temporal factors is a di cult task.</p>
      <p>Despite the popularity of the above mentioned problem, many papers consider only individual
factors (for example, speed of the vehicle on the current and previous road segments) to predict
the arrival time at stop. Moreover, the comparison of algorithms in those papers is carried out
on di erent sets of data that often include information about only one or a few routes.</p>
      <p>In this paper, a comparison of di erent public transport arrival time prediction models
including arti cial neural networks, support vector regression and linear regression is made.
Heterogeneous information describing the transport situation is used for prediction. Comparison
of algorithms is carried out on the tra c data of bus network in Samara, Russia.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related works</title>
      <p>There are a large number of studies devoted to the problem of public transport arrival prediction.
All existing works can be divided into several categories according to the type of used models
and algorithms: parametric and non-parametric regression models, Kalman lters based models,
arti cial neural networks, the support vector machine, hybrid models.</p>
      <p>
        Linear regression models [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ] are constructed as regression functions from a set of
independent variables. The applicability of these models to transport systems is limited due
to the strong correlation of the variables of the regression function. Nonparametric regression,
in particular, the k-nearest-neighbor method, was used to solve the prediction problem in the
papers [
        <xref ref-type="bibr" rid="ref3 ref4 ref5">3, 4, 5</xref>
        ]. However, the requirement of a large sample size imposes a restriction on the use
of this method in real time. In [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], a clustering algorithm was used to determine the distribution
of the travel time of the road segment.
      </p>
      <p>
        Models based on the Kalman lter [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] allow to estimate the future values of the dependent
variables based on the recursive procedure, taking into account the stochastic nature of the
process and the noise of the measurements. Models of arti cial neural networks (ANN) [
        <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
        ]
are the most commonly used approaches for predicting arrival time. Prediction model presented
in [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] combines two models of neural networks trained using two sets of data respectively: travel
times dataset and arrival time at stops dataset. Authors of [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] used the Bayesian approach to
combine several neural networks to build a prediction.
      </p>
      <p>
        The support vector regression (SVR) is a set of similar learning algorithms with a teacher
used for classi cation and regression analysis problems [
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ]. In [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], the travel time of the
current and next road segments was used for prediction. In [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], the authors used a genetic
algorithm to select SVR parameters. The authors of [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] used a prediction model that combines
two SVR models.
      </p>
      <p>
        Hybrid models are also used to reduce the forecast error [
        <xref ref-type="bibr" rid="ref14 ref15 ref16">14, 15, 16</xref>
        ]. These models combine
several heterogeneous methods and algorithms. The travel time prediction problem is necessary
to solve other complex problems, such as reliable path nding [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] or autonomous vehicles routing
[
        <xref ref-type="bibr" rid="ref18">18</xref>
        ].
      </p>
      <p>
        The results of a comparison of several regression models and machine learning methods are
presented in [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ], the best result was shown by the SVR model. Inverse results were obtained
in [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ], the best results were shown by the neural network model.
      </p>
      <p>In most works, the best results of the public transport arrival time prediction were shown
using machine learning methods: neural network models and SVR. However, the choice of a
particular model depends on the used input data.
3. Basic notation and problem formulation
A transport network is considered as a directed graph, the vertices of which correspond to the
stops and the edges denotes segments of the transport network between the stops.</p>
      <p>Let's s denotes a bus stop from set S; wij denotes the segment of the transport network
between the stops i 2 S and j 2 S with length jwij j; r denotes public transport route from set
R; Rij denotes the set of routes passing through segment wij ; n denotes a vehicle from set N ;
Nr denotes a set of vehicles with route r 2 R.</p>
      <p>The problem of arrival time prediction for the vehicle n 2 N with route r 2 R at the stop
j 2 S can be formulated as:
tarr;n = tidep;n + Titjravel;n;
j
where tjarr;n denotes the arrival time at the stop j, tidep;n denotes the departure time from the
stop i, Titjravel;n denotes the travel time between stops i and j.</p>
      <p>Then the problem of the arrival time prediction is reduced to the problem of travel time
prediction Titjravel;n or, equivalently, problem of vehicle's speed vinj prediction.</p>
      <p>The problem can be formulated as follows:
using the transport network graph, as well as statistical and real-time data, predict a speed
v^inj (tc; t) at the time t, considering that the prediction is calculated at time tc.</p>
    </sec>
    <sec id="sec-3">
      <title>4. Proposed model</title>
      <p>4.1. Factors of prediction
In order to obtain a speed prediction v^inj of a vehicle n 2 N running the route r 2 R, various
factors a ecting the predicted value can be taken into account. In contrast to the works known to
the authors, this article proposes the use of heterogeneous information describing the transport
situation. This information de ned as follows:</p>
      <p>The speed vinj of the vehicle n 2 N on the segment wij ;
The weighted average speed virjoute;r of vehicles running the route r 2 R on the segment wij :
where !(t) is a kernel</p>
      <p>max is a time interval for which estimates of speed are considered.</p>
      <p>The weighted average speed viajll of vehicles with any route on the segment wij :
virjoute;r(t) =</p>
      <p>Pk2Nr ! t</p>
      <p>Pk2Nr ! t
tdep;k vij</p>
      <p>k
i
tdep;k
i</p>
      <p>;
!(t) =
(exp (
0;
t); t
t &gt;
max;
max;
viajll(t) =</p>
      <p>P
r2Rij
P
r2Rij</p>
      <p>Pk2Nr ! t</p>
      <p>Pk2Nr ! t
tdep;k vij</p>
      <p>k
i
tdep;k
i
;</p>
      <sec id="sec-3-1">
        <title>The average hourly tra c ow speed vhour;</title>
        <p>The average daily tra c ow speed vday;
The historical average speed visjtat(t) of vehicles with any route on the segment wij at time
interval t;
The average tra c ow speed vifjlow(t) on the segment wij at the time point t;
The tra c ow speed vifjNow on the segment wij at the current time.</p>
        <p>
          It is assumed that the average hourly and average daily speeds re ect the current seasonal
and weather situation indirectly, the average speed of the tra c ow re ects the changes in the
tra c situation and the occurrence of congestion.
4.2. The basic model of an arti cial neural network
In [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ], the neural network model with one hidden layer containing 5 neurons was used as a
prediction model. Three factors were used to predict the travel time of the vehicle n 2 N with
the route r 2 R on the road segment wij :
the weighted speed of vehicle with the same route on the road segment virjoute;r(t);
the weighted speed of vehicle with any route on the road segment viajll(t);
the vehicle speed on the previous segment vin 1;i.
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>We denote this model as ANN3;5;1.</title>
        <sec id="sec-3-2-1">
          <title>4.3. Support vector regression model</title>
          <p>The support vector regression (SVR) method is a special class of algorithms characterized by the
use of kernels. The most common kernels are linear, polynomial, radial basis function, sigmoid.
In this work a radial basis function is used in the following form:
k(x; x0) = exp(
kx
x0k2);
where &gt; 0 is a model parameter, x and x0 are the input data of the model. The three above
mentioned factors are used as an input data.
4.4. Extended model of arti cial neural network
We proposed to use an extended model of the neural network to predict the speed v^inj (tc; t) of
a vehicle n 2 N , running the route r 2 R. The input data includes all the factors described in
Section 4.1, and it can be written as a vector:</p>
          <p>V = vin 1;i; vinj1; vinj2;virjoute;r(t); viajll(t); visjtat(tc); visjtat(t);
vifjlow(tc); vij</p>
          <p>flow(t); vhour(t); vday(t); vifjNow :
where n1 is a preceding vehicle of the route r which passed the transport segment wij , n2 is a
preceding vehicle of any route which passed the road segment wij .</p>
          <p>
            The neural network model of the following form is used for prediction: one input layer (12
neurons), one hidden layer (13 neurons) and one output layer (1 neuron). The Adam [
            <xref ref-type="bibr" rid="ref21">21</xref>
            ] method
was used as the optimization method.
          </p>
        </sec>
        <sec id="sec-3-2-2">
          <title>4.5. Experiments</title>
          <p>Experimental studies of models were carried out on tra c data of bus routes in the transport
network of Samara, Russia, for two months, from August 1, 2018 to September 30, 2018. The
forecast was performed for 837 vehicles on 176 routes.</p>
          <p>The comparison of the linear regression model LR, basic neural network model ANN3;5;1,
support vector regression model SVR and the extended neural network model ANNext was
made.</p>
          <p>In order to evaluate the prediction quality of each prediction model, two standard metrics
were used: mean absolute percentage error (MAPE) and mean absolute error (MAE).</p>
          <p>n
MAPE = 1 X jvt
n
t=1</p>
          <p>n
MAE = 1 X
n
t=1</p>
          <p>v^tj
vt
jvt</p>
          <p>100%
v^tj
50
%
,
E
P40
A
M
30
20
10
0
1000
900
800
700
,c600
EA500
M400
300
200
100
0</p>
          <p>In this case, the size of the input data used for training and forecasting was limited to the
size of selected route's data. Data obtained on a given day were used as a test data, all the rest
data were used as a train data. The table shows the average MAE and MAPE values obtained
for 7 days. From the obtained results it can be seen that the average value of the prediction
error for one road segment is quite high. The best result is demonstrated by the extended model
of an arti cial neural network.</p>
          <p>However, more interesting are the results of predicting the arrival time of vehicles at distant
stops. For experimental studies of the dependence of MAPE and MAE on the forecast horizon,
the full volume of data on the vehicles movement was used. The studies were carryed out for one
day and all routes, while the data obtained for the entire above-mentioned period of time except
the selected day were used as archival data. The time spent on training the SVR model amounts
to tens of hours for such a signi cant amount of input data and the results obtained above show
the superiority of other models. Thus the SVR model was not used on these experimental
studies.The dependence of MAPE and MAE on the forecast horizon are shown in Figure 1.
0
10
20 30 40
Forecast horizon, m,in
50
60
0
10
20 30 40
Forecast horizon. min
50
60
Extended model of artificial neural network</p>
          <p>Linear regression</p>
          <p>Basic model of artificial neural network</p>
          <p>Based on the obtained results, it can be concluded that the prediction quality of the extended
model of an arti cial neural network is higher throughout the forecast horizon than the prediction
quality of the other models . The worst result was obtained using the basic model of the arti cial
neural network. At the same time, the value of MAPE decreases for all considered models with
an increase in the forecast horizon value. The prediction quality of the vehicles arrival time at
distant stops is signi cantly higher than the prediction quality for the nearest stops.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>5. Conclusion</title>
      <p>This paper proposed an extended model of the neural network which takes into account
heterogeneous information to predict the arrival time of the public transport. The experiments
were carried out on real tra c information about bus routes in the Samara, Russia. The proposed
model showed the best results compared to linear regression model, support vector regression
model and the basic model of the arti cial neural network.</p>
      <p>The proposed model can be used to predict the arrival time of public transport in real time.</p>
      <p>The possible direction of further research includes the usage of di erent models for individual
routes or periods of the day.
Acknowledgments
This work was supported by the RFBR (research projects N18-29-03135-mk, N 18-07-00605 A).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Agafonov</surname>
            <given-names>A A</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sergeyev</surname>
            <given-names>A V</given-names>
          </string-name>
          and
          <article-title>Chernov A V 2012 Forecasting of the motion parameters of city transport by satellite monitoring data</article-title>
          <source>Computer Optics</source>
          <volume>36</volume>
          (
          <issue>2</issue>
          )
          <fpage>453</fpage>
          -
          <lpage>458</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Jeon</surname>
            <given-names>R</given-names>
          </string-name>
          and
          <string-name>
            <surname>Rilett L 2005</surname>
          </string-name>
          <article-title>Prediction model of bus arrival time for real-time applications</article-title>
          <source>Transportation Research Record</source>
          <volume>1927</volume>
          <fpage>195</fpage>
          -
          <lpage>204</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Chanh</surname>
            <given-names>H</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Park</surname>
            <given-names>D</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            <given-names>S</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            <given-names>H</given-names>
          </string-name>
          and
          <string-name>
            <surname>Baek S 2010</surname>
          </string-name>
          <article-title>Dynamic multi-interval bus travel time prediction using bus transit data</article-title>
          <source>Transportmetrica</source>
          <volume>6</volume>
          <fpage>19</fpage>
          -
          <lpage>38</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Smith</surname>
            <given-names>B</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Williams</surname>
            <given-names>B</given-names>
          </string-name>
          and
          <string-name>
            <surname>Keith Oswald R 2002</surname>
          </string-name>
          <article-title>Comparison of parametric and nonparametric models for traffic flow</article-title>
          forecasting Transportation Research Part C: Emerging Technologies 10
          <fpage>303</fpage>
          -
          <lpage>321</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Agafonov</surname>
            <given-names>A A</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yumaganov</surname>
            <given-names>A S</given-names>
          </string-name>
          and
          <string-name>
            <surname>Myasnikov</surname>
            <given-names>V V</given-names>
          </string-name>
          <year>2018</year>
          <article-title>Big data analysis in a geoinformatic problem of short-term traffic flow forecasting based on a K nearest neighbors</article-title>
          method
          <source>Computer Optics</source>
          <volume>42</volume>
          (
          <issue>6</issue>
          )
          <fpage>1101</fpage>
          -
          <lpage>1111</lpage>
          DOI: 10.18287/
          <fpage>2412</fpage>
          -6179-2018-42-6-
          <fpage>1101</fpage>
          -1111
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Xu</surname>
            <given-names>H</given-names>
          </string-name>
          and
          <string-name>
            <surname>Ying J 2017</surname>
          </string-name>
          <article-title>Bus arrival time prediction with real-time and historic data</article-title>
          <source>Cluster Computing</source>
          <volume>20</volume>
          <fpage>3099</fpage>
          -
          <lpage>3106</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Chen</surname>
            <given-names>M</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            <given-names>X</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xia</surname>
            <given-names>J</given-names>
          </string-name>
          and
          <string-name>
            <surname>Chien</surname>
            <given-names>S 2004</given-names>
          </string-name>
          <article-title>A dynamic bus-arrival time prediction model based on APC data Computer-Aided Civil</article-title>
          and
          <source>Infrastructure Engineering</source>
          <volume>19</volume>
          <fpage>364</fpage>
          -
          <lpage>376</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Chien</surname>
            <given-names>S J</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ding</surname>
            <given-names>Y</given-names>
          </string-name>
          and
          <string-name>
            <surname>Wei C 2002</surname>
          </string-name>
          <article-title>Dynamic bus arrival time prediction with artificial neural networks</article-title>
          <source>Journal of Transportation Engineering</source>
          <volume>128</volume>
          <fpage>429</fpage>
          -
          <lpage>438</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>van Hinsbergen</surname>
            <given-names>C</given-names>
          </string-name>
          ,
          <string-name>
            <surname>van Lint</surname>
            <given-names>J and van Zuylen H 2009</given-names>
          </string-name>
          <article-title>Bayesian committee of neural networks to predict travel times with confidence intervals Transportation Research Part C: Emerging Technologies</article-title>
          <volume>17</volume>
          <fpage>498</fpage>
          -
          <lpage>509</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Jeong</surname>
            <given-names>R</given-names>
          </string-name>
          and
          <string-name>
            <surname>Rilett L 2004</surname>
          </string-name>
          <article-title>Bus arrival time prediction using artificial neural network model Proc</article-title>
          .
          <source>of the 7th International IEEE Conference on Intelligent Transportation Systems</source>
          <volume>1</volume>
          <fpage>988</fpage>
          -
          <lpage>993</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Yang</surname>
            <given-names>M</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            <given-names>C</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            <given-names>L</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yan</surname>
            <given-names>X</given-names>
          </string-name>
          and
          <string-name>
            <surname>Zhou L 2016</surname>
          </string-name>
          <article-title>Bus arrival time prediction using support vector machine with genetic algorithm</article-title>
          <source>Neural Network World</source>
          <volume>26</volume>
          <fpage>205</fpage>
          -
          <lpage>217</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Bin</surname>
            <given-names>Y</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhongzhen</surname>
            <given-names>Y</given-names>
          </string-name>
          and
          <string-name>
            <surname>Baozhen</surname>
            <given-names>Y 2006</given-names>
          </string-name>
          <article-title>Bus arrival time prediction using support vector machines</article-title>
          <source>Journal of Intelligent Transportation Systems: Technology, Planning, and Operations</source>
          <volume>10</volume>
          <fpage>151</fpage>
          -
          <lpage>158</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Yu</surname>
            <given-names>B</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang Z Z and Yu</surname>
            <given-names>B 2009</given-names>
          </string-name>
          <article-title>Hybrid model for multi-stop arrival time prediction</article-title>
          <source>Neural Network World</source>
          <volume>19</volume>
          <fpage>321</fpage>
          -
          <lpage>332</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Agafonov</surname>
            <given-names>A</given-names>
          </string-name>
          and
          <string-name>
            <surname>Myasnikov</surname>
            <given-names>V 2015</given-names>
          </string-name>
          <article-title>Traffic flow forecasting algorithm based on combination of adaptive elementary predictors</article-title>
          <source>Communications in Computer and Information Science</source>
          <volume>542</volume>
          <fpage>163</fpage>
          -
          <lpage>174</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Yu</surname>
            <given-names>B</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            <given-names>Z</given-names>
            Z
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            <given-names>K</given-names>
          </string-name>
          and
          <string-name>
            <surname>Yu B 2010</surname>
          </string-name>
          <article-title>Hybrid model for prediction of bus arrival times at next station</article-title>
          <source>Journal of Advanced Transportation</source>
          <volume>44</volume>
          <fpage>193</fpage>
          -
          <lpage>204</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Zheng</surname>
            <given-names>W</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee D H and Shi</surname>
            <given-names>Q 2006</given-names>
          </string-name>
          <article-title>Short-term freeway traffic flow prediction: Bayesian combined neural network approach</article-title>
          <source>Journal of Transportation Engineering</source>
          <volume>132</volume>
          <fpage>114</fpage>
          -
          <lpage>121</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Agafonov</surname>
            <given-names>A A</given-names>
          </string-name>
          and
          <string-name>
            <surname>Myasnikov</surname>
            <given-names>V V</given-names>
          </string-name>
          <year>2016</year>
          <article-title>Method for the reliable shortest path search in timedependent stochastic networks and its application to GIS-based traffic</article-title>
          control
          <source>Computer Optics</source>
          <volume>40</volume>
          (
          <issue>2</issue>
          )
          <fpage>275</fpage>
          -
          <lpage>283</lpage>
          DOI: 10.18287/
          <fpage>2412</fpage>
          -6179-2016-40-2-
          <fpage>275</fpage>
          -283
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Agafonov</surname>
            <given-names>A A</given-names>
          </string-name>
          and
          <string-name>
            <surname>Myasnikov</surname>
            <given-names>V V</given-names>
          </string-name>
          <year>2018</year>
          <article-title>Numerical route reservation method in the geoinformatic task of autonomous vehicle routing</article-title>
          <source>Computer Optics</source>
          <volume>42</volume>
          (
          <issue>5</issue>
          )
          <fpage>912</fpage>
          -
          <lpage>920</lpage>
          DOI: 10.18287/
          <fpage>2412</fpage>
          -6179-2018-42-5-
          <fpage>912</fpage>
          -920
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Yu</surname>
            <given-names>B</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lam</surname>
            <given-names>W</given-names>
          </string-name>
          and
          <string-name>
            <surname>Tam</surname>
            <given-names>M 2011</given-names>
          </string-name>
          <article-title>Bus arrival time prediction at bus stop with multiple routes Transportation Research Part C: Emerging Technologies</article-title>
          <volume>19</volume>
          <fpage>1157</fpage>
          -
          <lpage>1170</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Yin</surname>
            <given-names>T</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhong</surname>
            <given-names>G</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
            <given-names>J</given-names>
          </string-name>
          ,
          <string-name>
            <surname>He</surname>
            <given-names>S</given-names>
          </string-name>
          and
          <string-name>
            <surname>Ran</surname>
            <given-names>B 2017</given-names>
          </string-name>
          <article-title>A prediction model of bus arrival time at stops with multi-routes</article-title>
          <source>Transportation research procedia</source>
          <volume>25</volume>
          <fpage>4627</fpage>
          -
          <lpage>4640</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Kingma D P and Ba J L 2014</surname>
          </string-name>
          <article-title>Adam: A Method for Stochastic Optimization Computing Research Repository 15</article-title>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>