<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="2.3" xml:lang="EN">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Sustain.</journal-id>
<journal-title>Frontiers in Sustainability</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Sustain.</abbrev-journal-title>
<issn pub-type="epub">2673-4524</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/frsus.2024.1388771</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Sustainability</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Accelerate demand forecasting by hybridizing CatBoost with the dingo optimization algorithm to support supply chain conceptual framework precisely</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name><surname>Abed</surname> <given-names>Ahmed M.</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="corresp" rid="c001"><sup>&#x002A;</sup></xref>
<uri xlink:href="https://loop.frontiersin.org/people/2183917/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
<role content-type="https://credit.niso.org/contributor-roles/funding-acquisition/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/project-administration/"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>Industrial Engineering Department, Engineering College, Prince Sattam bin Abdulaziz University</institution>, <addr-line>Al-Kharj</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff2"><sup>2</sup><institution>Department of Industrial and System Engineering, Zagazig University</institution>, <addr-line>Zagazig</addr-line>, <country>Egypt</country></aff>
<author-notes>
<fn fn-type="edited-by" id="fn0003">
<p>Edited by: Pourya Pourhejazy, UiT The Arctic University of Norway, Norway</p>
</fn>
<fn fn-type="edited-by" id="fn0004">
<p>Reviewed by: Bikash Koli Dey, Hongik University, Republic of Korea</p>
<p>Rekha Guchhait, Yonsei University, Republic of Korea</p>
</fn>
<corresp id="c001">&#x002A;Correspondence: Ahmed M. Abed, <email>a.abed@psau.edu.sa</email>; <email>ahmed-abed@zu.edu.eg</email></corresp>
</author-notes>
<pub-date pub-type="epub">
<day>13</day>
<month>08</month>
<year>2024</year>
</pub-date>
<pub-date pub-type="collection">
<year>2024</year>
</pub-date>
<volume>5</volume>
<elocation-id>1388771</elocation-id>
<history>
<date date-type="received">
<day>20</day>
<month>02</month>
<year>2024</year>
</date>
<date date-type="accepted">
<day>12</day>
<month>07</month>
<year>2024</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x00A9; 2024 Abed.</copyright-statement>
<copyright-year>2024</copyright-year>
<copyright-holder>Abed</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<abstract>
<p>Supply chains (SCs) serve many sectors that are, in turn, affected by e-commerce which rely on the make-to-order (MTO) system to avoid a risk in following the make-to-stoke (MTS) policy due to poor forecasting demand, which will be difficult if the products have short shelf life (e.g., refrigeration foodstuffs). The weak forecasting negatively impacts SC sectors such as production, inventory tracking, circular economy, market demands, transportation and distribution, and procurement. The forecasting obstacles are in e-commerce data types that are massive, imbalanced, and chaotic. Using machine learning (ML) algorithms to solve the problem works well because they quickly classify things, which makes accurate forecasting possible. However, it was found that the accuracy of ML algorithms varies depending on the SC data sectors. Therefore, the presented conceptual framework discusses the relations among ML algorithms, the most related sectors, and the effective scope of tackling their data, which enables the companies to guarantee continuity and competitiveness by reducing shortages and return costs. The data supplied show the e-commerce sales that were made at 47 different online stores in Egypt and the KSA during 413&#x2009;days. The article proposes a novel mechanism that hybridizes the CatBoost algorithm with Dingo Optimization (Cat-DO), to obtain precise forecasting. The Cat-DO has been compared with other six ML algorithms to check its superiority over autoregressive integrated moving average (ARIMA), long short-term memory (LSTM), deep neural network (DNN), categorical data boost (CatBoost), support vector machine (SVM), and LSTM-CatBoost by 0.52, 0.73, 1.43, 8.27, 15.94, and 13.12%, respectively. Transportation costs were reduced by 6.67%.</p>
</abstract>
<kwd-group>
<kwd>machine learning</kwd>
<kwd>e-business</kwd>
<kwd>supply chain intelligence management</kwd>
<kwd>inventory control</kwd>
<kwd>hybridize algorithms</kwd>
</kwd-group>
<counts>
<fig-count count="14"/>
<table-count count="5"/>
<equation-count count="19"/>
<ref-count count="146"/>
<page-count count="26"/>
<word-count count="17825"/>
</counts>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Sustainable Supply Chain Management</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="sec1">
<label>1</label>
<title>Introduction</title>
<p>One of the main elements contributing to the success of contemporary businesses, especially e-commerce, is effective and efficient supply chain management, which is beyond the obstacles that stand in the way of supply and demand by using outstanding machine learning (ML) methods in their compatible sectors.</p>
<p>Supply chain management (SCM) discovers the strengths and weaknesses in the decentralized business, which do not achieve optimum utilization of resources due to many obstacles that resist continuous performance improvement. The weakness of SC is due to its quick, massive, chaotic, and uncertain data, lack of communication, and prediction in tracking consumer behavior, which inhibits the rapid handling of all SC issues parallelly and affects negatively meeting the SDG 9 objective (<xref ref-type="bibr" rid="ref26">Cho and Gerchak, 2005</xref>; <xref ref-type="bibr" rid="ref44">Garfamy, 2011</xref>; <xref ref-type="bibr" rid="ref131">Wenzel et al., 2019</xref>). The necessity of machine learning (ML) to raise communication to a reliable level guarantees the sustainability of the working of all SC sectors. It helps researchers save time in choosing preferable algorithms that suit their issues to gain high accuracy in a short time, according to <xref ref-type="bibr" rid="ref55">Huber and Stuckenschmidt (2020)</xref>.</p>
<p>Large volumes of dynamic data are regularly generated, gathered, and stored in various process businesses in the big data era, which is considered the backbone growth of the business. Data are vital for enhancing operational activities and its design. Making intelligent use of this data, together with the extraction of information and the formation of knowledge to facilitate experience exchange, has many potential benefits. It has become necessary to gain sustainability via a business that joins many engineering edges such as the supply chain because it is interested in optimizing seven edges, namely, production, inventory management, circular economy, demand forecasting, transportation and distribution, procurement and supply management, sustainable development, and supply chain improvement. The question is as follows: how can these edges join and manipulate their data? The answer is in using Internet of things (IoT) manipulated by machine learning (ML) algorithms to gain system optimization. The ML is superior to the traditional decision-support system as discussed by <xref ref-type="bibr" rid="ref20">Ben-Daya et al. (2019)</xref>, facing massive data satisfactorily to meet smart supply chain management (SSCM). Machine learning algorithms can find previously unidentified trends in data, producing fresh perspectives and pointing researchers in the right direction. Many industries, such as operations, manufacturing, healthcare, and dwellings, can benefit from the application of ML techniques as discussed by <xref ref-type="bibr" rid="ref29">Darvazeh et al. (2020)</xref>. This article is an answer to the main question for a published paper on the conceptual framework that integrates the IoT by ML algorithms to improve its performance. First and the foremost, the IoT is used to visualize missions via data in the real place (Genjutsu) to predict future situations monitored, to maximize the desirable objective. Although there is no standard definition for artificial intelligence (AI), most researchers define it as the ability of machines to do what humans do in decision-making based on professional data classification, to discover specific behaviors of data to present precise forecasting guides to prevent the recurrence of problems. In the last decade, applications of AI have increased rapidly in many sectors, especially the industrial sector, as organizations considered it as a perfect solution for end-to-end SC activities, and it promises value for organizations. <xref ref-type="bibr" rid="ref97">Pournader et al. (2021)</xref> address that AI is divided into three main branches, namely, sending and interacting (vision and speech recognition), learning (ML), and decision-making (simulation, planning, and scheduling). <xref ref-type="bibr" rid="ref143">Zekhnini et al. (2021)</xref> define ML algorithms as having the ability to discover the hidden and complex relationships of data that humans are not able to observe. Therefore, <xref ref-type="bibr" rid="ref88">Ni et al. (2020)</xref> consider ML as a learning technique concerning the application of computer procedures that can learn according to self-aware to be smart and have experiences which can be managed through a controller unit to make appropriate and reliable decisions. System configuration is shown in <xref ref-type="fig" rid="fig1">Figure 1</xref> (<xref ref-type="bibr" rid="ref110">Sharma et al., 2020</xref>).</p>
<fig position="float" id="fig1">
<label>Figure 1</label>
<caption>
<p>ML system configuration <xref ref-type="bibr" rid="ref110">(Sharma et al., 2020)</xref>.</p>
</caption>
<graphic xlink:href="frsus-05-1388771-g001.tif"/>
</fig>
<p>According to <xref ref-type="bibr" rid="ref59">Jordan and Mitchell (2015)</xref>, <xref ref-type="bibr" rid="ref123">Traore et al. (2017)</xref>, and <xref ref-type="bibr" rid="ref110">Sharma et al. (2020)</xref> discuss three main types of ML, namely, supervised, unsupervised, and ensemble learning, as shown in <xref ref-type="table" rid="tab1">Table 1</xref>. In addition, many researchers can handle the data through semi-supervised learning algorithms in the case of using labeled and unlabeled data in classification data with high precision. Unlike previous training methods, reinforcement learning algorithms are based on the last outcomes to decide whether to continue or stop. Machine learning applications in demand forecasting focus on balancing the SCM sectors. Therefore, many researchers compete to meet high accuracy to reduce losses. <xref ref-type="bibr" rid="ref57">Izadyar et al. (2015)</xref> applied artificial neural networks to operate genetic propagation algorithms and compare them with extreme machine learning algorithms that produce more accurate results for heat demand forecasting, as discussed by <xref ref-type="bibr" rid="ref100">Prifti et al. (2024)</xref>. The performance of SCM in the digital transformation of emerging organizations is impacted by demand forecasting, which sounds negative in many sectors if accuracy is low. With current circumstances being complicated, dynamic, and uncertain, it may mark the biggest shift in integrated SCM significance. Ranking-wise, the RF classifier performs better on this particular forecasting of demand challenge than the artificial neural network, which trails in the investigated category. Bayesian neural network forecasts show that the log price and volatility of e-commerce sales follow a consistent trend, as cited in <xref ref-type="bibr" rid="ref66">Klar et al. (2023)</xref>, which may not be logical to perceive as chaotic behavior. SVMs and perceptron-learning algorithms are flexible and effective in handling non-linear relationships and high-dimensional data for both supervised and unsupervised data, especially in identifying the exact hyperplane dividing the many classes present in the intended attribute. How well a perceptron classifies newly acquired data inputs serves as a measure of its effectiveness. <xref ref-type="bibr" rid="ref112">Sheth et al. (2022)</xref> discuss how ANN and SVM provide 100% accuracy for 80% of the forecasting process, while according to <xref ref-type="bibr" rid="ref23">Cannas et al. (2023)</xref> provide the 67.2% highest forecasting accuracy, which outperformed over DNN used by <xref ref-type="bibr" rid="ref114">Sin and Wang (2017)</xref> who gained 50.43% accuracy and proved by <xref ref-type="bibr" rid="ref24">Cao et al. (2016)</xref>. Feedforward ANNs are effective at categorizing data and recognizing straightforward patterns, two basic issue types. However, more difficult duties may prove difficult for them. However, because algorithms that use deep learning have several underlying layers of abstraction, they can handle and analyze large amounts of data. Two well-liked recurrent RNN long-term memory versions are long short-term memory (LSTM) networks and gated recurrent unit (GRU) networks. Using the identical database to track specific sales for products, GRU processes it 29.29% quicker than LSTM. The accuracy ratio, recall ratio, and F1 ratio of GRU are, respectively, 23.45, 27.69, and 26.95% greater than those of LSTM while considering the two performance and processing power cost aspects. <xref ref-type="bibr" rid="ref58">Ji et al. (2019)</xref> demonstrate that dynamic systems are effective if tracked via ARIMA to achieve a minimum reported residual of less than 0.002. The main obstacle to tracking the e-commerce data is that it is quickly updated, massive, chaotic, and imbalanced, which pushes <xref ref-type="bibr" rid="ref92">Pant et al. (2018)</xref> to make a classification stage before the forecasting process. <xref ref-type="bibr" rid="ref134">Wu et al. (2018)</xref> gets benefited by presenting a new forecasting framework that is considered the basis for the proposed framework in this article. <xref ref-type="bibr" rid="ref111">Sharma et al. (2023)</xref> tackle the fluctuation of demand by deducing the correlation among different product sales on e-commerce using polynomial regression that achieves an accuracy of approximately 66.66%. Forecasting energy consumption using machine learning methods was also covered by <xref ref-type="bibr" rid="ref54">Huang et al. (2019)</xref>. Support vector regression was determined by Huang&#x2019;s team to be the most effective method after comparing it with CatBoost, extreme ML, linear regression, and various other algorithms. CatBoost leverages decision trees to determine the most significant variables and construct models, making it more effective when working with massive data sets and capable of producing more precise findings, balancing the data inputs, and meeting regularization to avoid overfitting. However, there is a chance that ANNs will cost more to compute and take longer to train. <xref ref-type="bibr" rid="ref56">Ibrahim (2021)</xref> discusses using binary classified-vector-prediction, Naive Bayes, SVM, and logistic regression that are superior to previous methods to gain an accuracy in forecasting of approximately 72% when hybridized with the CatBoost algorithm. <xref ref-type="bibr" rid="ref141">Yani et al. (2019)</xref> took the lead in presenting a hybrid revolutionary forecasting methodology that combines a non-linear autoregressive neural network with <underline>discrete wavelet decomposition (DWD)</underline> as a part of their suggested new method. The suggested approach demonstrated a high level of proficiency in enhancing the efficacy of demand-side management initiatives. Synchronize <xref ref-type="bibr" rid="ref13">Aljojo et al. (2021)</xref> develop the Nonlinear-AutoRegressive-with-eXogenous (NARX) inputs method and achieve a breakthrough in forecasting accuracy of 96%. SC managers have used NARX to forecast e-commerce demand to control inventory levels. The NARX is perfect for discovering how the intricate linkages and dynamics observed in supply chains may be captured by its simulations, which makes it an invaluable tool for optimization and decision-making. The NARX is used to enhance algorithms when the prediction timestamp influence is valuable in e-commerce. The best result was given by LightGBM during forecasting in the procurement sector, which had the lowest training time of 0.92&#x2009;s and the highest accuracy of 95.02%. The computing work needed to provide the LightGBM model was minimal when compared with the inelastic structural evaluations as discussed by <xref ref-type="bibr" rid="ref118">Sun et al. (2020)</xref>. <xref ref-type="bibr" rid="ref82">Mitra et al. (2023)</xref> rely on the CatBoost algorithm which outperforms RF and gradient boosting in accuracy for forecasting and mimics the NARX method. Therefore, this article is based on improving the works of <xref ref-type="bibr" rid="ref134">Wu et al. (2018)</xref>, <xref ref-type="bibr" rid="ref13">Aljojo et al. (2021)</xref>, and <xref ref-type="bibr" rid="ref82">Mitra et al. (2023)</xref> to enhance the proposed framework and working mechanism that deal with speed, massive, imbalanced, and chaotic data of e-commerce sales (i.e., demands) by classifying to make dimension reduction to tackle the imbalance and chaotic features and then forecasting using the CatBoost algorithm that is enhanced by hybridizing with Dingo optimization and comparing the results with most published algorithms of machine learning that focus on forecasting a fluctuating demand. The classification relies on meet dimension reduction, which is based on feature selection to treat the imbalance in the data input and struggle with multicollinearity. Therefore, researchers resorted to using Lasso Regression, which is effective at feature selection, or Ridge Regression, which is better suited for handling multicollinearity. Classification of supervised data learning and clustering of unsupervised data learning are based on dimension reduction techniques such as PCA, LDA, and t-SNE, which enhance ML mechanisms&#x2019; work and preserve essential features by increasing generalization when reducing the number of predictor variables. The main role of dimension reduction is to eliminate redundant features that are noisy and control the attainable variables. The LDA and PCA maximize data projection points in the tree regression, and t-SNE makes the separation mechanism visualize. Generative adversarial network (GAN), a type of deep-learning mechanism, deals with the problem of data imbalance as a result of data loss in database rows, which works in the reverse direction of dimension reduction methods, by generating hypothetical intermediate data not existing in the training dataset, reaching a novelty rate of 92.53% when generating 2&#x2009;million observations, as discussed by <xref ref-type="bibr" rid="ref74">Liu et al. (2019)</xref> and <xref ref-type="bibr" rid="ref113">Shrestha et al. (2021)</xref>. An autoencoder works on unsupervised data learning and aims to reduce the number of dimensions using latent space and rebuild the optimal cost matrix through 83% training. The mean squared error (MSE) loss function is used for 90% validation accuracy, which relies on reconstructing the input data as manipulated by <xref ref-type="bibr" rid="ref27">Chong et al. (2017)</xref>, <xref ref-type="bibr" rid="ref42">Gao and Lee (2019)</xref>, and <xref ref-type="bibr" rid="ref1">Aamer et al. (2020)</xref>. An effective agglomerative clustering technique uses a heap to keep track of the distances between each pair of clusters in the root node of the tree. Therefore, researchers resorted to clustering of unsupervised data learning to pave the way for forecasting mechanisms via k-means and mean-shift algorithms. They found that K-means works quicker and more robustly in terms of efficiency if the clusters are over 10 and less than 15 while using mean-shift if bandwidth h lies in the range of 0.03 to 0.06. When it comes to tiny data sets, the FP growth method is the fastest; nevertheless, when it comes to generating frequent item collections, the ECLAT and Apriori algorithms perform better. If hybridized by random forest, BayesNet, sequential minimal optimization (SMO), random gradient descent (SGD), and multinomial logistic regression (MLR), the accuracy values are 100, 96.75, 98.25, and 95.75%, respectively as discussed by <xref ref-type="bibr" rid="ref101">Prifti et al. (2023)</xref>. Predicting the sales and returns of merchandize is a crucial component of procurement management that affects inventory and production sectors. A persistent problem, particularly in online grocery and other foo, shops embedded in the Hunger Station application, is estimating market demand and determining inventory supply levels by using nine regression models (i.e., RF, linear regression, logistic regression, SVM, ANN, SVM, ARIMA, NARX, and decision tree), which hybridize with Adaboost algorithms through a fuzzification model. Minimal deviations between predicted and actual values characterize an exceptional performance of the Random Forest model, as discussed by <xref ref-type="bibr" rid="ref125">Vairagade et al. (2019)</xref> and <xref ref-type="bibr" rid="ref101">Prifti et al. (2023)</xref>. Based on the estimation features (specificity, accuracy, and sensitivity), the RF approach yielded the most accurate predictions according to Hamming distances, which aid in giving the closest predictions larger weights.</p>
<table-wrap position="float" id="tab1">
<label>Table 1</label>
<caption>
<p>ML categories and most common algorithms work on supply chain sectors.</p>
</caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left" valign="top">Learning type</th>
<th align="left" valign="top">Definition</th>
<th align="left" valign="top">Suggested algorithms</th>
<th align="left" valign="top">Best use according to data input</th>
<th align="left" valign="top">Ref.</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" valign="middle" rowspan="4">Discrete data <inline-graphic xlink:href="frsus-05-1388771-i001.tif"/></td>
<td align="left" valign="middle" rowspan="8">Based on Labeled data (controlled) with prior knowledge of input and output<break/>Mapping the variables to the desired output variables</td>
<td align="left" valign="middle">Decision trees (DTs)</td>
<td align="left" valign="top">(DTs) classify variables into different categories based on associated values, which can be utilized for group objectives.</td>
<td align="left" valign="top"><xref ref-type="bibr" rid="ref131">Wenzel et al. (2019)</xref>; <xref ref-type="bibr" rid="ref78">Makkar et al. (2020)</xref></td>
</tr>
<tr>
<td align="left" valign="middle">Na&#x00EF;ve Bayes</td>
<td align="left" valign="top">Relies on Bayes&#x2019; theorem which is good when using small-scale datasets and preferable in clustering and classifying objects.</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref93">Park (2021)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Support vector machine (SVM)</td>
<td align="left" valign="top">It is a classification and regression machine learning algorithm that has a powerful advantage in mathematical interpretability, so it is sustainable for high-dimensional problems for classification purposes.</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref12">Ahmed and Farzana (2020)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">K-nearest neighbor</td>
<td align="left" valign="top">A supervised clustering ML algorithm that uses training data. It is similar to the K-means algorithm when introducing data to a learner to a correlation test, which helps in predicting the grouping of an individual data point.</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref45">Gaur et al. (2015)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Supervised learning</td>
<td align="left" valign="middle">Deep Q-Learning</td>
<td align="left" valign="top">Is a different from Q-learning, which relies on a deep NN to represent the Q-function, rather than a simple table of values?</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref35">Dittrich and Fohlmeister (2021)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle" rowspan="3">Continuous data <inline-graphic xlink:href="frsus-05-1388771-i002.tif"/></td>
<td align="left" valign="middle">Supervised/Recurrent neural network (RNN)</td>
<td align="left" valign="middle">When comparing the expected and real results of a supervised neural network (SNN), errors are found, and parameter values are adjusted to feed the neural network with new data.</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref86">Najjartabar Bisheh et al. (2022)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Extreme Machine Learning (EML)</td>
<td align="left" valign="middle">A front propagation NN that is used in grouping and data regression. It can minimize half of the calculation compared with a normal neural network.</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref1">Aamer et al. (2020)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Logistic regression (LR)</td>
<td align="left" valign="top">A classification ML algorithm is used for predicting the probability of certain classes based on some dependent variable and is considered extended to linear type.</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref93">Park (2021)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle" rowspan="4">Unsupervised learning <inline-graphic xlink:href="frsus-05-1388771-i003.tif"/></td>
<td align="left" valign="top" rowspan="4">Based on unlabeled (uncontrolled) data without prior knowledge of input and output.<break/>Exploring the hidden pattern based on the unlabeled dataset.</td>
<td align="left" valign="middle"><italic>K</italic>-means clustering (KM)</td>
<td align="left" valign="top">The K-means (KM) grouping technique forms K-similar clusters, with the mean of the outcomes at the core of each one, based on the resemblance of the data groups.</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref65">Khalid and Herbert-Hansen (2018)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Principal component analysis (PCA)</td>
<td align="left" valign="middle">Due to its ability to minimize the dimensions of the data, the analysis of principal components can facilitate calculating more quickly.</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref73">Liu (2022)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Apriori</td>
<td align="left" valign="top">Helps in creating association rules from a given dataset.</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref137">Yan (2023)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Unsupervised/Artificial neural network (ANN)</td>
<td align="left" valign="middle">Artificial or unsupervised neural networks (UNN) classify input by comparing it to a predetermined set of characteristics while the results are unknown. Consequently, it turns to identifying correlations among various inputs and categorizing them accordingly.</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref76">Lunardi and Lima Junior (2021)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle" rowspan="2">Semi-supervised learning</td>
<td align="left" valign="middle" rowspan="2">When data input is diverse between controllable and uncontrollable</td>
<td align="left" valign="middle">Self-training</td>
<td align="left" valign="top">Using labeled data for initial self-training of classifiers, uncontrolled data are subsequently fed into the system.</td>
<td align="left" valign="top" rowspan="2">
<xref ref-type="bibr" rid="ref133">Widodo et al. (2024)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Transudative support vector machine</td>
<td align="left" valign="middle">Consider an SVM extension aptly named (TSVM) that tackles both controlled and uncontrolled data types to gain maximum margin between them</td>
</tr>
<tr>
<td align="left" valign="middle" rowspan="4">Ensemble learning <inline-graphic xlink:href="frsus-05-1388771-i004.tif"/></td>
<td align="left" valign="middle" rowspan="4">Training and testing datasets are combined and interact with the environment to collect information used for predicting results better than any of the basic classifiers alone.</td>
<td align="left" valign="middle">Bagging or Bootstrap</td>
<td align="left" valign="top">It is employed to manage trade-offs between bias and variance and lower a prediction model&#x2019;s variability. Specifically for decision tree methods, stripping is utilized for both classification and regression models to prevent overfitting of the data.</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref129">Wang et al. (2023)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Catboost, XGboost, Adaboost</td>
<td align="left" valign="top">Modern reinforcing guarantees rapidly tackling the growing nature of big data and present analytical-relation especially when joining SC sector s.</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref91">Panda and Mohanty (2023)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Genetic</td>
<td align="left" valign="top">It is an optimization algorithm similar to the EM algorithm or gradient descent optimization. If you are applying it to clustering, you&#x2019;d create an unsupervised algorithm.</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref72">Lin et al. (2022)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Random Forest</td>
<td align="left" valign="top">Is an algorithm used for classifications and regression? It uses trained data from several decision trees. It takes the average to improve the predictive accuracy of a dataset.</td>
<td align="left" valign="top"><xref ref-type="bibr" rid="ref125">Vairagade et al. (2019)</xref>; <xref ref-type="bibr" rid="ref136">Xu et al. (2023)</xref></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The success of the SC is to satisfy the customer&#x2019;s demand at a suitable time with the required quality at a minimum cost. Managing sector parts between supply chain parts is a significant part of achieving this success via eliminating non-value-added activities across the chain to make it more agile, as discussed by <xref ref-type="bibr" rid="ref142">Yu Lin and Hui Ho (2008)</xref>; <xref ref-type="bibr" rid="ref68">Kov&#x00E1;cs and Kot (2016)</xref>; <xref ref-type="bibr" rid="ref138">Yan et al. (2019)</xref>; <xref ref-type="bibr" rid="ref99">Pournader et al. (2020b)</xref>. Any organization aims to satisfy the customers&#x2019; requirements with the minimum cost as observed in the study by <xref ref-type="bibr" rid="ref10">Abed et al. (2023)</xref>. <xref ref-type="fig" rid="fig2">Figure 2A</xref> illustrates the number of most common ML algorithms used in 89 published papers obtained from the Taylor &#x0026; Francis, Emerald, and ScienceDirect libraries and focuses on the interval during 2016&#x2013;2024. Many researchers are keen to use GA and unsupervised neural networks, and there is a poor use of CatBoost and Apriori algorithms, despite their efficiency and modernity. There are 10 sectors of SCM as shown in <xref ref-type="fig" rid="fig2">Figure 2B</xref>, where many researchers focus on circular economy that touches on its importance in sustaining the SC cycle, 17 of them tackle inventory problem, while 15 are interested in forecasting the demand that affects transportation and distribution to set inventory dimensions. In addition, little researchers are interested in using sustainable development in supply chain issue, therefore focus on the causes of the lack of research in this area. The authors believe in sustainable development based on one strong motivation between common sectors, which is the circular economy.</p>
<fig position="float" id="fig2">
<label>Figure 2</label>
<caption>
<p><bold>(A)</bold> The most ML algorithms used in supply chain management. <bold>(B)</bold> Classification based on the SCM interest.</p>
</caption>
<graphic xlink:href="frsus-05-1388771-g002.tif"/>
</fig>
<p>Moreover, organizations need to implement new approaches and new technologies to meet these challenges. ML and IoT technologies represent the main pillars of industry 4.0 transformation. In this research, Sec. (1) and its subsection give a detailed review of ML applications in SCM and how SCM can be benefited from it. Sec. (1.2) illustrates a Workflow for building an ML model via common algorithms. Sec. (2) discusses the research gap to pave to hybridize the optimization algorithms with ML algorithms to gain enhancement in its mechanism behavior and present its pseudocode. Sec. (3) presented a conceptual framework for applying ML applications in SCM and some limitations of applying it. Sec. (4) illustrates an illustrative example of how to apply ML in a circular economy and discusses the proposed mathematical model of the proposed technique. Finally, conclusion is presented in Sec. (5), and future work is suggested in Sec. (6).</p>
<sec id="sec2">
<label>1.1</label>
<title>Taxonomy relationship between SCM and ML</title>
<p>The number of research that has been published about the use of algorithms based on ML in SCM is insufficient, even though there are many papers in the fields of ML and SCM independently, as discussed by <xref ref-type="bibr" rid="ref21">Bertolini et al. (2021)</xref> who derived his study from <xref ref-type="bibr" rid="ref28">Ciresan et al. (2012)</xref> and <xref ref-type="bibr" rid="ref71">Leung et al. (2014)</xref>. However, there is a lack of communication in this field between scholars and practitioners. It may result from practitioners&#x2019; lack of understanding of the capabilities and benefits of ML algorithms for handling SCM issues. This section provides an overview of how the most well-known algorithms that use machine learning are used to manage supply chain-related challenges, such as risk related to suppliers, supplier classification, and choosing suppliers.</p>
<sec id="sec3">
<label>1.1.1</label>
<title>Ml applications in SCM</title>
<p>The resistance to diseases via human immunity power that based on healthy foods produced from vegetables or fruits. These products have a low life cycle and entail spoilage if the producer presents more than customer demand requirements. Therefore, accurate forecasting is a suitable solution for tackling online historical massive data. Food goods are perishable; hence, <xref ref-type="bibr" rid="ref88">Ni et al. (2020)</xref> showed in their research by finding that the food and grocery businesses dominate the usage of ML approaches in their SCM to get accurate demand forecasts. <xref ref-type="bibr" rid="ref110">Sharma et al. (2020)</xref> examined research articles that use machine learning (ML) in the agriculture supply chain (ASC). They looked at 93 studies that addressed the advantages of using ML algorithms in various SC sectors to ensure a profit on this investment. Therefore, the researchers have been directed to a circular economy that is based on prediction to be able to use all product components. In addition, they believed that ML could improve the performance and efficiency of ASC and solve various challenges such as low life-cycle, customer management, and environmental effects. <xref ref-type="bibr" rid="ref28">Ciresan et al. (2012)</xref>, <xref ref-type="bibr" rid="ref71">Leung et al. (2014)</xref>, and <xref ref-type="bibr" rid="ref120">Tirkolaee et al. (2021)</xref> created a conceptual framework to highlight how ML approaches help with supply chain risks, production, demand forecasting, and supplier selection, among other SCM tasks. Based on the data amount and major variable behavior, the significance of selecting an appropriate ML method is acknowledged throughout the text. The authors conclude that there are significant gaps in supply chain design and optimization between ML and the mathematical optimization model. <xref ref-type="bibr" rid="ref128">Wamba et al. (2017)</xref> and <xref ref-type="bibr" rid="ref102">Priore et al. (2019)</xref> presented a system that demonstrates the implementation of machine learning (ML) in a dynamic supply chain context with large, dynamic data sets impacted by contemporary internet applications such as the Internet of things. The policies in effect quicken the SC. According to <xref ref-type="bibr" rid="ref95">Perera et al. (2020)</xref>, the suggested framework is regarded as a guide for managers to comprehend complicated inventory scenarios and how managers may choose replenishment plans efficiently. An order-up-to-replenishment policy&#x2019;s stock level is contingent upon the vendor&#x2019;s lead time on item delivery. <xref ref-type="bibr" rid="ref8">Abed and Seddek (2022)</xref> based on the study by <xref ref-type="bibr" rid="ref115">Singh et al. (2018)</xref>, suggest that periodic order-up-to systems are the most appropriate for small businesses with little inventory spread across many warehouses as discussed by <xref ref-type="bibr" rid="ref115">Singh et al. (2018)</xref>, where their model proved its efficiency in decreasing operation costs as it reduced time for replenishment by 88% using support vector machine (SVM) to analyze data from social media (twitter), as shown in <xref ref-type="fig" rid="fig3">Figure 3</xref>. In 2013, the ML algorithm was used to analyze people&#x2019;s sentiments about mobiles, electronic products, and laptops from tweeters&#x2019; posts, which divided people&#x2019;s opinions associated with their products into two satisfaction categories (positive or negative) according to <xref ref-type="bibr" rid="ref87">Neethu and Rajasree (2013)</xref>, proving its efficiency in improving the supply chain especially that associated with their customer feedback. The new feature vector was proposed to face the problem of handling misspellings and slang words by doing feature extraction in two procedures. The first one is to make a summary of specific features from tweets and add it to the feature vector. The second step is to remove these features from tweets, extract them again, and then add them to the feature vector. The proposed vector approved its accuracy in the electronic products domain compared with other feature vectors. The second inquiry is about risks facing supply chains and requires techniques to help detect, evaluate, and lessen different types of risk. The term supply chain risk management (SCRM) is interested in routine occurrences to extraordinary disruptions.</p>
<fig position="float" id="fig3">
<label>Figure 3</label>
<caption>
<p>Analyzing data from Twitter (<xref ref-type="bibr" rid="ref115">Singh et al., 2018</xref>).</p>
</caption>
<graphic xlink:href="frsus-05-1388771-g003.tif"/>
</fig>
<p><xref ref-type="bibr" rid="ref83">Montufar et al. (2014)</xref>, <xref ref-type="bibr" rid="ref77">Ma et al. (2015)</xref>, and <xref ref-type="bibr" rid="ref49">Han and Zhang (2021)</xref> illustrate the way for using ML algorithms to effectively manage risks in the supply chain. They built a model based on the neural network and then they used MATLAB to simulate their model and validate it with examples. The results showed that the model proposed is applicable and has a feasible effect in managing supply chain risks. This study illustrates the approach that pushed <xref ref-type="bibr" rid="ref108">Salama et al. (2023)</xref> to present its results, which is based their study by <xref ref-type="bibr" rid="ref11">Aburto and Weber (2007)</xref>, <xref ref-type="bibr" rid="ref103">Raina et al. (2009)</xref>, <xref ref-type="bibr" rid="ref69">Kraus et al. (2020)</xref>, and <xref ref-type="bibr" rid="ref6">Abed and Al-Attar (2018)</xref>, streamlining when presenting a hybrid system for estimating demand that can be used for the retail industry. In case of the auto-combined regressive integrated moving average (ARIMA) models and neural networks, the proposed model approved its value in improving accuracy for a short-term forecast, improving service quality and reducing sales failures that increase competitiveness. <xref ref-type="bibr" rid="ref89">Nie et al. (2012)</xref>, <xref ref-type="bibr" rid="ref109">Sameh Ibrahim et al. (2011)</xref>, and <xref ref-type="bibr" rid="ref17">Baecke et al. (2017)</xref> presented a model for forecasting demand they integrated the SVM algorithm with the moving average for estimating linear and non-linear basic part of load, then authors tried the proposed model on large sample estimation, and approved its ability in improving forecast accuracy. <xref ref-type="bibr" rid="ref130">Wang and Zhang (2020)</xref> introduced a framework, a statistical approach, based on multiple costing frameworks for power control by applying ML model for power optimization and cost reduction, as discussed by <xref ref-type="bibr" rid="ref40">Furian et al. (2021)</xref>.</p>
<p>Then, they presented a general model to solve the problem of idleness and explored techniques to increase the profitability and efficiency of organizations and achieve sustainability, as discussed by <xref ref-type="bibr" rid="ref126">Vandchali et al. (2021)</xref> and <xref ref-type="bibr" rid="ref127">Vandchali et al. (2021)</xref>. <xref ref-type="bibr" rid="ref36">DuHadway et al. (2019)</xref> used ML algorithms for the automatic detection of RFID readings in a real-world factory to help in risk detection. They used three classifiers named logistic regression, SVM, and DTs, which combined to classify RFID readings more effectively. The results showed that logistic regression provided the lowest accuracy (92.75%), DTs provided accuracy of 92.85% and SVM provided the highest accuracy (95.3%). Generally, ML algorithms provide a significant solution for identifying and tracking goods overall in the supply chain. In the Healthy sector, <xref ref-type="bibr" rid="ref50">Haq et al. (2018)</xref> and <xref ref-type="bibr" rid="ref79">Malviya et al. (2021)</xref> used ML algorithms for the forecasting of heart disease, and backorders for healthy supplies, seven ML algorithms were used. <xref ref-type="bibr" rid="ref37">Dzogbewu et al. (2023)</xref> investigated supply chain disturbances during the COVID-19 pandemic in South Africa&#x2019;s industrial sector, and the application of technology for additive manufacturing to mitigate those disruptions relies on <xref ref-type="bibr" rid="ref49">Han and Zhang (2021)</xref>, but they adopted a qualitative research approach. A company&#x2019;s supply chain robustness is its capacity to recover from adversity. Supply chain endurance describes the ability of the system to adapt and withstand transient disturbances. Previous research has shown that for businesses to increase their supply chain resilience capability while dealing with other vendors, design information portability and substitutability were necessary, as discussed by <xref ref-type="bibr" rid="ref19">Belhadi et al. (2022)</xref>. Based on lean techniques to control waste elimination in SCM activities and sustain SC on the green side to respect the environment, the success of SCM relies on the perspective of <xref ref-type="bibr" rid="ref39">Friedman (2008)</xref>. This objective is the best resistance to poverty and considers the health of people because many people share in these chains to save their income and achieve social welfare. Therefore, securing the supply chain of risks via understanding the supply chain risk management (SCRM) is the most important safeguard for the safety and sustainability of living life. The different algorithms of machine learning prove successful SCM, especially in reducing cost and delivering parcels in minimum time in the right agreed place. The ML is a real embodiment of the objectives of Industrial Revolution I4.0 through artificial intelligence superiority.</p>
</sec>
<sec id="sec4">
<label>1.1.2</label>
<title>Supply chain risk management</title>
<p>Several risks affect the success of the enterprises and are managed via aptly named SCRM, which aims to identify, assess, and mitigate unexpected risks, which involve both negative and positive outcomes. SC research and SCRM are two areas where AI approaches have not received much attention, according to <xref ref-type="bibr" rid="ref144">Zhang et al. (2014)</xref>. Massive amounts of data, more powerful computers, and the effectiveness of machine learning methods have all contributed to the recent rebirth of artificial intelligence (AI). Scientists have used it as an opportunity to utilize AI techniques in SCRM for tasks such as risk identification, evaluation, reaction, and forecasting, according to <xref ref-type="bibr" rid="ref139">Yang and Sudharshan (2019)</xref> and <xref ref-type="bibr" rid="ref122">Toorajipour et al. (2021)</xref> (<xref ref-type="bibr" rid="ref16">Azar and Dolatabad, 2019</xref>; <xref ref-type="bibr" rid="ref18">Baryannis et al., 2019</xref>; <xref ref-type="bibr" rid="ref98">Pournader et al., 2020a</xref>). SCRs are the most important supply chain sector that must be framed through two sequential steps:</p>
<list list-type="alpha-upper">
<list-item>
<p>Risk identification: The first activity in SCRM, which is based on classification action for risk causes, must be labeled. Therefore, the organization identifies risk drivers, which are massive and dynamic via supervised learning and focuses on SVM, RF, and DTs, which help the organization measure their risks and suggest some activities to mitigate the consequences.</p>
</list-item>
<list-item>
<p>Risk measurement and evaluation: The risk caused by forming massive data needs continuous analysis via suitable ML algorithms; the authors found that the artificial neural networks (ANNs) in both types of SNN or RNN based on Bayesian networks are the two most acceptable potentials in modeling risk assessment that summarized by <xref ref-type="bibr" rid="ref80">Mikolov et al. (2011)</xref>, <xref ref-type="bibr" rid="ref31">Dauphin et al. (2014)</xref>; <xref ref-type="bibr" rid="ref121">Tompson et al. (2014)</xref>, and <xref ref-type="bibr" rid="ref132">Wichmann et al. (2020)</xref>.</p>
</list-item>
</list>
<p><xref ref-type="bibr" rid="ref18">Baryannis et al. (2019)</xref> presented a comprehensive review of papers that used artificial intelligence (AI) techniques in facing supply chain risks; the result showed that the researchers tend to explore mathematical programming instead of exploring other AI techniques. The benefits of modern artificial intelligence are not being reached yet; many areas need more exploration, such as prediction and learning, decision-making and applicability, big data, and hybridization. <xref ref-type="bibr" rid="ref4">Abed et al. (2023)</xref> hybridize a mathematical model based on an ML algorithm to enhance heuristic techniques called mat-heuristic and achieve effective output, but the risk management is considered a main obstacle to gain hopeful performance. <xref ref-type="fig" rid="fig4">Figure 4</xref> illustrates seven main types of global supply chain risks, as discussed by <xref ref-type="bibr" rid="ref9001">Chu et al. (2020)</xref>, <xref ref-type="bibr" rid="ref43">Garc&#x00ED;a et al. (2009)</xref>, and <xref ref-type="bibr" rid="ref60">Kamble et al. (2020)</xref>, each of them have several factors that affect the performance in all supply chain networks such as <underline>demand</underline>, <underline>inventory</underline>, <underline>shortage</underline>, <underline>overstock</underline>, and <underline>supplier</underline>, in addition to the factors of supply and demand risks. In addition, the second is political risk factors, such as <underline>terrorism</underline>, <underline>wars</underline>, <underline>policy</underline>, <underline>traffic</underline>, and <underline>pandemic diseases</underline> and third is the system risk, such as <underline>network</underline>, <underline>transparency</underline>, <underline>uncertainty</underline>, and <underline>trust</underline>, as discussed in the third theory of corruption by <xref ref-type="bibr" rid="ref3">Abed (2023)</xref>. The fourth is logistic risks, such as <underline>transportation</underline>, <underline>distribution</underline>, <underline>warehouse</underline>, <underline>bullwhip,</underline><xref ref-type="fn" rid="fn0001"><sup>1</sup></xref> and <underline>storage</underline> (<xref ref-type="bibr" rid="ref123">Traore et al., 2017</xref>), while fifth type is financial risks, such as <underline>profit</underline>, <underline>accounting</underline>, and <underline>finance</underline> (<xref ref-type="bibr" rid="ref2">Abdel-Basset et al., 2019</xref>; <xref ref-type="bibr" rid="ref25">Chen, 2022</xref>), and the sixth type is operational risks, such as <underline>utilization</underline>, <underline>capacity</underline>, <underline>schedule</underline>, <underline>cost</underline>, and <underline>quality</underline>, as discussed by <xref ref-type="bibr" rid="ref62">Kamble et al. (2022)</xref>. The last is environmental risks, such as <underline>flood</underline>, <underline>fire</underline>, <underline>weather</underline>, <underline>sustainability</underline>, and <underline>disasters</underline>. All of these factors must be taken into consideration when managing supply chain risks. The lifeline of SCM is combating risks that threaten its sustainability while encouraging a circular economy that ensures the greatest occupancy of means of transportation in the chain to reduce its costs and increase utilization.</p>
<fig position="float" id="fig4">
<label>Figure 4</label>
<caption>
<p>Seven main types of global supply chain risks.</p>
</caption>
<graphic xlink:href="frsus-05-1388771-g004.tif"/>
</fig>
<p>The previous research emphasizes that there is no unified definition for SCRM, but any internal or external activities affect the performance negatively of receiving or delivering the parcel at the right time for the right customer in the right place forming risk, leading to a cut in the chain as <xref ref-type="bibr" rid="ref116">Singh et al. (2019)</xref> prove. Many researchers defined it as the integration between all supply chain partners in taking many actions to avoid risks that may face the success of the organization. These actions could be summarized in three procedures, the first one is to identify, evaluate, and mitigate risks as discussed by <xref ref-type="bibr" rid="ref51">Ho et al. (2015)</xref>, <xref ref-type="bibr" rid="ref36">DuHadway et al. (2019)</xref>, and <xref ref-type="bibr" rid="ref18">Baryannis et al. (2019)</xref>, where the base references of many researchers were seeking to optimize SCM. In addition, one conclusion can be drawn from many researchers, which is that machine learning is the direct way to help in succeeding the SCM and increase its performance.</p>
</sec>
</sec>
<sec id="sec5">
<label>1.2</label>
<title>Workflow for building a suitable ML model</title>
<p><xref ref-type="fig" rid="fig5">Figure 5</xref> illustrates six steps for building a general ML model, according to <xref ref-type="bibr" rid="ref63">Kamble et al. (2019b)</xref> and <xref ref-type="bibr" rid="ref61">Kamble et al. (2019a)</xref>. SC must resort to collecting data quickly and precisely for speed change data system and advocates to integrate IoT in this stage using a controller unit and following the preparation, as discussed by <xref ref-type="bibr" rid="ref108">Salama et al. (2023)</xref>, to train the data according to most training percentages of 30&#x2013;70% or 20&#x2013;80% to validate the model.</p>
<fig position="float" id="fig5">
<label>Figure 5</label>
<caption>
<p>Workflow for building the ML model.</p>
</caption>
<graphic xlink:href="frsus-05-1388771-g005.tif"/>
</fig>
<p>Finally, try to enhance the performance of supply chain system by mitigating expected risks via adopting optimization algorithms such as Dingo, Arithmetic, etc. Therefore, becomes vital to see the effect of AI on optimizing the algorithms of the ML when tackling the SCM sector discussed above and their risks.</p>
<sec id="sec6">
<label>1.2.1</label>
<title>Artificial intelligence</title>
<p><xref ref-type="bibr" rid="ref94">Pelletier and Tyedmers (2010)</xref>, and <xref ref-type="bibr" rid="ref109">Sameh Ibrahim, et al. (2011)</xref> predicted that more intelligent chains of business would use search and pattern recognition algorithms to analyze real-time data to check product quality. These algorithms are now hierarchical rather than merely predictive, and they will allow supply networks to respond to machine-generated artificial intelligence while offering immediate insight and transparency. Three requirements are needed for smart supply chain management (SSCM) (aptly called instruments, interconnection, and intelligent). ML is a type of AI that makes machines able to simulate the way that humans learn through learning from historical data, as discussed by <xref ref-type="bibr" rid="ref47">Goodfellow et al. (2016)</xref>. There are three main categories of ML illustrated briefly in <xref ref-type="fig" rid="fig6">Figure 6</xref>, as expressed by <xref ref-type="bibr" rid="ref97">Pournader et al. (2021)</xref> and pave the way to <xref ref-type="bibr" rid="ref9002">Peng et al. (2021)</xref> and <xref ref-type="bibr" rid="ref22">Bousqaoui et al. (2017)</xref>, which classified into unsupervised, reinforcement learning affect in supervised learning and used for regression, classification, clustering, and association tasks.</p>
<fig position="float" id="fig6">
<label>Figure 6</label>
<caption>
<p>AI taxonomy for ML algorithms in SCM (<xref ref-type="bibr" rid="ref97">Pournader et al., 2021</xref>).</p>
</caption>
<graphic xlink:href="frsus-05-1388771-g006.tif"/>
</fig>
</sec>
<sec id="sec7">
<label>1.2.2</label>
<title>Ml algorithms used in SCM based on AI intervention</title>
<p>The digital simulator network that tackles the online e-commerce data architecture is presented in <xref ref-type="fig" rid="fig7">Figure 7</xref>. A methodology for hybridizing AI to track SCRM activities is shown in <xref ref-type="fig" rid="fig8">Figure 8</xref> to form a conceptual two-way framework to help in risk cause prediction and is acceptable by many scientists in the field (<xref ref-type="bibr" rid="ref70">Lee et al., 2018</xref>; <xref ref-type="bibr" rid="ref46">Giri et al., 2019</xref>; <xref ref-type="bibr" rid="ref34">Dhamija and Bag, 2020</xref>; <xref ref-type="bibr" rid="ref96">Peres et al., 2020</xref>; <xref ref-type="bibr" rid="ref140">Yang et al., 2021</xref>). The AI experts&#x2019; decisions are contingent upon the inputs whether labeled or unlabeled according to the SC sector, and the developed models and results must be comprehensible to enable making choices based on them or their influence on SCRM decision-making. Although there are 32 commonly used algorithms for ML.</p>
<fig position="float" id="fig7">
<label>Figure 7</label>
<caption>
<p>Architectural Framework for Cat-DO controlling digital simulator network.</p>
</caption>
<graphic xlink:href="frsus-05-1388771-g007.tif"/>
</fig>
<fig position="float" id="fig8">
<label>Figure 8</label>
<caption>
<p>Taxonomy conceptual framework for ML terminals in SSCM.</p>
</caption>
<graphic xlink:href="frsus-05-1388771-g008.tif"/>
</fig>
<p>Although supply chains can gain a lot of benefits from applying ML, There are some limitations to implementing it, such as the ML algorithm&#x2019;s lack of explanation in detail for how to implement and benefits from applying it, high error-susceptibility, and the ability to accurately interpret the results generated by the algorithm; so it is very critical to choose the correct algorithm for the purpose needed as discussed by <xref ref-type="bibr" rid="ref32">Dave and Choudhary, (2014)</xref>, <xref ref-type="bibr" rid="ref85">Nagar et al. (2021)</xref>, and <xref ref-type="bibr" rid="ref48">Hamdy et al. (2022)</xref>.</p>
</sec>
</sec>
</sec>
<sec id="sec8">
<label>2</label>
<title>Research gap and problem statement</title>
<p>The supply chain management improvement idea originated from data analysis capabilities that enable decision-makers to take beneficial actions. The challenge with e-commerce data is its massive, quick, imbalanced, and chaotic nature. Therefore, using ML algorithms is suitable for tackling this challenge and presenting an answer about the core sector among SCM sectors that control the success of the whole sector framework. The answer is demanding forecasting. The failure of forecasting accuracy negatively affects safety stocks and creates extra holding costs in finished goods inventory, and the bullwhip effect reveals supplier unreliability and creates a crisis in transport network unpredictability. E-commerce is a timestamp-dynamic system that must update every short interval to meet accurate forecasting values and avoid losses in SC sectors. The framework has been modified for <xref ref-type="bibr" rid="ref134">Wu et al. (2018)</xref>, and the forecasting is a natural development for the review statements for <xref ref-type="bibr" rid="ref14">Altan et al. (2019)</xref> and compared with many of them to study the interval of superiority that achieves minimum error. The forecasting that is related to timestamp data behavior has been discussed by <xref ref-type="bibr" rid="ref14">Altan et al. (2019)</xref>, to reduce unfavorable conditions and improve accuracy based on an LSTM neural network when improving the Cuckoo search (CS) algorithm.</p>
<p>Marketing Healthy food products must follow the make-to-order (MTO) system, and it is difficult to follow the make-to-stoke (MTS) method due to the difficulty in storing them for long periods due to the lack of preservatives. Therefore, supply chain logistics suffered from not meeting customer requests promptly, which created difficulty in competing in markets far from the production source. Therefore, it has become necessary to accurately forecast customer demand for this type of product so that the company does not incur financial losses. These products are sold through both physical and electronic sales outlets (e-commerce) that do not close their gates. The difficulty was that the electronic platforms are available for 24&#x2009;h a day, which accumulates orders that must be addressed to the customer immediately after production. For us to be able to order quickly, it was necessary to make forecasts continuously and quickly for the massive and chaotic data collected. Due to the abundance of data and the need for quick decision-making, the research resorted to making the use of machine learning (ML) algorithms.</p>
<p>Through previous research, we were able to handle the largest amount of transported inventory via increased packing (<xref ref-type="bibr" rid="ref56">Ibrahim, 2021</xref>), another application studies the shortest path, and another application reduces the waiting time of customers and serves the largest number of customers during a work shift. Now, with this research, we are examining the forecasting process to speed up the process of withdrawing from stock and providing the product with special specifications. The article compares a variety of ML algorithms and proposes the CatBoost algorithm, which uses Dingo optimization to catch the smallest forecasting error. The order characteristics are different according to the customers&#x2019; age and sex. Therefore, the study tackles the data according to both factors. The hybridization between the CatBoost algorithm and Dingo Optimization (DO) is called <italic>Cat-DO</italic>. We compare the suggested method with the six other methods, including long short-term memory (LSTM), autoregressive integrated moving average (ARIMA), additive boost (Ada-boost), extreme gradient boosting (CatBoost), support vector machine (SVM), and deep neural network (DNN). The data types are chaotic and imbalanced, pushing us to track the accuracy via normalized root mean square error (NRMSE), and program the proposed method via Python software.</p>
</sec>
<sec id="sec9">
<label>3</label>
<title>A conceptual framework for applying ML applications in SCM</title>
<p>According to the review section, the ML algorithms provide massive advantages to enhance the SCM, what if IoT for it. <xref ref-type="bibr" rid="ref64">Kazemi (2019)</xref> and <xref ref-type="bibr" rid="ref81">Misic and Perakis (2020)</xref> suggest integrating ML algorithms as a manager to IoT, to enable the components of the system to talk to each other that provide traceability, real-time monitoring, and visibility overall the supply chain sectors. <xref ref-type="fig" rid="fig9">Figure 9</xref> illustrates a proposed framework for applying ML algorithms in several parts of SCM and its function in each sector (<underline>production</underline>, <underline>inventory management</underline>, <underline>circular economy</underline>, <underline>demand forecasting</underline>, <underline>transportation</underline> and <underline>distribution</underline>, <underline>procurement</underline> or supplier selection, <underline>sustainable development, and supply chain risks resistance</underline>, supplier segmentation, and <underline>supply chain improvement</underline>). The outputs must be monitored and controlled by supply chain experts based on the perspective of <xref ref-type="bibr" rid="ref75">Liu et al. (2012)</xref> and the implementation of <xref ref-type="bibr" rid="ref38">Eladly et al. (2023)</xref> (<xref ref-type="bibr" rid="ref33">Deif, 2011</xref>; <xref ref-type="bibr" rid="ref90">Pan et al., 2021</xref>; <xref ref-type="bibr" rid="ref5">Abed et al., 2024</xref>).</p>
<fig position="float" id="fig9">
<label>Figure 9</label>
<caption>
<p>Data-driven framework for many commonly used ML algorithms in SSCM.</p>
</caption>
<graphic xlink:href="frsus-05-1388771-g009.tif"/>
</fig>
</sec>
<sec id="sec10">
<label>4</label>
<title>Illustrative example of how to apply ML in demand forecasting</title>
<p>This example is based on a conceptual framework presented in <xref ref-type="fig" rid="fig7">Figure 7</xref>, which shows how SSCM applications succeed by using suitable ML algorithms that match the data and mitigate the risks. The proposed mechanism relies on the IoT for supply chain data collection. The illustrative case study for the food industry, which has many diverse products, discusses how ML is useful in forecasting market demand for many finished products. The IoT is an effective AI tool that gives the mechanism the power of real-time data, which must be based on a high-speed algorithm to tackle this type of data. Therefore, the article settled on using the CatBoost technique, to tackle data after being enhanced by an optimization Dingo algorithm.</p>
<p>It helps in preserving resource usage, remanufacturing, recycling, repairing, and refurbishment as discussed by <xref ref-type="bibr" rid="ref2">Abdel-Basset et al. (2019)</xref>, <xref ref-type="bibr" rid="ref41">Gao et al. (2019)</xref>, and <xref ref-type="bibr" rid="ref124">Trappey et al. (2020)</xref>, which implemented effectively by <xref ref-type="bibr" rid="ref38">Eladly et al. (2023)</xref> in textile fabrication and by <xref ref-type="bibr" rid="ref106">Rico-Fern&#x00E1;ndez et al. (2019)</xref> and <xref ref-type="bibr" rid="ref105">Rehman et al. (2019)</xref> in agriculture. The circular economy must sustain TBL elements (environmental, people, and profit) via control wastes to be suitable resource usage to guarantee its sustainability without affecting the quality of the products requested by the customer, as the main purpose of any industry is to gain customer satisfaction. The purpose is to trace back the generation of waste to its upstream to generate useful waste as discussed by <xref ref-type="bibr" rid="ref104">Read and Muth (2021)</xref>, and <xref ref-type="bibr" rid="ref107">Saghaei et al. (2020)</xref> are interested in recycling the biomass waste via (re)chemical, and <xref ref-type="bibr" rid="ref25">Chen (2022)</xref> suggest hybridizing ML and IoT based on image processing, as implemented by <xref ref-type="bibr" rid="ref38">Eladly et al. (2023)</xref> and <xref ref-type="bibr" rid="ref108">Salama et al. (2023)</xref>.</p>
<p>Because food manufacturers produce many comparable items, there is a fierce rivalry among them. Therefore, it is critical to retain customers so that they do not locate another supplier. As a result, precise demand forecasting is crucial, particularly when taking into account the quantity of online orders&#x2014;a factor that has been highlighted in I4.0. Because of the massive and chaotic nature of e-commerce, the quantity of historical data used to construct projections from sales sources (hyperstores, minimarkets, grocery shops, food outlets, etc.) is erroneous. The prompt reaction will bolster the precision of the demand forecast for a wide range of food goods. Accelerating the supply chain begins with accelerating inventory sales, which leads to the speed of meeting customer demand, which depends on the accuracy of forecasting customer requests. However, forecasting is a double-edged sword. The first is that if the forecast leads to an increase in inventory, the organization will incur financial burdens, while the second is the case of a shortage in inventory, which will expose the organization to financial losses. Given that the e-commerce requests are made through multiple sources speedly in receiving multiple orders from companies and individuals requesting through online sites, which is estimated at an order volume of more than 35% as cited by <xref ref-type="bibr" rid="ref67">Konovalenko and Ludwig (2019)</xref> of total orders, which in the study case exceeds an average of 2,416 requests per minute, and to ensure the accuracy of the forecast, the speed must be in line with the requested speed. Therefore, machine learning techniques are suitable to tackle this type of data. Dingo optimization focuses on fixing centers C of data to identify the catwalk through the created groups (clusters for unsupervised data and classes for supervised data), to avoid loss of time and cost. The number of groups was <inline-formula>
<mml:math id="M1">
<mml:mn>2</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>C</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>n</mml:mi>
</mml:math>
</inline-formula>, where select a value for parameter &#x2018;m&#x2019; and thereafter initialize the partition matrix U(0). Each step in this algorithm will be labeled as &#x2018;r,&#x2019; where r&#x2009;=&#x2009;0, 1, 2 &#x2026;</p>
<p>The center of groups forms vector {<inline-formula>
<mml:math id="M2">
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:math>
</inline-formula>} as expressed in <xref ref-type="disp-formula" rid="EQ1">equation (1)</xref>, and the distance of the CatBoost expressed in <xref ref-type="disp-formula" rid="EQ2">equation (2)</xref> creates a walk matrix.</p>
<disp-formula id="EQ1">
<label>(1)</label>
<mml:math id="M3">
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msubsup>
<mml:mstyle displaystyle="true">
<mml:mo stretchy="true">&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn mathvariant="bold">1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:msubsup>
<mml:msup>
<mml:mfenced open="(" close=")">
<mml:msub>
<mml:mi>&#x03BC;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mfenced>
<mml:mi>m</mml:mi>
</mml:msup>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msubsup>
<mml:mstyle displaystyle="true">
<mml:mo stretchy="true">&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn mathvariant="bold">1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:msubsup>
<mml:msup>
<mml:mfenced open="(" close=")">
<mml:msub>
<mml:mi>&#x03BC;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mfenced>
<mml:mi>m</mml:mi>
</mml:msup>
</mml:mrow>
</mml:mfrac>
</mml:math>
</disp-formula>
<disp-formula id="EQ2">
<label>(2)</label>
<mml:math id="M4">
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:msup>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo stretchy="true">&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>m</mml:mi>
</mml:munderover>
<mml:msup>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:mfenced>
<mml:mn>0.5</mml:mn>
</mml:msup>
</mml:math>
</disp-formula>
<sec id="sec11"><label>4.1</label><title>The proposed mechanism of Cat-Do pseudocode</title><p>To improve data classification via optimized feature selection for a deep neural network (DNN) classifier and prevent the premature convergence problem&#x2014;which is the foundation of forecasting&#x2014;as well as resist stagnation in local optimal conditions, this article proposes a novel version of the CatBoost algorithm based on the Dingo Optimization Algorithm (DOA). The steps needed to train a proposed mechanism structure are written in the pseudocode of the CatBoost technique that is supported by Dingo Optimization. These steps include importing the training data, changing the hyperparameters, starting up the methodology, and saving the finished file. The Dingo Optimization is a metaheuristic algorithm that draws inspiration from how dingoes hunt for prey. Therefore, it is used to enhance the efficiency of CatBoost in forecasting missions by initializing the population, establishing the parameters, identifying dingo locations, updating the objective function, updating <italic>alpha</italic>, <italic>beta</italic>, and <italic>delta</italic> dingoes, carrying out exploration and exploitation, and updating the step size in the dingo optimization method. Dingoes follow a strategy to identify the optimum points of hunting prey in the whole search area through a plan, which has three steps using their sounds:</p>
<list list-type="order">
<list-item>
<p>Set the dingo population&#x2019;s starting placements and speed at random.</p>
</list-item>
<list-item>
<p>Determine each dingo&#x2019;s level of fitness within the community.</p>
</list-item>
<list-item>
<p>Assign the rank and endurance of the dingo with the greatest fitness level among the community as the worldwide best.</p>
</list-item>
<list-item>
<p>Continue doing so until a halting requirement is satisfied, which is the minimum NRMSE can be achieved:</p>
</list-item>
</list>
<list list-type="simple">
<list-item>
<p>a. Update the rank and speed of each dingo using the following equations:</p></list-item></list>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;speed&#x2009;=&#x2009;speed + cat<sub>1</sub> &#x002A; rand () &#x002A; (global_best_location - current_location)&#x2009;+&#x2009;cat<sub>2</sub> &#x002A; rand () &#x002A;</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;(local_best_location - current_location) location&#x2009;=&#x2009;location + speed.</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;#Hint: rand() produces a random number between 0 and 1, and cat<sub>1</sub> and cat<sub>2</sub> are constants that represent the mental and relational parts of the method.</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; import Catboost</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; # Load the training data from the dataset (e-commerce dataset)</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; n=10001;</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; x_train, y_train = load_training_data( )</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; # Set the hyperparameters for the CatBoost model</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; params = {</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; 'iterations': 1000,</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; 'learning_rate': 0.12,</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; 'depth': 6,</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; 'loss_function': 'NRMSE'</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; }</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; # Initialize the CatBoost model</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; model = catboost.CatBoost(params)</p>
<p># <bold>Train</bold> the CatBoost model</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; model.fit(x_train, y_train)</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;Min_Order_capacity = MiOC;</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;Max_ Order _capacity = MxOC;</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;Fixed_location = FL;</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;Variable_location = VL;</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; demand=[MiOC: MxOC];</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; Cat_location = FL + VL &#x002A; demand;</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; for k=1:1309</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; cum_NRMSE_saves=0;</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;for j=1 : z</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;request = floor (rand&#x002A;( MxOC - MiOC)+ (MxOC - MiOC)+1);</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;if request &#x003E;= demand(k)</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;partial_ NRMSE_saves = efficiency &#x002A; demand(k);</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;else</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;efficiency = X;</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;losses= Y;</p>
<p>partial_ NRMSE_saves= X &#x002A; request + ((X-Y)) &#x002A;(demand(k)- request);</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; <bold>
end
</bold></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; saves = partial_ NRMSE_saves-losses(k);</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; cum_ NRMSE_saves = cum_ NRMSE_saves+saves;</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; <bold>
end
</bold></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; expected_ NRMSE_saves=cum_ NRMSE_saves/z;</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; p(i,1)=demand(k);</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; p(i,2)=expected_ NRMSE_saves;</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; <bold>
end
</bold></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0; plot (p( :,1),p( :, 2),'+',p( :, 1),p( :, 2),'o'), xlabel (&#x2018;time intervals during one day), ylabel (&#x2018;Amount of demand&#x2019;)</p>
<p><bold><italic>Input:</italic></bold> <inline-formula>
<mml:math id="M5">
<mml:mi mathvariant="normal">iter</mml:mi>
</mml:math>
</inline-formula>, number of evolution epochs, <inline-formula>
<mml:math id="M6">
<mml:mi mathvariant="bold-italic">n</mml:mi>
<mml:mi mathvariant="bold-italic">P</mml:mi>
</mml:math>
</inline-formula> is the number of odds in the population, <inline-formula>
<mml:math id="M7">
<mml:msup>
<mml:mi mathvariant="bold-italic">b</mml:mi>
<mml:mi mathvariant="bold-italic">h</mml:mi>
</mml:msup>
</mml:math>
</inline-formula> represent the bits of invisible neurons, while <inline-formula>
<mml:math id="M8">
<mml:mi mathvariant="bold-italic">n</mml:mi>
<mml:msub>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mtext>max</mml:mtext>
</mml:msub>
</mml:math>
</inline-formula> and <inline-formula>
<mml:math id="M9">
<mml:mi mathvariant="bold-italic">n</mml:mi>
<mml:msub>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mtext>min</mml:mtext>
</mml:msub>
</mml:math>
</inline-formula> is the allowable limit of them.</p><p><bold><italic>Input</italic></bold>: <inline-formula>
<mml:math id="M10">
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi mathvariant="italic">odds</mml:mi>
</mml:msub>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math id="M11">
<mml:msup>
<mml:mfenced open="{" close="}">
<mml:mfenced open="(" close=")" separators=",">
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mfenced>
</mml:mfenced>
<mml:mtable columnalign="center">
<mml:mtr columnalign="center">
<mml:mtd columnalign="center">
<mml:mi>n</mml:mi>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="center">
<mml:mtd columnalign="center">
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:mi>&#x03B8;</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>L</mml:mi>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mfenced open="{" close="}">
<mml:mfenced open="(" close=")">
<mml:msub>
<mml:mi>&#x03C3;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mfenced>
</mml:mfenced>
<mml:mtable columnalign="center">
<mml:mtr columnalign="center">
<mml:mtd columnalign="center">
<mml:mi>n</mml:mi>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="center">
<mml:mtd columnalign="center">
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="italic">Mode</mml:mi>
</mml:math>
</inline-formula> //<italic>where</italic> <inline-formula>
<mml:math id="M12">
<mml:mi>&#x03B8;</mml:mi>
</mml:math>
</inline-formula> <italic>is accuracy,</italic> <inline-formula>
<mml:math id="M13">
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi mathvariant="italic">odds</mml:mi>
</mml:msub>
</mml:math>
</inline-formula> <italic>is total amount of datasets trained</italic> <inline-formula>
<mml:math id="M14">
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi mathvariant="bold-italic">t</mml:mi>
<mml:mi mathvariant="bold-italic">r</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;// <bold><italic>L</italic></bold> the length of cluster radius difference among fueled data by e-commerce applications</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; <italic>and random Mode center</italic></p>
<p><italic>Number of learning rounds <bold>T</bold>;</italic></p>
<p><inline-formula>
<mml:math id="M15">
<mml:msub>
<mml:mi>m</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mi>G</mml:mi>
<mml:mi mathvariant="italic">best</mml:mi>
</mml:msub>
</mml:math>
</inline-formula>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;// <italic>hyperparameter values</italic></p>
<p><inline-formula>
<mml:math id="M16">
<mml:mi mathvariant="bold-italic">D</mml:mi>
<mml:mo>=</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mfenced open="(" close=")" separators=",">
<mml:msub>
<mml:mi>m</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mfenced>
</mml:mfenced>
<mml:mo>&#x2200;</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:mn>3</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mi>N</mml:mi>
</mml:math>
</inline-formula> &#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;// <italic>the Total dataset tested</italic></p>
<p><inline-formula><mml:math id="M17">
<mml:mi mathvariant="italic">grad</mml:mi>
<mml:mo>&#x2190;</mml:mo>
<mml:mi mathvariant="italic">CalculateGradient</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mfenced open="(" close=")" separators=",,">
<mml:mi>L</mml:mi>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi mathvariant="italic">odd</mml:mi>
</mml:msub>
<mml:mi>y</mml:mi>
</mml:mfenced>
<mml:mtext>;</mml:mtext>
</mml:math>
</inline-formula></p>
<p><inline-formula>
<mml:math id="M18">
<mml:mi>r</mml:mi>
<mml:mo>&#x2190;</mml:mo>
<mml:mi mathvariant="italic">Rand</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mfenced open="(" close=")" separators=",">
<mml:mn>1</mml:mn>
<mml:mi>s</mml:mi>
</mml:mfenced>
<mml:mtext>;</mml:mtext>
</mml:math>
</inline-formula></p>
<p><inline-formula><mml:math id="M19">
<mml:mi mathvariant="bold-italic">if</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">Mode</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi mathvariant="italic">Plain</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="bold-italic">then</mml:mi>
</mml:math>
</inline-formula></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;<inline-formula>
<mml:math id="M20">
<mml:mi>G</mml:mi>
<mml:mo>&#x2190;</mml:mo>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>g</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>r</mml:mi>
</mml:msub>
<mml:mspace width="0.25em"/>
<mml:mfenced open="(" close=")">
<mml:mi>i</mml:mi>
</mml:mfenced>
<mml:mspace width="0.25em"/>
<mml:mi>f</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1.</mml:mn>
<mml:mo>.</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mtext>;</mml:mtext>
</mml:math>
</inline-formula> //<inline-formula>
<mml:math id="M21">
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2208;</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mi mathvariant="bold-italic">S</mml:mi>
<mml:mi mathvariant="bold-italic">P</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula><italic>, is the set of <underline>selected parameters</underline> that control the hopeful process and</italic> <inline-formula>
<mml:math id="M22">
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mi mathvariant="bold-italic">S</mml:mi>
<mml:mi mathvariant="bold-italic">P</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula> <italic>is the set of&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;<underline>total significant parameters</underline>.</italic></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;<inline-formula>
<mml:math id="M23">
<mml:mi mathvariant="bold-italic">if</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">Mode</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi mathvariant="italic">Ordered</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="bold-italic">then</mml:mi>
</mml:math>
</inline-formula></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;<inline-formula>
<mml:math id="M24">
<mml:mi>G</mml:mi>
<mml:mo>&#x2190;</mml:mo>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>g</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>&#x03C3;</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mi>i</mml:mi>
</mml:mfenced>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mspace width="0.25em"/>
<mml:mfenced open="(" close=")">
<mml:mi>i</mml:mi>
</mml:mfenced>
<mml:mspace width="0.25em"/>
<mml:mi>f</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1.</mml:mn>
<mml:mo>.</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mtext>;</mml:mtext>
</mml:math>
</inline-formula>// <italic>back to tuning the hyper-parameters to precise the neurons</italic></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; <inline-formula>
<mml:math id="M25">
<mml:mi>T</mml:mi>
<mml:mo>&#x2190;</mml:mo>
<mml:mi mathvariant="italic">empty</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">tree</mml:mi>
<mml:mtext>;</mml:mtext>
</mml:math>
</inline-formula> <italic>// if</italic> <inline-formula>
<mml:math id="M26">
<mml:mi>n</mml:mi>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mtext>max</mml:mtext>
</mml:msub>
<mml:mo>&#x2260;</mml:mo>
<mml:mfenced open="|" close="|">
<mml:mrow>
<mml:mi mathvariant="bold-italic">S</mml:mi>
<mml:mi mathvariant="bold-italic">P</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>+</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo>&#x00D7;</mml:mo>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:msub>
</mml:math>
</inline-formula> <italic>, where</italic> <inline-formula>
<mml:math id="M27">
<mml:msup>
<mml:mi>n</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>h</mml:mi>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> <italic>is tree branches</italic></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; <inline-formula>
<mml:math id="M28">
<mml:mi mathvariant="bold-italic">foreach</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">step</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">of</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">top</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mi mathvariant="italic">down</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">procedure</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="bold-italic">do</mml:mi>
</mml:math>
</inline-formula></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; <inline-formula>
<mml:math id="M29">
<mml:mi mathvariant="bold-italic">foreach</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">candidate</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">split</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="bold-italic">do</mml:mi>
</mml:math>
</inline-formula></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; <inline-formula>
<mml:math id="M30">
<mml:msub>
<mml:mi mathvariant="bold-italic">T</mml:mi>
<mml:mi mathvariant="bold-italic">c</mml:mi>
</mml:msub>
<mml:mo>&#x2190;</mml:mo>
<mml:mi mathvariant="italic">add</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">split</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mi mathvariant="bold-italic">s</mml:mi>
<mml:mi mathvariant="bold-italic">p</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mspace width="0.25em"/>
<mml:mi>t</mml:mi>
<mml:mi>o</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="bold-italic">T</mml:mi>
</mml:math>
</inline-formula>;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;<italic>// specific tree</italic></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;<inline-formula>
<mml:math id="M31">
<mml:mi mathvariant="bold-italic">Input</mml:mi>
<mml:mo>:</mml:mo>
<mml:mi>A</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">conditional</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi>R</mml:mi>
<mml:mi>F</mml:mi>
<mml:mo>:</mml:mo>
<mml:mi mathvariant="italic">tree</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="bold-italic">T</mml:mi>
</mml:math>
</inline-formula></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;<bold><italic>end;</italic></bold></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;<bold><italic>end;</italic></bold></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;<inline-formula>
<mml:math id="M32">
<mml:mi mathvariant="bold-italic">elseIf</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi>T</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">only</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">contains</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi>a</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">single</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">branch</mml:mi>
<mml:mspace width="0.25em"/>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mi>h</mml:mi>
</mml:msub>
<mml:mtext>;</mml:mtext>
</mml:math>
</inline-formula></p>
<p><bold><italic>Set</italic></bold> <inline-formula>
<mml:math id="M33">
<mml:msub>
<mml:mi>G</mml:mi>
<mml:mi mathvariant="italic">best</mml:mi>
</mml:msub>
</mml:math>
</inline-formula>as all tested parameters;</p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;<bold><italic>end;</italic></bold></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;<inline-formula><mml:math id="M34">
<mml:mi mathvariant="bold-italic">elseif</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">Mode</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi mathvariant="italic">Plain</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="bold-italic">then</mml:mi>
</mml:math></inline-formula>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;<italic>// pick image X and analysis it</italic></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;<inline-formula>
<mml:math id="M35">
<mml:mi>&#x0394;</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mi>i</mml:mi>
</mml:mfenced>
<mml:mo>&#x2190;</mml:mo>
<mml:mi mathvariant="bold-italic">a</mml:mi>
<mml:mi mathvariant="bold-italic">v</mml:mi>
<mml:mi mathvariant="bold-italic">g</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>g</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>r</mml:mi>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mi>k</mml:mi>
</mml:mfenced>
<mml:mi mathvariant="bold-italic">f</mml:mi>
<mml:mi mathvariant="bold-italic">o</mml:mi>
<mml:mi mathvariant="bold-italic">r</mml:mi>
</mml:math>
</inline-formula></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;<inline-formula>
<mml:math id="M36">
<mml:mi mathvariant="bold-italic">k</mml:mi>
<mml:mo>:</mml:mo>
<mml:mi mathvariant="italic">lea</mml:mi>
<mml:msub>
<mml:mi>f</mml:mi>
<mml:mi>r</mml:mi>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mi mathvariant="bold-italic">k</mml:mi>
</mml:mfenced>
<mml:mo>=</mml:mo>
<mml:mi mathvariant="italic">lea</mml:mi>
<mml:msub>
<mml:mi>f</mml:mi>
<mml:mi>r</mml:mi>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mi mathvariant="bold-italic">i</mml:mi>
</mml:mfenced>
<mml:mtext>;</mml:mtext>
</mml:math>
</inline-formula>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;<italic>// image of leaf is data of disease shape and area</italic></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;<inline-formula>
<mml:math id="M37">
<mml:mi mathvariant="bold-italic">elseif</mml:mi>
<mml:mspace width="0.25em"/>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>v</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mfenced open="[" close="]">
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mi>m</mml:mi>
</mml:mfenced>
<mml:mo>+</mml:mo>
<mml:mi>S</mml:mi>
<mml:msub>
<mml:mi>K</mml:mi>
<mml:mi>v</mml:mi>
</mml:msub>
<mml:mo>&#x00D7;</mml:mo>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2217;</mml:mo>
<mml:msup>
<mml:mi>k</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfenced>
<mml:mo>%</mml:mo>
<mml:mi>n</mml:mi>
</mml:math>
</inline-formula></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;<inline-formula>
<mml:math id="M38">
<mml:mi>p</mml:mi>
<mml:mo>:</mml:mo>
<mml:mi mathvariant="italic">lea</mml:mi>
<mml:msub>
<mml:mi>f</mml:mi>
<mml:mi>r</mml:mi>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mi>p</mml:mi>
</mml:mfenced>
<mml:mo>=</mml:mo>
<mml:mi mathvariant="italic">lea</mml:mi>
<mml:msub>
<mml:mi>f</mml:mi>
<mml:mi>r</mml:mi>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mi>i</mml:mi>
</mml:mfenced>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>&#x03C3;</mml:mi>
<mml:mi>r</mml:mi>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mi>p</mml:mi>
</mml:mfenced>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mi>&#x03C3;</mml:mi>
<mml:mi>r</mml:mi>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mi>i</mml:mi>
</mml:mfenced>
</mml:math>
</inline-formula></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;<inline-formula>
<mml:math id="M39">
<mml:mi mathvariant="bold-italic">loss</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mfenced open="(" close=")">
<mml:msub>
<mml:mi mathvariant="bold-italic">T</mml:mi>
<mml:mi mathvariant="bold-italic">c</mml:mi>
</mml:msub>
</mml:mfenced>
<mml:mo>&#x2190;</mml:mo>
<mml:mo>cos</mml:mo>
<mml:mfenced open="(" close=")" separators=",">
<mml:mi mathvariant="normal">&#x0394;</mml:mi>
<mml:mi mathvariant="bold-italic">G</mml:mi>
</mml:mfenced>
</mml:math>
</inline-formula></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;<inline-formula>
<mml:math id="M40">
<mml:mi>X</mml:mi>
<mml:mo>=</mml:mo>
<mml:mfenced open="[" close="]">
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mi>m</mml:mi>
</mml:mfenced>
<mml:mo>&#x2217;</mml:mo>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mi>v</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2217;</mml:mo>
<mml:mi>G</mml:mi>
<mml:mfenced open="(" close=")" separators=",">
<mml:mi>x</mml:mi>
<mml:mi>y</mml:mi>
</mml:mfenced>
<mml:mo>+</mml:mo>
<mml:mi>r</mml:mi>
<mml:mo>&#x2217;</mml:mo>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mi>v</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2217;</mml:mo>
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mi>K</mml:mi>
<mml:mi>v</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>%</mml:mo>
<mml:mi>n</mml:mi>
</mml:math>
</inline-formula></p>
<p><inline-formula>
<mml:math id="M41">
<mml:mi mathvariant="bold-italic">T</mml:mi>
<mml:mo>&#x2190;</mml:mo>
<mml:mi mathvariant="bold-italic">arg</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="bold-italic">m</mml:mi>
<mml:mi mathvariant="bold-italic">i</mml:mi>
<mml:msub>
<mml:mi mathvariant="bold-italic">n</mml:mi>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>C</mml:mi>
</mml:msub>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi mathvariant="bold-italic">loss</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mfenced open="(" close=")">
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;<inline-formula>
<mml:math id="M42">
<mml:mi mathvariant="bold-italic">f</mml:mi>
<mml:mi mathvariant="bold-italic">o</mml:mi>
<mml:mi mathvariant="bold-italic">r</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1.</mml:mn>
<mml:mo>.</mml:mo>
<mml:mi>n</mml:mi>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mtext>min</mml:mtext>
</mml:msub>
<mml:mtext>;</mml:mtext>
</mml:math>
</inline-formula></p>
<p><inline-formula>
<mml:math id="M43">
<mml:mi mathvariant="bold-italic">output</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">itemset</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="bold-italic">Y</mml:mi>
<mml:mo>&#x222A;</mml:mo>
<mml:mi mathvariant="bold-italic">T</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="italic">base</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">with</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">count</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi mathvariant="italic">smallest</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">count</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">of</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">nodes</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">in</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi>Y</mml:mi>
<mml:mtext>;</mml:mtext>
</mml:math>
</inline-formula></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;<inline-formula>
<mml:math id="M44">
<mml:mi mathvariant="bold-italic">else</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="bold-italic">foreach</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="bold-italic">i</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">in</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="bold-italic">T</mml:mi>
<mml:mo>.</mml:mo>
<mml:mi mathvariant="italic">header</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">do</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="bold-italic">begin</mml:mi>
</mml:math>
</inline-formula></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;<inline-formula>
<mml:math id="M45">
<mml:mi mathvariant="italic">Output</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="bold-italic">Y</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>T</mml:mi>
<mml:mo>.</mml:mo>
<mml:mi mathvariant="italic">base</mml:mi>
<mml:mo>&#x222A;</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mi>i</mml:mi>
</mml:mfenced>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">with</mml:mi>
<mml:mspace width="0.25em"/>
<mml:mi>i</mml:mi>
<mml:mo>.</mml:mo>
<mml:mi mathvariant="italic">count</mml:mi>
<mml:mtext>;</mml:mtext>
</mml:math>
</inline-formula></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; <bold><italic>end;</italic></bold></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; <bold><italic>end;</italic></bold></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; <bold><italic>end;</italic></bold></p>
<p>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0; <bold><italic>end;</italic></bold>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;# Save the trained model to a file model.save_model(&#x2018;trained_model.cbm&#x2019;)</p>
<list list-type="simple">
<list-item>
<p>b. Assess each dingo&#x2019;s level of fitness within the community.</p>
</list-item>
<list-item>
<p>c. If a dingo is more fit than the current world best, update the global best location and fitness.</p>
</list-item>
</list>
<list list-type="simple">
<list-item>
<p>5. <bold><italic>Return</italic></bold> the global best location and fitness as the solution.</p>
</list-item>
</list>
<sec id="sec12">
<label>4.1.1</label>
<title>The mathematical model of proposed technique</title>
<p>The solution plan consists of five steps discussed that are implemented and programmed via four sequential strategies.</p>
<p><underline>Strategy#1: Attack sound plan:</underline> The Dingoes can modify their communication during agreeing through this strategy to construct a unique tree of choices working on categories boosting called (CatBoost), which is a member of the gradient booster algorithm family works on the dataset in the specific database, as discussed in <xref ref-type="disp-formula" rid="EQ3">equations 3</xref>&#x2013;<xref ref-type="disp-formula" rid="EQ5">5</xref> (i.e., e-commerce; <inline-formula>
<mml:math id="M46">
<mml:mi>E</mml:mi>
<mml:mspace width="0.25em"/>
<mml:msub>
<mml:mfenced open="{" close="}">
<mml:mfenced open="(" close=")" separators=",">
<mml:msub>
<mml:mi>&#x03B4;</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mfenced>
</mml:mfenced>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x22EF;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mspace width="0.25em"/>
<mml:mi mathvariant="italic">and</mml:mi>
<mml:mspace width="0.25em"/>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>R</mml:mi>
</mml:math>
</inline-formula>). This step hybridizes the Dingo technique communication with CatBoost methods to tackle the data candidate in the dataset <inline-formula>
<mml:math id="M47">
<mml:mfenced open="(" close=")">
<mml:mi>E</mml:mi>
</mml:mfenced>
<mml:mtext>.</mml:mtext>
</mml:math>
</inline-formula></p>
<disp-formula id="EQ3">
<label>(3)</label>
<mml:math id="M48">
<mml:mover accent="true">
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mo>=</mml:mo>
<mml:mfenced open="|" close="|">
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mo>&#x22C5;</mml:mo>
<mml:mover accent="true">
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x22C5;</mml:mo>
<mml:mover accent="true">
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>p</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mi>x</mml:mi>
</mml:mfenced>
<mml:mo>&#x2212;</mml:mo>
<mml:mover accent="true">
<mml:mi>P</mml:mi>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mi>i</mml:mi>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:math>
</disp-formula><disp-formula id="EQ4">
<label>(4)</label>
<mml:math id="M49">
<mml:mover accent="true">
<mml:mi>P</mml:mi>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
<mml:mo>=</mml:mo>
<mml:mfenced open="|" close="|">
<mml:mrow>
<mml:mover accent="true">
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>p</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mi>i</mml:mi>
</mml:mfenced>
<mml:mo>&#x2212;</mml:mo>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mover accent="true">
<mml:mi>b</mml:mi>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mo>&#x22C5;</mml:mo>
<mml:mover accent="true">
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mo>&#x2212;</mml:mo>
<mml:mover accent="true">
<mml:mi>b</mml:mi>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mfenced>
<mml:mi mathvariant="normal">&#x0394;</mml:mi>
<mml:mover accent="true">
<mml:mi>D</mml:mi>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mi>d</mml:mi>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:math>
</disp-formula><disp-formula id="EQ5">
<label>(5)</label>
<mml:math id="M50">
<mml:mover accent="true">
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mi>&#x03B2;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo stretchy="true">&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:munderover>
<mml:mfrac>
<mml:mfenced open="[" close="]">
<mml:mrow>
<mml:mover accent="true">
<mml:msub>
<mml:mi>&#x03C6;</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mi>t</mml:mi>
</mml:mfenced>
<mml:mo>&#x2212;</mml:mo>
<mml:mover accent="true">
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mi>t</mml:mi>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mfrac>
<mml:mo>&#x2212;</mml:mo>
<mml:mover accent="true">
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mo>&#x2217;</mml:mo>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mi>t</mml:mi>
</mml:mfenced>
</mml:math>
</disp-formula>
<p>The main concept is to construct an ensemble of weak forecast choice trees to generate an efficient model, where the learning stage is focused on training a fitness function <inline-formula>
<mml:math id="M51">
<mml:msup>
<mml:mi>F</mml:mi>
<mml:mi>t</mml:mi>
</mml:msup>
<mml:mo>:</mml:mo>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:mi>m</mml:mi>
</mml:msup>
<mml:mo>&#x2192;</mml:mo>
<mml:mi>R</mml:mi>
</mml:math>
</inline-formula> to minimize the losses <inline-formula>
<mml:math id="M52">
<mml:mi>L</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mi>F</mml:mi>
</mml:mfenced>
<mml:mo>:</mml:mo>
<mml:mo>=</mml:mo>
<mml:mi mathvariant="italic">EL</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>y</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>F</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mi>&#x03B4;</mml:mi>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula> for a specific dataset <inline-formula>
<mml:math id="M53">
<mml:mfenced open="(" close=")">
<mml:mi>E</mml:mi>
</mml:mfenced>
</mml:math>
</inline-formula>.</p>
<p><underline>Strategy #2: The gradient step:</underline> The gradient step called <inline-formula>
<mml:math id="M54">
<mml:msup>
<mml:mi>h</mml:mi>
<mml:mi>t</mml:mi>
</mml:msup>
</mml:math>
</inline-formula> expressed in <xref ref-type="disp-formula" rid="EQ15">equation 6</xref> is selected as <inline-formula>
<mml:math id="M55">
<mml:msup>
<mml:mi>h</mml:mi>
<mml:mi>t</mml:mi>
</mml:msup>
<mml:mfenced open="(" close=")">
<mml:mi>x</mml:mi>
</mml:mfenced>
</mml:math>
</inline-formula> estimates to <inline-formula>
<mml:math id="M56">
<mml:mfrac>
<mml:mrow>
<mml:mo>&#x2202;</mml:mo>
<mml:mi>L</mml:mi>
<mml:mfenced open="(" close=")" separators=",">
<mml:mi>y</mml:mi>
<mml:mi>s</mml:mi>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2202;</mml:mo>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:mfrac>
<mml:mo stretchy="true">|</mml:mo>
<mml:msub>
<mml:mtext>&#x00A0;</mml:mtext>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>=</mml:mo>
<mml:msup>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msup>
<mml:mfenced open="(" close=")">
<mml:mi>&#x03B4;</mml:mi>
</mml:mfenced>
<mml:mtext>.</mml:mtext>
</mml:mrow>
</mml:msub>
</mml:math>
</inline-formula></p>
<disp-formula id="EQ15">
<label>(6)</label>
<mml:math id="M57">
<mml:msup>
<mml:mi>h</mml:mi>
<mml:mi>t</mml:mi>
</mml:msup>
<mml:mo>=</mml:mo>
<mml:munder>
<mml:mrow>
<mml:mo>arg</mml:mo>
<mml:mo>min</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>H</mml:mi>
</mml:mrow>
</mml:munder>
<mml:mi mathvariant="italic">EL</mml:mi>
<mml:msup>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mo>&#x2202;</mml:mo>
<mml:mi>L</mml:mi>
<mml:mfenced open="(" close=")" separators=",">
<mml:mi>y</mml:mi>
<mml:mi>s</mml:mi>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2202;</mml:mo>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:mfrac>
<mml:mo stretchy="true">|</mml:mo>
<mml:msub>
<mml:mtext>&#x00A0;</mml:mtext>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>=</mml:mo>
<mml:msup>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msup>
<mml:mfenced open="(" close=")">
<mml:mi>&#x03B4;</mml:mi>
</mml:mfenced>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>h</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mi>&#x03B4;</mml:mi>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:math>
</disp-formula>
<p><underline>Strategy #3: Persecution Sound plan:</underline> The strategy of hunting after surrounding the prey via a sketch of two intersection regions is based on harmony between the alpha <inline-formula>
<mml:math id="M58">
<mml:mfenced open="(" close=")">
<mml:mi>&#x03B1;</mml:mi>
</mml:mfenced>
</mml:math>
</inline-formula>and beta <inline-formula>
<mml:math id="M59">
<mml:mfenced open="(" close=")">
<mml:mi>&#x03B2;</mml:mi>
</mml:mfenced>
</mml:math>
</inline-formula>in the Dingo pack. This behavior can be formulated as expressed in <xref ref-type="disp-formula" rid="EQ16">equations 7.1</xref>&#x2013;<xref ref-type="disp-formula" rid="EQ7">7.3</xref>, <xref ref-type="disp-formula" rid="EQ8">8</xref>:</p>
<disp-formula id="EQ16">
<label>(7.1)</label>
<mml:math id="M60">
<mml:mover accent="true">
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>&#x03B1;</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mo>=</mml:mo>
<mml:mfenced open="|" close="|">
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>A</mml:mi>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#x22C5;</mml:mo>
<mml:mover accent="true">
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>&#x03B1;</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mi>x</mml:mi>
</mml:mfenced>
<mml:mo>&#x2212;</mml:mo>
<mml:mfenced open="|" close="|">
<mml:mrow>
<mml:mover accent="true">
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>&#x03B1;</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mo>&#x2212;</mml:mo>
<mml:mover accent="true">
<mml:mi>B</mml:mi>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mo>&#x22C5;</mml:mo>
<mml:mover accent="true">
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>&#x03B1;</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:math>
</disp-formula><disp-formula id="EQ6">
<label>(7.2)</label>
<mml:math id="M61">
<mml:mover accent="true">
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>&#x03B2;</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mo>=</mml:mo>
<mml:mfenced open="|" close="|">
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>A</mml:mi>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x22C5;</mml:mo>
<mml:mover accent="true">
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>&#x03B2;</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mi>x</mml:mi>
</mml:mfenced>
<mml:mo>&#x2212;</mml:mo>
<mml:mfenced open="|" close="|">
<mml:mrow>
<mml:mover accent="true">
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>&#x03B2;</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mo>&#x2212;</mml:mo>
<mml:mover accent="true">
<mml:mi>B</mml:mi>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mo>&#x22C5;</mml:mo>
<mml:mover accent="true">
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>&#x03B2;</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:math>
</disp-formula><disp-formula id="EQ7">
<label>(7.3)</label>
<mml:math id="M62">
<mml:mover accent="true">
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mo>=</mml:mo>
<mml:mfenced open="|" close="|">
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>A</mml:mi>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mn>3</mml:mn>
</mml:msub>
<mml:mo>&#x22C5;</mml:mo>
<mml:mover accent="true">
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mi>x</mml:mi>
</mml:mfenced>
<mml:mo>&#x2212;</mml:mo>
<mml:mfenced open="|" close="|">
<mml:mrow>
<mml:mover accent="true">
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mo>&#x2212;</mml:mo>
<mml:mover accent="true">
<mml:mi>B</mml:mi>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mo>&#x22C5;</mml:mo>
<mml:mover accent="true">
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:math>
</disp-formula><disp-formula id="EQ8">
<label>(8)</label>
<mml:math id="M63">
<mml:mover accent="true">
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
<mml:mo>=</mml:mo>
<mml:mover accent="true">
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mo>&#x2217;</mml:mo>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mi>t</mml:mi>
</mml:mfenced>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>&#x03B2;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#x2217;</mml:mo>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>&#x03B2;</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:msup>
<mml:mo>&#x2217;</mml:mo>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mover accent="true">
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mi>t</mml:mi>
</mml:mfenced>
<mml:mo>&#x2212;</mml:mo>
<mml:mover accent="true">
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mi>t</mml:mi>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
<mml:mspace width="0.5em"/>
<mml:mo>&#x2200;</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:mn>3</mml:mn>
</mml:math>
</disp-formula>
<p>The position must be updated, otherwise the hunting process is over. The value <inline-formula>
<mml:math id="M64">
<mml:mover accent="true">
<mml:mi>b</mml:mi>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
</mml:math>
</inline-formula> expressed in <xref ref-type="disp-formula" rid="EQ17">equation 9</xref> is linearly decreased with several iterations. The values <inline-formula>
<mml:math id="M65">
<mml:mover accent="true">
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>&#x03B1;</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
</mml:math>
</inline-formula> lie in the range <inline-formula>
<mml:math id="M66">
<mml:mfenced open="[" close="]">
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>3</mml:mn>
<mml:mi>b</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>3</mml:mn>
<mml:mi>b</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula>.</p>
<disp-formula id="EQ17">
<label>(9)</label>
<mml:math id="M67">
<mml:mover accent="true">
<mml:mi>b</mml:mi>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mo>=</mml:mo>
<mml:mn>3</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>I</mml:mi>
<mml:mo>&#x2217;</mml:mo>
<mml:mfenced open="(" close=")">
<mml:mfrac>
<mml:mn>3</mml:mn>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mtext>max</mml:mtext>
</mml:msub>
</mml:mfrac>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:math>
</disp-formula>
<p><underline>Strategy #4: Avoid the scavenge solution plan:</underline> This strategy works when a poor solution (i.e., easily accessible carrion) is encountered in the search path, which initially starts randomly and guides the Dingoes to choose the path that leads to survival <inline-formula>
<mml:math id="M68">
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula>, as represented in <xref ref-type="disp-formula" rid="EQ9">Eq. (10)</xref>, when facing difficulty finding a solution. It involves using the residuals from previous steps, and these pathways are continuously interconnected, as described in the pseudocode. The method prioritizes the better carrion and is based on the fitness function described in <xref ref-type="disp-formula" rid="EQ10">equations 11.1</xref>, <xref ref-type="disp-formula" rid="EQ11">11.2</xref>, which consider the movement and direction of the Dingoes to anticipate the best route for making optimal decisions.</p>
<disp-formula id="EQ9">
<label>(10)</label>
<mml:math id="M69">
<mml:mi>S</mml:mi>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mi>i</mml:mi>
</mml:mfenced>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi mathvariant="italic">fitnes</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mtext>max</mml:mtext>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mi mathvariant="italic">fitness</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mover accent="true">
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">fitnes</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mtext>max</mml:mtext>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mi mathvariant="italic">fitnes</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mtext>min</mml:mtext>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:math>
</disp-formula>
<disp-formula id="EQ10">
<label>(11.1)</label>
<mml:math id="M70">
<mml:mover accent="true">
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mi>t</mml:mi>
</mml:mfenced>
<mml:mo>=</mml:mo>
<mml:mover accent="true">
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mo>&#x2217;</mml:mo>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mi>t</mml:mi>
</mml:mfenced>
<mml:mo>+</mml:mo>
<mml:mn>0.5</mml:mn>
<mml:mfenced open="[" close="]">
<mml:mrow>
<mml:mover accent="true">
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mi>t</mml:mi>
</mml:mfenced>
<mml:mo>&#x2212;</mml:mo>
<mml:msup>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
<mml:mi>&#x03C3;</mml:mi>
</mml:msup>
<mml:mo>&#x2217;</mml:mo>
<mml:msub>
<mml:mover accent="true">
<mml:mi>P</mml:mi>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mi>t</mml:mi>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:math>
</disp-formula><disp-formula id="EQ11">
<label>(11.2)</label>
<mml:math id="M71">
<mml:mover accent="true">
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
<mml:mo>=</mml:mo>
<mml:mn>0.5</mml:mn>
<mml:mfenced open="[" close="]">
<mml:mrow>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>&#x03B2;</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:msup>
<mml:mo>&#x2217;</mml:mo>
<mml:mover accent="true">
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mi>t</mml:mi>
</mml:mfenced>
<mml:mo>&#x2212;</mml:mo>
<mml:msup>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
<mml:mi>&#x03C3;</mml:mi>
</mml:msup>
<mml:mo>&#x2217;</mml:mo>
<mml:msub>
<mml:mover accent="true">
<mml:mi>P</mml:mi>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mi>t</mml:mi>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:math>
</disp-formula>
<p>Because of this, the model&#x2019;s classification accuracy gradually improves over time paving the way to precise the prediction using CatBoost technique and employs CatBoost to reduce the losses and treat the imbalance in the dataset via controlling the loss function when it comes to binary classification, presenting the prediction formula as expressed in <xref ref-type="disp-formula" rid="EQ12">equation (12)</xref>:</p>
<disp-formula id="EQ12">
<label>(12)</label>
<mml:math id="M72">
<mml:msup>
<mml:msub>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="normal">y</mml:mi>
<mml:mspace width="1em"/>
</mml:mrow>
<mml:mo stretchy="true">^</mml:mo>
</mml:mover>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>&#x03B2;</mml:mi>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
</mml:msup>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mi>&#x03B2;</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>&#x03B2;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:msub>
<mml:mi>&#x03B4;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>&#x03B2;</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:msub>
<mml:mi>&#x03B4;</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:mo>&#x22EF;</mml:mo>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>&#x03B2;</mml:mi>
<mml:mi>P</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>&#x03B4;</mml:mi>
<mml:mi>P</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo stretchy="true">&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>N</mml:mi>
</mml:munderover>
<mml:msub>
<mml:mi>f</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:msubsup>
<mml:mfenced open="(" close=")">
<mml:msub>
<mml:mi>&#x03B4;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mfenced>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
</mml:math>
</disp-formula>
<p>where <inline-formula>
<mml:math id="M73">
<mml:msub>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="normal">y</mml:mi>
<mml:mspace width="1em"/>
</mml:mrow>
<mml:mo stretchy="true">^</mml:mo>
</mml:mover>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:math>
</inline-formula> is the predicted value of the significant classes discussed in this study such as age, sex, and time of order through the day, and each have many variables for identifying the product requirements, such as the amount of orders, date in Now(), expiration date, delivery place, delivery lead-time, <inline-formula>
<mml:math id="M74">
<mml:msub>
<mml:mi>&#x03B2;</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:math>
</inline-formula> are the intercepts, and <inline-formula>
<mml:math id="M75">
<mml:msub>
<mml:mi>&#x03B2;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:math>
</inline-formula> to <inline-formula>
<mml:math id="M76">
<mml:msub>
<mml:mi>&#x03B2;</mml:mi>
<mml:mi>p</mml:mi>
</mml:msub>
</mml:math>
</inline-formula> are the regression coefficients for the independent variables <inline-formula>
<mml:math id="M77">
<mml:msub>
<mml:mi>&#x03B4;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:math>
</inline-formula> to <inline-formula>
<mml:math id="M78">
<mml:msub>
<mml:mi>&#x03B4;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:math>
</inline-formula>. There are multiple input features in the code, so <inline-formula>
<mml:math id="M79">
<mml:mi>&#x03B4;</mml:mi>
<mml:mi>t</mml:mi>
</mml:math>
</inline-formula> is a vector of features at each time step <inline-formula>
<mml:math id="M80">
<mml:mfenced open="(" close=")">
<mml:mi>t</mml:mi>
</mml:mfenced>
<mml:mtext>.</mml:mtext>
</mml:math>
</inline-formula> The gradient step of movement for each predicted variable can expressed in <xref ref-type="disp-formula" rid="EQ13">equations 13.1</xref>, <xref ref-type="disp-formula" rid="EQ14">13.2</xref>.</p>
<disp-formula id="EQ13">
<label>(13.1)</label>
<mml:math id="M81">
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:msubsup>
<mml:mfenced open="(" close=")">
<mml:msub>
<mml:mi>&#x03B4;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mfenced>
<mml:mi>k</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msubsup>
<mml:mstyle displaystyle="true">
<mml:mo stretchy="true">&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:msubsup>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>k</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x22C5;</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msubsup>
<mml:mstyle displaystyle="true">
<mml:mo stretchy="true">&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:msubsup>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>k</mml:mi>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>k</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x22C5;</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:math>
</disp-formula><disp-formula id="EQ14">
<label>(13.2)</label>
<mml:math id="M82">
<mml:msub>
<mml:mi>f</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:msub>
<mml:mi>&#x03B4;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mfenced>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:msub>
<mml:mi>&#x03B4;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mfenced>
<mml:mo>+</mml:mo>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo stretchy="true">&#x2211;</mml:mo>
</mml:mstyle>
<mml:mi>T</mml:mi>
<mml:mi>X</mml:mi>
</mml:munderover>
<mml:mi>&#x03B7;</mml:mi>
<mml:mo>&#x22C5;</mml:mo>
<mml:msub>
<mml:mi>&#x03C9;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:msub>
<mml:mi>&#x03B4;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mfenced>
</mml:math>
</disp-formula>
<p>The inventory sector has a strong relation with demand risk estimation that the candidate&#x2019;s logistic regression to pick highly accurate expectations. Also affects inventory management where the costs are reduced when resorted to ML algorithms that hybridize by optimization such as Dingo, Genetic and Arithmetic algorithms with Random Forest as supervised learning and two kinds of neural networks whether artificial or recurrent that save from 15 to 35% of total costs (<xref ref-type="bibr" rid="ref71">Leung et al., 2014</xref>). The inventory has also a direct relation with the distribution sector, and the researchers prefer logistic regression, SNN, and DTs in managing this sector by using simulated annealing or the Dingo algorithm to optimize the results as discussed by <xref ref-type="bibr" rid="ref15">Attari et al. (2021)</xref>. The inventory also has a direct effect on supplier selection which must care green supply chain objective as discussed by <xref ref-type="bibr" rid="ref53">Hosseini (2007)</xref>, <xref ref-type="bibr" rid="ref117">Srivastava (2007)</xref>, <xref ref-type="bibr" rid="ref52">Holt and Gobadian (2009)</xref>, <xref ref-type="bibr" rid="ref84">Mudgal et al. (2009)</xref>, and <xref ref-type="bibr" rid="ref30">Dashore and Sohani (2013)</xref>, especially in discovering minimum route length (<xref ref-type="bibr" rid="ref7">Abed and Elattar, 2020</xref>; <xref ref-type="bibr" rid="ref5">Abed et al., 2024</xref>). The inventory field is the key Libra pomegranate balance and guarantees the success of SCM if supported by modern ML algorithms, such as DTs and SNN in supervised learning and Apriori or ANN in the case of unsupervised learning, while candidate TSVM as semi-supervised learning advice researchers to use CatBoost with Random Forest in ensemble learning. The challenge in SCM is to retreat in the amount of transport due to high expenses after the war of Ukraine and China exporting policies (container transportation cost). The SSCM meets SDG 9.5 (enhance research and upgrade industrial technologies), which encourages developing countries like Egypt via scientific research to overcome this challenge, where supporting domestic technology to be smart using highly accurate ML algorithms supported by AI techniques and respect industrial diversification, and value addition to commodities to meet SDG 9. b. Also, encourage activating IoT technologies to make the SCM more usable, reliable, and economical to meet SDG9.c.</p>
</sec>
<sec id="sec13">
<label>4.1.2</label>
<title>Digital Simulator controller results and discussion</title>
<p>Finding the estimated predicted market demand for various items rapidly is a difficult challenge. The SSCM improves the way IoT is handled by using ANN structures to pick the right data instantly and using CatBoost to get rid of instances that are not normal. It can take binary values as input. The fact that the artificial neural network&#x2019;s weights are really valued explains why the invisible integer neurons in <xref ref-type="fig" rid="fig10">Figure 10</xref> match so many different parameters, as discussed in <xref ref-type="table" rid="tab2">Table 2</xref>, to describe how the NN operates as discussed by <xref ref-type="bibr" rid="ref135">Xiao et al. (2014)</xref>. <xref ref-type="table" rid="tab3">Table 3</xref> displays the market demand functions for certain food items according to the age of clients. One popular method in ML for assessing a model&#x2019;s performance is 20&#x2013;80 cross-validation, where the picked data are divided into five equal sections (folds) and four folds (80%), to train the model and the remaining data for testing. These items need a precise forecast of market demand to avoid losses because their life cycles are short. We tested our proposed optimization method on 26 different types of regression algorithms and found that it worked best with the tree (hyper-parameter option) and the tree (optimizable tree) in 80% of the records.</p>
<fig position="float" id="fig10">
<label>Figure 10</label>
<caption>
<p>The fully DNN connected layer manages SCM [production, inventory, transportation, and procurement sectors] eight output neurons.</p>
</caption>
<graphic xlink:href="frsus-05-1388771-g010.tif"/>
</fig>
<table-wrap position="float" id="tab2">
<label>Table 2</label>
<caption>
<p>Variables of the neural network model manage SSCM.</p>
</caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left" valign="top">Parameters</th>
<th align="center" valign="top">Down</th>
<th align="center" valign="top">Up</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" valign="top"><inline-formula>
<mml:math id="M83">
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:math>
</inline-formula>: Neurons</td>
<td align="center" valign="top">8</td>
<td align="center" valign="top">32&#x2013;128</td>
</tr>
<tr>
<td align="left" valign="top"><inline-formula>
<mml:math id="M84">
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:math>
</inline-formula>: Learning rate</td>
<td align="center" valign="top">0.02</td>
<td align="center" valign="top">0.5</td>
</tr>
<tr>
<td align="left" valign="top"><inline-formula>
<mml:math id="M85">
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
</mml:math>
</inline-formula>: Training trial</td>
<td align="center" valign="top">1,000</td>
<td align="center" valign="top">32,000</td>
</tr>
<tr>
<td align="left" valign="top"><inline-formula>
<mml:math id="M86">
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mn>4</mml:mn>
</mml:msub>
</mml:math>
</inline-formula>: Momentum constant</td>
<td align="center" valign="top">0.12</td>
<td align="center" valign="top">0.98</td>
</tr>
<tr>
<td align="left" valign="top"><inline-formula>
<mml:math id="M87">
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mn>5</mml:mn>
</mml:msub>
</mml:math>
</inline-formula>: Nodes</td>
<td align="center" valign="top">150</td>
<td align="center" valign="top">300</td>
</tr>
<tr>
<td align="left" valign="top"><inline-formula>
<mml:math id="M88">
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mn>6</mml:mn>
</mml:msub>
</mml:math>
</inline-formula>: Training runs</td>
<td align="center" valign="top">4</td>
<td align="center" valign="top">24</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap position="float" id="tab3">
<label>Table 3</label>
<caption>
<p>The optimum forecasting parameter values according to age for four food products.</p>
</caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left" valign="top">Forecasting function</th>
<th align="center" valign="top">&#x003C; 8&#x2009;years</th>
<th align="center" valign="top">8&#x2009;&#x003C;&#x2009;age&#x2009;&#x003C;&#x2009;18</th>
<th align="center" valign="top">18&#x2009;&#x003C;&#x2009;age&#x2009;&#x003C;&#x2009;28</th>
<th align="center" valign="top">Age&#x2009;&#x003E;&#x2009;28</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" valign="middle">WeibulStdDist (4.18277, 47.46482) Item (1)</td>
<td align="center" valign="top">62.1&#x2013;67.9</td>
<td align="center" valign="top">47.4&#x2013;56.2</td>
<td align="center" valign="top">51.96&#x2013;55.8</td>
<td align="center" valign="top">47.4&#x2013;49.8</td>
</tr>
<tr>
<td align="left" valign="middle">LogNormStdDist (3.00067, 0.262739) Item (2)</td>
<td align="center" valign="middle">64.1&#x2013;80.6</td>
<td align="center" valign="middle">44.9&#x2013;51.7</td>
<td align="center" valign="middle">51.43&#x2013;71.4</td>
<td align="center" valign="middle">43.35&#x2013;49.1</td>
</tr>
<tr>
<td align="left" valign="top">NormDist (28.21584,6.566503) Item (3)</td>
<td align="center" valign="top">25.7&#x2013;37.3</td>
<td align="center" valign="top">29.05&#x2013;31.02</td>
<td align="center" valign="top">27.37&#x2013;29.6</td>
<td align="center" valign="top">26.05&#x2013;26.2</td>
</tr>
<tr>
<td align="left" valign="middle">ExponDist (0.669802) Item (4)</td>
<td align="center" valign="top">0.71&#x2013;0.804</td>
<td align="center" valign="top">0.66&#x2013;0.71</td>
<td align="center" valign="top">0.601&#x2013;0.731</td>
<td align="center" valign="top">0.608&#x2013;0.609.6</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Age and sex are the two most important factors that affect how well demand forecasting works and how much it depends on the SSCM response to cut down on losses, as shown in <xref ref-type="fig" rid="fig11">Figure 11</xref>. Therefore, a quick response is important to meet the demand for using ML algorithms called CatBoost, which are enhanced by an optimization method called Dingo in decision-making. The normalized mean absolute error (NMAE) expressed in <xref ref-type="disp-formula" rid="EQ18">equation 14</xref> and the normalized root mean square error (NRMSE) expressed in <xref ref-type="disp-formula" rid="EQ19">equation 15</xref> are the assessment metrics used in this study for demand prediction because they are imbalanced. Of these, NMAE uses the average error as the assessment criterion, whereas NRMSE computes the square of the error to amplify the larger wrong share. The two assessment indicators were computed using the following methods:</p>
<disp-formula id="EQ18">
<label>(14)</label>
<mml:math id="M89">
<mml:mi mathvariant="italic">NMAE</mml:mi>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn mathvariant="bold">1</mml:mn>
<mml:mi>n</mml:mi>
</mml:mfrac>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo stretchy="true">&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn mathvariant="bold">1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:mo stretchy="true">|</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo stretchy="true">^</mml:mo>
</mml:mover>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mi mathvariant="italic">Cap</mml:mi>
</mml:mfrac>
<mml:mo stretchy="true">|</mml:mo>
</mml:math>
</disp-formula>
<disp-formula id="EQ19">
<label>(15)</label>
<mml:math id="M90">
<mml:mi mathvariant="italic">NEMSE</mml:mi>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn mathvariant="bold">1</mml:mn>
<mml:mi>n</mml:mi>
</mml:mfrac>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo stretchy="true">&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn mathvariant="bold">1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:msup>
<mml:mfenced open="(" close=")">
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo stretchy="true">^</mml:mo>
</mml:mover>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mi mathvariant="italic">Cap</mml:mi>
</mml:mfrac>
</mml:mfenced>
<mml:mn mathvariant="bold">2</mml:mn>
</mml:msup>
</mml:math>
</disp-formula>
<p>where <inline-formula>
<mml:math id="M91">
<mml:msub>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="normal">y</mml:mi>
<mml:mspace width="1em"/>
</mml:mrow>
<mml:mo stretchy="true">^</mml:mo>
</mml:mover>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:math>
</inline-formula>is the observed value, <inline-formula>
<mml:math id="M92">
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:math>
</inline-formula> is the forecasted value, &#x1D436;&#x1D44E;&#x1D45D; is the inventory capacity of the related production line, and <inline-formula>
<mml:math id="M93">
<mml:mi>n</mml:mi>
</mml:math>
</inline-formula> is the number of sampling points. <xref ref-type="table" rid="tab4">Table 4</xref> highlights the superiority of the improved CatBoost algorithm by Dingo optimization as the training time is in line with the acceleration of data given by input sources. A response time of less than 1.6&#x2009;s (NRMSE 0.12387) demonstrates that classification is completed promptly to satisfy genuine market expectations.</p>
<fig position="float" id="fig11">
<label>Figure 11</label>
<caption>
<p>Demand forecasting significant parameters.</p>
</caption>
<graphic xlink:href="frsus-05-1388771-g011.tif"/>
</fig>
<table-wrap position="float" id="tab4">
<label>Table 4</label>
<caption>
<p>Comparison between the best two hybridized algorithms CatBoost technique and Dingo optimization for four datasets (<xref ref-type="bibr" rid="ref119">Sun and Tian, 2023</xref>).</p>
</caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left" valign="top" rowspan="3">Sensitive measure</th>
<th align="center" valign="top" colspan="4">CatBoost algorithm&#x2009;+&#x2009;DO Optimization</th>
</tr>
<tr>
<th align="center" valign="top" colspan="2">Tree (optimizable Tree)</th>
<th align="center" valign="top" colspan="2">Tree (Hyper-parameters option)</th>
</tr>
<tr>
<th align="center" valign="top">Training results</th>
<th align="center" valign="top">Test results</th>
<th align="center" valign="top">Training results</th>
<th align="center" valign="top">Test results</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" valign="top">NRMSE (Validation)</td>
<td align="center" valign="top">
<bold>0.12387</bold>
</td>
<td align="center" valign="top">0.21257</td>
<td align="center" valign="top">
<bold>0.12387</bold>
</td>
<td align="center" valign="top">0.21257</td>
</tr>
<tr>
<td align="left" valign="top">Time of training (sec)</td>
<td align="center" valign="top">
<bold>1.4327</bold>
</td>
<td align="center" valign="top">&#x2013;</td>
<td align="center" valign="top">
<bold>27.35</bold>
</td>
<td align="center" valign="top">&#x2013;</td>
</tr>
<tr>
<td align="left" valign="top">NMSE (Validation)</td>
<td align="center" valign="top">0.023781</td>
<td align="center" valign="top">0.05</td>
<td align="center" valign="top">0.023781</td>
<td align="center" valign="top">0.05</td>
</tr>
<tr>
<td align="left" valign="top">NMAE (Endorsement)</td>
<td align="center" valign="top">0.023781</td>
<td align="center" valign="top">0.05</td>
<td align="center" valign="top">0.023781</td>
<td align="center" valign="top">0.05</td>
</tr>
<tr>
<td align="left" valign="top">R-Squared (Endorsement)</td>
<td align="center" valign="top">0.96</td>
<td align="center" valign="top">0.95</td>
<td align="center" valign="top">0.96</td>
<td align="center" valign="top">0.95</td>
</tr>
<tr>
<td align="left" valign="top">Forecasting speed (obsr./sec)</td>
<td align="center" valign="top"><sup>
<bold>&#x02F7;</bold>
</sup><bold>7,100</bold>
</td>
<td align="center" valign="top">&#x2013;</td>
<td align="center" valign="top"><sup>&#x02F7;</sup>3,900</td>
<td align="center" valign="top">&#x2013;</td>
</tr>
</tbody>
</table>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="center" valign="top" colspan="7">Tree (Hyper-parameters option) for Cat-DO that verified with most four datasets Jupyter Notebook</th>
</tr>
<tr>
<th/>
<th align="center" valign="top">Cat-DO</th>
<th align="center" valign="top">LSTM-BO-CatBoost</th>
<th align="center" valign="top">LSTM-CatBoost</th>
<th align="center" valign="top">LSTM-XGBoost</th>
<th align="center" valign="top">LSTM</th>
<th align="center" valign="top">RNN</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" valign="top" colspan="7">
<bold>&#x201C;ATVI&#x201D;</bold>
</td>
</tr>
<tr>
<td align="left" valign="top">NMSE (Validation)</td>
<td align="center" valign="top">
<bold>1.2387</bold>
</td>
<td align="center" valign="top">2.61</td>
<td align="center" valign="top">2.95</td>
<td align="center" valign="top">2.93</td>
<td align="center" valign="top">8.61</td>
<td align="center" valign="top">14.29</td>
</tr>
<tr>
<td align="left" valign="top">NMAE (Endorsement)</td>
<td align="center" valign="top">
<bold>1.01</bold>
</td>
<td align="center" valign="top">1.01</td>
<td align="center" valign="top">1.10</td>
<td align="center" valign="top">1.12</td>
<td align="center" valign="top">2.62</td>
<td align="center" valign="top">3.55</td>
</tr>
<tr>
<td align="left" valign="top">Accuracy</td>
<td align="center" valign="top">
<bold>0.87613</bold>
</td>
<td align="center" valign="top">0.48</td>
<td align="center" valign="top">0.48</td>
<td align="center" valign="top">0.49</td>
<td align="center" valign="top">0.47</td>
<td align="center" valign="top">0.47</td>
</tr>
<tr>
<td align="left" valign="top" colspan="7">
<bold>&#x201C;BAC&#x201D;</bold>
</td>
</tr>
<tr>
<td align="left" valign="top">NMSE (Validation)</td>
<td align="center" valign="top">
<bold>0.12387</bold>
</td>
<td align="center" valign="top">0.49</td>
<td align="center" valign="top">0.54</td>
<td align="center" valign="top">0.67</td>
<td align="center" valign="top">0.50</td>
<td align="center" valign="top">0.49</td>
</tr>
<tr>
<td align="left" valign="top">NMAE (Endorsement)</td>
<td align="center" valign="top">
<bold>0.54</bold>
</td>
<td align="center" valign="top">0.54</td>
<td align="center" valign="top">0.57</td>
<td align="center" valign="top">0.64</td>
<td align="center" valign="top">0.55</td>
<td align="center" valign="top">0.54</td>
</tr>
<tr>
<td align="left" valign="top">Accuracy</td>
<td align="center" valign="top">
<bold>0.87613</bold>
</td>
<td align="center" valign="top">0.50</td>
<td align="center" valign="top">0.51</td>
<td align="center" valign="top">0.54</td>
<td align="center" valign="top">0.50</td>
<td align="center" valign="top">0.48</td>
</tr>
<tr>
<td align="left" valign="top" colspan="7">
<bold>&#x201C;KO&#x201D;</bold>
</td>
</tr>
<tr>
<td align="left" valign="top">NMSE (Validation)</td>
<td align="center" valign="top">
<bold>0.12387</bold>
</td>
<td align="center" valign="top">0.50</td>
<td align="center" valign="top">0.66</td>
<td align="center" valign="top">0.74</td>
<td align="center" valign="top">0.52</td>
<td align="center" valign="top">0.50</td>
</tr>
<tr>
<td align="left" valign="top">NMAE (Endorsement)</td>
<td align="center" valign="top">
<bold>0.44</bold>
</td>
<td align="center" valign="top">0.51</td>
<td align="center" valign="top">0.59</td>
<td align="center" valign="top">0.63</td>
<td align="center" valign="top">0.55</td>
<td align="center" valign="top">0.54</td>
</tr>
<tr>
<td align="left" valign="top">Accuracy</td>
<td align="center" valign="top">
<bold>0.87613</bold>
</td>
<td align="center" valign="top">0.53</td>
<td align="center" valign="top">0.53</td>
<td align="center" valign="top">0.52</td>
<td align="center" valign="top">0.46</td>
<td align="center" valign="top">0.44</td>
</tr>
<tr>
<td align="left" valign="top" colspan="7">
<bold>&#x201C;F&#x201D;</bold>
</td>
</tr>
<tr>
<td align="left" valign="top">NMSE (Validation)</td>
<td align="center" valign="top">
<bold>0.12387</bold>
</td>
<td align="center" valign="top">0.25</td>
<td align="center" valign="top">0.28</td>
<td align="center" valign="top">0.28</td>
<td align="center" valign="top">0.33</td>
<td align="center" valign="top">0.40</td>
</tr>
<tr>
<td align="left" valign="top">NMAE (Endorsement)</td>
<td align="center" valign="top">
<bold>0.34</bold>
</td>
<td align="center" valign="top">0.37</td>
<td align="center" valign="top">0.38</td>
<td align="center" valign="top">0.40</td>
<td align="center" valign="top">0.46</td>
<td align="center" valign="top">0.53</td>
</tr>
<tr>
<td align="left" valign="top">Accuracy</td>
<td align="center" valign="top">
<bold>0.87613</bold>
</td>
<td align="center" valign="top">0.51</td>
<td align="center" valign="top">0.50</td>
<td align="center" valign="top">0.51</td>
<td align="center" valign="top">0.50</td>
<td align="center" valign="top">0.50</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p>Bold values means the best values in each row.</p>
</table-wrap-foot>
</table-wrap>
<p>To improve data classification via optimized feature selection for a deep neural network (DNN) classifier and prevent the premature convergence problem&#x2014;which is the foundation of forecasting&#x2014;as well as resist stagnation in local optimal conditions, this study proposes a novel version of the CatBoost algorithm based on the Dingo Optimization Algorithm (DOA). <xref ref-type="fig" rid="fig12">Figure 12A</xref> illustrates the coverage ratio according to a number of nodes in the suggested DNN architecture. The ensemble methods set its parameters as follows: The CatBoost has n_estimators&#x2009;=&#x2009;77 groups, each of them has eight embedded experiments, max_depth&#x2009;=&#x2009;2, min_samples_split&#x2009;=&#x2009;2, min_samples_leaf&#x2009;=&#x2009;4, mini_impurity_decrease&#x2009;=&#x2009;0.12, criterion&#x2009;=&#x2009;&#x2018;gini&#x2019;, boostrap&#x2009;=&#x2009;Ture, oob_score&#x2009;=&#x2009;False, max_leaf_node&#x2009;=&#x2009;None, while CatBoost set their parameters as loss_function&#x2009;=&#x2009;&#x2018;Logloss&#x2019;, eval_metric&#x2009;=&#x2009;&#x2018;AUC&#x2019;, task_type&#x2009;=&#x2009;&#x2018;CPU&#x2019;, learning_rate&#x2009;=&#x2009;0.02, iterations&#x2009;=&#x2009;n_h, depth&#x2009;=&#x2009;4, l_leaf_reg&#x2009;=&#x2009;4, boosting_type&#x2009;=&#x2009;&#x2018;Ordered&#x2019;, random_seed&#x2009;=&#x2009;&#x2018;1000&#x2019;. Therefore, <xref ref-type="fig" rid="fig12">Figure 12B</xref> illustrates the quick response time to decision-making when adopting the CatBoost algorithm. For scientific integrity, the CatBoost algorithm presents a highly accurate prediction like the XG-boost algorithm, especially when tackling imbalanced and chaotic data. <xref ref-type="fig" rid="fig13">Figure 13</xref> illustrates the forecasting behavior according to age for males. The peak of purchasing for kids of younger than 8&#x2009;years old is at 12:00&#x2009;p.m., while the customers of younger than 18&#x2009;years old become avid at 8:00&#x2009;p.m. The adults prefer the purchase at 3:00&#x2009;p.m., as do those who are older than 28&#x2009;years old with little skewness. This figure gives a roadmap for advertisers to be oriented to specific ages and sexes during the day and enables them to prepare their logistic plan. The following are the primary steps in training a CatBoost classifier.</p>
<fig position="float" id="fig12">
<label>Figure 12</label>
<caption>
<p><bold>(A)</bold> The coverage ratio analysis for different prediction algorithms and <bold>(B)</bold> the most training time response.</p>
</caption>
<graphic xlink:href="frsus-05-1388771-g012.tif"/>
</fig>
<fig position="float" id="fig13">
<label>Figure 13</label>
<caption>
<p>The forecasting function of <xref ref-type="table" rid="tab3">Table 3</xref>.</p>
</caption>
<graphic xlink:href="frsus-05-1388771-g013.tif"/>
</fig>
<p>This study presents modern key gradient boosting known as the CatBoost technique toolkit and enables to gain high-quality solutions when hybridized with the Dingo Optimization mechanism, which leads to outperforming other available behaviors of machine learning ensemble groups and other predictive modeling groups, as shown in <xref ref-type="fig" rid="fig14">Figure 14</xref>. The proposed Cat-DO mechanism is the tree (&#x1D44B;&#x1D456;) constructed sequentially and repeatable, and each tree aims to correct the errors of the previous ones to precise the prediction value for a given input &#x1D44B;&#x1D456;, according to <xref ref-type="bibr" rid="ref119">Sun and Tian (2023)</xref>. The comparing experiment dataset follows Jupyter Notebook, which was downloaded<xref ref-type="fn" rid="fn0002"><sup>2</sup></xref> to obtain the historical time series data of most four stocks like our problem named &#x201C;ATVI,&#x201D; &#x201C;BAC,&#x201D; &#x201C;KO,&#x201D; and &#x201C;F.&#x201D; The four stocks start on 30 May 2022 and end on 12 December 2023 for 388 time series data for each variable of four different intervals of ages to gather 6,208 rows. The average comparisons of the three measures of NRMSE, NMSE, NMAE, and accuracy for 10 stocks with 10 times predicted results are shown in <xref ref-type="table" rid="tab4">Table 4</xref>.</p>
<fig position="float" id="fig14">
<label>Figure 14</label>
<caption>
<p>The forecasting error for male and female demands.</p>
</caption>
<graphic xlink:href="frsus-05-1388771-g014.tif"/>
</fig>
</sec>
<sec id="sec14">
<label>4.1.3</label>
<title>Evaluation indicators and comparison of experimental results</title>
<p>All of the algorithms for deep learning used in this study were created using Python (version 3.7.9) language. The historical data collected from an Egyptian food factory from January 2023 to December 2023 are the source of the data set used. Initially, the upper and lower quartile values of the collected data distribution are computed to identify the outliers and replace the outliers and missing values to address the issues of missing data and abnormal data in the data. The process of substituting data is based on a moving average calculation. <xref ref-type="fig" rid="fig14">Figure 14</xref> illustrate the NRMSE for online forecasting of the proposed method (<italic>Cat-DO</italic>) and other six ML algorithms for male and female customers for only adults (18&#x2009;&#x003C;&#x2009;Age&#x2009;&#x003C;&#x2009;28). <xref ref-type="table" rid="tab5">Table 5</xref> indicate the NRMSE for the year 2023, divided into four quarters, and show the behavior of demands for women that increase while those for men are jerky. The proposed method is superior to others in some intervals of demands, according to the actual year 2023. Therefore, the benefit of this comparison is that we are responsible for choosing the algorithm that presents the minimum error at the size of the demand.</p>
<table-wrap position="float" id="tab5">
<label>Table 5</label>
<caption>
<p>The NRMSE of demand forecasting according to client age and sex (male and female), order per quarter according to actual data.</p>
</caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left" valign="middle" rowspan="2">Quarter</th>
<th align="center" valign="middle" colspan="7">Male Age &#x003C;8 years old, error in prediction <inline-formula>
<mml:math id="M94">
<mml:msub>
<mml:mo>&#x2202;</mml:mo>
<mml:mi>d</mml:mi>
</mml:msub>
<mml:mspace width="0.25em"/>
<mml:mo stretchy="true">(</mml:mo>
<mml:mi mathvariant="italic">Order</mml:mi>
</mml:math>
</inline-formula>/hour)<inline-formula>
<mml:math id="M95">
<mml:mo>&#x2264;</mml:mo>
<mml:mn>750</mml:mn>
</mml:math>
</inline-formula></th>
<th align="center" valign="middle" rowspan="2">Quarter</th>
<th align="center" valign="middle" colspan="7">Male 8 &#x003C; Age &#x003C;18 years old, error in prediction <inline-formula>
<mml:math id="M96">
<mml:msub>
<mml:mo>&#x2202;</mml:mo>
<mml:mi>d</mml:mi>
</mml:msub>
<mml:mspace width="0.25em"/>
<mml:mo stretchy="true">(</mml:mo>
<mml:mi mathvariant="italic">Order</mml:mi>
</mml:math>
</inline-formula>/hour)<inline-formula>
<mml:math id="M97">
<mml:mo>&#x2264;</mml:mo>
<mml:mn>1130</mml:mn>
</mml:math>
</inline-formula></th>
</tr>
<tr>
<th align="center" valign="top">Cat-DO</th>
<th align="center" valign="top">ARIMA</th>
<th align="center" valign="top">LSTM</th>
<th align="center" valign="top">DNN</th>
<th align="center" valign="top">XG-boost</th>
<th align="center" valign="top">SVM</th>
<th align="center" valign="top">LSTM-Cat</th>
<th align="center" valign="top">Cat-DO</th>
<th align="center" valign="top">ARIMA</th>
<th align="center" valign="top">LSTM</th>
<th align="center" valign="top">DNN</th>
<th align="center" valign="top">XG-boost</th>
<th align="center" valign="top">SVM</th>
<th align="center" valign="top">LSTM-Cat</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" valign="middle" style="background-color:#eeece1">1</td>
<td align="char" valign="middle" char=".">0.12387</td>
<td align="char" valign="middle" char=".">0.13053</td>
<td align="char" valign="middle" char=".">0.13853</td>
<td align="char" valign="middle" char=".">0.14652</td>
<td align="char" valign="middle" char=".">0.14024</td>
<td align="char" valign="middle" char=".">0.14853</td>
<td align="char" valign="middle" char=".">0.14213</td>
<td align="char" valign="middle" char="." style="background-color:#eeece1;color:#000080">1</td>
<td align="char" valign="middle" char=".">0.155656</td>
<td align="char" valign="middle" char=".">0.134088</td>
<td align="char" valign="middle" char=".">0.134088</td>
<td align="char" valign="middle" char=".">0.134091</td>
<td align="char" valign="middle" char=".">0.15413</td>
<td align="char" valign="middle" char=".">0.15213</td>
<td align="char" valign="middle" char=".">0.14258</td>
</tr>
<tr>
<td align="left" valign="middle" style="background-color:#eeece1">2</td>
<td align="char" valign="middle" char=".">0.13499</td>
<td align="char" valign="middle" char=".">0.13600</td>
<td align="char" valign="middle" char=".">0.14500</td>
<td align="char" valign="middle" char=".">0.14499</td>
<td align="char" valign="middle" char=".">0.14024</td>
<td align="char" valign="middle" char=".">0.14500</td>
<td align="char" valign="middle" char=".">0.14413</td>
<td align="char" valign="middle" char="." style="background-color:#eeece1;color:#000080">2</td>
<td align="char" valign="middle" char=".">0.170284</td>
<td align="char" valign="middle" char=".">0.158001</td>
<td align="char" valign="middle" char=".">0.157921</td>
<td align="char" valign="middle" char=".">0.157940</td>
<td align="char" valign="middle" char=".">0.16413</td>
<td align="char" valign="middle" char=".">0.15213</td>
<td align="char" valign="middle" char=".">0.15658</td>
</tr>
<tr>
<td align="left" valign="middle" style="background-color:#eeece1">3</td>
<td align="char" valign="middle" char=".">0.13064</td>
<td align="char" valign="middle" char=".">0.14065</td>
<td align="char" valign="middle" char=".">0.14065</td>
<td align="char" valign="middle" char=".">0.14064</td>
<td align="char" valign="middle" char=".">0.14612</td>
<td align="char" valign="middle" char=".">0.16065</td>
<td align="char" valign="middle" char=".">0.14513</td>
<td align="char" valign="middle" char="." style="background-color:#eeece1;color:#000080">3</td>
<td align="char" valign="middle" char=".">0.149618</td>
<td align="char" valign="middle" char=".">0.169048</td>
<td align="char" valign="middle" char=".">0.168906</td>
<td align="char" valign="middle" char=".">0.168975</td>
<td align="char" valign="middle" char=".">0.16123</td>
<td align="char" valign="middle" char=".">0.14113</td>
<td align="char" valign="middle" char=".">0.15258</td>
</tr>
<tr>
<td align="left" valign="middle" style="background-color:#eeece1">4</td>
<td align="char" valign="middle" char=".">0.13099</td>
<td align="char" valign="middle" char=".">0.13100</td>
<td align="char" valign="middle" char=".">0.14100</td>
<td align="char" valign="middle" char=".">0.14080</td>
<td align="char" valign="middle" char=".">0.14713</td>
<td align="char" valign="middle" char=".">0.16108</td>
<td align="char" valign="middle" char=".">0.14713</td>
<td align="char" valign="middle" char="." style="background-color:#eeece1;color:#000080">4</td>
<td align="char" valign="middle" char=".">0.137285</td>
<td align="char" valign="middle" char=".">0.155759</td>
<td align="char" valign="middle" char=".">0.155663</td>
<td align="char" valign="middle" char=".">0.155702</td>
<td align="char" valign="middle" char=".">0.16313</td>
<td align="char" valign="middle" char=".">0.16425</td>
<td align="char" valign="middle" char=".">0.14258</td>
</tr>
</tbody>
</table>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="center" valign="middle" colspan="8">Male 18 &#x003C; Age &#x003C;28 years old, Error in prediction <inline-formula>
<mml:math id="M98">
<mml:msub>
<mml:mo>&#x2202;</mml:mo>
<mml:mi>d</mml:mi>
</mml:msub>
<mml:mspace width="0.25em"/>
<mml:mo stretchy="true">(</mml:mo>
<mml:mi mathvariant="italic">Order</mml:mi>
</mml:math>
</inline-formula>/hour)<inline-formula>
<mml:math id="M99">
<mml:mo>&#x2264;</mml:mo>
<mml:mn>1614</mml:mn>
</mml:math>
</inline-formula></th>
<th align="center" valign="middle" colspan="8">Male Age &#x003E;28 years old, Error in prediction <inline-formula>
<mml:math id="M100">
<mml:msub>
<mml:mo>&#x2202;</mml:mo>
<mml:mi>d</mml:mi>
</mml:msub>
<mml:mspace width="0.25em"/>
<mml:mo stretchy="true">(</mml:mo>
<mml:mi mathvariant="italic">Order</mml:mi>
</mml:math>
</inline-formula>/hour)<inline-formula>
<mml:math id="M101">
<mml:mo>&#x2264;</mml:mo>
<mml:mn>2160</mml:mn>
</mml:math>
</inline-formula></th>
</tr>
<tr>
<th align="left" valign="middle">Quarter</th>
<th align="center" valign="top">Cat-DO</th>
<th align="center" valign="top">ARIMA</th>
<th align="center" valign="top">LSTM</th>
<th align="center" valign="top">DNN</th>
<th align="center" valign="top">XG-boost</th>
<th align="center" valign="top">SVM</th>
<th align="center" valign="top">LSTM-Cat</th>
<th align="center" valign="middle">Quarter</th>
<th align="center" valign="top">Cat-DO</th>
<th align="center" valign="top">ARIMA</th>
<th align="center" valign="top">LSTM</th>
<th align="center" valign="top">DNN</th>
<th align="center" valign="top">XG-boost</th>
<th align="center" valign="top">SVM</th>
<th align="center" valign="top">LSTM-Cat</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" valign="middle" style="background-color:#eeece1">1</td>
<td align="char" valign="bottom" char=".">0.12500</td>
<td align="char" valign="bottom" char=".">0.13401</td>
<td align="char" valign="bottom" char=".">0.12501</td>
<td align="char" valign="bottom" char=".">0.14400</td>
<td align="char" valign="middle" char=".">0.14014</td>
<td align="char" valign="bottom" char=".">0.14501</td>
<td align="char" valign="middle" char=".">0.14413</td>
<td align="char" valign="middle" char="." style="background-color:#eeece1;color:#000080">1</td>
<td align="char" valign="bottom" char=".">0.160355</td>
<td align="char" valign="bottom" char=".">0.149627</td>
<td align="char" valign="bottom" char=".">0.149618</td>
<td align="char" valign="bottom" char=".">0.149634</td>
<td align="char" valign="middle" char=".">0.14313</td>
<td align="char" valign="middle" char=".">0.15213</td>
<td align="char" valign="middle" char=".">0.17258</td>
</tr>
<tr>
<td align="left" valign="middle" style="background-color:#eeece1">2</td>
<td align="char" valign="bottom" char=".">0.12839</td>
<td align="char" valign="bottom" char=".">0.13440</td>
<td align="char" valign="bottom" char=".">0.13840</td>
<td align="char" valign="bottom" char=".">0.14635</td>
<td align="char" valign="middle" char=".">0.14034</td>
<td align="char" valign="bottom" char=".">0.16840</td>
<td align="char" valign="middle" char=".">0.14513</td>
<td align="char" valign="middle" char="." style="background-color:#eeece1;color:#000080">2</td>
<td align="char" valign="bottom" char=".">0.137353</td>
<td align="char" valign="bottom" char=".">0.137394</td>
<td align="char" valign="bottom" char=".">0.137292</td>
<td align="char" valign="bottom" char=".">0.137331</td>
<td align="char" valign="middle" char=".">0.16213</td>
<td align="char" valign="middle" char=".">0.16213</td>
<td align="char" valign="middle" char=".">0.16258</td>
</tr>
<tr>
<td align="left" valign="middle" style="background-color:#eeece1">3</td>
<td align="char" valign="bottom" char=".">0.12726</td>
<td align="char" valign="bottom" char=".">0.13227</td>
<td align="char" valign="bottom" char=".">0.13844</td>
<td align="char" valign="bottom" char=".">0.14643</td>
<td align="char" valign="middle" char=".">0.15602</td>
<td align="char" valign="bottom" char=".">0.16844</td>
<td align="char" valign="middle" char=".">0.14313</td>
<td align="char" valign="middle" char="." style="background-color:#eeece1;color:#000080">3</td>
<td align="char" valign="bottom" char=".">0.129044</td>
<td align="char" valign="bottom" char=".">0.140723</td>
<td align="char" valign="bottom" char=".">0.140546</td>
<td align="char" valign="bottom" char=".">0.140570</td>
<td align="char" valign="middle" char=".">0.16274</td>
<td align="char" valign="middle" char=".">0.16113</td>
<td align="char" valign="middle" char=".">0.14258</td>
</tr>
<tr>
<td align="left" valign="middle" style="background-color:#eeece1">4</td>
<td align="char" valign="bottom" char=".">0.12221</td>
<td align="char" valign="bottom" char=".">0.13029</td>
<td align="char" valign="bottom" char=".">0.14224</td>
<td align="char" valign="bottom" char=".">0.14032</td>
<td align="char" valign="middle" char=".">0.15603</td>
<td align="char" valign="bottom" char=".">0.17224</td>
<td align="char" valign="middle" char=".">0.14613</td>
<td align="char" valign="middle" char="." style="background-color:#eeece1;color:#000080">4</td>
<td align="char" valign="bottom" char=".">0.135362</td>
<td align="char" valign="bottom" char=".">0.160364</td>
<td align="char" valign="bottom" char=".">0.160355</td>
<td align="char" valign="bottom" char=".">0.160371</td>
<td align="char" valign="middle" char=".">0.16425</td>
<td align="char" valign="middle" char=".">0.16313</td>
<td align="char" valign="middle" char=".">0.14258</td>
</tr>
</tbody>
</table>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left" valign="middle" rowspan="2">Quarter</th>
<th align="center" valign="middle" colspan="7">Female Age &#x003C;8 years old, Error in prediction <inline-formula>
<mml:math id="M102">
<mml:msub>
<mml:mo>&#x2202;</mml:mo>
<mml:mi>d</mml:mi>
</mml:msub>
<mml:mspace width="0.25em"/>
<mml:mo stretchy="true">(</mml:mo>
<mml:mi mathvariant="italic">Order</mml:mi>
</mml:math>
</inline-formula>/hour)<inline-formula>
<mml:math id="M103">
<mml:mo>&#x2264;</mml:mo>
<mml:mn>750</mml:mn>
</mml:math>
</inline-formula></th>
<th align="center" valign="middle" rowspan="2">Quarter</th>
<th align="center" valign="middle" colspan="7">Female 8 &#x003C; Age &#x003C;18 years old, Error in prediction <inline-formula>
<mml:math id="M104">
<mml:msub>
<mml:mo>&#x2202;</mml:mo>
<mml:mi>d</mml:mi>
</mml:msub>
<mml:mspace width="0.25em"/>
<mml:mo stretchy="true">(</mml:mo>
<mml:mi mathvariant="italic">Order</mml:mi>
</mml:math>
</inline-formula>/hour)<inline-formula>
<mml:math id="M105">
<mml:mo>&#x2264;</mml:mo>
<mml:mn>1130</mml:mn>
</mml:math>
</inline-formula></th>
</tr>
<tr>
<th align="center" valign="top">Cat-DO</th>
<th align="center" valign="top">ARIMA</th>
<th align="center" valign="top">LSTM</th>
<th align="center" valign="top">DNN</th>
<th align="center" valign="top">XG-boost</th>
<th align="center" valign="top">SVM</th>
<th align="center" valign="top">LSTM-Cat</th>
<th align="center" valign="top">Cat-DO</th>
<th align="center" valign="top">ARIMA</th>
<th align="center" valign="top">LSTM</th>
<th align="center" valign="top">DNN</th>
<th align="center" valign="top">XG-boost</th>
<th align="center" valign="top">SVM</th>
<th align="center" valign="top">LSTM-Cat</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" valign="middle" style="background-color:#eeece1">1</td>
<td align="char" valign="middle" char=".">0.11852</td>
<td align="char" valign="middle" char=".">0.12853</td>
<td align="char" valign="middle" char=".">0.10853</td>
<td align="char" valign="middle" char=".">0.10853</td>
<td align="char" valign="middle" char=".">0.13024</td>
<td align="char" valign="bottom" char=".">0.14501</td>
<td align="char" valign="bottom" char=".">0.16501</td>
<td align="char" valign="middle" char="." style="background-color:#eeece1;color:#000080">1</td>
<td align="char" valign="middle" char=".">0.155656</td>
<td align="char" valign="middle" char=".">0.114088</td>
<td align="char" valign="middle" char=".">0.114093</td>
<td align="char" valign="middle" char=".">0.134091</td>
<td align="char" valign="middle" char=".">0.13024</td>
<td align="char" valign="bottom" char=".">0.14501</td>
<td align="char" valign="bottom" char=".">0.16501</td>
</tr>
<tr>
<td align="left" valign="middle" style="background-color:#eeece1">2</td>
<td align="char" valign="bottom" char=".">0.12499</td>
<td align="char" valign="bottom" char=".">0.11500</td>
<td align="char" valign="bottom" char=".">0.10500</td>
<td align="char" valign="bottom" char=".">0.10401</td>
<td align="char" valign="middle" char=".">0.13024</td>
<td align="char" valign="bottom" char=".">0.15840</td>
<td align="char" valign="bottom" char=".">0.15840</td>
<td align="char" valign="middle" char="." style="background-color:#eeece1;color:#000080">2</td>
<td align="char" valign="bottom" char=".">0.170284</td>
<td align="char" valign="bottom" char=".">0.128001</td>
<td align="char" valign="bottom" char=".">0.127921</td>
<td align="char" valign="bottom" char=".">0.157940</td>
<td align="char" valign="middle" char=".">0.14024</td>
<td align="char" valign="bottom" char=".">0.15840</td>
<td align="char" valign="bottom" char=".">0.15840</td>
</tr>
<tr>
<td align="left" valign="middle" style="background-color:#eeece1">3</td>
<td align="char" valign="bottom" char=".">0.14064</td>
<td align="char" valign="bottom" char=".">0.15065</td>
<td align="char" valign="bottom" char=".">0.13065</td>
<td align="char" valign="bottom" char=".">0.12066</td>
<td align="char" valign="middle" char=".">0.13612</td>
<td align="char" valign="bottom" char=".">0.16844</td>
<td align="char" valign="bottom" char=".">0.16844</td>
<td align="char" valign="middle" char="." style="background-color:#eeece1;color:#000080">3</td>
<td align="char" valign="bottom" char=".">0.149618</td>
<td align="char" valign="bottom" char=".">0.129048</td>
<td align="char" valign="bottom" char=".">0.138976</td>
<td align="char" valign="bottom" char=".">0.168975</td>
<td align="char" valign="middle" char=".">0.14612</td>
<td align="char" valign="bottom" char=".">0.16844</td>
<td align="char" valign="bottom" char=".">0.16844</td>
</tr>
<tr>
<td align="left" valign="middle" style="background-color:#eeece1">4</td>
<td align="char" valign="bottom" char=".">0.13099</td>
<td align="char" valign="bottom" char=".">0.13100</td>
<td align="char" valign="bottom" char=".">0.13100</td>
<td align="char" valign="bottom" char=".">0.12104</td>
<td align="char" valign="middle" char=".">0.13713</td>
<td align="char" valign="bottom" char=".">0.17424</td>
<td align="char" valign="bottom" char=".">0.15224</td>
<td align="char" valign="middle" char="." style="background-color:#eeece1;color:#000080">4</td>
<td align="char" valign="bottom" char=".">0.137285</td>
<td align="char" valign="bottom" char=".">0.135759</td>
<td align="char" valign="bottom" char=".">0.135663</td>
<td align="char" valign="bottom" char=".">0.155702</td>
<td align="char" valign="middle" char=".">0.15713</td>
<td align="char" valign="bottom" char=".">0.17424</td>
<td align="char" valign="bottom" char=".">0.15224</td>
</tr>
</tbody>
</table>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="center" valign="middle" colspan="8">Female 18 &#x003C; Age &#x003C;28 years old, Error in prediction <inline-formula>
<mml:math id="M106">
<mml:msub>
<mml:mo>&#x2202;</mml:mo>
<mml:mi>d</mml:mi>
</mml:msub>
<mml:mspace width="0.25em"/>
<mml:mo stretchy="true">(</mml:mo>
<mml:mi mathvariant="italic">Order</mml:mi>
</mml:math>
</inline-formula>/hour)<inline-formula>
<mml:math id="M107">
<mml:mo>&#x2264;</mml:mo>
<mml:mn>1614</mml:mn>
</mml:math>
</inline-formula></th>
<th align="center" valign="middle" colspan="8">Female Age &#x003E;28 years old, Error in prediction <inline-formula>
<mml:math id="M108">
<mml:msub>
<mml:mo>&#x2202;</mml:mo>
<mml:mi>d</mml:mi>
</mml:msub>
<mml:mspace width="0.25em"/>
<mml:mo stretchy="true">(</mml:mo>
<mml:mi mathvariant="italic">Order</mml:mi>
</mml:math>
</inline-formula>/hour)<inline-formula>
<mml:math id="M109">
<mml:mo>&#x2264;</mml:mo>
<mml:mn>2160</mml:mn>
</mml:math>
</inline-formula></th>
</tr>
<tr>
<th align="left" valign="middle">Quarter</th>
<th align="center" valign="top">Cat-DO</th>
<th align="center" valign="top">ARIMA</th>
<th align="center" valign="top">LSTM</th>
<th align="center" valign="top">DNN</th>
<th align="center" valign="top">XG-boost</th>
<th align="center" valign="top">SVM</th>
<th align="center" valign="top">LSTM-Cat</th>
<th align="center" valign="middle">Quarter</th>
<th align="center" valign="top">Cat-DO</th>
<th align="center" valign="top">ARIMA</th>
<th align="center" valign="top">LSTM</th>
<th align="center" valign="top">DNN</th>
<th align="center" valign="top">XG-boost</th>
<th align="center" valign="top">SVM</th>
<th align="center" valign="top">LSTM-Cat</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" valign="middle" style="background-color:#eeece1">1</td>
<td align="char" valign="bottom" char=".">0.11500</td>
<td align="char" valign="bottom" char=".">0.11401</td>
<td align="char" valign="bottom" char=".">0.11501</td>
<td align="char" valign="bottom" char=".">0.10400</td>
<td align="char" valign="middle" char=".">0.14014</td>
<td align="char" valign="bottom" char=".">0.14701</td>
<td align="char" valign="bottom" char=".">0.15501</td>
<td align="char" valign="middle" char="." style="background-color:#eeece1;color:#000080">1</td>
<td align="char" valign="bottom" char=".">0.160355</td>
<td align="char" valign="bottom" char=".">0.149627</td>
<td align="char" valign="bottom" char=".">0.149618</td>
<td align="char" valign="bottom" char=".">0.149634</td>
<td align="char" valign="middle" char=".">0.15014</td>
<td align="char" valign="bottom" char=".">0.15501</td>
<td align="char" valign="bottom" char=".">0.16501</td>
</tr>
<tr>
<td align="left" valign="middle" style="background-color:#eeece1">2</td>
<td align="char" valign="bottom" char=".">0.15839</td>
<td align="char" valign="bottom" char=".">0.15440</td>
<td align="char" valign="bottom" char=".">0.15840</td>
<td align="char" valign="bottom" char=".">0.10635</td>
<td align="char" valign="middle" char=".">0.14034</td>
<td align="char" valign="bottom" char=".">0.16840</td>
<td align="char" valign="bottom" char=".">0.16840</td>
<td align="char" valign="middle" char="." style="background-color:#eeece1;color:#000080">2</td>
<td align="char" valign="bottom" char=".">0.137353</td>
<td align="char" valign="bottom" char=".">0.137394</td>
<td align="char" valign="bottom" char=".">0.137292</td>
<td align="char" valign="bottom" char=".">0.137331</td>
<td align="char" valign="middle" char=".">0.15034</td>
<td align="char" valign="bottom" char=".">0.16840</td>
<td align="char" valign="bottom" char=".">0.15840</td>
</tr>
<tr>
<td align="left" valign="middle" style="background-color:#eeece1">3</td>
<td align="char" valign="bottom" char=".">0.15726</td>
<td align="char" valign="bottom" char=".">0.15227</td>
<td align="char" valign="bottom" char=".">0.15844</td>
<td align="char" valign="bottom" char=".">0.11643</td>
<td align="char" valign="middle" char=".">0.15602</td>
<td align="char" valign="bottom" char=".">0.16144</td>
<td align="char" valign="bottom" char=".">0.17844</td>
<td align="char" valign="middle" char="." style="background-color:#eeece1;color:#000080">3</td>
<td align="char" valign="bottom" char=".">0.129044</td>
<td align="char" valign="bottom" char=".">0.140723</td>
<td align="char" valign="bottom" char=".">0.140546</td>
<td align="char" valign="bottom" char=".">0.140570</td>
<td align="char" valign="middle" char=".">0.16602</td>
<td align="char" valign="bottom" char=".">0.16844</td>
<td align="char" valign="bottom" char=".">0.16844</td>
</tr>
<tr>
<td align="left" valign="middle" style="background-color:#eeece1">4</td>
<td align="char" valign="bottom" char=".">0.14221</td>
<td align="char" valign="bottom" char=".">0.14029</td>
<td align="char" valign="bottom" char=".">0.14224</td>
<td align="char" valign="bottom" char=".">0.12032</td>
<td align="char" valign="middle" char=".">0.15603</td>
<td align="char" valign="bottom" char=".">0.16224</td>
<td align="char" valign="bottom" char=".">0.18224</td>
<td align="char" valign="middle" char="." style="background-color:#eeece1;color:#000080">4</td>
<td align="char" valign="bottom" char=".">0.135362</td>
<td align="char" valign="bottom" char=".">0.160364</td>
<td align="char" valign="bottom" char=".">0.160355</td>
<td align="char" valign="bottom" char=".">0.160371</td>
<td align="char" valign="middle" char=".">0.17603</td>
<td align="char" valign="bottom" char=".">0.17424</td>
<td align="char" valign="bottom" char=".">0.17224</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="fig" rid="fig14">Figure 14</xref> shows that SVM works best for orders less than 45 per min. The proposed algorithm Cat-DO is then used for orders between 46 and 90 per min, even though LSTM is better for orders between 91 and 105 per min. However, back to the proposed Cat-DO to show the least amount of error between 106 and 135 orders, and then back SVM, ARIMA, LSTM, and Cat-DO. Also, the male purchasing behavior and superiority at medium and high purchasing orders per minute and presents accurate forecasting, while the purchasing behavior for women, where ARIMA and proposed Cat-DO are accurate. The Dingo with chaotic data is useful because it generates a high degree of variation in the algorithm, enhancing its capacity to break out from any local optimums. To start the search process toward the global optima, the weight factor is added in the second place.</p>
</sec></sec>
</sec>
<sec sec-type="conclusions" id="sec15">
<label>5</label>
<title>Conclusion</title>
<p>Health food marketing lacks accurate forecasting for demand during the four seasons for men and women through four age intervals. It needs to be quick because the demands via e-commerce are chaotic, massive, and imbalanced. The study conducts a comprehensive review to explore the relationship between machine learning algorithms and their behavior based on input data (labeled or unlabeled) within various supply chain sectors. This analysis aims to optimize processes within these sectors when determining the suitable ML algorithm to hybridize with suitable AI optimization technique and compare with benchmarking data (<xref ref-type="bibr" rid="ref119">Sun and Tian, 2023</xref>) to authorize in implementing on real data. The study&#x2019;s methodology focused on using a multi-method bibliometric approach to create a taxonomy for ML studies in SC themes, as shown in <xref ref-type="fig" rid="fig1">Figures 1</xref>, <xref ref-type="fig" rid="fig2">2</xref>. According to data inputs, this taxonomy divided the sectors of SC into four categories, namely, supervised, unsupervised, semi-supervised, and ensemble learning. This technique helps in making choices and enhances the efficiency of SC performance, as shown in <xref ref-type="table" rid="tab1">Table 1</xref>. Certainly, the hybridization between ML and AI in its (IoT at e-commerce) aspect can alleviate concerns about any cause of risk and increase SC adaptively to guarantee continuity. Therefore, the article presents <xref ref-type="fig" rid="fig6">Figures 6</xref>&#x2013;<xref ref-type="fig" rid="fig9">9</xref> to help researchers in determining the best algorithm according to problem nature. Machine learning (ML) models are considered effective tools for managing supply chains. They provide automation and visualization, which make the connections between supply chain sectors more intelligent. This is especially helpful when analyzing massive amounts of data to discover patterns or relationships. <xref ref-type="fig" rid="fig11">Figure 11</xref> illustrates that demand forecasting is based on age and sex factors in this case study. <xref ref-type="fig" rid="fig12">Figure 12</xref> proves that the proposed algorithm has more coverage than others, and <xref ref-type="fig" rid="fig13">Figure 13</xref> indicates the order behavior according to age for aggregated demands of men and women. The analysis of the data from <xref ref-type="fig" rid="fig14">Figure 14</xref> shows that male demand is erratic, whereas female demand is on the rise. This suggests that different machine-learning methods may be needed for different batches of orders per hour. <xref ref-type="table" rid="tab5">Table 5</xref> show the details of NRMSE for both men and women and different age intervals, which enable the company to improve the product according to age. The proposed algorithm was found to be superior to others at 180&#x2013;195 orders per minute for men, while CatBoost presents the best forecasting for women&#x2019;s behavior. In addition, the proposed method is good for women at orders of 225&#x2013;240 per min. The Cat-DO has been compared with other six ML algorithms to test its superiority over ARIMA, LTSM, DNN, CatBoost, SVM, and LSTM- CatBoost by 0.52, 0.73, 1.43, 8.27, 15.94, and 13.12%, respectively. Transportation costs have been reduced by 6.67%, which grows the ROI of companies as cited in the study mentioned in the reference (<xref ref-type="bibr" rid="ref9">Abed and Seddek, 2024</xref>).</p>
</sec>
<sec id="sec16">
<label>6</label>
<title>Future work</title>
<p>Demand forecasting is the backbone of the management of supply chain sectors, which appears in other related sectors, such as inventory, transportation, production planning, and purchasing. Therefore, the extension of this study depends on following up on customers&#x2019; requirements by relying on data classified in the local databases of the food department through deep analysis of their purchases and accurately identifying the items to remind them of their needs during the usual time of purchase (specifying customer registration data) and talking to them through a picture of their favorite products using an ensemble algorithms aims to conventional AI for customer service as shown in <xref ref-type="fig" rid="fig6">Figure 6</xref>. Achieving this goal depends on classification datasets precisely to meet public awareness management for reading customers&#x2019; ideas and requirements. Like model-based clustering, which is based on Gaussian distributions that handle numeric and categorical data considering the importance and correlation of features and produce groups that have different shapes and sizes, each of them forms the best population for forecast demand.</p>
</sec>
</body>
<back>
<sec sec-type="data-availability" id="sec18">
<title>Data availability statement</title>
<p>The original contributions presented in the study are included in the article/supplementary material, further inquiries can be directed to the corresponding author.</p>
</sec>
<sec sec-type="author-contributions" id="sec19">
<title>Author contributions</title>
<p>AMA: Conceptualization, Data curation, Formal analysis, Funding acquisition, Investigation, Methodology, Project administration, Resources, Software, Supervision, Validation, Visualization, Writing &#x2013; original draft, Writing &#x2013; review &#x0026; editing.</p>
</sec>
<sec sec-type="funding-information" id="sec20">
<title>Funding</title>
<p>The author(s) declare that financial support was received for the research, authorship, and/or publication of this article. The author is thankful for the support of the Deanship of Scientific Research at Princess Sattam bin Abdulaziz University through the Research Groups Program grant no. (PSAU/2023/01/24933).</p>
</sec>
<sec sec-type="COI-statement" id="sec21">
<title>Conflict of interest</title>
<p>The author declares that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="sec22">
<title>Publisher&#x2019;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<sec sec-type="supplementary-material" id="sec23">
<title>Supplementary material</title>
<p>The Supplementary material for this article can be found online at: <ext-link xlink:href="https://www.frontiersin.org/articles/10.3389/frsus.2024.1388771/full#supplementary-material" ext-link-type="uri">https://www.frontiersin.org/articles/10.3389/frsus.2024.1388771/full#supplementary-material</ext-link></p>
<supplementary-material xlink:href="Data_Sheet_1.xlsx" id="SM1" mimetype="application/vnd.openxmlformats-officedocument.spreadsheetml.sheet" xmlns:xlink="http://www.w3.org/1999/xlink"/>
</sec>
<fn-group>
<fn id="fn0001"><p><sup>1</sup>The bullwhip effect is a phenomenon in which little variations in retail demand led to corresponding swings in wholesale, distributor, and manufacturer demand. This phenomenon causes inefficiencies and disarray across the whole logistical chain.</p></fn>
<fn id="fn0002"><p><sup>2</sup><ext-link xlink:href="https://www.kaggle.com/" ext-link-type="uri">https://www.kaggle.com/</ext-link></p></fn>
</fn-group>
<ref-list>
<title>References</title>
<ref id="ref1"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Aamer</surname> <given-names>A.</given-names></name> <name><surname>Yani</surname> <given-names>L. P. E.</given-names></name> <name><surname>Priyatna</surname> <given-names>I. M. A.</given-names></name></person-group> (<year>2020</year>). <article-title>Data analytics in supply chain management: review of machine learning applications in demand forecasting</article-title>. <source>Oper. Supply Chain Manage. Int. J.</source> <volume>14</volume>, <fpage>1</fpage>&#x2013;<lpage>13</lpage>. doi: <pub-id pub-id-type="doi">10.31387/oscm0440281</pub-id></citation></ref>
<ref id="ref2"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Abdel-Basset</surname> <given-names>M.</given-names></name> <name><surname>Gunasekaran</surname> <given-names>M.</given-names></name> <name><surname>Mohamed</surname> <given-names>M.</given-names></name> <name><surname>Chilamkurti</surname> <given-names>N.</given-names></name></person-group> (<year>2019</year>). <article-title>A framework for risk assessment, management, and evaluation: economic tool for quantifying risks in supply chain</article-title>. <source>Fut Generat Comput Syst</source> <volume>90</volume>, <fpage>489</fpage>&#x2013;<lpage>502</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.future.2018.08.035</pub-id></citation></ref>
<ref id="ref3"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Abed</surname> <given-names>A. M.</given-names></name></person-group> (<year>2023</year>). <article-title>The resistance of the third organizational efficiency theory for depravity on socio-economic?</article-title> <source>Eur. Chem. Bull</source> <volume>12</volume>, <fpage>3147</fpage>&#x2013;<lpage>3171</lpage>. doi: <pub-id pub-id-type="doi">10.48047/ecb/2023.12.12.2142022.11/10/2023</pub-id></citation></ref>
<ref id="ref4"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Abed</surname> <given-names>A. M.</given-names></name> <name><surname>AlArjani</surname> <given-names>A.</given-names></name> <name><surname>Seddek</surname> <given-names>L. F.</given-names></name></person-group> (<year>2023</year>). <article-title>Optimization of the working parameters with digital Jidoka twin by hybridizing the WSPA and HS methods to keep products within standard specifications</article-title>. <source>J. Adv. Manuf. Syst.</source> <volume>23</volume>, <fpage>1</fpage>&#x2013;<lpage>33</lpage>. doi: <pub-id pub-id-type="doi">10.1142/S021968672450001X</pub-id></citation></ref>
<ref id="ref5"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Abed</surname> <given-names>A. M.</given-names></name> <name><surname>AlArjani</surname> <given-names>A.</given-names></name> <name><surname>Seddek</surname> <given-names>L. F.</given-names></name> <name><surname>El Attar</surname> <given-names>S.</given-names></name></person-group> (<year>2024</year>). <article-title>Reduce the delivery time and relevant costs in a chaotic requests system via lean-Heijunka model to enhance the logistic Hamiltonian route</article-title>. <source>Results Eng.</source> <volume>21</volume>:<fpage>101745</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.rineng.2023.101745</pub-id></citation></ref>
<ref id="ref6"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Abed</surname> <given-names>Ahmed M.</given-names></name> <name><surname>Al-Attar</surname> <given-names>Samia A.</given-names></name></person-group>, (<year>2018</year>). &#x201C;Sustainable quality boosts emission reduction using ARIMA to forecast the malfunction behavior,&#x201D; in The <italic>2nd International Conference on new trends for sustainable energy ICNTSE'18, Alex</italic>, Nov. 5&#x2013;6, 2018, Pharos university, Egypt. pp. 62.</citation></ref>
<ref id="ref7"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Abed</surname> <given-names>A. M.</given-names></name> <name><surname>Elattar</surname> <given-names>S.</given-names></name></person-group> (<year>2020</year>). <article-title>Minimize the Route Length using heuristic method aided with Simulated Annealing to reinforce Lean management sustainability</article-title>. <source>PRO</source> <volume>8</volume>:<fpage>495</fpage>. doi: <pub-id pub-id-type="doi">10.3390/pr8040495</pub-id></citation></ref>
<ref id="ref8"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Abed</surname> <given-names>A. M.</given-names></name> <name><surname>Seddek</surname> <given-names>L. F.</given-names></name></person-group> (<year>2022</year>). <article-title>The lean-branch-and-bound structure effectiveness in enhancing the logistic stowage methodology for the regular shapes</article-title>. <source>PRO</source> <volume>10</volume>:<fpage>2252</fpage>. doi: <pub-id pub-id-type="doi">10.3390/pr10112252</pub-id></citation></ref>
<ref id="ref9"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Abed</surname> <given-names>A. M.</given-names></name> <name><surname>Seddek</surname> <given-names>L. F.</given-names></name></person-group> (<year>2024</year>). <article-title>Discuss the effect of the third organizational efficiency theory on society and economic growth via corruption axes frustration by a non-linear model corruption aspects benefit</article-title>. <source>Egyptian Int. J. Eng. Sci. Technol.</source> 47. doi: <pub-id pub-id-type="doi">10.21608/eijest.2024.225347.1241</pub-id></citation></ref>
<ref id="ref10"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Abed</surname> <given-names>A. M.</given-names></name> <name><surname>Seddek</surname> <given-names>L. F.</given-names></name> <name><surname>AlArjani</surname> <given-names>A.</given-names></name></person-group> (<year>2023</year>). <article-title>Enhancing two-phase supply chain network distribution via three meta-heuristic optimization algorithms subsidized by mathematical procedures</article-title>. <source>J. Adv. Manuf. Syst.</source> <volume>23</volume>, <fpage>445</fpage>&#x2013;<lpage>476</lpage>. doi: <pub-id pub-id-type="doi">10.1142/S0219686723500221</pub-id></citation></ref>
<ref id="ref11"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Aburto</surname> <given-names>L.</given-names></name> <name><surname>Weber</surname> <given-names>R.</given-names></name></person-group> (<year>2007</year>). <article-title>Improved supply chain management based on hybrid demand forecasts</article-title>. <source>Appl. Soft Comput.</source> <volume>7</volume>, <fpage>136</fpage>&#x2013;<lpage>144</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.asoc.2005.06.001</pub-id></citation></ref>
<ref id="ref12"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ahmed</surname> <given-names>N.</given-names></name> <name><surname>Farzana</surname> <given-names>F.</given-names></name></person-group> (<year>2020</year>). <article-title>Forecasting supply chain sporadic demand using support vector machine approaches</article-title>. <source>Fuzzy Sets Syst.</source> <volume>10</volume>, <fpage>87</fpage>&#x2013;<lpage>102</lpage>.</citation></ref>
<ref id="ref13"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Aljojo</surname> <given-names>N.</given-names></name> <name><surname>Alshutayri</surname> <given-names>A.</given-names></name> <name><surname>Aldhahri</surname> <given-names>E.</given-names></name> <name><surname>Almandeel</surname> <given-names>S.</given-names></name> <name><surname>Zainol</surname> <given-names>A.</given-names></name></person-group> (<year>2021</year>). <article-title>A nonlinear autoregressive exogenous (NARX) neural network model for the prediction of timestamp influence on bitcoin value</article-title>. <source>IEEE Access</source> <volume>9</volume>, <fpage>148611</fpage>&#x2013;<lpage>148624</lpage>. doi: <pub-id pub-id-type="doi">10.1109/ACCESS.2021.3124629</pub-id></citation></ref>
<ref id="ref14"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Altan</surname> <given-names>A.</given-names></name> <name><surname>Karasu</surname> <given-names>S.</given-names></name> <name><surname>Bekiros</surname> <given-names>S.</given-names></name></person-group> (<year>2019</year>). <article-title>Digital currency forecasting with chaotic meta-heuristic bio-inspired signal processing techniques</article-title>. <source>Chaos, Solitons Fractals</source> <volume>126</volume>, <fpage>325</fpage>&#x2013;<lpage>336</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.chaos.2019.07.011</pub-id></citation></ref>
<ref id="ref15"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Attari</surname> <given-names>M. Y. N.</given-names></name> <name><surname>Torkayesh</surname> <given-names>A. E.</given-names></name> <name><surname>Malmir</surname> <given-names>B.</given-names></name> <name><surname>Jami</surname> <given-names>E. N.</given-names></name></person-group> (<year>2021</year>). <article-title>Robust possibilistic programming for joint order batching and picker routing problem in warehouse management</article-title>. <source>Int. J. Prod. Res.</source>. <volume>59</volume>, <fpage>4434</fpage>&#x2013;<lpage>4452</lpage>. doi: <pub-id pub-id-type="doi">10.1080/00207543.2020.1766712</pub-id></citation></ref>
<ref id="ref16"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Azar</surname> <given-names>A.</given-names></name> <name><surname>Dolatabad</surname> <given-names>K. M.</given-names></name></person-group> (<year>2019</year>). <article-title>A method for modelling operational risk with fuzzy cognitive maps and Bayesian belief networks</article-title>. <source>Expert Syst. Appl.</source> <volume>115</volume>, <fpage>607</fpage>&#x2013;<lpage>617</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.eswa.2018.08.043</pub-id></citation></ref>
<ref id="ref17"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Baecke</surname> <given-names>P.</given-names></name> <name><surname>de Baets</surname> <given-names>S.</given-names></name> <name><surname>Vanderheyden</surname> <given-names>K.</given-names></name></person-group> (<year>2017</year>). <article-title>Investigating the added value of integrating human judgement into statistical demand forecasting systems</article-title>. <source>Int. J. Prod. Econ.</source> <volume>191</volume>, <fpage>85</fpage>&#x2013;<lpage>96</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.ijpe.2017.05.016</pub-id></citation></ref>
<ref id="ref18"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Baryannis</surname> <given-names>G.</given-names></name> <name><surname>Validi</surname> <given-names>S.</given-names></name> <name><surname>Dani</surname> <given-names>S.</given-names></name> <name><surname>Antoniou</surname> <given-names>G.</given-names></name></person-group> (<year>2019</year>). <article-title>Supply chain risk management and artificial intelligence: state of the art and future research directions</article-title>. <source>Int. J. Prod. Res.</source> <volume>57</volume>, <fpage>2179</fpage>&#x2013;<lpage>2202</lpage>. doi: <pub-id pub-id-type="doi">10.1080/00207543.2018.1530476</pub-id></citation></ref>
<ref id="ref19"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Belhadi</surname> <given-names>A.</given-names></name> <name><surname>Kamble</surname> <given-names>S. S.</given-names></name> <name><surname>Venkatesh</surname> <given-names>M.</given-names></name> <name><surname>Jabbour</surname> <given-names>C. J. C.</given-names></name> <name><surname>Benkhati</surname> <given-names>I.</given-names></name></person-group> (<year>2022</year>). <article-title>Building supply chain resilience and efficiency through additive manufacturing: an ambidextrous perspective on the dynamic capability view</article-title>. <source>Int. J. Prod. Econ.</source> <volume>249</volume>:<fpage>108516</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.ijpe.2022.108516</pub-id></citation></ref>
<ref id="ref20"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ben-Daya</surname> <given-names>M.</given-names></name> <name><surname>Hassini</surname> <given-names>E.</given-names></name> <name><surname>Bahroun</surname> <given-names>Z.</given-names></name></person-group> (<year>2019</year>). <article-title>Internet of things and supply chain management: a literature review</article-title>. <source>Int. J. Prod. Res.</source> <volume>57</volume>, <fpage>4719</fpage>&#x2013;<lpage>4742</lpage>. doi: <pub-id pub-id-type="doi">10.1080/00207543.2017.1402140</pub-id></citation></ref>
<ref id="ref21"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bertolini</surname> <given-names>M.</given-names></name> <name><surname>Mezzogori</surname> <given-names>D.</given-names></name> <name><surname>Neroni</surname> <given-names>M.</given-names></name> <name><surname>Zammori</surname> <given-names>F.</given-names></name></person-group> (<year>2021</year>). <article-title>Machine learning for industrial applications: a comprehensive literature review</article-title>. <source>Expert Syst. Appl.</source> <volume>175</volume>:<fpage>114820</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.eswa.2021.114820</pub-id></citation></ref>
<ref id="ref22"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Bousqaoui</surname> <given-names>Halima</given-names></name> <name><surname>Achchab</surname> <given-names>Said</given-names></name> <name><surname>Tikito</surname> <given-names>Kawtar</given-names></name></person-group>. (<year>2017</year>). &#x201C;Machine learning applications in supply chains: an emphasis on neural network applications.&#x201D; in <italic>2017 3rd international conference of cloud computing technologies and applications (CloudTech)</italic>, pp. 1&#x2013;7. IEEE, 2017.</citation></ref>
<ref id="ref23"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cannas</surname> <given-names>V. G.</given-names></name> <name><surname>Ciano</surname> <given-names>M. P.</given-names></name> <name><surname>Saltalamacchia</surname> <given-names>M.</given-names></name> <name><surname>Secchi</surname> <given-names>R.</given-names></name></person-group> (<year>2023</year>). <article-title>Artificial intelligence in supply chain and operations management: a multiple case study research</article-title>. <source>Int. J. Prod. Res.</source> <volume>62</volume>, <fpage>3333</fpage>&#x2013;<lpage>3360</lpage>. doi: <pub-id pub-id-type="doi">10.1080/00207543.2023.2232050</pub-id></citation></ref>
<ref id="ref24"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cao</surname> <given-names>J.</given-names></name> <name><surname>Jiang</surname> <given-names>Z.</given-names></name> <name><surname>Wang</surname> <given-names>K.</given-names></name></person-group> (<year>2016</year>). <article-title>Customer demand prediction of service-oriented manufacturing using the least square support vector machine optimized by particle swarm optimization algorithm</article-title>. <source>Eng. Optim.</source> <volume>49</volume>, <fpage>1197</fpage>&#x2013;<lpage>1210</lpage>. doi: <pub-id pub-id-type="doi">10.1080/0305215X.2016.1245729</pub-id></citation></ref>
<ref id="ref25"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chen</surname> <given-names>X.</given-names></name></person-group> (<year>2022</year>). <article-title>Machine learning approach for a circular economy with waste recycling in smart cities</article-title>. <source>Energy Rep.</source> <volume>8</volume>, <fpage>3127</fpage>&#x2013;<lpage>3140</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.egyr.2022.01.193</pub-id></citation></ref>
<ref id="ref26"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cho</surname> <given-names>R. K.</given-names></name> <name><surname>Gerchak</surname> <given-names>Y.</given-names></name></person-group> (<year>2005</year>). <article-title>Supply chain coordination with downstream operating costs: coordination and investment to improve downstream operating efficiency</article-title>. <source>Eur. J. Oper. Res.</source> <volume>162</volume>, <fpage>762</fpage>&#x2013;<lpage>772</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.ejor.2003.08.064</pub-id></citation></ref>
<ref id="ref27"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chong</surname> <given-names>E.</given-names></name> <name><surname>Han</surname> <given-names>C.</given-names></name> <name><surname>Park</surname> <given-names>F.</given-names></name></person-group> (<year>2017</year>). <article-title>Deep learning networks for stock market analysis and prediction: methodology, data representations, and case studies</article-title>. <source>Expert Syst. Appl.</source> <volume>83</volume>, <fpage>187</fpage>&#x2013;<lpage>205</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.eswa.2017.04.030</pub-id></citation></ref>
<ref id="ref9001"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chu</surname> <given-names>D. K.</given-names></name> <name><surname>Akl</surname> <given-names>E. A.</given-names></name> <name><surname>Duda</surname> <given-names>S.</given-names></name> <name><surname>Solo</surname> <given-names>K.</given-names></name> <name><surname>Yaacoub</surname> <given-names>S.</given-names></name> <name><surname>Sch&#x00FC;nemann</surname> <given-names>H. J.</given-names></name> <etal/></person-group>. (<year>2020</year>). <article-title>Physical distancing, face masks, and eye protection to prevent person-to-person transmission of SARS-CoV-2 and COVID-19: a systematic review and meta-analysis</article-title>. <source>The Lancet</source>, <volume>395</volume>, <fpage>1973</fpage>&#x2013;<lpage>1987</lpage>.</citation></ref>
<ref id="ref28"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ciresan</surname> <given-names>D.</given-names></name> <name><surname>Meier</surname> <given-names>U.</given-names></name> <name><surname>Masci</surname> <given-names>J.</given-names></name> <name><surname>Schmidhuber</surname> <given-names>J.</given-names></name></person-group> (<year>2012</year>). <article-title>Multi-column deep neural network for traffic sign classification</article-title>. <source>Neural Netw.</source> <volume>32</volume>, <fpage>333</fpage>&#x2013;<lpage>338</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.neunet.2012.02.023</pub-id>, PMID: <pub-id pub-id-type="pmid">22386783</pub-id></citation></ref>
<ref id="ref29"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Darvazeh</surname> <given-names>S. S.</given-names></name> <name><surname>Vanani</surname> <given-names>I. R.</given-names></name> <name><surname>Musolu</surname> <given-names>F. M.</given-names></name></person-group> (<year>2020</year>). <source>Big data analytics and its applications in supply chain management, in new trends in the use of artificial intelligence for the industry 4.0</source>. <publisher-loc>London, UK</publisher-loc>: <publisher-name>IntechOpen</publisher-name>.</citation></ref>
<ref id="ref30"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dashore</surname> <given-names>K.</given-names></name> <name><surname>Sohani</surname> <given-names>N.</given-names></name></person-group> (<year>2013</year>). <article-title>Green supply chain management: a hierarchical framework for barriers</article-title>. <source>Int. J. Eng. Trends Technol. (IJETT)</source> <volume>4</volume>, <fpage>2172</fpage>&#x2013;<lpage>2182</lpage>.</citation></ref>
<ref id="ref31"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dauphin</surname> <given-names>Y. N.</given-names></name> <name><surname>Pascanu</surname> <given-names>R.</given-names></name> <name><surname>Gulcehre</surname> <given-names>C.</given-names></name> <name><surname>Cho</surname> <given-names>K.</given-names></name> <name><surname>Ganguli</surname> <given-names>S.</given-names></name> <name><surname>Bengio</surname> <given-names>Y.</given-names></name></person-group> (<year>2014</year>). <article-title>Identifying and attacking the saddle point problem in high-dimensional non-convex optimization</article-title>. <source>Adv. Neural Inf. Proces. Syst.</source> <volume>27</volume>.</citation></ref>
<ref id="ref32"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dave</surname> <given-names>D.</given-names></name> <name><surname>Choudhary</surname> <given-names>V.</given-names></name></person-group> (<year>2014</year>). <article-title>Barriers to implement green supply chain management in transmission tower manufacturing industry using interpretive structural modelling technique</article-title>. <source>Int. J. Eng. Res. Technol.</source> <volume>3</volume>, <fpage>2063</fpage>&#x2013;<lpage>2073</lpage>.</citation></ref>
<ref id="ref33"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Deif</surname> <given-names>A. M.</given-names></name></person-group> (<year>2011</year>). <article-title>A system model for green manufacturing</article-title>. <source>J. Clean. Prod.</source> <volume>19</volume>, <fpage>1553</fpage>&#x2013;<lpage>1559</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.jclepro.2011.05.022</pub-id></citation></ref>
<ref id="ref34"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dhamija</surname> <given-names>P.</given-names></name> <name><surname>Bag</surname> <given-names>S.</given-names></name></person-group> (<year>2020</year>). <article-title>Role of artificial intelligence in operations environment: a review and bibliometric analysis</article-title>. <source>TQM J.</source> <volume>32</volume>, <fpage>869</fpage>&#x2013;<lpage>896</lpage>. doi: <pub-id pub-id-type="doi">10.1108/TQM-10-2019-0243</pub-id></citation></ref>
<ref id="ref35"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dittrich</surname> <given-names>M. A.</given-names></name> <name><surname>Fohlmeister</surname> <given-names>S.</given-names></name></person-group> (<year>2021</year>). <article-title>A deep q-learning-based optimization of the inventory control in a linear process chain</article-title>. <source>Prod. Eng.</source> <volume>15</volume>, <fpage>35</fpage>&#x2013;<lpage>43</lpage>. doi: <pub-id pub-id-type="doi">10.1007/s11740-020-01000-8</pub-id></citation></ref>
<ref id="ref36"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>DuHadway</surname> <given-names>S.</given-names></name> <name><surname>Carnovale</surname> <given-names>S.</given-names></name> <name><surname>Hazen</surname> <given-names>B.</given-names></name></person-group> (<year>2019</year>). <article-title>Understanding risk management for intentional supply chain disruptions: risk detection, risk mitigation, and risk recovery</article-title>. <source>Ann. Oper. Res.</source> <volume>283</volume>, <fpage>179</fpage>&#x2013;<lpage>198</lpage>. doi: <pub-id pub-id-type="doi">10.1007/s10479-017-2452-0</pub-id></citation></ref>
<ref id="ref37"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dzogbewu</surname> <given-names>T. C.</given-names></name> <name><surname>Koranteng-Fianko</surname> <given-names>S.</given-names></name> <name><surname>Jnr</surname> <given-names>S. A.</given-names></name> <name><surname>Amoah</surname> <given-names>N.</given-names></name> <name><surname>Imdaadulah</surname> <given-names>A.</given-names></name> <name><surname>Johan</surname> <given-names>D.</given-names></name></person-group> (<year>2023</year>). <article-title>Supply chain disruptions and resilience in manufacturing industry during Covid-19: additive manufacturing intervention in perspective</article-title>. <source>J. Industrial Eng. Manag. JIEM</source> <volume>16</volume>, <fpage>509</fpage>&#x2013;<lpage>520</lpage>. doi: <pub-id pub-id-type="doi">10.3926/jiem.4526</pub-id></citation></ref>
<ref id="ref38"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Eladly</surname> <given-names>A. M.</given-names></name> <name><surname>Abed</surname> <given-names>A. M.</given-names></name> <name><surname>Aly</surname> <given-names>M. H.</given-names></name> <name><surname>Salama</surname> <given-names>W. M.</given-names></name></person-group> (<year>2023</year>). <article-title>Enhancing circular economy via detecting and recycling 2D nested sheet waste using Bayesian optimization technique based-smart digital twin</article-title>. <source>Results Eng.</source> <volume>2023</volume>:<fpage>101544</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.rineng.101544</pub-id></citation></ref>
<ref id="ref39"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Friedman</surname> <given-names>P.</given-names></name></person-group> (<year>2008</year>). <source>Leaning toward green: Green your supply chain with lean practices</source>. <source>Outsourced Logistics.</source> <volume>1</volume>, <fpage>16</fpage>&#x2013;<lpage>17</lpage>.</citation></ref>
<ref id="ref40"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Furian</surname> <given-names>N.</given-names></name> <name><surname>O&#x2019;Sullivan</surname> <given-names>M.</given-names></name> <name><surname>Walker</surname> <given-names>C.</given-names></name> <name><surname>&#x00C7;ela</surname> <given-names>E.</given-names></name></person-group> (<year>2021</year>). <article-title>A machine learning-based branch and price algorithm for a sampled vehicle routing problem</article-title>. <source>OR Spectr.</source> <volume>43</volume>, <fpage>693</fpage>&#x2013;<lpage>732</lpage>. doi: <pub-id pub-id-type="doi">10.1007/s00291-020-00615-8</pub-id></citation></ref>
<ref id="ref41"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gao</surname> <given-names>Q.</given-names></name> <name><surname>Guo</surname> <given-names>S.</given-names></name> <name><surname>Liu</surname> <given-names>X.</given-names></name> <name><surname>Manogaran</surname> <given-names>G.</given-names></name> <name><surname>Chilamkurti</surname> <given-names>N.</given-names></name> <name><surname>Kadry</surname> <given-names>S.</given-names></name></person-group> (<year>2019</year>). <article-title>Simulation analysis of supply chain risk management system based on IoT information platform</article-title>. <source>Enterp. Inf. Syst.</source> <volume>14</volume>, <fpage>1354</fpage>&#x2013;<lpage>1378</lpage>. doi: <pub-id pub-id-type="doi">10.1080/17517575.2019.1644671</pub-id></citation></ref>
<ref id="ref42"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gao</surname> <given-names>X.</given-names></name> <name><surname>Lee</surname> <given-names>G.</given-names></name></person-group> (<year>2019</year>). <article-title>Moment-based rental prediction for bicycle-sharing transportation systems using a hybrid genetic algorithm and machine learning</article-title>. <source>Comput. Ind. Eng.</source> <volume>128</volume>, <fpage>60</fpage>&#x2013;<lpage>69</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.cie.2018.12.023</pub-id></citation></ref>
<ref id="ref43"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Garc&#x00ED;a</surname> <given-names>S.</given-names></name> <name><surname>Fern&#x00E1;ndez</surname> <given-names>A.</given-names></name> <name><surname>Luengo</surname> <given-names>J.</given-names></name> <name><surname>Herrera</surname> <given-names>F.</given-names></name></person-group> (<year>2009</year>). <article-title>A study of statistical techniques and performance measures for genetics based machine learning: accuracy and interpretability</article-title>. <source>Soft. Comput.</source> <volume>13</volume>, <fpage>959</fpage>&#x2013;<lpage>977</lpage>. doi: <pub-id pub-id-type="doi">10.1007/s00500-008-0392-y</pub-id></citation></ref>
<ref id="ref44"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Garfamy</surname> <given-names>R. M.</given-names></name></person-group> (<year>2011</year>). <article-title>Supplier selection and business process improvement: an exploratory multiple case study</article-title>. <source>Int. J. Operational Res.</source> <volume>10</volume>, <fpage>240</fpage>&#x2013;<lpage>255</lpage>. doi: <pub-id pub-id-type="doi">10.1504/IJOR.2011.038586</pub-id></citation></ref>
<ref id="ref45"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Gaur</surname> <given-names>M.</given-names></name> <name><surname>Goel</surname> <given-names>S.</given-names></name> <name><surname>Jain</surname> <given-names>E.</given-names></name></person-group> (<year>2015</year>). &#x201C;Comparison between nearest Neighbours and Bayesian network for demand forecasting in supply chain management,&#x201D; in <italic>2015 2nd international conference on computing for sustainable global development (INDIACom)</italic> (pp. 1433&#x2013;1436). IEEE.</citation></ref>
<ref id="ref46"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Giri</surname> <given-names>C.</given-names></name> <name><surname>Jain</surname> <given-names>S.</given-names></name> <name><surname>Zeng</surname> <given-names>X.</given-names></name> <name><surname>Bruniaux</surname> <given-names>P.</given-names></name></person-group> (<year>2019</year>). <article-title>A detailed review of artificial intelligence applied in the fashion and apparel industry</article-title>. <source>IEEE Access</source> <volume>7</volume>, <fpage>95376</fpage>&#x2013;<lpage>95396</lpage>. doi: <pub-id pub-id-type="doi">10.1109/ACCESS.2019.2928979</pub-id></citation></ref>
<ref id="ref47"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Goodfellow</surname> <given-names>I.</given-names></name> <name><surname>Bengio</surname> <given-names>Y.</given-names></name> <name><surname>Courville</surname> <given-names>A.</given-names></name></person-group> (<year>2016</year>). <source>Deep learning</source>. <publisher-loc>US</publisher-loc>: <publisher-name>MIT press</publisher-name>.</citation></ref>
<ref id="ref48"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hamdy</surname> <given-names>W.</given-names></name> <name><surname>Al-Awamry</surname> <given-names>A.</given-names></name> <name><surname>Mostafa</surname> <given-names>N.</given-names></name></person-group> (<year>2022</year>). <article-title>Warehousing 4.0: a proposed system of using node-red for applying internet of things in warehousing. Sustainable</article-title>. <source>Futures</source> <volume>4</volume>:<fpage>100069</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.sftr.2022.100069</pub-id></citation></ref>
<ref id="ref49"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Han</surname> <given-names>C.</given-names></name> <name><surname>Zhang</surname> <given-names>Q.</given-names></name></person-group> (<year>2021</year>). <article-title>Optimization of supply chain efficiency management based on machine learning and neural network</article-title>. <source>Neural Comput. &#x0026; Applic.</source> <volume>33</volume>, <fpage>1419</fpage>&#x2013;<lpage>1433</lpage>. doi: <pub-id pub-id-type="doi">10.1007/s00521-020-05023-1</pub-id></citation></ref>
<ref id="ref50"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Haq</surname> <given-names>A. U.</given-names></name> <name><surname>Li</surname> <given-names>J. P.</given-names></name> <name><surname>Memon</surname> <given-names>M. H.</given-names></name> <name><surname>Nazir</surname> <given-names>S.</given-names></name> <name><surname>Sun</surname> <given-names>R.</given-names></name></person-group> (<year>2018</year>). <article-title>A hybrid intelligent system framework for the prediction of heart disease using machine learning algorithms</article-title>. <source>Mob. Inf. Syst.</source> <volume>2018</volume>, <fpage>1</fpage>&#x2013;<lpage>21</lpage>. doi: <pub-id pub-id-type="doi">10.1155/2018/3860146</pub-id></citation></ref>
<ref id="ref51"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ho</surname> <given-names>W.</given-names></name> <name><surname>Zheng</surname> <given-names>T.</given-names></name> <name><surname>Yildiz</surname> <given-names>H.</given-names></name> <name><surname>Talluri</surname> <given-names>S.</given-names></name></person-group> (<year>2015</year>). <article-title>Supply chain risk management: a literature review</article-title>. <source>Int. J. Prod. Res.</source> <volume>53</volume>, <fpage>5031</fpage>&#x2013;<lpage>5069</lpage>. doi: <pub-id pub-id-type="doi">10.1080/00207543.2015.1030467</pub-id></citation></ref>
<ref id="ref52"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Holt</surname> <given-names>D.</given-names></name> <name><surname>Gobadian</surname> <given-names>A.</given-names></name></person-group> (<year>2009</year>). <article-title>An empirical study of green supply chain management practices amongst UK manufacturers</article-title>. <source>J. Manuf. Technol. Manag.</source> <volume>20</volume>, <fpage>933</fpage>&#x2013;<lpage>956</lpage>. doi: <pub-id pub-id-type="doi">10.1108/17410380910984212</pub-id></citation></ref>
<ref id="ref53"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hosseini</surname> <given-names>A.</given-names></name></person-group> (<year>2007</year>). <article-title>Identification of green management of system&#x2019;s factors: a conceptualized model</article-title>. <source>Int. J. Manag. Sci. Eng. Manag.</source> <volume>2</volume>, <fpage>221</fpage>&#x2013;<lpage>228</lpage>. doi: <pub-id pub-id-type="doi">10.1080/17509653.2007.10671022</pub-id></citation></ref>
<ref id="ref54"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Huang</surname> <given-names>Y.</given-names></name> <name><surname>Yuan</surname> <given-names>Y.</given-names></name> <name><surname>Chen</surname> <given-names>H.</given-names></name> <name><surname>Wang</surname> <given-names>J.</given-names></name> <name><surname>Guo</surname> <given-names>Y.</given-names></name> <name><surname>Ahmad</surname> <given-names>T.</given-names></name></person-group> (<year>2019</year>). <article-title>A novel energy demand prediction strategy for residential buildings based on ensemble training</article-title>. <source>Energy Procedia</source> <volume>158</volume>, <fpage>3411</fpage>&#x2013;<lpage>3416</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.egypro.2019.01.935</pub-id></citation></ref>
<ref id="ref55"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Huber</surname> <given-names>J.</given-names></name> <name><surname>Stuckenschmidt</surname> <given-names>H.</given-names></name></person-group> (<year>2020</year>). <article-title>Daily retail demand forecasting using machine learning with an emphasis on calendric special days</article-title>. <source>Int. J. Forecast.</source> <volume>36</volume>, <fpage>1420</fpage>&#x2013;<lpage>1438</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.ijforecast.2020.02.005</pub-id></citation></ref>
<ref id="ref56"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Ibrahim</surname> <given-names>A.</given-names></name></person-group> (<year>2021</year>). &#x201C;Forecasting the early market movement in bitcoin using twitter's sentiment analysis: an ensemble-based prediction model,&#x201D; in <italic>2021 IEEE international IOT, electronics and mechatronics conference (IEMTRONICS)</italic> (pp. 1&#x2013;5). IEEE.</citation></ref>
<ref id="ref57"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Izadyar</surname> <given-names>N.</given-names></name> <name><surname>Ong</surname> <given-names>H.</given-names></name> <name><surname>Shamshirband</surname> <given-names>S.</given-names></name> <name><surname>Ghadamian</surname> <given-names>H.</given-names></name> <name><surname>Tong</surname> <given-names>C.</given-names></name></person-group> (<year>2015</year>). <article-title>Intelligent forecasting of residential heating demand for the district heating system based on the monthly overall natural gas consumption</article-title>. <source>Energ. Buildings</source> <volume>104</volume>, <fpage>208</fpage>&#x2013;<lpage>214</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.enbuild.2015.07.006</pub-id></citation></ref>
<ref id="ref58"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ji</surname> <given-names>L.</given-names></name> <name><surname>Zou</surname> <given-names>Y.</given-names></name> <name><surname>He</surname> <given-names>K.</given-names></name> <name><surname>Zhu</surname> <given-names>B.</given-names></name></person-group> (<year>2019</year>). <article-title>Carbon futures price forecasting based with ARIMA-CNN-LSTM model</article-title>. <source>Procedia Computer Sci.</source> <volume>162</volume>, <fpage>33</fpage>&#x2013;<lpage>38</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.procs.2019.11.254</pub-id></citation></ref>
<ref id="ref59"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jordan</surname> <given-names>M. I.</given-names></name> <name><surname>Mitchell</surname> <given-names>T. M.</given-names></name></person-group> (<year>2015</year>). <article-title>Machine learning: trends, perspectives, and prospects</article-title>. <source>Science</source> <volume>349</volume>, <fpage>255</fpage>&#x2013;<lpage>260</lpage>. doi: <pub-id pub-id-type="doi">10.1126/science.aaa8415</pub-id>, PMID: <pub-id pub-id-type="pmid">26185243</pub-id></citation></ref>
<ref id="ref60"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kamble</surname> <given-names>S. S.</given-names></name> <name><surname>Gunasekaran</surname> <given-names>A.</given-names></name> <name><surname>Gawankar</surname> <given-names>S. A.</given-names></name></person-group> (<year>2020</year>). <article-title>Achieving sustainable performance in a data-driven agriculture supply chain: a review for research and applications</article-title>. <source>Int. J. Prod. Econ.</source> <volume>219</volume>, <fpage>179</fpage>&#x2013;<lpage>194</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.ijpe.2019.05.022</pub-id></citation></ref>
<ref id="ref61"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kamble</surname> <given-names>S. S.</given-names></name> <name><surname>Gunasekaran</surname> <given-names>A.</given-names></name> <name><surname>Parekh</surname> <given-names>H.</given-names></name> <name><surname>Joshi</surname> <given-names>S.</given-names></name></person-group> (<year>2019a</year>). <article-title>Modeling the internet of things adoption barriers in food retail supply chains</article-title>. <source>J. Retail. Consum. Serv.</source> <volume>48</volume>, <fpage>154</fpage>&#x2013;<lpage>168</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.jretconser.2019.02.020</pub-id></citation></ref>
<ref id="ref62"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kamble</surname> <given-names>S. S.</given-names></name> <name><surname>Gunasekaran</surname> <given-names>A.</given-names></name> <name><surname>Parekh</surname> <given-names>H.</given-names></name> <name><surname>Mani</surname> <given-names>V.</given-names></name> <name><surname>Belhadi</surname> <given-names>A.</given-names></name> <name><surname>Sharma</surname> <given-names>R.</given-names></name></person-group> (<year>2022</year>). <article-title>Digital twin for sustainable manufacturing supply chains: current trends, future perspectives, and an implementation framework</article-title>. <source>Technol. Forecast. Soc. Chang.</source> <volume>176</volume>:<fpage>121448</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.techfore.2021.121448</pub-id></citation></ref>
<ref id="ref63"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kamble</surname> <given-names>S. S.</given-names></name> <name><surname>Gunasekaran</surname> <given-names>A.</given-names></name> <name><surname>Sharma</surname> <given-names>R.</given-names></name></person-group> (<year>2019</year>). <article-title>Modeling the blockchain-enabled traceability in agriculture supply chain</article-title>. <source>Int. J. Inf. Manag.</source> <volume>52</volume>:<fpage>101967</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.ijinfomgt.2019.05.023</pub-id></citation></ref>
<ref id="ref64"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Kazemi</surname> <given-names>Y.</given-names></name></person-group> (<year>2019</year>). AI, big data &#x0026; advanced analytics in the supply chain. Available at: <ext-link xlink:href="https://www.forbes.com/sites/yasamankazemi/2019/01/29/ai-big-data-advanced-analytics-in-the-supply-chain/#75db62f4244f" ext-link-type="uri">https://www.forbes.com/sites/yasamankazemi/2019/01/29/ai-big-data-advanced-analytics-in-the-supply-chain/#75db62f4244f</ext-link>.</citation></ref>
<ref id="ref65"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Khalid</surname> <given-names>W.</given-names></name> <name><surname>Herbert-Hansen</surname> <given-names>Z. N. L.</given-names></name></person-group> (<year>2018</year>). <article-title>Using k-means clustering in international location decision</article-title>. <source>J. Global Operations and Strategic Sourcing</source> <volume>11</volume>, <fpage>274</fpage>&#x2013;<lpage>300</lpage>. doi: <pub-id pub-id-type="doi">10.1108/JGOSS-11-2017-0056</pub-id></citation></ref>
<ref id="ref66"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Klar</surname> <given-names>M.</given-names></name> <name><surname>Glatt</surname> <given-names>M.</given-names></name> <name><surname>Aurich</surname> <given-names>J. C.</given-names></name></person-group> (<year>2023</year>). <article-title>Performance comparison of reinforcement learning and metaheuristics for factory layout planning</article-title>. <source>CIRP J. Manuf. Sci. Technol.</source> <volume>45</volume>, <fpage>1755</fpage>&#x2013;<lpage>5817</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.cirpj.2023.05.008</pub-id></citation></ref>
<ref id="ref67"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Konovalenko</surname> <given-names>I.</given-names></name> <name><surname>Ludwig</surname> <given-names>A.</given-names></name></person-group> (<year>2019</year>). <article-title>Event processing in supply chain management&#x2013;the status quo and research outlook</article-title>. <source>Comput. Ind.</source> <volume>105</volume>, <fpage>229</fpage>&#x2013;<lpage>249</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.compind.2018.12.009</pub-id></citation></ref>
<ref id="ref68"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kov&#x00E1;cs</surname> <given-names>G.</given-names></name> <name><surname>Kot</surname> <given-names>S.</given-names></name></person-group> (<year>2016</year>). <article-title>New logistics and production trends as the effect of global economy changes</article-title>. <source>Pol. J. Manag. Stud.</source> <volume>14</volume>, <fpage>115</fpage>&#x2013;<lpage>126</lpage>. doi: <pub-id pub-id-type="doi">10.17512/pjms.2016.14.2.11</pub-id></citation></ref>
<ref id="ref69"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kraus</surname> <given-names>M.</given-names></name> <name><surname>Feuerriegel</surname> <given-names>S.</given-names></name> <name><surname>Oztekin</surname> <given-names>A.</given-names></name></person-group> (<year>2020</year>). <article-title>Deep learning in business analytics and operations research: models, applications and managerial implications</article-title>. <source>Eur. J. Oper. Res.</source> <volume>281</volume>, <fpage>628</fpage>&#x2013;<lpage>641</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.ejor.2019.09.018</pub-id></citation></ref>
<ref id="ref70"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lee</surname> <given-names>J.</given-names></name> <name><surname>Davari</surname> <given-names>H.</given-names></name> <name><surname>Singh</surname> <given-names>J.</given-names></name> <name><surname>Pandhare</surname> <given-names>V.</given-names></name></person-group> (<year>2018</year>). <article-title>Industrial artificial intelligence for industry 4.0-based manufacturing systems</article-title>. <source>Manufacturing letters</source> <volume>18</volume>, <fpage>20</fpage>&#x2013;<lpage>23</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.mfglet.2018.09.002</pub-id></citation></ref>
<ref id="ref71"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Leung</surname> <given-names>M. K.</given-names></name> <name><surname>Xiong</surname> <given-names>H. Y.</given-names></name> <name><surname>Lee</surname> <given-names>L. J.</given-names></name> <name><surname>Frey</surname> <given-names>B. J.</given-names></name></person-group> (<year>2014</year>). <article-title>Deep learning of the tissue-regulated splicing code</article-title>. <source>Bioinformatics</source> <volume>30</volume>, <fpage>i121</fpage>&#x2013;<lpage>i129</lpage>. doi: <pub-id pub-id-type="doi">10.1093/bioinformatics/btu277</pub-id>, PMID: <pub-id pub-id-type="pmid">24931975</pub-id></citation></ref>
<ref id="ref72"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lin</surname> <given-names>H.</given-names></name> <name><surname>Lin</surname> <given-names>J.</given-names></name> <name><surname>Wang</surname> <given-names>F.</given-names></name></person-group> (<year>2022</year>). <article-title>An innovative machine learning model for supply chain management</article-title>. <source>J. Innov. Knowl.</source> <volume>7</volume>:<fpage>100276</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.jik.2022.100276</pub-id></citation></ref>
<ref id="ref73"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>C.</given-names></name></person-group> (<year>2022</year>). <article-title>Risk prediction of digital transformation of manufacturing supply chain based on principal component analysis and backpropagation artificial neural network</article-title>. <source>Alex. Eng. J.</source> <volume>61</volume>, <fpage>775</fpage>&#x2013;<lpage>784</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.aej.2021.06.010</pub-id></citation></ref>
<ref id="ref74"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>T.</given-names></name> <name><surname>Xu</surname> <given-names>C.</given-names></name> <name><surname>Guo</surname> <given-names>Y.</given-names></name> <name><surname>Chen</surname> <given-names>H.</given-names></name></person-group> (<year>2019</year>). <article-title>A novel deep reinforcement learning based methodology for short term HVAC system energy consumption prediction</article-title>. <source>Int. J. Refrig.</source> <volume>107</volume>, <fpage>39</fpage>&#x2013;<lpage>51</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.ijrefrig.2019.07.018</pub-id></citation></ref>
<ref id="ref75"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>X.</given-names></name> <name><surname>Yang</surname> <given-names>J.</given-names></name> <name><surname>Qu</surname> <given-names>S.</given-names></name> <name><surname>Wang</surname> <given-names>L.</given-names></name> <name><surname>Shishime</surname> <given-names>T.</given-names></name> <name><surname>Bao</surname> <given-names>C.</given-names></name></person-group> (<year>2012</year>). <article-title>Sustainable production: practices and determinant factors of green supply chain management of Chinese companies</article-title>. <source>Bus. Strateg. Environ.</source> <volume>21</volume>, <fpage>1</fpage>&#x2013;<lpage>16</lpage>. doi: <pub-id pub-id-type="doi">10.1002/bse.705</pub-id></citation></ref>
<ref id="ref76"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lunardi</surname> <given-names>A. R.</given-names></name> <name><surname>Lima Junior</surname> <given-names>F. R.</given-names></name></person-group> (<year>2021</year>). <article-title>Comparison of artificial neural networks learning methods to evaluate supply chain performance</article-title>. <source>Gest&#x00E3;o &#x0026; Produ&#x00E7;&#x00E3;o</source> <volume>28</volume>:<fpage>e5450</fpage>. doi: <pub-id pub-id-type="doi">10.1590/1806-9649-2021v28e5450</pub-id></citation></ref>
<ref id="ref77"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ma</surname> <given-names>J.</given-names></name> <name><surname>Sheridan</surname> <given-names>R. P.</given-names></name> <name><surname>Liaw</surname> <given-names>A.</given-names></name> <name><surname>Dahl</surname> <given-names>G. E.</given-names></name> <name><surname>Svetnik</surname> <given-names>V.</given-names></name></person-group> (<year>2015</year>). <article-title>Deep neural nets as a method for quantitative structure-activity relationships</article-title>. <source>J. Chem. Inf. Model.</source> <volume>55</volume>, <fpage>263</fpage>&#x2013;<lpage>274</lpage>. doi: <pub-id pub-id-type="doi">10.1021/ci500747n</pub-id>, PMID: <pub-id pub-id-type="pmid">25635324</pub-id></citation></ref>
<ref id="ref78"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Makkar</surname> <given-names>S.</given-names></name> <name><surname>Devi</surname> <given-names>G. N. R.</given-names></name> <name><surname>Solanki</surname> <given-names>V. K.</given-names></name></person-group> (<year>2020</year>). &#x201C;<article-title>Applications of machine learning techniques in supply chain optimization</article-title>&#x201D; in <source>ICICCT 2019&#x2013;system reliability, quality control, safety, maintenance and management: Applications to electrical, electronics and computer science and engineering</source>. Eds. <person-group person-group-type="editor"><name><surname>Gunjan</surname> <given-names>V.</given-names></name> <name><surname>Diaz</surname> <given-names>V. Garcia</given-names></name> <name><surname>Cardona</surname> <given-names>M.</given-names></name> <name><surname>Solanki</surname> <given-names>V.</given-names></name> <name><surname>Sunitha</surname> <given-names>K.</given-names></name></person-group> (<publisher-loc>Singapore</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>861</fpage>&#x2013;<lpage>869</lpage>.</citation></ref>
<ref id="ref79"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Malviya</surname> <given-names>L.</given-names></name> <name><surname>Chittora</surname> <given-names>P.</given-names></name> <name><surname>Chakrabarti</surname> <given-names>P.</given-names></name> <name><surname>Vyas</surname> <given-names>R. S.</given-names></name> <name><surname>Poddar</surname> <given-names>S.</given-names></name></person-group> (<year>2021</year>). <article-title>Backorder prediction in the supply chain using machine learning</article-title>. <source>Materials Today: Proceed.</source> <volume>2021</volume>:<fpage>558</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.matpr.2020.11.558</pub-id></citation></ref>
<ref id="ref80"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mikolov</surname> <given-names>T.</given-names></name> <name><surname>Deoras</surname> <given-names>A.</given-names></name> <name><surname>Povey</surname> <given-names>D.</given-names></name> <name><surname>Burget</surname> <given-names>L.</given-names></name> <name><surname>Cernocky</surname> <given-names>J.</given-names></name></person-group> (<year>2011</year>). <article-title>Strategies for training large scale neural network language models</article-title>. <source>Proc. Automatic Speech Recog. Understand.</source>, <fpage>196</fpage>&#x2013;<lpage>201</lpage>. doi: <pub-id pub-id-type="doi">10.1109/ASRU.2011.6163930</pub-id></citation></ref>
<ref id="ref81"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Misic</surname> <given-names>V. V.</given-names></name> <name><surname>Perakis</surname> <given-names>G.</given-names></name></person-group> (<year>2020</year>). <article-title>Data analytics in operations management: a review</article-title>. <source>Manuf. Serv. Oper. Manag.</source> <volume>22</volume>, <fpage>158</fpage>&#x2013;<lpage>169</lpage>. doi: <pub-id pub-id-type="doi">10.1287/msom.2019.0805</pub-id></citation></ref>
<ref id="ref82"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Mitra</surname> <given-names>A.</given-names></name> <name><surname>Jain</surname> <given-names>A.</given-names></name> <name><surname>Kishore</surname> <given-names>A.</given-names></name> <name><surname>Kumar</surname> <given-names>P.</given-names></name></person-group> (<year>2023</year>). &#x201C;<article-title>A comparative study for machine learning models in retail demand forecasting</article-title>&#x201D; in <source>Human-centric smart computing. Smart innovation, systems and technologies</source>. eds. <person-group person-group-type="editor"><name><surname>Bhattacharyya</surname> <given-names>S.</given-names></name> <name><surname>Banerjee</surname> <given-names>J. S.</given-names></name> <name><surname>K&#x00F6;ppen</surname> <given-names>M.</given-names></name></person-group>, vol. <volume>316</volume> (<publisher-loc>Singapore</publisher-loc>: <publisher-name>Springer</publisher-name>).</citation></ref>
<ref id="ref83"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Montufar</surname> <given-names>G. F.</given-names></name> <name><surname>Pascanu</surname> <given-names>R.</given-names></name> <name><surname>Cho</surname> <given-names>K.</given-names></name> <name><surname>Bengio</surname> <given-names>Y.</given-names></name></person-group> (<year>2014</year>). <article-title>On the number of linear regions of deep neural networks</article-title>. <source>Proc. Adv. Neural Inf. Proces. Syst.</source> <volume>27</volume>, <fpage>2924</fpage>&#x2013;<lpage>2932</lpage>.</citation></ref>
<ref id="ref84"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mudgal</surname> <given-names>R. K.</given-names></name> <name><surname>Shankar</surname> <given-names>R.</given-names></name> <name><surname>Talib</surname> <given-names>P.</given-names></name> <name><surname>Raj</surname> <given-names>T.</given-names></name></person-group> (<year>2009</year>). <article-title>Greening the supply chain practices: an Indian perspective of enablers&#x2019; relationship</article-title>. <source>Int. J. Adv. Oper. Manag.</source> <volume>1</volume>, <fpage>151</fpage>&#x2013;<lpage>176</lpage>. doi: <pub-id pub-id-type="doi">10.1504/IJAOM.2009.030671</pub-id></citation></ref>
<ref id="ref85"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Nagar</surname> <given-names>D.</given-names></name> <name><surname>Raghav</surname> <given-names>S.</given-names></name> <name><surname>Bhardwaj</surname> <given-names>A.</given-names></name> <name><surname>Kumar</surname> <given-names>R.</given-names></name> <name><surname>Singh</surname> <given-names>P. L.</given-names></name> <name><surname>Sindhwani</surname> <given-names>R.</given-names></name></person-group> (<year>2021</year>). <article-title>Machine learning: Best way to sustain the supply chain in the era of industry 4.0</article-title>. <source>Materials Today: Proceed.</source>. <volume>47</volume>, <fpage>3676</fpage>&#x2013;<lpage>3682</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.matpr.2021.01.267</pub-id></citation></ref>
<ref id="ref86"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Najjartabar Bisheh</surname> <given-names>M.</given-names></name> <name><surname>Nasiri</surname> <given-names>G. R.</given-names></name> <name><surname>Esmaeili</surname> <given-names>E.</given-names></name> <name><surname>Davoudpour</surname> <given-names>H.</given-names></name> <name><surname>Chang</surname> <given-names>S. I.</given-names></name></person-group> (<year>2022</year>). <article-title>A new supply chain distribution network design for two classes of customers using transfer recurrent neural network</article-title>. <source>Int. J. Syst. Assur. Eng. Manag.</source> <volume>13</volume>, <fpage>2604</fpage>&#x2013;<lpage>2618</lpage>. doi: <pub-id pub-id-type="doi">10.1007/s13198-022-01670-w</pub-id></citation></ref>
<ref id="ref87"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Neethu</surname> <given-names>M. S.</given-names></name> <name><surname>Rajasree</surname> <given-names>R.</given-names></name></person-group> (<year>2013</year>). "Sentiment analysis in twitter using machine learning techniques," in <italic>2013 fourth international conference on computing, communications and networking technologies (ICCCNT)</italic>, (Tiruchengode, India: IEEE Access) pp. <fpage>1</fpage>&#x2013;<lpage>5</lpage>.</citation></ref>
<ref id="ref88"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ni</surname> <given-names>D.</given-names></name> <name><surname>Xiao</surname> <given-names>Z.</given-names></name> <name><surname>Lim</surname> <given-names>M. K.</given-names></name></person-group> (<year>2020</year>). <article-title>A systematic review of the research trends of machine learning in supply chain management</article-title>. <source>Int. J. Mach. Learn. Cybern.</source> <volume>11</volume>, <fpage>1463</fpage>&#x2013;<lpage>1482</lpage>. doi: <pub-id pub-id-type="doi">10.1007/s13042-019-01050-0</pub-id></citation></ref>
<ref id="ref89"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Nie</surname> <given-names>H.</given-names></name> <name><surname>Liu</surname> <given-names>G.</given-names></name> <name><surname>Liu</surname> <given-names>X.</given-names></name> <name><surname>Wang</surname> <given-names>Y.</given-names></name></person-group> (<year>2012</year>). <article-title>Hybrid of ARIMA and SVMs for short-term load forecasting</article-title>. <source>Energy Procedia</source> <volume>16</volume>, <fpage>1455</fpage>&#x2013;<lpage>1460</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.egypro.2012.01.229</pub-id></citation></ref>
<ref id="ref90"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pan</surname> <given-names>S.</given-names></name> <name><surname>Zhang</surname> <given-names>L.</given-names></name> <name><surname>Thompson</surname> <given-names>R. G.</given-names></name> <name><surname>Ghaderi</surname> <given-names>H.</given-names></name></person-group> (<year>2021</year>). <article-title>A parcel network flow approach for joint delivery networks using parcel lockers</article-title>. <source>Int. J. Prod. Res.</source>. <volume>59</volume>, <fpage>2090</fpage>&#x2013;<lpage>2115</lpage>. doi: <pub-id pub-id-type="doi">10.1080/00207543.2020.1856440</pub-id></citation></ref>
<ref id="ref91"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Panda</surname> <given-names>S. K.</given-names></name> <name><surname>Mohanty</surname> <given-names>S. N.</given-names></name></person-group> (<year>2023</year>). <source>Time series forecasting and modelling of food demand supply chain based on regressors analysis</source>, vol. <volume>11</volume>. <publisher-name>IEEE Access</publisher-name>, <fpage>42679</fpage>&#x2013;<lpage>42700</lpage>.</citation></ref>
<ref id="ref92"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Pant</surname> <given-names>D. R.</given-names></name> <name><surname>Neupane</surname> <given-names>P.</given-names></name> <name><surname>Poudel</surname> <given-names>A.</given-names></name> <name><surname>Pokhrel</surname> <given-names>A. K.</given-names></name> <name><surname>Lama</surname> <given-names>B. K.</given-names></name></person-group> (<year>2018</year>). &#x201C;Recurrent neural network-based bitcoin price prediction by twitter sentiment analysis,&#x201D; in <italic>2018 IEEE 3rd international conference on computing, communication and security (ICCCS)</italic> (pp. 128&#x2013;132). IEEE.</citation></ref>
<ref id="ref93"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Park</surname> <given-names>K. J.</given-names></name></person-group> (<year>2021</year>). <article-title>Determining the tiers of a supply chain using machine learning algorithms</article-title>. <source>Symmetry</source> <volume>13</volume>:<fpage>1934</fpage>. doi: <pub-id pub-id-type="doi">10.3390/sym13101934</pub-id></citation></ref>
<ref id="ref94"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pelletier</surname> <given-names>N.</given-names></name> <name><surname>Tyedmers</surname> <given-names>P.</given-names></name></person-group> (<year>2010</year>). <article-title>Forecasting potential global environmental costs of livestock production 2000&#x2013;2050</article-title>. <source>Proc. Natl. Acad. Sci.</source> <volume>107</volume>, <fpage>18371</fpage>&#x2013;<lpage>18374</lpage>. doi: <pub-id pub-id-type="doi">10.1073/pnas.1004659107</pub-id>, PMID: <pub-id pub-id-type="pmid">20921375</pub-id></citation></ref>
<ref id="ref9002"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Peng</surname> <given-names>J.</given-names></name> <name><surname>Jury</surname> <given-names>E. C.</given-names></name> <name><surname>D&#x00F6;nnes</surname> <given-names>P.</given-names></name> <name><surname>Ciurtin</surname> <given-names>C.</given-names></name></person-group> (<year>2021</year>). <article-title>Machine learning techniques for personalised medicine approaches in immune-mediated chronic inflammatory diseases: applications and challenges</article-title>. <source>Front. Pharmacol.</source> <volume>12</volume>:<fpage>720694</fpage>.</citation></ref>
<ref id="ref95"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Perera</surname> <given-names>N.</given-names></name> <name><surname>Fahimnia</surname> <given-names>B.</given-names></name> <name><surname>Tokar</surname> <given-names>T.</given-names></name></person-group> (<year>2020</year>). <article-title>Inventory and order decisions: a systematic review on research driven through behavioral experiments</article-title>. <source>Int. J. Oper. Prod. Manag.</source> <volume>40</volume>, <fpage>997</fpage>&#x2013;<lpage>1039</lpage>. doi: <pub-id pub-id-type="doi">10.1108/IJOPM-05-2019-0339</pub-id></citation></ref>
<ref id="ref96"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Peres</surname> <given-names>R. S.</given-names></name> <name><surname>Jia</surname> <given-names>X.</given-names></name> <name><surname>Lee</surname> <given-names>J.</given-names></name> <name><surname>Sun</surname> <given-names>K.</given-names></name> <name><surname>Colombo</surname> <given-names>A. W.</given-names></name> <name><surname>Barata</surname> <given-names>J.</given-names></name></person-group> (<year>2020</year>). <article-title>Industrial artificial intelligence in industry 4.0-systematic review, challenges and outlook</article-title>. <source>IEEE Access</source> <volume>8</volume>, <fpage>220121</fpage>&#x2013;<lpage>220139</lpage>. doi: <pub-id pub-id-type="doi">10.1109/ACCESS.2020.3042874</pub-id></citation></ref>
<ref id="ref97"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pournader</surname> <given-names>M.</given-names></name> <name><surname>Ghaderi</surname> <given-names>H.</given-names></name> <name><surname>Hassanzadegan</surname> <given-names>A.</given-names></name> <name><surname>Fahimnia</surname> <given-names>B.</given-names></name></person-group> (<year>2021</year>). <article-title>Artificial intelligence applications in supply chain management</article-title>. <source>Int. J. Prod. Econ.</source> <volume>241</volume>:<fpage>108250</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.ijpe.2021.108250</pub-id></citation></ref>
<ref id="ref98"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pournader</surname> <given-names>M.</given-names></name> <name><surname>Kach</surname> <given-names>A.</given-names></name> <name><surname>Talluri</surname> <given-names>S.</given-names></name></person-group> (<year>2020a</year>). <article-title>A review of the existing and emerging topics in the supply chain risk management literature</article-title>. <source>Decis. Sci. J.</source> <volume>51</volume>, <fpage>867</fpage>&#x2013;<lpage>919</lpage>. doi: <pub-id pub-id-type="doi">10.1111/deci.12470</pub-id>, PMID: <pub-id pub-id-type="pmid">34234385</pub-id></citation></ref>
<ref id="ref99"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pournader</surname> <given-names>M.</given-names></name> <name><surname>Shi</surname> <given-names>Y.</given-names></name> <name><surname>Seuring</surname> <given-names>S.</given-names></name> <name><surname>Koh</surname> <given-names>S. C. L.</given-names></name></person-group> (<year>2020b</year>). <article-title>Blockchain applications in supply chains, transport and logistics: a systematic review of the literature</article-title>. <source>Int. J. Prod. Res.</source> <volume>58</volume>, <fpage>2063</fpage>&#x2013;<lpage>2081</lpage>. doi: <pub-id pub-id-type="doi">10.1080/00207543.2019.1650976</pub-id></citation></ref>
<ref id="ref100"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Prifti</surname> <given-names>V.</given-names></name> <name><surname>Sinoimeri</surname> <given-names>D.</given-names></name> <name><surname>Lazaj</surname> <given-names>A.</given-names></name> <name><surname>Dini</surname> <given-names>B.</given-names></name> <name><surname>Luniku</surname> <given-names>K.</given-names></name></person-group> (<year>2024</year>). &#x201C;Using &#x2018;machine learning&#x2019; techniques in increasing the efficiency of sales forecasting in Albania,&#x201D; In: <person-group person-group-type="editor"><name><surname>Guxho</surname> <given-names>G.</given-names></name> <name><surname>Kosova Spahiu</surname> <given-names>T.</given-names></name> <name><surname>Prifti</surname> <given-names>V.</given-names></name> <name><surname>Gjeta</surname> <given-names>A.</given-names></name> <name><surname>Xhafka</surname> <given-names>E.</given-names></name> <name><surname>Sulejmani</surname> <given-names>A</given-names></name></person-group>. (eds) Proceedings of the <italic>joint international conference: 10th textile conference and 4th conference on engineering and entrepreneurship. ITC-ICEE 2023</italic>. Lecture Notes on Multidisciplinary Industrial Engineering. Springer, Cham.</citation></ref>
<ref id="ref101"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Prifti</surname> <given-names>V.</given-names></name> <name><surname>Sinoimeri</surname> <given-names>D.</given-names></name> <name><surname>Lazaj</surname> <given-names>A.</given-names></name> <name><surname>Keci</surname> <given-names>J.</given-names></name></person-group> (<year>2023</year>). <article-title>Impact of the information systems and technology on enterprises</article-title>. <source>J. Integr. Eng. Appl. Sci.</source> <volume>1</volume>, <fpage>23</fpage>&#x2013;<lpage>31</lpage>. doi: <pub-id pub-id-type="doi">10.5281/zenodo.10655748</pub-id></citation></ref>
<ref id="ref102"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Priore</surname> <given-names>P.</given-names></name> <name><surname>Ponte</surname> <given-names>B.</given-names></name> <name><surname>Rosillo</surname> <given-names>R.</given-names></name> <name><surname>de la Fuente</surname> <given-names>D.</given-names></name></person-group> (<year>2019</year>). <article-title>Applying machine learning to the dynamic selection of replenishment policies in fast-changing supply chain environments</article-title>. <source>Int. J. Prod. Res.</source> <volume>11</volume>, <fpage>3663</fpage>&#x2013;<lpage>3677</lpage>. doi: <pub-id pub-id-type="doi">10.1080/00207543.2018.1552369</pub-id></citation></ref>
<ref id="ref103"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Raina</surname> <given-names>R.</given-names></name> <name><surname>Madhavan</surname> <given-names>A.</given-names></name> <name><surname>Ng</surname> <given-names>A. Y.</given-names></name></person-group> (<year>2009</year>). &#x201C;Large-scale deep unsupervised learning using graphics processors,&#x201D; in <italic>Proc. 26th annual international conference on machine learning</italic>. 873&#x2013;880.</citation></ref>
<ref id="ref104"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Read</surname> <given-names>Q. D.</given-names></name> <name><surname>Muth</surname> <given-names>M. K.</given-names></name></person-group> (<year>2021</year>). <article-title>Cost-effectiveness of four food waste interventions: is food waste reduction a &#x201C;win&#x2013;win?&#x201D;</article-title>. <source>Resour. Conserv. Recycl.</source> <volume>168</volume>:<fpage>105448</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.resconrec.2021.105448</pub-id></citation></ref>
<ref id="ref105"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Rehman</surname> <given-names>T. U.</given-names></name> <name><surname>Mahmud</surname> <given-names>M. S.</given-names></name> <name><surname>Chang</surname> <given-names>Y. K.</given-names></name> <name><surname>Jin</surname> <given-names>J.</given-names></name> <name><surname>Shin</surname> <given-names>J.</given-names></name></person-group> (<year>2019</year>). <article-title>Current and future applications of statistical machine learning algorithms for agricultural machine vision systems</article-title>. <source>Comput. Electron. Agric.</source> <volume>156</volume>, <fpage>585</fpage>&#x2013;<lpage>605</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.compag.2018.12.006</pub-id></citation></ref>
<ref id="ref106"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Rico-Fern&#x00E1;ndez</surname> <given-names>M. P.</given-names></name> <name><surname>Rios-Cabrera</surname> <given-names>R.</given-names></name> <name><surname>Castel&#x00E1;n</surname> <given-names>M.</given-names></name> <name><surname>Guerrero-Reyes</surname> <given-names>H. I.</given-names></name> <name><surname>Juarez-Maldonado</surname> <given-names>A.</given-names></name></person-group> (<year>2019</year>). <article-title>A contextualized approach for segmentation of foliage in different crop species</article-title>. <source>Comput. Electron. Agric.</source> <volume>156</volume>, <fpage>378</fpage>&#x2013;<lpage>386</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.compag.2018.11.033</pub-id></citation></ref>
<ref id="ref107"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Saghaei</surname> <given-names>M.</given-names></name> <name><surname>Ghaderi</surname> <given-names>H.</given-names></name> <name><surname>Soleimani</surname> <given-names>H.</given-names></name></person-group> (<year>2020</year>). <article-title>Design and optimization of biomass electricity supply chain with uncertainty in material quality, availability and market demand</article-title>. <source>Energy</source> <volume>197</volume>:<fpage>117165</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.energy.2020.117165</pub-id></citation></ref>
<ref id="ref108"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Salama</surname> <given-names>W. M.</given-names></name> <name><surname>Aly</surname> <given-names>M. H.</given-names></name> <name><surname>Abed</surname> <given-names>A. M.</given-names></name> <name><surname>Eladly</surname> <given-names>A.</given-names></name></person-group> (<year>2023</year>). <article-title>Efficiency marker evaluation based on optimized deep learning supported by Bayesian optimization technique</article-title>. <source>Textile Res. J. (TRJ).</source> <volume>93</volume>, <fpage>4273</fpage>&#x2013;<lpage>4289</lpage>. doi: <pub-id pub-id-type="doi">10.1177/00405175231171720</pub-id></citation></ref>
<ref id="ref109"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sameh Ibrahim</surname> <given-names>M.</given-names></name> <name><surname>Mansour</surname> <given-names>M. A. R.</given-names></name> <name><surname>Abed</surname> <given-names>A. M.</given-names></name></person-group> (<year>2011</year>). <article-title>Improve six-sigma management by forecasting production quantity using image verification quality tool</article-title>. <source>Int. J. Advan. Eng. Technol. (IJAET)</source> <volume>1</volume>, <fpage>332</fpage>&#x2013;<lpage>342</lpage>.</citation></ref>
<ref id="ref110"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sharma</surname> <given-names>R.</given-names></name> <name><surname>Kamble</surname> <given-names>S. S.</given-names></name> <name><surname>Gunasekaran</surname> <given-names>A.</given-names></name> <name><surname>Kumar</surname> <given-names>V.</given-names></name> <name><surname>Kumar</surname> <given-names>A.</given-names></name></person-group> (<year>2020</year>). <article-title>A systematic literature review on machine learning applications for sustainable agriculture supply chain performance</article-title>. <source>Comput. Oper. Res.</source> <volume>119</volume>:<fpage>104926</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.cor.2020.104926</pub-id></citation></ref>
<ref id="ref111"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sharma</surname> <given-names>M.</given-names></name> <name><surname>Mittal</surname> <given-names>N.</given-names></name> <name><surname>Mishra</surname> <given-names>A.</given-names></name> <name><surname>Gupta</surname> <given-names>A.</given-names></name></person-group> (<year>2023</year>). <article-title>Machine learning-based electricity load forecast for the agriculture sector</article-title>. <source>Int. J. Software Innovation (IJSI)</source> <volume>11</volume>, <fpage>1</fpage>&#x2013;<lpage>21</lpage>. doi: <pub-id pub-id-type="doi">10.4018/IJSI.315735</pub-id></citation></ref>
<ref id="ref112"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sheth</surname> <given-names>V.</given-names></name> <name><surname>Tripathi</surname> <given-names>U.</given-names></name> <name><surname>Sharma</surname> <given-names>A.</given-names></name></person-group> (<year>2022</year>). <article-title>A comparative analysis of machine learning algorithms for classification purpose</article-title>. <source>Procedia Computer Sci.</source> <volume>215</volume>, <fpage>422</fpage>&#x2013;<lpage>431</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.procs.2022.12.044</pub-id></citation></ref>
<ref id="ref113"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Shrestha</surname> <given-names>Y. R.</given-names></name> <name><surname>Krishna</surname> <given-names>V.</given-names></name> <name><surname>von Krogh</surname> <given-names>G.</given-names></name></person-group> (<year>2021</year>). <article-title>Augmenting organizational decision-making with deep learning algorithms: principles, promises, and challenges</article-title>. <source>J. Bus. Res.</source> <volume>123</volume>, <fpage>588</fpage>&#x2013;<lpage>603</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.jbusres.2020.09.068</pub-id></citation></ref>
<ref id="ref114"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Sin</surname> <given-names>E.</given-names></name> <name><surname>Wang</surname> <given-names>L.</given-names></name></person-group> (<year>2017</year>). &#x201C;Bitcoin price prediction using ensembles of neural networks,&#x201D; in 2017 <italic>13th international conference on natural computation, fuzzy systems and knowledge discovery (ICNC-FSKD)</italic> (pp. 666&#x2013;671). IEEE.</citation></ref>
<ref id="ref115"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Singh</surname> <given-names>A.</given-names></name> <name><surname>Shukla</surname> <given-names>N.</given-names></name> <name><surname>Mishra</surname> <given-names>N.</given-names></name></person-group> (<year>2018</year>). <article-title>Social media data analytics to improve supply chain management in food industries</article-title>. <source>Transportation Res. Part E: Logistics and Transportation Rev.</source> <volume>114</volume>, <fpage>398</fpage>&#x2013;<lpage>415</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.tre.2017.05.008</pub-id></citation></ref>
<ref id="ref116"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Singh</surname> <given-names>P. L.</given-names></name> <name><surname>Sindhwani</surname> <given-names>R.</given-names></name> <name><surname>Dua</surname> <given-names>N. K.</given-names></name> <name><surname>Jamwal</surname> <given-names>A.</given-names></name> <name><surname>Aggarwal</surname> <given-names>A.</given-names></name> <name><surname>Iqbal</surname> <given-names>A.</given-names></name> <etal/></person-group>. (<year>2019</year>). &#x201C;<article-title>Evaluation of common barriers to the combined lean-green-agile manufacturing system by two-way assessment method</article-title>&#x201D; in <source>Advances in industrial and production engineering</source> (<publisher-loc>Singapore</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>653</fpage>&#x2013;<lpage>672</lpage>.</citation></ref>
<ref id="ref117"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Srivastava</surname> <given-names>S. K.</given-names></name></person-group> (<year>2007</year>). <article-title>Green supply chain management: a state-of-the-art literature review</article-title>. <source>Int. J. Manag. Rev.</source> <volume>9</volume>, <fpage>53</fpage>&#x2013;<lpage>80</lpage>. doi: <pub-id pub-id-type="doi">10.1111/j.1468-2370.2007.00202.x</pub-id></citation></ref>
<ref id="ref118"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sun</surname> <given-names>X.</given-names></name> <name><surname>Liu</surname> <given-names>M.</given-names></name> <name><surname>Sima</surname> <given-names>Z.</given-names></name></person-group> (<year>2020</year>). <article-title>A novel cryptocurrency price trend forecasting model based on LightGBM</article-title>. <source>Financ. Res. Lett.</source> <volume>32</volume>:<fpage>101084</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.frl.2018.12.032</pub-id></citation></ref>
<ref id="ref119"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Sun</surname> <given-names>Y.</given-names></name> <name><surname>Tian</surname> <given-names>L</given-names></name></person-group>. (<year>2023</year>). &#x201C;Research on stock prediction based on LSTM and CatBoost algorithm,&#x201D; in <italic>Proceedings of the 2nd International Conference on Bigdata Blockchain and Economy Management, ICBBEM 2023, May 19&#x2013;21, 2023, Hangzhou, China</italic>.</citation></ref>
<ref id="ref120"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tirkolaee</surname> <given-names>E. B.</given-names></name> <name><surname>Sadeghi</surname> <given-names>S.</given-names></name> <name><surname>Mooseloo</surname> <given-names>F. M.</given-names></name> <name><surname>Vandchali</surname> <given-names>H. R.</given-names></name> <name><surname>Aeini</surname> <given-names>S.</given-names></name></person-group> (<year>2021</year>). <article-title>Application of machine learning in supply chain management: a comprehensive overview of the main areas</article-title>. <source>Math. Probl. Eng.</source> <volume>2021</volume>, <fpage>1</fpage>&#x2013;<lpage>14</lpage>. doi: <pub-id pub-id-type="doi">10.1155/2021/1476043</pub-id></citation></ref>
<ref id="ref121"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tompson</surname> <given-names>J.</given-names></name> <name><surname>Jain</surname> <given-names>A.</given-names></name> <name><surname>LeCun</surname> <given-names>Y.</given-names></name> <name><surname>Bregler</surname> <given-names>C.</given-names></name></person-group> (<year>2014</year>). <article-title>Joint training of a convolutional network and a graphical model for human pose estimation. In Proc</article-title>. <source>Adv. Neural Inf. Proces. Syst.</source> <volume>27</volume>, <fpage>1799</fpage>&#x2013;<lpage>1807</lpage>.</citation></ref>
<ref id="ref122"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Toorajipour</surname> <given-names>R.</given-names></name> <name><surname>Sohrabpour</surname> <given-names>V.</given-names></name> <name><surname>Nazarpour</surname> <given-names>A.</given-names></name> <name><surname>Oghazi</surname> <given-names>P.</given-names></name> <name><surname>Fischl</surname> <given-names>M.</given-names></name></person-group> (<year>2021</year>). <article-title>Artificial intelligence in supply chain management: a systematic literature review</article-title>. <source>J. Bus. Res.</source> <volume>122</volume>, <fpage>502</fpage>&#x2013;<lpage>517</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.jbusres.2020.09.009</pub-id></citation></ref>
<ref id="ref123"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Traore</surname> <given-names>B. B.</given-names></name> <name><surname>Kamsu-Foguem</surname> <given-names>B.</given-names></name> <name><surname>Tangara</surname> <given-names>F.</given-names></name></person-group> (<year>2017</year>). <article-title>Data mining techniques on satellite images for discovery of risk areas</article-title>. <source>Expert Syst. Appl.</source> <volume>72</volume>, <fpage>443</fpage>&#x2013;<lpage>456</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.eswa.2016.10.010</pub-id></citation></ref>
<ref id="ref124"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Trappey</surname> <given-names>A. J. C.</given-names></name> <name><surname>Trappey</surname> <given-names>C. V.</given-names></name> <name><surname>Wu</surname> <given-names>J.-L.</given-names></name> <name><surname>Wang</surname> <given-names>J. W. C.</given-names></name></person-group> (<year>2020</year>). <article-title>Intelligent compilation of patent summaries using machine learning and natural language processing techniques</article-title>. <source>Adv. Eng. Inform.</source> <volume>43</volume>:<fpage>101027</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.aei.2019.101027</pub-id></citation></ref>
<ref id="ref125"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Vairagade</surname> <given-names>N.</given-names></name> <name><surname>Logofatu</surname> <given-names>D.</given-names></name> <name><surname>Leon</surname> <given-names>F.</given-names></name> <name><surname>Muharemi</surname> <given-names>F.</given-names></name></person-group> (<year>2019</year>). &#x201C;<article-title>Demand forecasting using random Forest and artificial neural network for supply chain management</article-title>&#x201D; in <source>Computational collective intelligence. ICCCI 2019</source>. eds. <person-group person-group-type="editor"><name><surname>Nguyen</surname> <given-names>N.</given-names></name> <name><surname>Chbeir</surname> <given-names>R.</given-names></name> <name><surname>Exposito</surname> <given-names>E.</given-names></name> <name><surname>Aniort&#x00E9;</surname> <given-names>P.</given-names></name> <name><surname>Trawi&#x0144;ski</surname> <given-names>B.</given-names></name></person-group>, <series>Lecture Notes in Computer Science</series>, Vol. <volume>11683</volume> (<publisher-loc>Cham</publisher-loc>: <publisher-name>Springer</publisher-name>).</citation></ref>
<ref id="ref126"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Vandchali</surname> <given-names>H. R.</given-names></name> <name><surname>Cahoon</surname> <given-names>S.</given-names></name> <name><surname>Chen</surname> <given-names>S. L.</given-names></name></person-group> (<year>2021</year>). <article-title>The impact of power on the depth of sustainability collaboration in the supply chain network for Australian food retailers</article-title>. <source>Int. J. Procurement Manag.</source> <volume>14</volume>, <fpage>165</fpage>&#x2013;<lpage>184</lpage>. doi: <pub-id pub-id-type="doi">10.1504/IJPM.2021.113487</pub-id></citation></ref>
<ref id="ref127"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Vandchali</surname> <given-names>H. R.</given-names></name> <name><surname>Cahoon</surname> <given-names>S.</given-names></name> <name><surname>Chen</surname> <given-names>S.-L.</given-names></name></person-group> (<year>2021</year>). <article-title>The impact of supply chain network structure on relationship management strategies: an empirical investigation of sustainability practices in retailers</article-title>. <source>Sustain. Production Consump.</source> <volume>28</volume>, <fpage>281</fpage>&#x2013;<lpage>299</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.spc.2021.04.016</pub-id></citation></ref>
<ref id="ref128"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wamba</surname> <given-names>S. F.</given-names></name> <name><surname>Gunasekaran</surname> <given-names>A.</given-names></name> <name><surname>Akter</surname> <given-names>S.</given-names></name> <name><surname>Ren</surname> <given-names>S. J. F.</given-names></name> <name><surname>Dubey</surname> <given-names>R.</given-names></name> <name><surname>Childe</surname> <given-names>S. J.</given-names></name></person-group> (<year>2017</year>). <article-title>Big data analytics and firm performance: effects of dynamic capabilities</article-title>. <source>J. Bus. Res.</source> <volume>70</volume>, <fpage>356</fpage>&#x2013;<lpage>365</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.jbusres.2016.08.009</pub-id></citation></ref>
<ref id="ref129"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>L.</given-names></name> <name><surname>Jia</surname> <given-names>F.</given-names></name> <name><surname>Chen</surname> <given-names>L.</given-names></name> <name><surname>Xu</surname> <given-names>Q.</given-names></name></person-group> (<year>2023</year>). <article-title>Forecasting SMEs&#x2019; credit risk in supply chain finance with a sampling strategy based on machine learning techniques</article-title>. <source>Ann. Oper. Res.</source> <volume>331</volume>, <fpage>1</fpage>&#x2013;<lpage>33</lpage>. doi: <pub-id pub-id-type="doi">10.1007/s10479-022-04518-5</pub-id></citation></ref>
<ref id="ref130"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>D.</given-names></name> <name><surname>Zhang</surname> <given-names>Y.</given-names></name></person-group> (<year>2020</year>). <article-title>Implications for sustainability in supply chain management and the circular economy using machine learning model</article-title>. <source>IseB</source> <volume>21</volume>, <fpage>1</fpage>&#x2013;<lpage>13</lpage>. doi: <pub-id pub-id-type="doi">10.1007/s10257-020-00477-1</pub-id></citation></ref>
<ref id="ref131"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wenzel</surname> <given-names>H.</given-names></name> <name><surname>Smit</surname> <given-names>D.</given-names></name> <name><surname>Sardesai</surname> <given-names>S.</given-names></name></person-group> (<year>2019</year>). <article-title>Artificial intelligence and digital transformation in supply chain management: innovative approaches for supply chains</article-title>. <source>Proceed. Hamburg Inst.</source> <volume>27</volume>, <fpage>413</fpage>&#x2013;<lpage>441</lpage>. doi: <pub-id pub-id-type="doi">10.15480/882.2460</pub-id></citation></ref>
<ref id="ref132"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wichmann</surname> <given-names>P.</given-names></name> <name><surname>Brintrup</surname> <given-names>A.</given-names></name> <name><surname>Baker</surname> <given-names>S.</given-names></name> <name><surname>Woodall</surname> <given-names>P.</given-names></name> <name><surname>McFarlane</surname> <given-names>D.</given-names></name></person-group> (<year>2020</year>). <article-title>Extracting supply chain maps from news articles using deep neural networks</article-title>. <source>Int. J. Prod. Res.</source> <volume>58</volume>, <fpage>5320</fpage>&#x2013;<lpage>5336</lpage>. doi: <pub-id pub-id-type="doi">10.1080/00207543.2020.1720925</pub-id></citation></ref>
<ref id="ref133"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Widodo</surname> <given-names>C. E.</given-names></name> <name><surname>Adi</surname> <given-names>K.</given-names></name> <name><surname>Gernowo</surname> <given-names>R.</given-names></name></person-group> (<year>2024</year>). <article-title>A support vector machine approach for identification of pleural effusion</article-title>. <source>Heliyon</source> <volume>10</volume>:<fpage>e22778</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.heliyon.2023.e22778</pub-id>, PMID: <pub-id pub-id-type="pmid">38268601</pub-id></citation></ref>
<ref id="ref134"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Wu</surname> <given-names>C. H.</given-names></name> <name><surname>Lu</surname> <given-names>C. C.</given-names></name> <name><surname>Ma</surname> <given-names>Y. F.</given-names></name> <name><surname>Lu</surname> <given-names>R. S.</given-names></name></person-group> (<year>2018</year>). &#x201C;A new forecasting framework for bitcoin price with LSTM,&#x201D; in <italic>2018 IEEE international conference on data mining workshops (ICDMW)</italic> (pp. 168&#x2013;175). IEEE.</citation></ref>
<ref id="ref135"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Xiao</surname> <given-names>G.</given-names></name> <name><surname>Guo</surname> <given-names>J.</given-names></name> <name><surname>Da Xu</surname> <given-names>L.</given-names></name> <name><surname>Gong</surname> <given-names>Z.</given-names></name></person-group> (<year>2014</year>). <article-title>User interoperability with heterogeneous IoT devices through transformation</article-title>. <source>IEEE Trans. Industr. Inform.</source> <volume>10</volume>, <fpage>1486</fpage>&#x2013;<lpage>1496</lpage>. doi: <pub-id pub-id-type="doi">10.1109/TII.2014.2306772</pub-id></citation></ref>
<ref id="ref136"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Xu</surname> <given-names>Z.</given-names></name> <name><surname>Ni</surname> <given-names>W.</given-names></name> <name><surname>Liu</surname> <given-names>S.</given-names></name> <name><surname>Wang</surname> <given-names>F.</given-names></name> <name><surname>Li</surname> <given-names>J.</given-names></name></person-group> (<year>2023</year>). <article-title>Logistics supply chain network risk prediction model based on intelligent random Forest model</article-title>. <source>IEEE Trans. Eng. Manag.</source> <volume>71</volume>, <fpage>9813</fpage>&#x2013;<lpage>9825</lpage>. doi: <pub-id pub-id-type="doi">10.1109/TEM.2023.3317922</pub-id></citation></ref>
<ref id="ref137"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Yan</surname> <given-names>M.</given-names></name></person-group> (<year>2023</year>). &#x201C;Simulation of financial risk prediction model based on Apriori optimization algorithm,&#x201D; in <italic>2023 international conference on networking, informatics and computing (ICNETIC)</italic> (pp. 511&#x2013;515). IEEE.</citation></ref>
<ref id="ref138"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yan</surname> <given-names>W.</given-names></name> <name><surname>He</surname> <given-names>J.</given-names></name> <name><surname>Trappey</surname> <given-names>A. J. C.</given-names></name></person-group> (<year>2019</year>). <article-title>Risk-aware supply chain intelligence: AI-enabled supply chain and logistics management considering risk mitigation</article-title>. <source>Adv. Eng. Inform.</source> <volume>42</volume>:<fpage>100976</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.aei.2019.100976</pub-id></citation></ref>
<ref id="ref139"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yang</surname> <given-names>Z.</given-names></name> <name><surname>Sudharshan</surname> <given-names>D.</given-names></name></person-group> (<year>2019</year>). <article-title>Examining multicategory cross purchases models with increasing dataset scale&#x2013;an artificial neural network approach</article-title>. <source>Expert Syst. Appl.</source> <volume>120</volume>, <fpage>310</fpage>&#x2013;<lpage>318</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.eswa.2018.11.038</pub-id></citation></ref>
<ref id="ref140"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yang</surname> <given-names>T.</given-names></name> <name><surname>Yi</surname> <given-names>X.</given-names></name> <name><surname>Lu</surname> <given-names>S.</given-names></name> <name><surname>Johansson</surname> <given-names>K. H.</given-names></name> <name><surname>Chai</surname> <given-names>T.</given-names></name></person-group> (<year>2021</year>). <article-title>Intelligent manufacturing for the process industry driven by industrial artificial intelligence</article-title>. <source>Engineering</source> <volume>7</volume>, <fpage>1224</fpage>&#x2013;<lpage>1230</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.eng.2021.04.023</pub-id></citation></ref>
<ref id="ref141"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Yani</surname> <given-names>L. P. E.</given-names></name> <name><surname>Priyatna</surname> <given-names>I. M. A.</given-names></name> <name><surname>Aamer</surname> <given-names>A. M.</given-names></name></person-group> (<year>2019</year>). Exploring machine learning applications in supply chain management. In <italic>9th international conference on operations and supply chain management</italic> (pp. 161&#x2013;169).</citation></ref>
<ref id="ref142"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yu Lin</surname> <given-names>C.</given-names></name> <name><surname>Hui Ho</surname> <given-names>Y.</given-names></name></person-group> (<year>2008</year>). <article-title>An empirical study on logistics services provider, intention to adopt green innovations</article-title>. <source>J. Technol. Manag. Innov.</source> <volume>3</volume>, <fpage>17</fpage>&#x2013;<lpage>26</lpage>.</citation></ref>
<ref id="ref143"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zekhnini</surname> <given-names>K.</given-names></name> <name><surname>Cherrafi</surname> <given-names>A.</given-names></name> <name><surname>Bouhaddou</surname> <given-names>I.</given-names></name> <name><surname>Benghabrit</surname> <given-names>Y.</given-names></name> <name><surname>Garza-Reyes</surname> <given-names>J. A.</given-names></name></person-group> (<year>2021</year>). <article-title>Supply chain management 4.0: a literature review and research framework</article-title>. <source>Benchmarking Int. J.</source> <volume>28</volume>, <fpage>465</fpage>&#x2013;<lpage>501</lpage>. doi: <pub-id pub-id-type="doi">10.1108/BIJ-04-2020-0156</pub-id></citation></ref>
<ref id="ref144"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhang</surname> <given-names>L.</given-names></name> <name><surname>Wu</surname> <given-names>X.</given-names></name> <name><surname>Skibniewski</surname> <given-names>M. J.</given-names></name> <name><surname>Zhong</surname> <given-names>J.</given-names></name> <name><surname>Lu</surname> <given-names>Y.</given-names></name></person-group> (<year>2014</year>). <article-title>Bayesian-network-based safety risk analysis in construction projects</article-title>. <source>Reliab. Eng. Syst. Saf.</source> <volume>131</volume>, <fpage>29</fpage>&#x2013;<lpage>39</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.ress.2014.06.006</pub-id></citation></ref>
</ref-list>
<glossary>
<def-list>
<title>Glossary</title>
<def-item>
<term>Cat-DO</term>
<def><p>Hybrid Catboost and Dingo optimization</p></def>
</def-item>
<def-item>
<term>DNN</term>
<def><p>Deep Neural Network</p></def>
</def-item>
<def-item>
<term>ARIMA</term>
<def><p>Autoregressive Integrated Moving Average</p></def>
</def-item>
<def-item>
<term>SVM</term>
<def><p>Support vector Machine</p></def>
</def-item>
<def-item>
<term>LSTM</term>
<def><p>Long Short-Term Memory</p></def>
</def-item>
<def-item>
<term>MTO/S</term>
<def><p>Make-to-order / stock</p></def>
</def-item>
<def-item>
<term>CatBoost</term>
<def><p>Auto ML tool, Cat (categorical data) uses decision trees in gradient boosting (Boost) for classification and regression.</p></def>
</def-item>
<def-item>
<term>Adaboost</term>
<def><p>Adaptive Boosting based on weights when re-assign to each instance</p></def>
</def-item>
<def-item>
<term>XGboost</term>
<def><p>eXtreme Gradient Boosting</p></def>
</def-item>
<def-item>
<term>RF</term>
<def><p>Random Forest</p></def>
</def-item>
<def-item>
<term>SDG</term>
<def><p>Sustainable and developmental goals</p></def>
</def-item>
<def-item>
<term>SSCM</term>
<def><p>Smart Supply chain management</p></def>
</def-item>
<def-item>
<term>LDA</term>
<def><p>Linear discriminant analysis</p></def>
</def-item>
<def-item>
<term>RNN</term>
<def><p>Recurrent neural network</p></def>
</def-item>
<def-item>
<term>PCA</term>
<def><p>Principal Component Analysis</p></def>
</def-item>
<def-item>
<term>SNN</term>
<def><p>Simulated neural network</p></def>
</def-item>
<def-item>
<term>NARX</term>
<def><p>Nonlinear Autoregressive Exogenous</p></def>
</def-item>
<def-item>
<term>SVD</term>
<def><p>Singular Value Decomposition</p></def>
</def-item>
<def-item>
<term>t-SNE</term>
<def><p>t-distributed Stochastic Neighbor Embedding</p></def>
</def-item>
<def-item>
<term>LCA</term>
<def><p>Life Cycle Assessment</p></def>
</def-item>
<def-item>
<term>GRU</term>
<def><p>Gated Recurrent Unit</p></def>
</def-item>
<def-item>
<term>FP Growth</term>
<def><p>Frequent pattern-growth</p></def>
</def-item>
<def-item>
<term>GAN</term>
<def><p>A generative adversarial network</p></def>
</def-item>
<def-item>
<term>MLP</term>
<def><p>Multilayer Perceptron</p></def>
</def-item>
<def-item>
<term>ECLAT</term>
<def><p>Equivalence Class Clustering and Bottom-Up Lattice Traversal</p></def>
</def-item>
<def-item>
<term>Light GBM</term>
<def><p>gradient boosting ensemble method</p></def>
</def-item>
<def-item>
<term>
<inline-formula>
<mml:math id="M110">
<mml:mi>X</mml:mi>
</mml:math>
</inline-formula>
</term>
<def><p>The dingoes&#x2019; population size that generated randomly.</p></def>
</def-item>
<def-item>
<term>
<inline-formula>
<mml:math id="M111">
<mml:mi>D</mml:mi>
</mml:math>
</inline-formula>
</term>
<def><p>Represents the distance vector,</p></def>
</def-item>
<def-item>
<term>
<inline-formula>
<mml:math id="M112">
<mml:msub>
<mml:mi>&#x03B2;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:math>
</inline-formula>
</term>
<def><p>The deployment vector of Dingos&#x2019; beta <inline-formula>
<mml:math id="M113">
<mml:mfenced open="(" close=")">
<mml:msub>
<mml:mi>&#x03B2;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mfenced>
</mml:math>
</inline-formula> that uniformly generated randomly within <inline-formula>
<mml:math id="M114">
<mml:mfenced open="[" close="]">
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula>, while <inline-formula>
<mml:math id="M115">
<mml:msub>
<mml:mi>&#x03B2;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:math>
</inline-formula> lie into <inline-formula>
<mml:math id="M116">
<mml:mfenced open="[" close="]">
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula>.</p></def>
</def-item>
<def-item>
<term>
<inline-formula>
<mml:math id="M117">
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:math>
</inline-formula>
</term>
<def><p>A random integer number lies among <inline-formula>
<mml:math id="M118">
<mml:mfenced open="[" close="]" separators=",">
<mml:mn>1</mml:mn>
<mml:mfrac>
<mml:mi>X</mml:mi>
<mml:mn>2</mml:mn>
</mml:mfrac>
</mml:mfenced>
</mml:math>
</inline-formula>, where <inline-formula>
<mml:math id="M119">
<mml:mi>X</mml:mi>
</mml:math>
</inline-formula> is the total size of the population of dingoes.</p></def>
</def-item>
<def-item>
<term><inline-formula>
<mml:math id="M120">
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:math>
</inline-formula> &#x0026; <inline-formula>
<mml:math id="M121">
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:math>
</inline-formula></term>
<def><p>Represent vectors of random variables in [0,1].</p></def>
</def-item>
<def-item>
<term>
<inline-formula>
<mml:math id="M122">
<mml:mi>P</mml:mi>
</mml:math>
</inline-formula>
</term>
<def><p>represents the position vector.</p></def>
</def-item>
<def-item>
<term>
<inline-formula>
<mml:math id="M123">
<mml:mover accent="true">
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula>
</term>
<def><p>The new dingoes&#x2019; movement position.</p></def>
</def-item>
<def-item>
<term>
<inline-formula>
<mml:math id="M124">
<mml:mover accent="true">
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mi>t</mml:mi>
</mml:mfenced>
</mml:math>
</inline-formula>
</term>
<def><p>The current search agent.</p></def>
</def-item>
<def-item>
<term>subscript <inline-formula>
<mml:math id="M125">
<mml:mi>d</mml:mi>
</mml:math>
</inline-formula></term>
<def><p>Represents the Dingos, while the subscript p represents the prey.</p></def>
</def-item>
<def-item>
<term>
<inline-formula>
<mml:math id="M126">
<mml:msub>
<mml:mi>&#x03C9;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:math>
</inline-formula>
</term>
<def><p>The expected loss function gradient through the <inline-formula>
<mml:math id="M127">
<mml:msup>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>h</mml:mi>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> sample.</p></def>
</def-item>
<def-item>
<term>
<inline-formula>
<mml:math id="M128">
<mml:mover accent="true">
<mml:msub>
<mml:mi>&#x03C6;</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mi>t</mml:mi>
</mml:mfenced>
</mml:math>
</inline-formula>
</term>
<def><p>Dingos&#x2019; vector that will attack according to time <inline-formula>
<mml:math id="M129">
<mml:mfenced open="(" close=")">
<mml:mi>t</mml:mi>
</mml:mfenced>
</mml:math>
</inline-formula></p></def>
</def-item>
<def-item>
<term>
<inline-formula>
<mml:math id="M130">
<mml:mi>&#x03C3;</mml:mi>
</mml:math>
</inline-formula>
</term>
<def><p>A binary number is randomly generated.</p></def>
</def-item>
<def-item>
<term>
<inline-formula>
<mml:math id="M131">
<mml:mover accent="true">
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mo>&#x2217;</mml:mo>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mfenced open="(" close=")">
<mml:mi>t</mml:mi>
</mml:mfenced>
</mml:math>
</inline-formula>
</term>
<def><p>The best catch solution path search compared with the previous iteration <inline-formula>
<mml:math id="M132">
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula></p></def>
</def-item>
<def-item>
<term>
<inline-formula>
<mml:math id="M133">
<mml:mover accent="true">
<mml:mi>B</mml:mi>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
</mml:math>
</inline-formula>
</term>
<def><p><inline-formula>
<mml:math id="M134">
<mml:mover accent="true">
<mml:mi>B</mml:mi>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mo>=</mml:mo>
<mml:mn>2</mml:mn>
<mml:mover accent="true">
<mml:mi>b</mml:mi>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mo>&#x22C5;</mml:mo>
<mml:mover accent="true">
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mo>&#x2212;</mml:mo>
<mml:mover accent="true">
<mml:mi>b</mml:mi>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
</mml:math>
</inline-formula> determine whether the prey is moving away from the search agent</p></def>
</def-item>
<def-item>
<term>
<inline-formula>
<mml:math id="M135">
<mml:mi>&#x03B7;</mml:mi>
</mml:math>
</inline-formula>
</term>
<def><p>The shrinkage to trap the solution (i.e., prey) and known by the learning rate. Here, the prey refers to the best search agent, while the dingoes refer to all other search agents.</p></def>
</def-item>
<def-item>
<term>
<inline-formula>
<mml:math id="M136">
<mml:mover accent="true">
<mml:mi>A</mml:mi>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
</mml:math>
</inline-formula>
</term>
<def><p>Vectors <inline-formula>
<mml:math id="M137">
<mml:mover accent="true">
<mml:mi>A</mml:mi>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mo>=</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo>&#x22C5;</mml:mo>
<mml:mover accent="true">
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
<mml:mtext>,</mml:mtext>
</mml:math>
</inline-formula> determine the portion of the solution space around the prey to study dingoes converge.</p></def>
</def-item>
</def-list>
</glossary>
</back>
</article>