<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">31541</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2022.031541</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Intelligent Slime Mould Optimization with Deep Learning Enabled Traffic Prediction in Smart Cities</article-title>
<alt-title alt-title-type="left-running-head">Intelligent Slime Mould Optimization with Deep Learning Enabled Traffic Prediction in Smart Cities</alt-title>
<alt-title alt-title-type="right-running-head">Intelligent Slime Mould Optimization with Deep Learning Enabled Traffic Prediction in Smart Cities</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Hamza</surname><given-names>Manar Ahmed</given-names>
</name><xref ref-type="aff" rid="aff-1">1</xref><email>Ma.hamza@psau.edu.sa</email></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Alsolai</surname><given-names>Hadeel</given-names>
</name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Alzahrani</surname><given-names>Jaber S.</given-names>
</name><xref ref-type="aff" rid="aff-3">3</xref></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Alamgeer</surname><given-names>Mohammad</given-names>
</name><xref ref-type="aff" rid="aff-4">4</xref>
<xref ref-type="aff" rid="aff-5">5</xref></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Sayed</surname><given-names>Mohamed Mahmoud</given-names>
</name><xref ref-type="aff" rid="aff-6">6</xref></contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western"><surname>Zamani</surname><given-names>Abu Sarwar</given-names>
</name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-7" contrib-type="author">
<name name-style="western"><surname>Yaseen</surname><given-names>Ishfaq</given-names>
</name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-8" contrib-type="author">
<name name-style="western"><surname>Motwakel</surname><given-names>Abdelwahed</given-names>
</name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<aff id="aff-1"><label>1</label><institution>Department of Computer and Self Development, Preparatory Year Deanship, Prince Sattam bin Abdulaziz University</institution>, <addr-line>AlKharj</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Information Systems, College of Computer and Information Sciences, Princess Nourah bint Abdulrahman University, P.O. Box 84428</institution>, <addr-line>Riyadh, 11671</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-3"><label>3</label><institution>Department of Industrial Engineering, College of Engineering at Alqunfudah, Umm Al-Qura University</institution>, <country>Saudi Arabia</country></aff>
<aff id="aff-4"><label>4</label><institution>Department of Information Systems, College of Science &#x0026; Art at Mahayil, King Khalid University</institution>, <country>Saudi Arabia</country></aff>
<aff id="aff-5"><label>5</label><institution>Department of Computer Science and Bioinformatics, Singhania University, Pacheri Bari</institution>, <addr-line>District Jhnujhunu, Rajasthan</addr-line>, <country>India</country></aff>
<aff id="aff-6"><label>6</label><institution>Department of Architectural Engineering, Faculty of Engineering and Technology, Future University in Egypt</institution>, <addr-line>New Cairo, 11835</addr-line>, <country>Egypt</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Manar Ahmed Hamza. Email: <email>Ma.hamza@psau.edu.sa</email></corresp>
</author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-07-25"><day>25</day>
<month>07</month>
<year>2022</year></pub-date>
<volume>73</volume>
<issue>3</issue>
<fpage>6563</fpage>
<lpage>6577</lpage>
<history>
<date date-type="received">
<day>20</day>
<month>4</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>09</day>
<month>6</month>
<year>2022</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2022 Hamza et al.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Hamza et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_31541.pdf"></self-uri>
<abstract>
<p>Intelligent Transportation System (ITS) is one of the revolutionary technologies in smart cities that helps in reducing traffic congestion and enhancing traffic quality. With the help of big data and communication technologies, ITS offers real-time investigation and highly-effective traffic management. Traffic Flow Prediction (TFP) is a vital element in smart city management and is used to forecast the upcoming traffic conditions on transportation network based on past data. Neural Network (NN) and Machine Learning (ML) models are widely utilized in resolving real-time issues since these methods are capable of dealing with adaptive data over a period of time. Deep Learning (DL) is a kind of ML technique which yields effective performance on data classification and prediction tasks. With this motivation, the current study introduces a novel Slime Mould Optimization (SMO) model with Bidirectional Gated Recurrent Unit (BiGRU) model for Traffic Prediction (SMOBGRU-TP) in smart cities. Initially, data preprocessing is performed to normalize the input data in the range of [0, 1] using min-max normalization approach. Besides, BiGRU model is employed for effective forecasting of traffic in smart cities. Moreover, the novelty of the work lies in using SMO algorithm to effectively adjust the hyperparameters of BiGRU method. The proposed SMOBGRU-TP model was experimentally validated and the simulation results established the model&#x2019;s superior performance in terms of prediction compared to existing techniques.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Smart cities</kwd>
<kwd>traffic flow prediction</kwd>
<kwd>slime mould optimization algorithm</kwd>
<kwd>deep learning</kwd>
<kwd>intelligent models</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>The tremendous growth experienced in the total number of automobiles in recent years, without any additional supporting means of transportation architecture, is one of the major issues in smart city development [<xref ref-type="bibr" rid="ref-1">1</xref>]. Due to countless number of cars on road, urban regions are overcrowded which in turn causes multiple effects such as increased air and noise pollution, reduced fuel proficiency and increased velocity of traffic. This scenario stimulates the intersection traffic by major alterations in pace control structures of metropolitan cities and towns [<xref ref-type="bibr" rid="ref-2">2</xref>]. Since these systems further disturb traffic signal control mechanisms and pollution control strategies, logistics and traffic management have become major issues to deal with. In earlier times, traffic signal controlling tools were used in traffic administration system whereas such tools are used for traffic management these days in smart cities. It plays a major role in ensuring the safety of people who experience traffic [<xref ref-type="bibr" rid="ref-3">3</xref>]. Traffic data accumulations act as a significant input in both management and understanding of the traffic. Traffic counting process is commonly executed these days while conventional city or state governments have certain ways to track the count of traffic such as microwave sensors, cameras, radar weapons, and speed guns [<xref ref-type="bibr" rid="ref-4">4</xref>]. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> illustrates the structure of ITS.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Structure of intelligent transportation systems</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31541-fig-1.png"/>
</fig>
<p>For a known period of time, researchers are working on automobile traffic prediction and proposed few models to achieve it. In specialized publications, various solutions have been proposed [<xref ref-type="bibr" rid="ref-5">5</xref>] which function in a fair and accurate manner under regular circumstances i.e., no unplanned incidents on road network. But, on many occasions, these methodologies are unprepared to find out the convoluted congestion propagation patterns. This lack of preparation results in erroneous predictions under severe conditions, although exact predictions are required during these important times [<xref ref-type="bibr" rid="ref-6">6</xref>,<xref ref-type="bibr" rid="ref-7">7</xref>]. Such serious conditions occur through multiple factors such as events, traffic threats, extreme weather conditions, and so on. Even though it is not easy to get rid of the suspicious element entirely from traffic estimation, it is possible to reduce the adverse effect of the blockage by considering exogenous data resources [<xref ref-type="bibr" rid="ref-8">8</xref>&#x2013;<xref ref-type="bibr" rid="ref-10">10</xref>].</p>
<p>The advancements made in technology and unique ideas for smart cities have encouraged great deals of development in smart cities. The application areas of Artificial Intelligence (AI) such as big data, Deep Learning (DL), Machine Learning (ML), and Internet of Things (IoT) [<xref ref-type="bibr" rid="ref-11">11</xref>], have gained importance in assisting technological evolution of smart cities. Amongst them, ML approaches have endowed numerous applications in different fields such as air pollution monitoring and estimation, city planning, energy demand, consumption estimation, mobility management and monitoring of food supply and production estimation, resource distribution, etc. [<xref ref-type="bibr" rid="ref-12">12</xref>,<xref ref-type="bibr" rid="ref-13">13</xref>].</p>
<p>The current article introduces a novel Slime Mould Optimization (SMO) with Bidirectional Gated Recurrent Unit (BiGRU) model for Traffic Prediction (SMOBGRU-TP) in smart cities. Initially, the data is pre-processed to normalize the input data within a range of [0,1] using min-max normalization approach. Besides, BiGRU model is employed for effective forecasting of traffic in smart cities. Further, SMO algorithm is utilized for fine tuning the hypervariables involved in BiGRU design. In order to validate the superior prediction performance of the proposed SMOBGRU-TP model, numerous analyses were conducted and the results established the supremacy of the proposed model.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Literature Review</title>
<p>Vijayalakshmi&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-14">14</xref>] projected an attention-based multi-stage predictive method named Convolution Neural Network(CNN)-Long Short Term Memory (LSTM). The suggested system used spatial and time-based traffic information extracted with the help of CNN and LSTM systems in order to enhance the accuracy of the model. Attention-based method assists in identifying the nearby traffic information, since the speed is an important parameter to forecast the upcoming values of the flow. In literature [<xref ref-type="bibr" rid="ref-15">15</xref>], the authors presented ML and optimization methods to empower an intelligent ecosystem. For validation purpose, a computation was executed in this study with multi-layer perceptron and Particle Swarm Optimization (PSO) approach.</p>
<p>Wang&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-16">16</xref>] introduced a multi-task DL approach named &#x2018;Multitask Recurrent Graph Convolution Network (MRGCN)&#x2019; which precisely forecasts the traffic data in smart cities. Especially, this study presented a multitasking architecture that consists of four major elements such as a task-specific decoder to forecast the traffic flow, a region flow encoding unit to model region flow dynamics, a transition flow encoding unit to explore transition flow correlation, and a context modelling module for contextual combination of two kinds of traffic flow. Khan&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-17">17</xref>] aimed at developing a data fusion-related traffic congestion control scheme in smart city using DL method. A hybrid mechanism was utilized in this study based on CNN and LSTM frameworks for region-related traffic flow prediction in smart cities. CNN was employed here for spatial dataset categorization, whereas LSTM was applied for temporal dataset classification.</p>
<p>Kuang&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-18">18</xref>] presented a traffic signal control method based on reinforcement learning using state reduction. At first, a reinforcement learning method was determined according to the previous traffic flow dataset. In addition to this, the study also presented a dual-objective reward operation that might improve the matching and degree decrease vehicle delay. Neelakandan&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-19">19</xref>] developed a powerful IoT-based traffic predictive model with OWENN approach and traffic signal control scheme using Intel 80,286 microprocessor for smart cities. The presented technique comprised of five stages such as traffic signal control system, categorization, optimization of traffic IoT values, feature extraction and IoT data collection. At first, IoT traffic dataset is gathered from the information. Next, weather, direction, and traffic dataset are extracted. Followed by, the extracted feature is fed as input to the classification model that classifies the location as either heavy traffic or not.</p>
</sec>
<sec id="s3">
<label>3</label>
<title>The Proposed Model</title>
<p>In current study, a new SMOBGRU-TP model has been proposed to forecast the flow of traffic in smart city environment. The presented SMOBGRU-TP model comprises of data pre-processing initially, during when the input data is normalized within a range of [0,1] using min-max normalization approach. Further, SMO-BiGRU model is employed for effective forecasting of traffic in smart cities.</p>
<sec id="s3_1">
<label>3.1</label>
<title>Data Pre-processing</title>
<p>At this preliminary level, the presented SMOBGRU-TP model comprises of data pre-processing which is performed to normalize the input data within a range of [0,1] through min-max normalization approach from scikit library. In these experiments, the preceding traffic flow of an hour i.e., a time series of 12 data points, is considered. It is used in the prediction of traffic flow that approaches from the following five minutes. Here, the list is generally grouped into 13 readings and the lists are utilized for training and testing purposes.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Design of BiGRU Based Predictive Model</title>
<p>After data pre-processing, BiGRU model is employed for effective forecasting of traffic in smart cities. The benefit of utilizing DL approaches is its capability to learn abstract features under several hidden layers. Gated Recurrent Unit (GRU) method is different from LSTM since it combines forget as well as input gates to a single upgrade gate. Further, it also integrates the cell as well as hidden states [<xref ref-type="bibr" rid="ref-16">16</xref>]. Thus, the latest GRU technique is simple and fast compared to typical LSTM technique, particularly when training big data. It is stored for several times with small performance variance compared to typical LSTM method. Both GRU and LSTM maintain essential characteristics with several gates so as to make sure that these characteristics are not lost from long-term broadcast. <xref ref-type="fig" rid="fig-2">Fig. 2</xref> illustrates the structure of GRU technique.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Structure of GRU</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31541-fig-2.png"/>
</fig>
<p>Whereas <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> signifies the upgrade gate and <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denotes the reset gate. At time <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mi>t</mml:mi></mml:math></inline-formula>, GRU computes the novel state as follows.</p>
<p><disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>Z</mml:mi><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>Z</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mover><mml:mi>h</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow></mml:math></disp-formula></p>
<p>This is to compute a linear interpolation between the earlier state <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> and the existing candidate state <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:msub><mml:mrow><mml:mover><mml:mi>h</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> with novel sequence data. The upgrade gate <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> resolves the issues like maintaining several past data and adding several novel data. It manages to an extent up to which the data of the preceding state is carried on to the existing state. The superior value of the state is denoted by <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> while the additional data of preceding state is taken forward. The state of <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is upgraded as follows.</p>
<p><disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>Z</mml:mi></mml:mrow></mml:msub><mml:mo>.</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>U</mml:mi><mml:mrow><mml:mi>Z</mml:mi></mml:mrow></mml:msub><mml:mo>.</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>T</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>Z</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p>Here, <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> refers to the instance vector at time <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mi>t</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:msub><mml:mrow><mml:mover><mml:mi>h</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denotes the candidate state which was calculated similar to the hidden layer of typical Recurrent Neural Network (RNN).</p>
<p><disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:msub><mml:mrow><mml:mover><mml:mi>h</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>tanh</mml:mi><mml:mspace width="thickmathspace" /><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>h</mml:mi></mml:mrow></mml:msub><mml:mo>.</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>U</mml:mi><mml:mrow><mml:mi>h</mml:mi></mml:mrow></mml:msub><mml:mo>.</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>h</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p>Here, <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> refers to the reset gate that controls several preceding states and gives to the existing candidate state, <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:msub><mml:mrow><mml:mover><mml:mi>h</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. Lesser the value, lesser the contribution is, in the preceding state. When <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula>, it is forgotten as the preceding state. The reset gate is upgraded as follows.</p>
<p><disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>&#x03B3;</mml:mi></mml:mrow></mml:msub><mml:mo>.</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>U</mml:mi><mml:mrow><mml:mi>&#x03B3;</mml:mi></mml:mrow></mml:msub><mml:mo>.</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>&#x03B3;</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p>In case of several sequence modelling tasks, it is useful to gain access to upcoming and past contexts. But typical GRU network procedures perform sequence modelling in temporal manner and it disregards the future context altogether. Bi-directional GRU network expands the unidirectional GRU network by presenting an additional layer whereas the hidden-to-hidden associates flow from the opposite temporal sequence. This technique is capable of exploiting data from both past and the future. Similarly, GRUs provide a disappearing gradient issue by utilizing two gates such as update and reset gates. Essentially, these are two vectors that choose the dissemination of data to the output gate and these vectors are trained to retain the data even earlier. This permits it to pass the the applicable data down a chain of events so as to achieve optimum forecasts.</p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>SMO Based Hyperparameter Optimization</title>
<p>In this final stage, SMO algorithm is utilized for fine tuning the hyper-variables of BiGRU model [<xref ref-type="bibr" rid="ref-20">20</xref>&#x2013;<xref ref-type="bibr" rid="ref-23">23</xref>]. Benabbou&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-24">24</xref>] proposed SMO algorithm which is inspired from natural simulation as per the foraging and diffusion characteristics of slime mould. In current study, &#x2018;slime mould&#x2019; (SM) represents <italic>Physarum polycephalum</italic> which is the major player in nutritious phase of SM. Here, the organic material in SM is accountable for travelling near the food, finding and digesting. The arithmetical model for the abovementioned stages is given below.</p>
<p>The individual objective optimization method is shown herewith.</p>
<p><disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p><disp-formula id="ueqn-6"><mml:math id="mml-ueqn-6" display="block"><mml:mi>s</mml:mi><mml:mo>.</mml:mo><mml:mi>t</mml:mi><mml:mo>.</mml:mo><mml:mi>l</mml:mi><mml:mi>b</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mi>X</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mi>u</mml:mi><mml:mi>b</mml:mi></mml:math></disp-formula></p>
<p>Here, <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> denotes the optimization function, and <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mi>l</mml:mi><mml:mi>b</mml:mi><mml:mo>,</mml:mo><mml:mi>u</mml:mi><mml:mi>b</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> indicate the upper and lower limits of the parameter, <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mi>&#x03C7;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>. For the abovementioned <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mi>d</mml:mi></mml:math></inline-formula> dimension optimization issue, the initialized SM population with <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mi>n</mml:mi></mml:math></inline-formula> individuals is represented by <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mi>n</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>d</mml:mi></mml:math></inline-formula> matrix named <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mi>X</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mn>0</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x22EF;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. All the individuals in this population are nothing but vectors with <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mi>d</mml:mi></mml:math></inline-formula> components that can be calculated as follows.</p>
<p><disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>l</mml:mi><mml:mi>b</mml:mi><mml:mo>+</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>u</mml:mi><mml:mi>b</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>l</mml:mi><mml:mi>b</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:math></disp-formula></p>
<p>SM can approach the food based on the odor in air as given below.</p>
<p><disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mi>X</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing=".2em" columnspacing="1em" displaystyle="false"><mml:mtr><mml:mtd><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>b</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mi>v</mml:mi><mml:mi>b</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>W</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mi>r</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mi>p</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>v</mml:mi><mml:mi>c</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mi>r</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mi>p</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>Here, <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mi>X</mml:mi></mml:math></inline-formula> signifies the location of SM, <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mi>t</mml:mi></mml:math></inline-formula> indicates the existing iteration value, <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>b</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denotes a separate location with maximum odor concentration, <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> indicate two individuals that are arbitrarily chosen from the population. Such behaviors are inspired by two variables, <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mi>v</mml:mi><mml:mi>b</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mi>v</mml:mi><mml:mi>c</mml:mi></mml:math></inline-formula>, which lie within <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mo stretchy="false">[</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy="false">]</mml:mo></mml:math></inline-formula> and <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mi>v</mml:mi><mml:mi>c</mml:mi></mml:math></inline-formula> gets linearly reduced within [0,1]. <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mi>W</mml:mi></mml:math></inline-formula> epitomizes the weight of the searching agents and <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mi>r</mml:mi></mml:math></inline-formula> denotes the arbitrary value within <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mo stretchy="false">[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">]</mml:mo></mml:math></inline-formula>. It can be expressed as per the literature [<xref ref-type="bibr" rid="ref-25">25</xref>]:</p>
<p><disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mi>p</mml:mi><mml:mo>=</mml:mo><mml:mi>tanh</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>S</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>D</mml:mi><mml:mi>P</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:math></disp-formula></p>
<p>Now, <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mi>S</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> signifies the fitness value of the existing individuals whereas <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mi>D</mml:mi><mml:mi>F</mml:mi></mml:math></inline-formula> signifies the optimum fitness value in existing iteration as shown in the following equation.</p>
<p><disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:mi>v</mml:mi><mml:mi>b</mml:mi><mml:mo>=</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy="false">]</mml:mo><mml:mo>,</mml:mo><mml:mi>a</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">h</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mn>2</mml:mn><mml:mrow><mml:munder><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:mo>&#x2212;</mml:mo></mml:mrow></mml:munder><mml:mi>t</mml:mi></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>Here, <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:munder><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:mo>&#x2212;</mml:mo></mml:mrow></mml:munder><mml:mi>t</mml:mi></mml:math></inline-formula> embodies the maximal number of iterations. Weight <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mi>W</mml:mi></mml:math></inline-formula> is calculated as given below.</p>
<p><disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:mi>W</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="italic">S</mml:mi><mml:mi mathvariant="italic">m</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">l</mml:mi><mml:mi mathvariant="italic">l</mml:mi><mml:mi mathvariant="italic">I</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">d</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">x</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing=".2em" columnspacing="1em" displaystyle="false"><mml:mtr><mml:mtd><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi>b</mml:mi><mml:mi>F</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>S</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi>b</mml:mi><mml:mi>F</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>w</mml:mi><mml:mi>F</mml:mi></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">d</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">n</mml:mi></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi>b</mml:mi><mml:mi>F</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>S</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi>b</mml:mi><mml:mi>F</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>w</mml:mi><mml:mi>F</mml:mi></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">h</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">s</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:mrow><mml:mtext>SmellIndex</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>t</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>S</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p>In this equation, the condition indicates the initial half of the population while <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mi>r</mml:mi></mml:math></inline-formula> indicates an arbitrary value within <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:mo stretchy="false">[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">]</mml:mo></mml:math></inline-formula>. SmellIndex denotes the series of fitness values arranged in the ascending order with minimal value issue and <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mi>b</mml:mi><mml:mi>F</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mi>w</mml:mi><mml:mi>F</mml:mi></mml:math></inline-formula> indicate the optimum and worst values attained in the existing generation.</p>
<p>This phase mimics the contraction of venous tissues of the SM to search food. It alters the searching pattern based on the quality of food [<xref ref-type="bibr" rid="ref-26">26</xref>]. It is arithmetically formulated in the following equation,</p>
<p><disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mi>X</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing=".2em" columnspacing="1em" displaystyle="false"><mml:mtr><mml:mtd><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>u</mml:mi><mml:mi>b</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>l</mml:mi><mml:mi>b</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mi>l</mml:mi><mml:mi>b</mml:mi><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mi>z</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>b</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mi>v</mml:mi><mml:mi>b</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>W</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mi>r</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mi>p</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>v</mml:mi><mml:mi>c</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mi>r</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mi>p</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>Now, rand and <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mi>r</mml:mi></mml:math></inline-formula> indicates the arbitrary values within <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mrow><mml:mo>[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mi>u</mml:mi><mml:mi>b</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mi>l</mml:mi><mml:mi>b</mml:mi></mml:math></inline-formula> indicate the maximum and minimum limits of the searching region, correspondingly<inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:mo>.</mml:mo></mml:math></inline-formula> <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:mi>z</mml:mi></mml:math></inline-formula> represents a variable that balances both exploration and exploitation abilities. Further, distinct values are chosen based on certain problems. In current study, <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mi>z</mml:mi></mml:math></inline-formula> is fixed to be 0.03. <xref ref-type="fig" rid="fig-3">Fig. 3</xref> demonstrates the steps involved in SMO.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Steps in SMO</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31541-fig-3.png"/>
</fig>
<p>In this work, SMO algorithm is applied to appropriately fine-tune the hyperparameters involved in BiGRU model so as to minimize MSE. MSE is calculated as follows.</p>
<p><disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:mi>M</mml:mi><mml:mi>S</mml:mi><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>T</mml:mi></mml:mfrac><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>L</mml:mi></mml:mrow></mml:munderover><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:munderover><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>y</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>d</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>,</mml:mo></mml:math></disp-formula></p>
<p>Here, <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:mi>M</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:mi>L</mml:mi></mml:math></inline-formula> define the resultant values of layers and data correspondingly whereas <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:msubsup><mml:mi>y</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> and <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:msubsup><mml:mi>d</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> signify the attained and suitable magnitudes for j<sup>th</sup> unit from the resultant layer of network, at time t.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Experimental Validation</title>
<p>In this section, the TFP outcomes of the proposed SMOBGRU-TP model were analyzed under several aspects. <xref ref-type="table" rid="table-1">Tab. 1</xref> and <xref ref-type="fig" rid="fig-4">Figs. 4</xref> and <xref ref-type="fig" rid="fig-5">5</xref> provide a detailed overview on TFP performance outcomes achieved by the proposed SMOBGRU-TP model and other existing models under different measures. The experimental results indicate that Radial Basis Function (RBF)&#x002B;Principal Component Analysis (PCA)&#x002B;PIM and RBF&#x002B;PCC&#x002B;PCA&#x002B;PIM models reached ineffectual outcomes compared to other methods. At the same time, RBF&#x002B;PIM and RBF&#x002B;PCC models accomplished slightly enhanced results. Though AT-TFP model reached a Mean Absolute Percentage Error (MAPE) of 21.364%, Mean Square Error (MSE) of 299.636, and Root Mean Square Error (RMSE) of 17.310, the proposed SMOBGRU-TP model attained the least MAPE of 18.560%, MSE of 256.350%, and RMSE of 16.011.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Results of the analysis of SMOBGRU-TP technique under distinct measures</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Algorithms</th>
<th>MAPE (%)</th>
<th>MSE</th>
<th>RMSE</th>
</tr>
</thead>
<tbody>
<tr>
<td>Radial Basis Function&#x002B;PIM</td>
<td>21.996</td>
<td>310.867</td>
<td>17.631</td>
</tr>
<tr>
<td>Radial Basis Function&#x002B;PCC</td>
<td>23.509</td>
<td>333.776</td>
<td>18.270</td>
</tr>
<tr>
<td>Radial Basis Function &#x002B;PCA&#x002B;PIM</td>
<td>20.537</td>
<td>418.009</td>
<td>20.445</td>
</tr>
<tr>
<td>Radial Basis Function &#x002B;PCC&#x002B;PCA&#x002B;PIM</td>
<td>24.268</td>
<td>428.065</td>
<td>20.690</td>
</tr>
<tr>
<td>AI-TFP Model</td>
<td>21.364</td>
<td>299.636</td>
<td>17.310</td>
</tr>
<tr>
<td>SMOBGRU-TP</td>
<td>18.560</td>
<td>256.350</td>
<td>16.011</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Results of the analysis of SMOBGRU-TP technique in terms of MAPE</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31541-fig-4.png"/>
</fig>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Results of the analysis of SMOBGRU-TP technique in terms of MSE</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31541-fig-5.png"/>
</fig>
<p><xref ref-type="table" rid="table-2">Tab. 2</xref> and <xref ref-type="fig" rid="fig-6">Figs. 6</xref> and <xref ref-type="fig" rid="fig-7">7</xref> provide a detailed overview on predictive outcomes accomplished by the proposed SMOBGRU-TP model and other recent models. The experimental outcomes infer that RNN-LSTM and RNN-GRU models reached ineffectual outcomes with maximal error values. Followed by, the cascaded LSTM, cascaded GRU, and autoencoder methodologies produced slightly lesser error values. Though NN, AE-RBF, and AI-TFP models accomplished reasonable error values, the proposed SMOBGRU-TP model attained an effectual performance with a minimal MAPE of 9.523%, MSE of 142.265, and RMSE of 11.927.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Predictive analysis results of SMOBGRU-TP technique and other existing approaches</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Algorithms</th>
<th>MAPE (%)</th>
<th>MSE</th>
<th>RMSE</th>
</tr>
</thead>
<tbody>
<tr>
<td>RNN-LSTM</td>
<td>15.894</td>
<td>188.626</td>
<td>13.734</td>
</tr>
<tr>
<td>RNN-GRU</td>
<td>13.023</td>
<td>182.593</td>
<td>13.513</td>
</tr>
<tr>
<td>Cascaded LSTM</td>
<td>11.533</td>
<td>175.741</td>
<td>13.257</td>
</tr>
<tr>
<td>Cascaded GRU</td>
<td>11.148</td>
<td>175.382</td>
<td>13.243</td>
</tr>
<tr>
<td>AutoEncoder</td>
<td>11.113</td>
<td>165.035</td>
<td>12.847</td>
</tr>
<tr>
<td>Neural Networks</td>
<td>10.924</td>
<td>164.913</td>
<td>12.842</td>
</tr>
<tr>
<td>AutoEncoder-RBF</td>
<td>10.898</td>
<td>162.353</td>
<td>12.742</td>
</tr>
<tr>
<td>AI-TFP Model</td>
<td>10.528</td>
<td>157.846</td>
<td>12.564</td>
</tr>
<tr>
<td>SMOBGRU-TP</td>
<td>09.523</td>
<td>142.265</td>
<td>11.927</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>MAPE analysis results of SMOBGRU-TP technique and other existing approaches</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31541-fig-6.png"/></fig>
<fig id="fig-7">
<label>Figure 7</label><caption>
<title>MSE analysis results of SMOBGRU-TP technique and other existing approaches</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31541-fig-7.png"/></fig>
<p><xref ref-type="table" rid="table-3">Tab. 3</xref> and <xref ref-type="fig" rid="fig-8">Fig. 8</xref> shows the predictive results achieved by SMOBGRU-TP model and other recent models under distinct time durations [<xref ref-type="bibr" rid="ref-27">27</xref>&#x2013;<xref ref-type="bibr" rid="ref-29">29</xref>]. The experimental results exhibit that the proposed SMOBGRU-TP model accomplished the least MAPE under all-time durations. For example, with a time duration of 5 mins, SMOBGRU-TP model provided the least MAPE of 15.894%, whereas RNN-LSTM, RNN-GRU, cascaded LSTM, cascaded GRU, AE, NN, AE-RBF, and AI-TFP models reached high MAPE values such as 15.894%, 13.023%, 11.533%, 11.148%, 11.113%, 10.924%, 10.898%, and 10.528% respectively. Along with that, with a time duration of 30 mins, the proposed SMOBGRU-TP method provided a low MAPE of 17.820%, whereas RNN-LSTM, RNN-GRU, cascaded LSTM, cascaded GRU, AE, NN, AE-RBF, and AI-TFP techniques reached high MAPE values such as 25.073%, 24.995%, 22.787%, 22.174%, 21.761%, 21.656%, 20.957%, and 17.820% correspondingly.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>MAPE analysis results of SMOBGRU-TP technique and other recent algorithms under distinct time durations</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>MAPE (%)</th>
<th/>
<th/>
<th/>
<th/>
<th/>
<th/>
</tr>
</thead>
<tbody>
<tr>
<td>Algorithms</td>
<td colspan="6" align="center">Time (min)</td>
</tr>
<tr>
<td/>
<td>5</td>
<td>10</td>
<td>15</td>
<td>20</td>
<td>25</td>
<td>30</td>
</tr>
<tr>
<td>RNN-LSTM</td>
<td>15.894</td>
<td>18.448</td>
<td>20.113</td>
<td>21.284</td>
<td>23.371</td>
<td>25.073</td>
</tr>
<tr>
<td>RNN-GRU</td>
<td>13.023</td>
<td>15.798</td>
<td>18.500</td>
<td>20.762</td>
<td>22.386</td>
<td>24.995</td>
</tr>
<tr>
<td>Cascaded LSTM</td>
<td>11.533</td>
<td>13.862</td>
<td>16.488</td>
<td>19.320</td>
<td>21.382</td>
<td>22.787</td>
</tr>
<tr>
<td>Cascaded GRU</td>
<td>11.148</td>
<td>13.593</td>
<td>15.774</td>
<td>18.514</td>
<td>20.298</td>
<td>22.174</td>
</tr>
<tr>
<td>AutoEncoder</td>
<td>11.113</td>
<td>13.526</td>
<td>15.487</td>
<td>17.638</td>
<td>20.004</td>
<td>21.761</td>
</tr>
<tr>
<td>Neural Networks</td>
<td>10.924</td>
<td>12.951</td>
<td>14.981</td>
<td>16.333</td>
<td>18.781</td>
<td>21.656</td>
</tr>
<tr>
<td>AutoEncoder-RBF</td>
<td>10.898</td>
<td>12.582</td>
<td>14.260</td>
<td>16.317</td>
<td>18.707</td>
<td>20.957</td>
</tr>
<tr>
<td>AI-TFP Model</td>
<td>10.528</td>
<td>12.117</td>
<td>13.347</td>
<td>15.446</td>
<td>17.886</td>
<td>20.205</td>
</tr>
<tr>
<td>SMOBGRU-TP</td>
<td>9.523</td>
<td>10.755</td>
<td>12.655</td>
<td>15.123</td>
<td>16.341</td>
<td>17.820</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>MAPE analysis results of SMOBGRU-TP technique under distinct time durations</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31541-fig-8.png"/>
</fig>
<p><xref ref-type="table" rid="table-4">Tab. 4</xref> and <xref ref-type="fig" rid="fig-9">Fig. 9</xref> portrays the predictive output produced by SMOBGRU-TP model and other recent models under distinct time durations. The experimental results exhibit that the proposed SMOBGRU-TP model accomplished a minimal MSE under all-time durations. For instance, with a time duration of 5 mins, the proposed SMOBGRU-TP model provided a low MSE of 142.265, while RNN-LSTM, RNN-GRU, cascaded LSTM, cascaded GRU, AE, NN, AE-RBF, and AI-TFP methodologies reached high MSE values such as 188.626, 182.593, 175.741, 175.382, 165.035, 164.913, 162.353, and 157.846 respectively. Likewise, at 30 mins duration, SMOBGRU-TP system provided the least MSE of 235.966, but RNN-LSTM, RNN-GRU, cascaded LSTM, cascaded GRU, AE, NN, AE-RBF, and AI-TFP techniques reached high MSE values such as 452.353, 449.797, 441.446, 428.327, 414.809, 398.998, 372.006, and 289.229 correspondingly.</p>
<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>MSE analysis results of SMOBGRU-TP technique and other recent algorithms under distinct time durations</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th colspan="7">Mean Squared Error</th>
</tr>
<tr>
<td rowspan="2">Algorithms</td>
<td align="center" colspan="6">Time (min)</td>
</tr>
</thead>
<tbody>
<tr>
<td>5</td>
<td>10</td>
<td>15</td>
<td>20</td>
<td>25</td>
<td>30</td>
</tr>
<tr>
<td>RNN-LSTM</td>
<td>188.626</td>
<td>251.810</td>
<td>299.685</td>
<td>373.490</td>
<td>411.059</td>
<td>452.353</td>
</tr>
<tr>
<td>RNN-GRU</td>
<td>182.593</td>
<td>221.044</td>
<td>294.174</td>
<td>349.806</td>
<td>399.869</td>
<td>449.797</td>
</tr>
<tr>
<td>Cascaded LSTM</td>
<td>175.741</td>
<td>218.048</td>
<td>285.264</td>
<td>340.920</td>
<td>381.915</td>
<td>441.446</td>
</tr>
<tr>
<td>Cascaded GRU</td>
<td>175.382</td>
<td>216.170</td>
<td>276.808</td>
<td>336.721</td>
<td>381.524</td>
<td>428.327</td>
</tr>
<tr>
<td>AutoEncoder</td>
<td>165.035</td>
<td>215.751</td>
<td>259.057</td>
<td>323.966</td>
<td>381.500</td>
<td>414.809</td>
</tr>
<tr>
<td>Neural Networks</td>
<td>164.913</td>
<td>211.089</td>
<td>258.491</td>
<td>320.641</td>
<td>363.263</td>
<td>398.998</td>
</tr>
<tr>
<td>AutoEncoder-RBF</td>
<td>162.353</td>
<td>210.627</td>
<td>252.652</td>
<td>281.474</td>
<td>338.353</td>
<td>372.006</td>
</tr>
<tr>
<td>AI-TFP Model</td>
<td>157.846</td>
<td>178.504</td>
<td>195.675</td>
<td>218.776</td>
<td>238.698</td>
<td>289.229</td>
</tr>
<tr>
<td>SMOBGRU-TP</td>
<td>142.265</td>
<td>157.254</td>
<td>176.923</td>
<td>199.115</td>
<td>213.294</td>
<td>235.966</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>MSE analysis results of SMOBGRU-TP technique under distinct time durations</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31541-fig-9.png"/>
</fig>
<p><xref ref-type="table" rid="table-5">Tab. 5</xref> and <xref ref-type="fig" rid="fig-10">Fig. 10</xref> showcases the predictive results attained by the proposed SMOBGRU-TP model and other recent models under distinct time durations. The experimental results demonstrate that the proposed SMOBGRU-TP model accomplished the least RMSE at all-time durations. For example, for 5 mins time duration, SMOBGRU-TP system provided the least RMSE of 11.927, while RNN-LSTM, RNN-GRU, cascaded LSTM, cascaded GRU, AE, NN, AE-RBF, and AI-TFP techniques reached high RMSE values such as 13.734, 13.513, 13.257, 13.243, 12.847, 12.842, 12.742, and 12.564 correspondingly. In addition, with a time duration of 30 mins, the proposed SMOBGRU-TP approach reached a low RMSE of 15.361, whereas RNN-LSTM, RNN-GRU, cascaded LSTM, cascaded GRU, AE, NN, AE-RBF, and AI-TFP techniques reached high RMSE values such as 21.269, 21.208, 21.011, 20.453, 19.870, 19.209, 18.493, and 17.007 correspondingly. Based on the comprehensive comparative analyses and the simulation results, the proposed SMOBGRU-TP model proved its superiority to other models, in terms of performance.</p>
<table-wrap id="table-5">
<label>Table 5</label>
<caption>
<title>RMSE analysis results of SMOBGRU-TP technique and other recent algorithms under distinct time durations</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th colspan="7">Root Mean Square Error</th>
</tr>
<tr>
<td rowspan="2">Algorithms</td>
<td colspan="6">Time (min)</td>
</tr>
</thead>
<tbody>
<tr>
<td>5</td>
<td>10</td>
<td>15</td>
<td>20</td>
<td>25</td>
<td>30</td>
</tr>
<tr>
<td>RNN-LSTM</td>
<td>13.734</td>
<td>15.869</td>
<td>17.311</td>
<td>19.326</td>
<td>20.275</td>
<td>21.269</td>
</tr>
<tr>
<td>RNN-GRU</td>
<td>13.513</td>
<td>15.364</td>
<td>17.152</td>
<td>18.703</td>
<td>19.997</td>
<td>21.208</td>
</tr>
<tr>
<td>Cascaded LSTM</td>
<td>13.257</td>
<td>15.101</td>
<td>16.890</td>
<td>18.464</td>
<td>19.543</td>
<td>21.011</td>
</tr>
<tr>
<td>Cascaded GRU</td>
<td>13.243</td>
<td>14.703</td>
<td>16.638</td>
<td>17.513</td>
<td>18.749</td>
<td>20.453</td>
</tr>
<tr>
<td>AutoEncoder</td>
<td>12.847</td>
<td>14.688</td>
<td>16.095</td>
<td>17.145</td>
<td>18.480</td>
<td>19.870</td>
</tr>
<tr>
<td>Neural Networks</td>
<td>12.842</td>
<td>14.181</td>
<td>15.764</td>
<td>16.451</td>
<td>17.980</td>
<td>19.209</td>
</tr>
<tr>
<td>AutoEncoder-RBF</td>
<td>12.742</td>
<td>13.807</td>
<td>14.922</td>
<td>15.858</td>
<td>17.842</td>
<td>18.493</td>
</tr>
<tr>
<td>AI-TFP Model</td>
<td>12.564</td>
<td>13.361</td>
<td>13.988</td>
<td>14.791</td>
<td>15.450</td>
<td>17.007</td>
</tr>
<tr>
<td>SMOBGRU-TP</td>
<td>11.927</td>
<td>12.540</td>
<td>13.301</td>
<td>14.111</td>
<td>14.605</td>
<td>15.361</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>RMSE analysis results of SMOBGRU-TP technique under distinct time durations</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31541-fig-10.png"/>
</fig>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion</title>
<p>In current study, a new SMOBGRU-TP model has been proposed to forecast the flow of traffic in smart city environment. In the initial stage of SMOBGRU-TP model, data pre-processing is performed to normalize the input data within a range of [0,1] using min-max normalization approach. BiGRU model is employed for effective forecasting of the traffic in smart cities. At last, SMO algorithm is utilized to fine tune the hyperparameters involved in BiGRU approach. In order to experimentally validate the superiority of the proposed SMOBGRU-TP models in terms of prediction performance, different analyses were conducted. The simulation outcome confirmed the superior results achieved by SMOBGRU-TP model than the existing techniques. In future, the efficiency of SMOBGRU-TP methodology can be improved with the help of hybrid DL models.</p>
</sec>
</body>
<back>
<fn-group>
<fn fn-type="other"><p><bold>Funding Statement:</bold> The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work through Large Groups Project under grant number (180/43). Princess Nourah bint Abdulrahman University Researchers Supporting Project number (PNURSP2022R303), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia. The authors would like to thank the Deanship of Scientific Research at Umm Al-Qura University for supporting this work by Grant Code: 22UQU4340237DSR21.</p>
</fn>
<fn fn-type="conflict"><p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Fang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>Q.</given-names> <surname>He</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Yu</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Edge content caching with deep spatiotemporal residual network for iov in smart city</article-title>,&#x201D; <source>ACM Transactions on Sensor Networks</source>, vol. <volume>17</volume>, no. <issue>3</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>33</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. M.</given-names> <surname>Nagy</surname></string-name> and <string-name><given-names>V.</given-names> <surname>Simon</surname></string-name></person-group>, &#x201C;<article-title>Survey on traffic prediction in smart cities</article-title>,&#x201D; <source>Pervasive and Mobile Computing</source>, vol. <volume>50</volume>, no. <issue>4</issue>, pp. <fpage>148</fpage>&#x2013;<lpage>163</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Chen</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Chen</surname></string-name></person-group>, &#x201C;<article-title>A review on traffic prediction methods for intelligent transportation system in smart cities</article-title>,&#x201D; in <conf-name>2019 12th Int. Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI)</conf-name>, <publisher-loc>Suzhou, China</publisher-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>5</lpage>, <year>2019</year>. </mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>N.</given-names> <surname>Shahid</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Shah</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Maple</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Jeon</surname></string-name></person-group>, &#x201C;<article-title>Towards greener smart cities and road traffic forecasting using air pollution data</article-title>,&#x201D; <source>Sustainable Cities and Society</source>, vol. <volume>72</volume>, no. <issue>4</issue>, pp. <fpage>103062</fpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G.</given-names> <surname>Kothai</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Poovammal</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Dhiman</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Ramana</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Sharma</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>A new hybrid deep learning algorithm for prediction of wide traffic congestion in smart cities</article-title>,&#x201D; <source>Wireless Communications and Mobile Computing</source>, vol. <volume>2021</volume>, no. <issue>8</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>13</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. M.</given-names> <surname>Nagy</surname></string-name> and <string-name><given-names>V.</given-names> <surname>Simon</surname></string-name></person-group>, &#x201C;<article-title>Improving traffic prediction using congestion propagation patterns in smart cities</article-title>,&#x201D; <source>Advanced Engineering Informatics</source>, vol. <volume>50</volume>, no. <issue>1</issue>, pp. <fpage>101343</fpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F. N.</given-names> <surname>Al-Wesabi</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Obayya</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Hamza</surname></string-name>, <string-name><given-names>J. S.</given-names> <surname>Alzahrani</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Gupta</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Energy aware resource optimization using unified metaheuristic optimization algorithm allocation for cloud computing environment</article-title>,&#x201D; <source>Sustainable Computing: Informatics and Systems</source>, vol. <volume>35</volume>, no. <issue>17</issue>, pp. <fpage>100686</fpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Bai</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Lin</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Ma</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Duan</surname></string-name></person-group>, &#x201C;<article-title>PrePCT: Traffic congestion prediction in smart cities with relative position congestion tensor</article-title>,&#x201D; <source>Neurocomputing</source>, vol. <volume>444</volume>, no. <issue>1</issue>, pp. <fpage>147</fpage>&#x2013;<lpage>157</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. M.</given-names> <surname>Hilal</surname></string-name>, <string-name><given-names>B. S.</given-names> <surname>Alfurhood</surname></string-name>, <string-name><given-names>F. N. A.</given-names> <surname>Wesabi</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Hamza</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Duhayyim</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Artificial intelligence based sentiment analysis for health crisis management in smart cities</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>71</volume>, no. <issue>1</issue>, pp. <fpage>143</fpage>&#x2013;<lpage>157</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Sirohi</surname></string-name>, <string-name><given-names>F. N. A.</given-names> <surname>Wesabi</surname></string-name>, <string-name><given-names>H. M.</given-names> <surname>Alshahrani</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Maheshwari</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Agarwal</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Energy-efficient cloud service selection and recommendation based on QoS for sustainable smart cities</article-title>,&#x201D; <source>Applied Sciences</source>, vol. <volume>11</volume>, no. <issue>20</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>17</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Nasser</surname></string-name> and <string-name><given-names>V.</given-names> <surname>Simon</surname></string-name></person-group>, &#x201C;<article-title>A novel method for analyzing weather effect on smart city traffic</article-title>,&#x201D; in <conf-name>2021 IEEE 22nd Int. Symp. on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)</conf-name>, <publisher-loc>Pisa, Italy</publisher-loc>, pp. <fpage>335</fpage>&#x2013;<lpage>340</lpage>, <year>2021</year>. </mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Varshney</surname></string-name>, <string-name><given-names>R. A.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>U.</given-names> <surname>Khan</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Verma</surname></string-name></person-group>, &#x201C;<article-title>Approaches of artificial intelligence and machine learning in smart cities: Critical review</article-title>,&#x201D; <source>IOP Conference Series: Materials Science and Engineering</source>, vol. <volume>1022</volume>, no. <issue>1</issue>, pp. <fpage>012019</fpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Aslam</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Aurangzeb</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Alhussein</surname></string-name> and <string-name><given-names>N.</given-names> <surname>Javaid</surname></string-name></person-group>, &#x201C;<article-title>Multiscale modeling in smart cities: A survey on applications, current trends, and challenges</article-title>,&#x201D; <source>Sustainable Cities and Society</source>, vol. <volume>78</volume>, no. <issue>2</issue>, pp. <fpage>103517</fpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Vijayalakshmi</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Ramar</surname></string-name>, <string-name><given-names>N. Z.</given-names> <surname>Jhanjhi</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Verma</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Kaliappan</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>An attention-based deep learning model for traffic flow prediction using spatiotemporal features towards sustainable smart city</article-title>,&#x201D; <source>International Journal of Communication Systems</source>, vol. <volume>34</volume>, no. <issue>3</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>14</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>L. R.</given-names> <surname>Frank</surname></string-name>, <string-name><given-names>Y. M.</given-names> <surname>Ferreira</surname></string-name>, <string-name><given-names>E. P.</given-names> <surname>Julio</surname></string-name>, <string-name><given-names>F. H. C.</given-names> <surname>Ferreira</surname></string-name>, <string-name><given-names>B. J.</given-names> <surname>Dembogurski</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Multilayer perceptron and particle swarm optimization applied to traffic flow prediction on smart cities</article-title>,&#x201D; in <conf-name>Int. Conf. on Computational Science and its Applications</conf-name>, <publisher-loc>Cham</publisher-loc>, <publisher-name>Lecture Notes in Computer Science book series, Springer</publisher-name>, <volume>11622</volume>, pp. <fpage>35</fpage>&#x2013;<lpage>47</lpage>, <year>2019</year>. </mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Zhou</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Zhao</surname></string-name></person-group>, &#x201C;<article-title>On prediction of traffic flows in smart cities: A multitask deep learning based approach</article-title>,&#x201D; <source>World Wide Web-internet and Web Information Systems</source>, vol. <volume>24</volume>, no. <issue>3</issue>, pp. <fpage>805</fpage>&#x2013;<lpage>823</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Nazir</surname></string-name>, <string-name><given-names>I. G.</given-names> <surname>Magari&#x00F1;o</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Hussain</surname></string-name></person-group>, &#x201C;<article-title>Deep learning-based urban big data fusion in smart cities: Towards traffic monitoring and flow-preserving fusion</article-title>,&#x201D; <source>Computers &#x0026; Electrical Engineering</source>, vol. <volume>89</volume>, pp. <fpage>106906</fpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Kuang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Zheng</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Li</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Gao</surname></string-name></person-group>, &#x201C;<article-title>Intelligent traffic signal control based on reinforcement learning with state reduction for smart cities</article-title>,&#x201D; <source>ACM Transactions on Internet Technology</source>, vol. <volume>21</volume>, no. <issue>4</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>24</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Neelakandan</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Berlin</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Tripathi</surname></string-name>, <string-name><given-names>V. B.</given-names> <surname>Devi</surname></string-name>, <string-name><given-names>I.</given-names> <surname>Bhardwaj</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>IoT-based traffic prediction and traffic signal control system for smart city</article-title>,&#x201D; <source>Soft Computing</source>, vol. <volume>25</volume>, no. <issue>18</issue>, pp. <fpage>12241</fpage>&#x2013;<lpage>12248</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Manne</surname></string-name>, <string-name><given-names>E. L.</given-names> <surname>Lydia</surname></string-name>, <string-name><given-names>I. V.</given-names> <surname>Pustokhina</surname></string-name>, <string-name><given-names>D. A.</given-names> <surname>Pustokhin</surname></string-name>, <string-name><given-names>V. S.</given-names> <surname>Parvathy</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>An intelligent energy management and traffic predictive model for autonomous vehicle systems</article-title>,&#x201D; <source>Soft Computing</source>, vol. <volume>25</volume>, no. <issue>18</issue>, pp. <fpage>11941</fpage>&#x2013;<lpage>11953</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S. K.</given-names> <surname>Lakshmanaprabu</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Shankar</surname></string-name>, <string-name><given-names>S. S.</given-names> <surname>Rani</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Abdulhay</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Arunkumar</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>An effect of big data technology with ant colony optimization based routing in vehicular ad hoc networks: Towards smart cities</article-title>,&#x201D; <source>Journal of Cleaner Production</source>, vol. <volume>217</volume>, no. <issue>3</issue>, pp. <fpage>584</fpage>&#x2013;<lpage>593</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Shankar</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Perumal</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Elhoseny</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Taher</surname></string-name>, <string-name><given-names>B. B.</given-names> <surname>Gupta</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Synergic deep learning for smart health diagnosis of covid-19 for connected living and smart cities</article-title>,&#x201D; <source>ACM Transactions on Internet Technology</source>, vol. <volume>22</volume>, no. <issue>3</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>14</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Gupta</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Khanna</surname></string-name>, <string-name><given-names>S. K.</given-names> <surname>Lakshmanaprabu</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Shankar</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Furtado</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Efficient artificial fish swarm based clustering approach on mobility aware energy-efficient for MANET</article-title>,&#x201D; <source>Transactions on Emerging Telecommunications Technologies</source>, vol. <volume>30</volume>, no. <issue>9</issue>, pp. <fpage>e3524</fpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F.</given-names> <surname>Benabbou</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Boukhouima</surname></string-name> and <string-name><given-names>N.</given-names> <surname>Sael</surname></string-name></person-group>, &#x201C;<article-title>Fake accounts detection system based on bidirectional gated recurrent unit neural network</article-title>,&#x201D; <source>International Journal of Electrical and Computer Engineering</source>, vol. <volume>12</volume>, no. <issue>3</issue>, pp. <fpage>3129</fpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>A. A.</given-names> <surname>Heidari</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Mirjalili</surname></string-name></person-group>, &#x201C;<article-title>Slime mould algorithm: A new method for stochastic optimization</article-title>,&#x201D; <source>Future Generation Computer Systems</source>, vol. <volume>111</volume>, pp. <fpage>300</fpage>&#x2013;<lpage>323</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Yu</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Liu</surname></string-name> and <string-name><given-names>Z.</given-names> <surname>Chen</surname></string-name></person-group>, &#x201C;<article-title>An improved slime mould algorithm for demand estimation of urban water resources</article-title>,&#x201D; <source>Mathematics</source>, vol. <volume>9</volume>, no. <issue>12</issue>, pp. <fpage>1316</fpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Hou</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Deng</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Cui</surname></string-name></person-group>, &#x201C;<article-title>Short-term traffic flow prediction with weather conditions: Based on deep learning algorithms and data fusion</article-title>,&#x201D; <source>Complexity</source>, vol. <volume>2021</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>14</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. Al</given-names> <surname>Duhayyim</surname></string-name>, <string-name><given-names>A. A.</given-names> <surname>Albraikan</surname></string-name>, <string-name><given-names>F. N. A.</given-names> <surname>Wesabi</surname></string-name>, <string-name><given-names>H. M.</given-names> <surname>Burbur</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Alamgeer</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Modeling of artificial intelligence based traffic flow prediction with weather conditions</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>71</volume>, no. <issue>2</issue>, pp. <fpage>3953</fpage>&#x2013;<lpage>3968</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. N.</given-names> <surname>Espinoza</surname></string-name>, <string-name><given-names>O. R. L.</given-names> <surname>Bonilla</surname></string-name>, <string-name><given-names>E. E. G.</given-names> <surname>Guerrero</surname></string-name>, <string-name><given-names>E. T.</given-names> <surname>Cuautle</surname></string-name>, <string-name><given-names>D. L.</given-names> <surname>Mancilla</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Traffic flow prediction for smart traffic lights using machine learning algorithms</article-title>,&#x201D; <source>Technologies</source>, vol. <volume>10</volume>, no. <issue>1</issue>, pp. <fpage>5</fpage>, <year>2022</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>
