<!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>
      <journal-title-group>
        <journal-title>H. Tian);</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Huihui Tian</string-name>
          <email>tianhuihui@hbbut.edu.cn</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jun Su</string-name>
          <email>sujuncs@hbut.edu.cn</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Orest Kochan</string-name>
          <email>orest.v.kochan@lpnu.ua</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Adaptive Inertia Weights, Convolutional Neural Network, Chaotic Mapping, GRU Neural</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Hubei University of Technology</institution>
          ,
          <addr-line>No.28 Street NanLi, Wuhan, 430068, Country</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Lviv Polytechnic National University</institution>
          ,
          <addr-line>12 S. Bandera Str., Lviv, 79013</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2009</year>
      </pub-date>
      <volume>000</volume>
      <fpage>0</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>In recent years, how to forecast traffic flow quickly and accurately has become a key issue in building an intelligent transportation system. Due to the temporal and spatial correlation of traffic flow data, we propose a prediction model combining convolutional neural network (CNN), gated recurrent unit (GRU) and improved slime mould algorithm (ISMA). The basic idea is to construct the traffic flow data as a two-dimensional matrix containing temporal and spatial information, and use CNN to obtain location-related spatial features and use GRU's memory function to obtain the temporal distribution features. Secondly, for the shortcomings of the slime mould algorithm with low initial population quality, this paper adds Tent chaos mapping and adaptive inertia weighting strategy to obtain the ISMA algorithm and uses it to find the optimal combination of hyperparameters for the GRU network to construct the ISMA-CNN-GRU prediction model. Finally, simulation experiments are conducted on the traffic flow dataset of Heathrow Airport, UK. The experiments confirm that the ISMA-CNNCOLINS-2023: 7th International Conference on Computational Linguistics and Intelligent Systems, April 20-21, 2023, Kharkiv, Ukraine</p>
      </abstract>
      <kwd-group>
        <kwd>1</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>GRU
exhibits higher prediction
accuracy compared to the</p>
    </sec>
    <sec id="sec-2">
      <title>APSO-GRU model, the unoptimized CNN-GRU model and the SMA-CNN-GRU model.</title>
      <sec id="sec-2-1">
        <title>1. Introduction</title>
        <p>In recent years, the phenomenon of vehicle congestion has been occurring more and more
frequently, which not only brings trouble to people's travel [1], but also increases the workload of
traffic police departments. Intelligent transportation system came into being, and how to predict urban
traffic flow quickly and accurately has become a key issue in building an intelligent transportation
system. Most of the traditional traffic flow prediction models are highly dependent on experienced
experts, lack of independent learning ability and low prediction accuracy, so they have been gradually
eliminated. Neural networks are widely used in traffic flow prediction because of their high
operational efficiency and independent learning ability [2]. Therefore, this paper starts from the neural
network to improve the traffic prediction accuracy as the goal of research.</p>
        <p>With the emergence of intelligent optimization algorithms, more and more scholars have improved
the prediction ability of network models by combining algorithms with neural networks. In the
literature [3], a based LSTM-RF traffic flow prediction model is proposed, which uses Long
ShortTerm Memory (LSTM) to obtain the temporal characteristics of the target road and combines them
with the upstream and downstream data of neighboring road sections to be incorporated into a random
forest model to predict traffic flow. The superior memory function of LSTM network solves the
problem that Recurrent Neural Network (RNN) is prone to gradient disappearance and gradient
explosion, but the training speed is still slow. The literature [4-7] compared GRU with other</p>
        <p>2023 Copyright for this paper by its authors.
prediction models, such as RNN, LSTM and Auto Regressive Integrated Moving Average (ARIMA)
statistical technology models, where GRU showed superior prediction results. In the literature [8], the
adaptive nonlinear inertial weight particle swarm optimization (APSO) algorithm was proposed, and
the APSO-GRU model shows significant stability.</p>
      </sec>
      <sec id="sec-2-2">
        <title>2. Related work</title>
      </sec>
      <sec id="sec-2-3">
        <title>2.1. GRU Neural Network</title>
        <p>
          To balance the input and forgetting gates in LSTM [9], GRU improves on the LSTM network by
adding update gates z to provide memory of past history information [10]. This not only optimizes its
internal structure, but also increases its learning speed. The GRU model is defined in the way shown
in Equations (
          <xref ref-type="bibr" rid="ref1">1</xref>
          )-(
          <xref ref-type="bibr" rid="ref6">6</xref>
          ) [11]. The inputs to the update gate   and reset gate   in GRU are   , ℎ −1,
where   is the tth component of the input sequence  and ℎ −1 is the hidden state of the previous time
step [12];   ,   ,   ,   ,  ℎ , and  ℎ are the weight matrices [13];   ,   and  ℎ are the bias
matrices.  is the Sigmoid function. ∗ denotes the corresponding elements in the matrix are
multiplied. The GRU always calculates a candidate state before the current hidden state. Finally, the
network calculates the final state ℎ at the current moment.
        </p>
        <p>zt   U z xt  Wzht1  bz 
rt   Ur xt  Wr ht1  br 
ht  tanh Uh xt  Wh  rt * ht1   bh 
ht  1 zt  * ht1  zt * ht</p>
        <p>  x  
tanh  x </p>
        <p>
          1
1 ex
ex  ex
ex  ex
(
          <xref ref-type="bibr" rid="ref1">1</xref>
          )
(
          <xref ref-type="bibr" rid="ref2">2</xref>
          )
(
          <xref ref-type="bibr" rid="ref3">3</xref>
          )
(
          <xref ref-type="bibr" rid="ref4">4</xref>
          )
(
          <xref ref-type="bibr" rid="ref5">5</xref>
          )
(
          <xref ref-type="bibr" rid="ref6">6</xref>
          )
2.2.
        </p>
      </sec>
      <sec id="sec-2-4">
        <title>Convolutional Neural Network</title>
        <p>The traffic flow of a site is not only related to the past traffic flow of that site, but also influenced
by the traffic flow of other sites, that is, by the spatial characteristics. CNNs use both local
connectivity and shared weights to identify spatially relevant features, which can effectively reduce
the complexity and errors such as over-fitting during data processing [14]. Therefore, this paper uses
CNN for spatial feature mining of traffic flow. As shown in Figure 1. Its structure consists of an input
layer, a convolutional layer, a pooling layer, and a fully connected layer [15]. The convolution layer
mainly performs convolution operations on the input data to extract local feature information and
obtain the feature matrix. After feature extraction in the convolutional layer, the number of features is
not reduced, so it needs to go through the pooling layer to reduce the amount of data processing, and
avoid too many parameters in the fully connected layer.</p>
        <p>Traffic flow data Convolution layer
Figure 1: Convolutional neural network flow chart
2.3.</p>
      </sec>
      <sec id="sec-2-5">
        <title>Slime Mould Algorithm</title>
        <p>Pooling layer</p>
        <p>Fully connected layer</p>
        <p>In 2020, Li et al [16] proposed the Slime Mould Algorithm (SMA) based on the oscillatory
foraging activity of slime mould. The higher the concentration of food odor in the air, resulting in the
accumulation of more slime mould in that domain; when the concentration of food in that range is low,
slime mould will be lured to forage in other domains. When the slime mould finds a superior quality
food source, they will also separate some individuals to explore better food in other areas.</p>
        <p>
          The equation of slime mould population renewal location is shown in (
          <xref ref-type="bibr" rid="ref7">7</xref>
          ).  is the number of
iterations;   ( ) is the current best position;   ( ) and   ( ) are the positions of two arbitrarily
selected individuals.  is the slime mould quality, which denotes the fitness weight.   and   are the
control parameters;   lies within the range [-a, a]; r and rand are random numbers between [0,1]; 
and  represent the upper and the lower bounds of the exploration domain, respectively; and  is a
custom parameter.
        </p>
        <p> rand  ub  lb  lb, rand  z

x t 1  xb t   vb   w  xA t   xB t  , r  p
 vc  x t  , r  p
p  tanh | s i   DF |</p>
        <p>
a  arctan h 1

t </p>
        <p>
tmax </p>
        <p>
          The mathematical model to describe the control variable  and parameter  is shown in Equations
(
          <xref ref-type="bibr" rid="ref8">8</xref>
          ) and (
          <xref ref-type="bibr" rid="ref9">9</xref>
          ).  ∈ 1, 2, 3,…, n;  ( ) is the current individual fitness value; DF is the current best fitness
value.
        </p>
        <p>
          The weight parameter  is described as follows in Equation (
          <xref ref-type="bibr" rid="ref10">10</xref>
          ).   denotes the best fitness of the
current iteration;   denotes the worst;  denotes the top half of individuals in terms of
fitness;  denotes the remaining individuals; and   ( ) is the fitness ranking and denotes the
odor index.
(
          <xref ref-type="bibr" rid="ref7">7</xref>
          )
(
          <xref ref-type="bibr" rid="ref8">8</xref>
          )
(
          <xref ref-type="bibr" rid="ref9">9</xref>
          )
1  r  log  bbff swif  1 , condition
 

w  sindex i    1  r  log  bbff sw if  1 , else


 sindex i   sort  s 
(
          <xref ref-type="bibr" rid="ref10">10</xref>
          )
        </p>
      </sec>
      <sec id="sec-2-6">
        <title>2.4. Proposed methodology</title>
      </sec>
      <sec id="sec-2-7">
        <title>2.4.1. Improved Slime Mould Algorithm</title>
        <p>It was found that the synergistic effect of   and   causes the slime mould to not only shrink
toward the optimal position, but also separate a part of organic matter to explore other fields, and the
oscillatory effect of   increases the possibility of global exploration [17]. But the oscillatory effect of
  weakens significantly in the late iterations, which leads to the fact that the algorithm falls into a
local optimum easily [18]. Therefore, the improved slime mould algorithm (ISMA) which improved
by Tent chaotic mapping and the adaptive inertia weighting strategy makes the search of slime mould
more effective.</p>
        <p>Among the many chaotic mapping functions, Tent chaotic mapping is chosen in this paper because
of its uniform distribution of chaotic sequences, better traversal uniformity and higher iteration speed
 Y
 i, j , Yi, j  0.7
 0.7
Yi, j1  
1  Yi, j , Yi, j  0.7
 0.3</p>
        <p>X i, j  Yi, j  (ub  lb)  lb</p>
        <p>
          It is found that at the beginning of each iteration the slime mould is prone to a large forward state,
which leads to a lack of search range and makes the algorithm easily fall into local extrema. We
propose the adaptive inertia weight strategy as shown in (13)(14) to help the slime mould jump out of
the local extrema. w1 and w2 are weight adjustment parameters. The pseudo-code for ISMA is shown
in Table 1.
[19]. The expressions are shown in (
          <xref ref-type="bibr" rid="ref11">11</xref>
          ) and (12).  denotes the population size;  denotes the chaotic
sequence number;   , is the chaotic sequence of [0,1]; the initial position of the population is obtained
using the   , inverse mapping; and [ ,  ] denotes the search range of the individual position   , .
(
          <xref ref-type="bibr" rid="ref11">11</xref>
          )
(12)
(13)
(14)
 rand  ub  lb  lb, rand  z

x t 1  xb t   m  vb   w  xA t   xB t  , r  p
        </p>
        <p> m  vc  x t  , r  p
m  w  (w1  w2 )(
1</p>
        <p>t
tmax
)2  2(w1  w2 )(</p>
        <p>t
tmax
)</p>
      </sec>
      <sec id="sec-2-8">
        <title>2.4.2. ISMA-CNN-GRU Prediction Model</title>
        <p>We propose to combine CNN and GRU to form a model. CNN mines spatial association features
by using local connectivity when processing time series data, while GRU can extract deep features
before and after time series data; then the ISMA algorithm is used to solve for the best combination of
hyperparameters in the network, and an ISMA-CNN-GRU prediction model is established. The input
to the model will be a two-dimensional spatio-temporal matrix constructed using the traffic flow by
time as the horizontal coordinate of the matrix and the site ID as the vertical coordinate of the matrix.
The spatio-temporal matrix is equation (15).   ,  ,  denote the traffic flow at different sites.
The ISMA-CNN-GRU model framework is illustrated in Figure 2.</p>
        <p>First, the traffic flow is preprocessed and transformed into a two-dimensional spatial and temporal
matrix, and the training set is fed into the convolutional neural network to extract the spatial
distribution features of the traffic flow.</p>
        <p>After the convolutional operation, the data are transferred to the pooling layer, which reduces the
dimensionality of the model to improve the computational speed of the model. The final data are
convolved by the convolutional neural network to obtain data samples with spatial characteristics.</p>
        <p>The local features extracted by the convolutional neural network are then used as input to the GRU
to further extract the temporal features of traffic flow.</p>
        <p>Finally, the predicted results are output through the fully connected layer, which is the output layer.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Input Layer</title>
    </sec>
    <sec id="sec-4">
      <title>Convolution Layer</title>
    </sec>
    <sec id="sec-5">
      <title>Pooling Layer GRU</title>
    </sec>
    <sec id="sec-6">
      <title>Output Layer</title>
    </sec>
    <sec id="sec-7">
      <title>Traffic Flow Data</title>
    </sec>
    <sec id="sec-8">
      <title>Data pre-processing</title>
    </sec>
    <sec id="sec-9">
      <title>Constructing a two-dimensional space matrix</title>
      <p>x1
x2
x3
xt
GRU
GRU
y1
GRU
GRU
y2
GRU
GRU
y3
GRU
GRU
yt
...
...
...
...
...
...</p>
    </sec>
    <sec id="sec-10">
      <title>ISMA Optimisation</title>
    </sec>
    <sec id="sec-11">
      <title>Number of neurons L1</title>
    </sec>
    <sec id="sec-12">
      <title>Number of neurons L2</title>
    </sec>
    <sec id="sec-13">
      <title>Learning Rate</title>
    </sec>
    <sec id="sec-14">
      <title>Batch size</title>
    </sec>
    <sec id="sec-15">
      <title>Number of iterations</title>
    </sec>
    <sec id="sec-16">
      <title>The specific steps are as follows.</title>
      <p>Step 1: pre-processing of traffic flow data and partitioning of the data set.</p>
      <p>Step 2: initialize the structure of the CNN-GRU neural network and initialize the basic parameters.
Step 3: initialize the slime by the Tent chaos mapping.</p>
      <p>Step 4: construct a spatio-temporal matrix of the traffic flow based on site and time traffic flows.
Step 5: input the matrix data into the CNN to extract the spatial features of the traffic flow.
Step 6: input the CNN-processed data to the GRU layer.</p>
      <p>Step 7: calculate the fitness of the slime mould using the fitness function, retain the best value.</p>
      <p>
        Step 8: calculate the weight parameter w according to equation (
        <xref ref-type="bibr" rid="ref10">10</xref>
        ) and generate adaptive inertia
weight factors by equation (13) (14) to update the position of the slime mould.
      </p>
      <p>Step 9: calculate and re-ranking the slime adaptation, update the best position and the fitness value.</p>
      <p>Step 10: determine whether the algorithm has reached the maximum number of iterations, and if
so, end and output the optimal solution, otherwise return to step 6 to continue execution.</p>
      <p>Step 11: the hyperparameters optimized by the slime mould algorithm are used as parameters for
the CNN-GRU network, and the optimized model is used to train and predict traffic flow.</p>
      <p>We choose the convolutional kernel size of 3×3, the number of convolutional layers is 1, the
number of convolutional kernels is 32, and the number of pooling layers is 1, using mean pooling.
The GRU contains two layers. The activation function is the Relu. The loss function is MSE. Setting
the slime population size to 30 and the maximum number of iterations to 10. The adaptive inertia
weights  1=0.9,  2=0.5. Using MSE as the fitness function, the formula is shown in (16), where n is
the number of predicted samples,   is the sample output value and   is the actual output value.
n (Yi  yi )2
f (i)  MSE  
i1 n
(16)</p>
      <sec id="sec-16-1">
        <title>3. ISMA-CNN-GRU Based Traffic Flow Prediction</title>
      </sec>
      <sec id="sec-16-2">
        <title>3.1. Experiment Dataset</title>
        <p>The experimental running environment in this section is a 64-bit Windows 10 operating system
with an Intel Core i5-7200U CPU @ 2.50GHz and a host installation with 4+8G of RAM. The
simulation software used for testing is MATLAB version R2021b. The traffic flow data was taken
from the British Motorways Dataset website. As shown in Figure 3, the selected dataset contains
information from seven sites on the M25 freeway near Heathrow Airport, UK. The seven sites in the
dataset are used as the vertical coordinates of the spatio-temporal matrix, and the horizontal
coordinates are the data of each site divided by 15 minutes. In order to observe the prediction effect of
the ISMA-CNN-GRU model more intuitively, this subsection takes the flow of site P as an example
for prediction. The traffic volumes from August 1 to 25 in summer and September 1 to 25 in autumn
were set as the training set, and August 25 to 30 and September 25 to 30 were set as the test set.</p>
        <p>In order to facilitate data processing, the commonly used normalization method was chosen to
normalize the historical data before training the network, scaling the data to the range of [0,1]. The
calculation formula is shown in (17), where  is the original data;  ′ is the normalized data;   is
the maximum values of the input quantities; and   is the minimum.</p>
        <p>x' </p>
        <p>x  xmin
xmax  xmin
3.3.</p>
      </sec>
      <sec id="sec-16-3">
        <title>Prediction Evaluation Indicators</title>
        <p>In order to facilitate us to compare the prediction accuracy of each model more clearly, we choose
the commonly used error evaluation metrics of mean absolute error (MAE) [20, 21], root mean square
error (RMSE) [22], mean absolute percentage error (MAPE) [23] and coefficient of determination
(R2) [24, 25] to evaluate the prediction effectiveness and goodness of fit of the models. The formulas
are shown in (18)-(21). n indicates the number of predicted data;  ̂ indicates the predicted data of the
ith; and   indicates the true data of the corresponding.</p>
        <p>MAE </p>
        <sec id="sec-16-3-1">
          <title>RMSE </title>
          <p>1 n
n i1 xi  xˆi
1 n</p>
          <p> (xi  xˆi )2
n i1
MAPE  1 n xi  xˆi 100%
n i1 xˆi
n
 (xˆi  xi )2
R2  1 in1
 (xi  xi )2
i1</p>
        </sec>
        <sec id="sec-16-3-2">
          <title>PICP </title>
          <p>1 n</p>
          <p> ci 100%
n i1
1, yˆi [Li ,Ui ]
ci  0, yˆi [Li ,Ui ]
PINAW  1 n Ui  Li 100%</p>
          <p>n i1 yˆi
CWC  PINAW (1   (PICP)e (PICP ) )</p>
          <p>0, PICP  
 = 
1, PICP  
(17)
(18)
(19)
(20)
(21)
(22)
(23)
(24)
(25)
(26)</p>
          <p>The metrics used to evaluate the prediction intervals are selected as the prediction intervals
coverage probability (PICP) [26], prediction interval normalized average width (PINAW) [27] and
coverage width criterion (CWC) [28]. n denotes the total number of samples;   is the reliability
metric of the upper interval   and the lower interval   against the true value  ̂ ;μ is the confidence
level and η is the penalty parameter [29]. Here μ = 0.95, η = 20. The formulas are shown in
(22)(26).
3.4.</p>
        </sec>
      </sec>
      <sec id="sec-16-4">
        <title>Prediction Results of ISMA-CNN-GRU</title>
        <p>ISMA searches for hyperparameter combinations of CNN-GRU networks, using MSE as the
judging criterion. The trend of the fitness value of the ISMA iteration process is shown in Figure 4.
The fitness value decreases rapidly with the increasing number of iterations and then remains stable,
and reaches a steady state with the minimum error at the maximum number of iterations.</p>
        <p>The variation of RMSE of the ISMA-CNN-GRU model, is shown in Figure 5. It can be seen that
the RMSE metric of the model decreases rapidly in the first 15 iterations of training. When the
number of training iterations reached 48, the model was basically stable. Finally, the number of
neurons in the first hidden layer is L1=88, the number of neurons in the second hidden layer is L2=78,
the batch size is Batchsize=27, the learning rate is lr=0.0055, and the number of iterations is K=48.</p>
        <p>In order to observe the prediction effect of the ISMA-CNN-GRU model more intuitively, this
subsection takes the flow of site P as an example for prediction, with a sample size of 960 for the
traffic flow from the test set. This experiment compares the prediction results of the
ISMA-CNNGRU model with the APSO-GRU [8], the CNN-GRU and SMA-CNN-GRU models, as shown in
Figure 6. The ISMA-CNN-GRU model and SMA-CNN-GRU model perform better than the
CNNGRU model and the APSO-GRU model in prediction performance, and the ISMA-CNN-GRU model
can fit the true value curve better. It can be seen that although the prediction results do not show a
significant difference between summer and autumn, and the seasonality is not obvious, the
ISMACNN-GRU still shows high prediction accuracy.</p>
        <p>The comparison results based on the error estimation evaluation metrics are shown in Table 2. The
prediction accuracy of the ISMA-CNN-GRU model is 98.4787%, that of the SMA-CNN-GRU model
is 98.16326%, and that of the CNN-GRU model is 97.6305%. the ISMA-CNN-GRU model is higher
than the SMA-CNN-GRU and CNN-GRU by 0.3161% and 0.8482%, respectively. The prediction
error of the APSO-GRU model is relatively large and the fit is poor. In addition, the highest R2 of
ISMA-CNN-GRU on this dataset is 0.9661, which is closer to 1 compared with several other models,
which reflects that this model can learn the changing pattern of traffic flow well and has high
prediction accuracy and precision, and verifies its feasibility in traffic flow prediction.</p>
        <p>The experiment was also done based on the interval prediction evaluation index. Figure 7 shows the
prediction results of the ISMA-CNN-GRU model at 95% confidence interval. As can be seen from
Table 3, the true values of all models fall within the interval when the confidence level is 95%.
Because PICP=1 indicates that the true value falls within the constructed interval. The minimum
value of CWC for the interval composite evaluation index of ISMA-CNN-GRU model is 0.628.
Compared with APSO-GRU, CNN-GRU and SMA-CNN-GRU models, both PINAW and CWC of
ISMA-CNN-GRU model have been reduced, and these two indicators fully illustrate the superiority
of the ISMA-CNN-GRU model, because when the PICP is determined, the smaller the PINAW and
the smaller the value of CWC, the narrower the prediction interval, indicating better prediction.</p>
      </sec>
      <sec id="sec-16-5">
        <title>4. Conclusion</title>
        <p>In recent years, how to forecast traffic flow quickly and accurately has become a key issue in
building an intelligent transportation system. We adopt a combination of CNN and GRU network and
ISMA algorithm to form a model. CNN is used to obtain the traffic flow distribution characteristics
between sites, and then the memory functions of GRU are used to obtain the temporal distribution
characteristics of traffic flow. Secondly, for the shortcomings of the slime mould algorithm with low
initial population quality, this paper adopts the Tent chaos mapping and adaptive inertia weighting
strategy to improve the slime mould algorithm. The hyperparameters of the GRU model are optimized
using the proposed ISMA algorithm. The simulation results show that the ISMA-CNN-GRU model
exhibits higher prediction accuracy compared with the APSO-GRU, the unoptimized CNN-GRU and
the SMA-CNN-GRU models. The accurate prediction of traffic flow by the model in this paper
contributes to the operational capacity of the transportation system as well as its operational
efficiency, and is of practical value to citizens, traffic management, road operations and infrastructure
participants. Future research will be extended in the following. The computational efficiency of the
ISMA algorithm in training out the optimal hyperparameters need to be improved. The proposed
ISMA-CNN-GRU model only selects the optimal parameter combinations, future research can design
controlled experiments to study the degree of influence of each parameter on the overall model
performance.</p>
      </sec>
      <sec id="sec-16-6">
        <title>5. References</title>
        <p>[12] U. Gupta, V. Bhattacharjee, P. S. Bishnu, StockNet—GRU based stock index prediction, Expert</p>
        <p>Systems with Applications 207 (2022). 117986. doi: 10.1016/j.eswa.2022.117986.
[13] L. Munkhdalai, M. Li, N. Theera-Umpon, S. Auephanwiriyakul, K. HoRyu, VAR-GRU: A
hybrid model for multivariate financial time series prediction, in: Proceedings of 2020 12th
Asian Conference on Intelligent Information and Database Systems, ACIIDS 2020, pp. 322-332.
[14] S. Ghimire, Z. M. Yaseen, A. A. Farooque, R. C. Deo, J. Zhang, X. Tao, Streamflow prediction
using an integrated methodology based on convolutional neural network and long short-term
memory networks, Scientific Reports 11 (2021). doi: 10.1038/s41598-021-96751-4.
[15] Z. Li, F. Liu, W. Yang, S. Peng, J. Zhou, A survey of convolutional neural networks: analysis,
applications, and prospects, IEEE transactions on neural networks and learning systems 3 (2021)
6999-7019. doi: 10.1109/TNNLS.2021.3084827.
[16] .S. Li, H. Chen, M. Wang, A. A. Heidari, S. Mirjalili, Slime mould algorithm: A new method for
stochastic optimization, Future Generation Computer Systems 111 (2020) 300-323. doi:
10.1016/j.future.2020.03.055.
[17] E. H. Houssein, M. A. Mahdy, M. J. Blondin, D. Shebl, W. M. Mohamed, Hybrid slime mould
algorithm with adaptive guided differential evolution algorithm for combinatorial and global
optimization problems, Expert Systems with Applications 174 (2021): 114689.
https://doi.org/10.1016/j.eswa.2021.114689.
[18] A. A. Ewees, L. Abualigah, D. Yousri, Z. Y. Algamal, M. A. Al-Qaness, R. A. Ibrahim, M. Abd
Elaziz, Improved slime mould algorithm based on firefly algorithm for feature selection: a case
study on QSAR model, Engineering with Computers 38, (2021) 2407–2421. doi:
10.1007/s00366-021-01342-6.
[19] A. M. Ahmed, T. A. Rashid, S. A. M. Saeed, Cat swarm optimization algorithm: a survey and
performance evaluation, Computational Intelligence and Neuroscience 2020 (2020) 4854895.
doi: 10.1155/2020/4854895.
[20] J. Chen, J. Su, O. Kochan, M. Levkiv, Metrological software test for simulating the method of
determining the thermocouple error in situ during operation, Measurement Science Review, 18
(2018) 52–58. doi: 10.1515/msr-2018-0008
[21] B. Medina-Salgado, E. Sanchez-DelaCruz, P. Pozos-Parra, J. E. Sierra, Urban traffic flow
prediction techniques: a review, Sustainable Computing: Informatics and Systems 35 (2022)
100739. doi: 10.1016/j.suscom.2022.100739.
[22] J. Becerra-Rico, M. A. Aceves-Fernández, K. Esquivel-Escalante, J. C. Pedraza-Ortega, Airborne
particle pollution predictive model using Gated Recurrent Unit (GRU) deep neural networks,
Earth Science Informatics, 13 (2020) 821-834. doi: 10.1007/s12145-020-00462-9.
[23] Navarro-Espinoza, Alfonso, et al. "Traffic flow prediction for smart traffic lights using machine
learning algorithms." Technologies 10.1 (2022): 5.
[24] M. Sabri, M. E. Hassouni, A Novel deep learning approach for short term photovoltaic power
forecasting based on GRU-CNN model, in: Proceedings of 2022 International Conference on
Energy and Green Computing, 336 (2022): 00064.
[25] V. Yeromenko, O. Kochan, The conditional least squares method for thermocouples error
modeling, in: Proceedings of the 2013 IEEE 7th International Conference on Intelligent Data
Acquisition and Advanced Computing Systems, IDAACS 2013, vol. 1, pp. 157–162. doi:
10.1109/IDAACS.2013.6662661
[26] B. Bommidi, V. Kosana, K. Teeparthi, S. Madasthu, Hybrid attention-based temporal
convolutional bidirectional LSTM approach for wind speed interval prediction, Environ Sci
Pollut Res 30, (2023) 40018–40030. doi: 10.1007/s11356-022-24641-x.
[27] X. Serrano-Guerrero, M. Briceño-León, J. M. Clairand, G. Escrivá-Escrivá, A new interval
prediction methodology for short-term electric load forecasting based on pattern recognition,
Applied Energy 297 (2021) 117173. doi: 10.1016/j.apenergy.2021.117173.
[28] A. Saeed, C. Li, M. Danish, S. Rubaiee, G. Tang, et al. Hybrid Bidirectional LSTM Model for
Short-Term Wind Speed Interval Prediction, IEEE Access 9 (2020) 182283-182294. doi:
10.1109/ACCESS.2020.3027977.</p>
        <p>A. Banik, C. Behera, T. V. Sarathkumar, A. K. Goswami, Uncertain wind power forecasting
using LSTM‐based prediction interval, IET Renewable Power Generation 14 (2020) 2657-2667.
doi: 10.1049/iet-rpg.2019.1238.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Dasgupta</surname>
            , Susmita,
            <given-names>Somik</given-names>
          </string-name>
          <string-name>
            <surname>Lall</surname>
            , and
            <given-names>David</given-names>
          </string-name>
          <string-name>
            <surname>Wheeler</surname>
          </string-name>
          .
          <article-title>"Spatiotemporal analysis of traffic congestion, air pollution, and exposure vulnerability in Tanzania."</article-title>
          <source>Science of The Total Environment</source>
          <volume>778</volume>
          (
          <year>2021</year>
          ):
          <fpage>147114</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>B. L.</given-names>
            <surname>Smith</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. J.</given-names>
            <surname>Demetsky</surname>
          </string-name>
          ,
          <article-title>"Short-Term Traffic Flow Prediction: Neural Network Approach"</article-title>
          <source>Transportation Research Record</source>
          <volume>1453</volume>
          (
          <year>1994</year>
          ):
          <fpage>98</fpage>
          -
          <lpage>104</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Shu-xu</surname>
          </string-name>
          ,
          <string-name>
            <surname>Z.</surname>
          </string-name>
          <article-title>Bao-hua, "Traffic flow prediction of urban road network based on LSTM-RF model</article-title>
          .
          <source>" Journal of Measurement Science &amp; Instrumentation Journal of Measurement Science &amp; Instrumentation</source>
          <volume>11</volume>
          (
          <year>2020</year>
          )
          <fpage>135</fpage>
          -
          <lpage>142</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>N.</given-names>
            <surname>Buslim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. L.</given-names>
            <surname>Rahmatullah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. A.</given-names>
            <surname>Setyawan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Alamsyah</surname>
          </string-name>
          ,
          <article-title>Comparing bitcoin's prediction model using GRU, RNN, and LSTM by hyperparameter optimization grid search and random search</article-title>
          ,
          <source>in: Proceedings of 2021 9th International Conference on Cyber and IT Service Management, CITSM</source>
          <year>2021</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>V.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. M.</given-names>
            <surname>Nookesh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. S.</given-names>
            <surname>Saketh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Syama</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Ramprabhakar</surname>
          </string-name>
          ,
          <article-title>Wind speed prediction using deep learning-LSTM and GRU</article-title>
          ,
          <source>in: Proceedings of 2021 2nd International Conference on Smart Electronics and Communication ICOSEC</source>
          <year>2021</year>
          , pp.
          <fpage>602</fpage>
          -
          <lpage>607</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>B.</given-names>
            <surname>Hussain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. K.</given-names>
            <surname>Afzal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ahmad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Mostafa</surname>
          </string-name>
          ,
          <article-title>Intelligent traffic flow prediction using optimized GRU model</article-title>
          ,
          <source>IEEE Access 9</source>
          (
          <year>2021</year>
          )
          <fpage>100736</fpage>
          -
          <lpage>100746</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>K. E. ArunKumar</surname>
            ,
            <given-names>D.V.</given-names>
          </string-name>
          <string-name>
            <surname>Kalaga</surname>
            ,
            <given-names>C. M. S.</given-names>
          </string-name>
          <string-name>
            <surname>Kumar</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Kawaji</surname>
            ,
            <given-names>T. M.</given-names>
          </string-name>
          <string-name>
            <surname>Brenza</surname>
          </string-name>
          ,
          <article-title>Comparative analysis of gated recurrent units (GRU), long short-term memory (LSTM) cells, autoregressive integrated moving average (ARIMA), seasonal autoregressive integrated moving average (SARIMA) for forecasting COVID-19 trends</article-title>
          , Alexandria
          <source>engineering journal 61</source>
          (
          <year>2022</year>
          )
          <fpage>7585</fpage>
          -
          <lpage>7603</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>D.</given-names>
            <surname>Han</surname>
          </string-name>
          ,
          <string-name>
            <surname>X</surname>
          </string-name>
          . Yang,
          <string-name>
            <given-names>G.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <article-title>Highway traffic speed prediction in rainy environment based on APSO-GRU</article-title>
          ,
          <source>Journal of advanced transportation</source>
          <year>2021</year>
          (
          <year>2021</year>
          )
          <fpage>1</fpage>
          -
          <lpage>11</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>L.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Qin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Przystupa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Majka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Kochan</surname>
          </string-name>
          ,
          <article-title>Individualized Short-Term Electric Load Forecasting Using Data-Driven Meta-Heuristic Method Based on LSTM Network</article-title>
          , Sensors,
          <volume>22</volume>
          (
          <year>2022</year>
          )
          <article-title>7900</article-title>
          . doi:
          <volume>10</volume>
          .3390/s22207900
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>D.</given-names>
            <surname>Bahdanau</surname>
          </string-name>
          ,
          <string-name>
            <surname>K. Cho,</surname>
          </string-name>
          <article-title>Neural Machine Translation by Jointly Learning to Align and Translate</article-title>
          , Computer Science 69 (
          <year>2014</year>
          )
          <fpage>2437</fpage>
          -
          <lpage>2448</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>S. M.</given-names>
            <surname>Abdullah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Periyasamy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. A.</given-names>
            <surname>Kamaludeen</surname>
          </string-name>
          ,
          <article-title>Optimizing traffic flow in smart cities: soft GRU-based recurrent neural networks for enhanced congestion prediction using deep learning</article-title>
          ,
          <source>Sustainability</source>
          <volume>15</volume>
          (
          <year>2023</year>
          ). doi:
          <volume>10</volume>
          .3390/su15075949.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>