<?xml version="1.0" encoding="UTF-8"?>
<article xmlns:xlink="http://www.w3.org/1999/xlink">
<front><article-meta>
<title-group><article-title>Estimation of Route Reliability in Multimodal Hierarchical Hub Location Problem Using Lagrangian Relaxation and Artificial Neural Networks (ANN)</article-title></title-group>
<contrib-group>
<contrib contrib-type="author"><name><surname>Korani</surname><given-names>Ehsan</given-names></name><xref ref-type="aff" rid="aff1"/></contrib>
<aff id="aff1">Department of Industrial Engineering, Kermanshah Branch, Islamic Azad University, Kermanshah, Iran.</aff>
</contrib-group>
<abstract><p>The present study has developed an Artificial Neural Networks (ANN) model to predict the route reliability in various structures of the Multimodal Hierarchical Hub Location Problem (MHHLP) utilizing Lagrangian relaxation; so that, initially, a mixed integer programming model was proposed for MHHLP and the, an efficient Lagrangian relaxation method was developed to solve the problem in different structures. The results obtained from problem solving were used as input and output data to create an ANN model using Multilayer Perceptron (MLP) neural network. As a result, an ANN model was designed by which, the reliability of the MHHLP route was predicted in large dimensions at different values of the parameters. Computational analysis, ANN model</p><p>validation and prediction process were conducted using CAB and IAD data.</p></abstract>
<kwd-group kwd-group-type="author"><kwd>Hub location problem</kwd><kwd>Lagrangian relaxation</kwd><kwd>Artificial neural networks</kwd><kwd>Reliability</kwd><kwd>Hierarchical</kwd></kwd-group>
</article-meta></front>
<body>
<sec id="sec-1"><label>1</label><title>Introduction</title>
<p>Hub Location Problems (HLPs) which are known as &quot;network optimization problems&quot;, identify hubs as collection and distribution centers <xref ref-type="bibr" rid="ref-1">[1]</xref>. In these problems, less and more direct connections are used to achieve the economic interests rather direct relationship between the two points and accordingly, demands with the same destination are aggregated and then distributed.</p>
<p>There are various other applications in the HLPs in addition to telecommunication and transportation systems, including production planning, retail management, wholesale management, and healthcare.</p>
<p>Teo and Shu <xref ref-type="bibr" rid="ref-2">[2-15]</xref> and many other works have been conducted in this field. However, along with the issues raised in all of these problems with a wide variety of applications, it should be noted that the disruption and revocation of a service flow will impose additional costs in addition to unfulfilled economic goal. The costs include increased direct and indirect costs, intensified dissatisfaction, and undermined system legitimacy <xref ref-type="bibr" rid="ref-5">[4]</xref>. Therefore, the reliability of the network communication routes and how to establish hub facilities based on reliability is important. However, Snyder et al. <xref ref-type="bibr" rid="ref-17">[16]</xref> have considered the effects of natural disasters, labor strikes, or terrorist threats among the factors affecting the reliability. The importance of this issue is increasing day by day by growing the industrial society and the increased volume of communications, and the growth of scientific research is possible in the field of reliable hub location. Kim and O&apos;kelly <xref ref-type="bibr" rid="ref-18">[17]</xref> were the first ones who focused on promoting the reliability of communication routes in the hub location problem and An et al. <xref ref-type="bibr" rid="ref-5">[4]</xref> improved the hub facility reliability factor by defining the backup facilities. According to them, given the strategic level of HLPs, the solving method is of great importance. Therefore, they proposed two approaches of branch and bound and Lagrangian for their model.</p>
<p>One of these characteristics of the HLPs is the hierarchical structure proposed by Yaman <xref ref-type="bibr" rid="ref-19">[18]</xref>, Alumur et al. <xref ref-type="bibr" rid="ref-11">[10]</xref> and Korani and Sahraeian <xref ref-type="bibr" rid="ref-14">[13]</xref>. However, multimodal transportation is another important characteristic that has been taken today beyond hub problems in the field of macro transportation. Competition in the field of accelerated services is one of the key indicators of global trade, led to inefficiencies in specialized and individual transportation <xref ref-type="bibr" rid="ref-20">[19]</xref>. Therefore, emphasis on multimodal transportation in hub has also been important as can be observed in recent research including Chen et al. <xref ref-type="bibr" rid="ref-21">[20]</xref>, Alumur et al. <xref ref-type="bibr" rid="ref-15">[14]</xref>, Onyemechi <xref ref-type="bibr" rid="ref-22">[21]</xref>, SteadieSeifi et al. <xref ref-type="bibr" rid="ref-23">[22]</xref>, Hanasusanto et al. <xref ref-type="bibr" rid="ref-24">[23]</xref>, Ambrosino and Sciomachen <xref ref-type="bibr" rid="ref-25">[24]</xref>, Fazayeli et al. <xref ref-type="bibr" rid="ref-26">[25]</xref> and Huang et al. <xref ref-type="bibr" rid="ref-27">[26]</xref>. However, simultaneous emphasis to these three characteristics causes new contingencies that should be considered in designing the model.</p>
<p>Given the complexity and time-consuming nature of the solving process of various problems in the real world, researchers have tried to overcome these complexities by creating new methods. One of these methods is the Artificial Neural Network (ANN), which is more useful than many models, and this is because of their higher level of speed and accuracy <xref ref-type="bibr" rid="ref-28">[27–29]</xref>. By the motivation of developing an alternative model that allows for a quick and reliable estimation of site overhead costs, Leśniak and Juszczyk <xref ref-type="bibr" rid="ref-30">[29]</xref> suggested an ANN-based regression model which was able to predict the site overhead cost index.</p>
<p>A new method for quick and accurate estimation and forecasting iron oxide (FeO) concentration in steel slag during discharge process in steelworks was also proposed utilizing two key tools of the ANN and infrared imaging <xref ref-type="bibr" rid="ref-31">[30]</xref>. This method has attempted to estimate and predict the value of material physical parameters based on the changes in the radiative parameters, which is most relevant to the amount of FeO in steel production.</p>
<p>An ANN model based on the input parameters of random data and strain values obtained from the static test was proposed to predict the static load applied on the wing rib <xref ref-type="bibr" rid="ref-33">[31]</xref>. The performance of their proposed ANN model has been also evaluated in predicting static load to a degree of accuracy.</p>
<p>Continuous and permanent monitoring of Particulate Matter (PM) at subway station is of particular importance for assessing the exposure level of PM to passengers. In this way, PM variations were predicted using ANN for 6 subway stations in Seoul. This ANN model has three inputs of outdoor PM10 concentrations, ventilation rates, and subway frequencies in the input layer, a hidden layer and an output layer <xref ref-type="bibr" rid="ref-34">[32]</xref>.</p>
<p>Optimizing the design process of asphalt mix in the road construction industry is one of the interesting uses of ANN which used by Sebaaly et al. <xref ref-type="bibr" rid="ref-35">[33]</xref> to optimize the asphalt mix design process using past process database suggesting a mixed method of ANN and Genetic Algorithm, so that their results were consistent with the applicable specification requirements.</p>
<p>ANN was also used in a heuristic effort to estimate the operatinal parameters of the counter-rotating wind turbine in which, neural networks played an important role in enabling the optimization of the dual-rotor turbine parameters <xref ref-type="bibr" rid="ref-36">[34]</xref>.</p>
<p>An ANN model was used to model air void content in an aggregate mixture, which was designed for feed-forward type using the error Back-Propagation Algorithm (BPA) <xref ref-type="bibr" rid="ref-37">[35]</xref>.</p>
<p>ANN has also been used to predict gold price fluctuations, so that Kristjanpoller and Minutolo <xref ref-type="bibr" rid="ref-38">[36]</xref> presented a hybrid model of ANN and the generalized autoregressive conditional hetero-skedasticity (GARCH), which also analyzed the price fluctuations of the gold spot price and future price. This mixed model dramatically contributed to predict the process in order to determine the impact of financial variables on gold prices. ANN has also been considered in the field of agricultural industry, so that it has been used to predict the amount of sesame seed production. The prediction in this process was utilized two models of ANN and Multiple Regression Models (MLRs) that eventually, ANN prediction outcomes were far better than the MLR results based on the comparison results <xref ref-type="bibr" rid="ref-39">[37]</xref>.</p>
<p>There are many instances of ANN application in literature; however the lack of the Location-Allocation Problems (LAPs) is so clear in literature. Hence, it is attempted in this paper, to implement ANN in the HLPs (as one of the LAPs subsets).</p>
<p>HLPs fall into the NP-Hard problems group <xref ref-type="bibr" rid="ref-40">[38]</xref>, and increased reliability aspects of these problems causes doubling their complexity, and reliable HLPs can be surely placed in this group. So, the Lagrangian relaxation solution is used in the problem solving process. Accordingly, different algorithms and methods for these problems spend considerable time to solution to provide final result and problem solution. For instance, sometimes it is needed to compare the solution and select it from a set of solutions of the problem to select the final solution so that each solution is obtained by changing the problem parameters and re-executing the solving method, which requires considerable time. In this paper, we attempted to provide a linear modeling of Multimodal Hierarchical Hub Location Problem (MHHLP), utilizing ANN that provides a set of the problem different solutions for different values of parameters with a minimum error rate and in the least possible time.</p>
<p>Therefore, the most important contribution of this paper is designing and developing an ANN linear model to predict the objective function of problem, in addition to provide a multimodal hierarchical hub location model and developing the lagrangian relaxation algorithm for its solution process.</p>
<p>The reminder of the paper is structured as follows according to the well-known patterns in the literature: the problem statement and the mathematical model are presented in Section 2. The steps of solving the lagrangian relaxation are presented in Section 3. Section 4 describes the design stages of the ANN model. Section 5 describes the computational results and MHHLP route reliability prediction stages. Finally, conclusion and research suggestions are provided in Section 6.</p>
</sec>
<sec id="sec-2"><label>2</label><title>MHHLP Formula</title>
<p>As mentioned earlier, the MHHLP research problem is one of the specific problems and subsets of LAPs. Therefore, before designing the mathematical model of the problem, first, its assumptions will be described to determine how the model will be formed. Then various indices and sets are introduced, after which the parameters and variables of the problem are presented. Finally, the integer programming model is proposed.</p>
<sec id="sec-3"><label>2.1</label><title>MHHLP Assumptions</title>
<p>In this model, the costs of the investment are somehow minimized in terms of affecting the flow rate of each route in the objective function and the make dependencies between the routes reliability on the traveled distance. This is because of the logic that the shorter route has a less probability of disruption, and the possibility of disconnecting is far less than the longer route.</p>
<p>The MHHLP problem to solve the reliability is related to the volume of traffic and the distance traveled to calculate reliability, so it has specific computational properties.</p>
<p>The following assumptions are proposed for the mathematical model:</p>
<p>I. The hubbing effect is considered as constant values, between 0 and 1, as the discount factor at different levels of the hub network.</p>
<p>II. The problem has three-level. The first level is related to the non-hub nodes, the second level is related to facilities hub, and the third level is related to facilitating the central hub (see also Yaman <xref ref-type="bibr" rid="ref-19">[18]</xref>, Korani and sahraeian <xref ref-type="bibr" rid="ref-10">[9]</xref>).</p>
<p>III. The hierarchical structure of the output network is in nested and non-coherent form.</p>
<p>IV. The transportation mode is ground between the hub and non-hub and air between the air hub and the central hub.</p>
<p>V. The number of hub facilities is constant in each level and the problem approach is p-hub.</p>
<p>VI. The facilities location-allocation optimization problem approach is implemented.</p>
<p>VII. Facilities capacity and transmission routes are unconstrained.</p>
<p>VIII. The time to travel between the nodes and the demand values is constant.</p>
<p>IX. The first level has a central hub facility.</p>
<p>X. The location of the demand nodes is predetermined.</p>
<p>XI. The hub facilities potential locations are known.</p>
<p>XII. The solution space is discrete.</p>
</sec>
<sec id="sec-4"><label>2.2</label><title>Indices and Symbols Of MHHLP</title>
<p>I: the set of all studied nodes.</p>
<p>H: the set of the potential nodes of the hub ( ).</p>
<p>C: the set of the potential nodes of the central hub (</p>
<p>Parameters:</p>
<p>: the number of hub facilities in the second level.</p>
<p>: the impact factor of hubbing effect on the reliability (</p>
<p>: travel time in the communication route between</p>
<p>: travel time in the communication route between the</p>
<p>: the reliability of the communication route between mode.</p>
<p>: the reliability of the communication route between</p>
<p>Variables:</p>
<p>and nodes in ground transportation mode.</p>
<p>and nodes in the air transportation mode.</p>
<p>and nodes in the ground transportation</p>
<p>and nodes in the air transportation mode. In this section, the three components of the model, namely sets, parameters, and variables of the problem have been introduced. The indices used in the proposed model include:</p>
<p>: the demand flow rate between the source and the destination .</p>
<p>: discount factor of hubbing effect on transportation time ( ).</p>
<p>: maximum time to service between each pair of source and destination nodes.</p>
<table-wrap id="tab1"><label>Table 1</label><caption><p>The reliability of the flow passing through each of the four paths.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:5:66,644.7,537.1,756.2"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p>Now, the objective function of the problem with the goal of maximizing the reliability of the flow of the network paths, is proposed as Eq. (1) according to <xref ref-type="table" rid="tab1">Table 1</xref>.</p>
<p>The objective function formulate in four parts of Models (1-1), (1-2), (1-3) and (1-4), so, we breakdown to explain one by one as follow:</p>
<p>(1-1)</p>
<p>(1-3)</p>
<p>(1-2)</p>
<p>(1-4)</p>
<p>According to <xref ref-type="table" rid="tab1">Table 1</xref>, we encounter four types of routes 1-4, so the objective function in the form of four sections Models (1-1), (1-2), (1-3), and (1-4) is described for the route types 1 to 4, respectively. Problem constraints are grouped based on the structure created in the problem, as follows:</p>
<sec id="sec-5"><title>Single assignment hub location-allocation</title>
<p>The constraints of the hub network structure are designed as single assignment in this section. Constraint (2) ensures that each demand node has only one route to the central hub. Constraint (3), Constraint (4), and Constraint (6) are only allowed to establish the route when the middle node being a hub or central hub. Constraint (5) and Constraint (6) reinforce the single assignment structure.</p>
<p>Opening P-hub facilities:</p>
<p>Considering that the design basis for the P-hub median problem and the number of facilities to be established are given at each level, Constraint (7) and Constraint (8) determine the number of hub facility in the second level and the number of central hub to be established at first level.</p>
<p>Flow balance constraints:</p>
<p>(10)</p>
<p>(11)</p>
<p>(12)</p>
<p>(13) (14) (15) (16) (17) (18)</p>
<p>Constraint (9) calculates the amount of output flow from the source node i, passing the hublink between the hub k and the central hub l. This constraint is used as balancing constraint in Yaman <xref ref-type="bibr" rid="ref-19">[18]</xref> and Korani and Sahraeian <xref ref-type="bibr" rid="ref-10">[9]</xref> Used.</p>
<p>Hence for every link from a hub to its central hub, the amount of traffic demand will be computed by Constraint (9) and Constraint (10).</p>
<p>Constraint (10) ensures that the variable flow rate originating from source i, passing through the connecting route of the nodes of the hub k and the central hub l, is not greater than the total flow derived from the source node i. This constraint is introduced in Correia et al. <xref ref-type="bibr" rid="ref-41">[39]</xref> according to its application. The Constraint (11) and Constraint (12) are designed inspired by Ernst &amp; kirshnamoorthy <xref ref-type="bibr" rid="ref-42">[40]</xref> and Karimi and setak <xref ref-type="bibr" rid="ref-12">[11]</xref>, that guarantee that the target node j receives a flow originating from the source node i. The Constraint (13) and Constraint (14) guarantee that when the demand flow is transferred from the source node i to the destination node j through two hubs k and m, respectively, the nodes i are assigned to the hub k and node j to the m hub. The Constraints (15) are also applied to ensure the accuracy level of flow rate. The Constraints (16)-(18) amplify the LP model.</p>
<p>(19)</p>
<p>(20)</p>
<p>(21)</p>
<p>Constraints (19)-(21) indicate the time bound constraints. These constraints guarantee that the travel time between each pair of source and destination nodes is no greater than the predetermined value of β. Constraint (19) serves travel time from each source to the central hub of that node in the variable, and the Constraint (20) places the total travel time from the source node to the destination node under the radius of the upper bound of β. The idea of this set of constraints in derived from research such as Ebery <xref ref-type="bibr" rid="ref-43">[41]</xref>, Ernst et al. <xref ref-type="bibr" rid="ref-44">[42]</xref>, Yaman <xref ref-type="bibr" rid="ref-19">[18]</xref> and Korani and Sahraeian<xref ref-type="bibr" rid="ref-10">[9]</xref>.</p>
</sec>
</sec>
</sec>
<sec id="sec-6"><label>3</label><title>Lagrangian Relaxation Method</title>
<p>There are various approaches based on mathematics to simplify the model and relax it from the variables and constraints that make the problem difficult to solve, including the Lagrangian relaxation method which is developed for the MHHLP model in the present paper. This methodology has been developed for several models in the HLPs literature including Aykin <xref ref-type="bibr" rid="ref-45">[43]</xref>, Lee et al. <xref ref-type="bibr" rid="ref-46">[44]</xref>, Marín <xref ref-type="bibr" rid="ref-47">[45]</xref>, Contreras et al. <xref ref-type="bibr" rid="ref-48">[46]</xref>, Ishfaq and Sox <xref ref-type="bibr" rid="ref-49">[47]</xref>, Mohammadi et al. <xref ref-type="bibr" rid="ref-50">[48]</xref>, Karimi and Setak <xref ref-type="bibr" rid="ref-12">[11]</xref>, He et al. <xref ref-type="bibr" rid="ref-51">[49]</xref> and Neamatian Monemi et al. <xref ref-type="bibr" rid="ref-6">[5]</xref>. According to the literature, the problem constraints was identified, and it was observed that the relationship between the two decision variables and dramatically affect the time to solution which was observed in Constraint (13) and Constraint (15). Hence, two sets of Lagrange multipliers and were defined for the Constraint (13) and Constraint (15), respectively ( and ). With the help of Lagrange multipliers, the relaxed problem as LR was defined as Eq. (22).</p>
<p>(22)</p>
<p>Such that. (2)-(12),(14),(16) and (21)</p>
<p>The problem is a formulation based on the Lagrangian relaxation approach, resulting in a high bound for MHHLP. Therefore, this approach is an attempt to find the best bound for the problem to match or close the optimal solution. To create this improvement process, the proposed method of Neamatian Monemi et al. <xref ref-type="bibr" rid="ref-6">[5]</xref> was followed by the sub gradient optimization method. In this method, a six-step algorithm was developed in the form of <xref ref-type="fig" rid="fig2">Fig. 2</xref>, in which the signs and indexes were used, as follows:</p>
<p>LB: lower bound.</p>
<p>UB: upper bound.</p>
<p>iter: iteration index.</p>
<p>: a random response resulting from solving the problem relaxed from hard constraint clause.</p>
<p>: the output of lagrangian relaxation for the objective function in iter repeat.</p>
<p>: sub gradients of Constraint (13) in the iterth iteration.</p>
<p>: sub gradients of Constraint (15) in the iterth iteration.</p>
<p>: the movement step in the iterth iteration.</p>
<p>: the multiplicative which is used as a decreasing factor in each iteration.</p>
<fig id="fig2"><label>Figure 2</label><caption><p>Optimization subgradients procedure for MHHLP.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:8:66,483.3,537.1,754"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<p>In the next section, it is attempted to examine the inequity and proposed method performance, individually and in combination of all available modes with the help of the standard data in the research literature, so that the best combination can be achieved in order to reach the best possible response in the shortest possible time.</p>
</sec>
<sec id="sec-7"><label>4</label><title>ANN Model of the Proposed MHHLP</title>
<p>An information processing system is used in order to predict and estimate the route reliability, or the same value of the MHHLP objective function, which is based on a large number of super-integrated processing elements called neurons that work together to solve a problem and transmit information by synopses (electromagnetic communications); this system is called the ANN in literature and neural biology, which main idea is inspired by the structure of human brain activity <xref ref-type="bibr" rid="ref-52">[50]</xref>. In the last decade, ANN has been used as an effective tool to estimate problems, and given that ANN can be defined as a mathematical system and the neuron is interpreted as a processing unit, network architecture is created helping organizing neurons, many of which are designed in the literature; however, the most popular of them is the Multi-Layer Perceptron (MLP) networks, which are among the Feed Forward Neural Networks type <xref ref-type="bibr" rid="ref-53">[51]</xref>.</p>
<p>These networks have input, hidden, and output layers in their topology <xref ref-type="bibr" rid="ref-29">[28]</xref>, <xref ref-type="bibr" rid="ref-53">[51]</xref>.</p>
<p>The neurons are placed on the layers with an activation function and each neuron is connected to the neurons in the next layer with the weighted connections.</p>
<p>The ANN weights are trained using a form of error feedback, which can be viewed as a generalization of the Learning Management System (LMS) <xref ref-type="bibr" rid="ref-29">[28]</xref>.</p>
<p>An error BPA is used to train the network to correct these weights in the various layers of the MLP.</p>
<p>The complexity of the connection network is directly related to the number of layers and neurons of each layer, whose accurate selection has a significant impact on achieving the best possible responses at the best possible time. Therefore, the neural network sensitivity was analyzed based on different numbers of hidden layers, the number of neurons, activation functions, etc. in order to achieve the best topology for MHHLP design, The obtained result is the proposed MLP model structure with four inputs, a hidden layer and an output that is mapped to the CAB dataset in <xref ref-type="fig" rid="fig3">Fig. 3</xref> and is exactly identical to the IAD dataset, however, 3 neurons are defined instead of the 4 neurons in the hidden layer.</p>
<fig id="fig3"><label>Figure 3</label><caption><p>The proposed MLP model architecture for MHHLP with CAB dataset.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:9:66,528.9,537.1,725.4"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<p>In the context of a feed-forward network, a hidden layer neuron is a Pre-synaptic Neuron (PN) because it is connected to other neurons in the network which are post-synaptic in relation to its output. In feed-forward networks, neurons form layers, or slabs, which are connected to and from post- and pre- synaptic neurons. Such groupings of neurons that are themselves connected to other neurons are sometimes (traditionally) called hidden layers or hidden layer neurons1.</p>
<p>Input data is composed of problem parameters (i.e. the number of nodes, the number of hubs, hubbing factor of time and hubbing factor of reliability) and the results of the Lagrangian relaxtion method choosed as output data for training for the ANN model. The Levenberg–Marquardt (LM) algorithm used for the training rule of network. These data were divided into two sets: training set (eighty percent of data) and test set (twenty percent of data). The MATLAB R2013a 8.1.0.604 software used for the training of the ANN model. The implementing phases of the ANN model with BPA presents in the <xref ref-type="fig" rid="fig4">Fig. 4</xref>. The planned ANN model specifications have been presented in <xref ref-type="table" rid="tab2">Table 2</xref> for each data sets of IAD and CAB.</p>
<table-wrap id="tab2"><label>Table 2</label><caption><p>The characteristics of planned ANN model.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:9:66,199.9,537.1,307"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p>We use tangent sigmoid transfer function tansig function as activation function in MLP models. This function is wellknown in literature <xref ref-type="bibr" rid="ref-29">[28]</xref>. The formulation of Tansig defines in Eq. (23) as follow:</p>
<p>(23)</p>
<p><ext-link ext-link-type="uri" xlink:href="http://standoutpublishing.com/g/hidden-layer.html">http://standoutpublishing.com/g/hidden-layer.html</ext-link></p>
<fig id="fig4"><label>Figure 4</label><caption><p>Flowchart of the ANN model phases (adapted from [51]).</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:10:66,618.7,537.1,778.2"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
</sec>
<sec id="sec-8"><label>5</label><title>The Computational Results</title>
<p>The present paper uses two well-known dataset in the HLPs literature namely the Civil Aeronautics Board (CAB) and the Iranian Aviation Dataset (IAD). O&apos;kelly <xref ref-type="bibr" rid="ref-55">[52]</xref> introduced the CAB data on the basis of the transport network of the 25 states of the United States.</p>
<p>Karimi and Bashiri <xref ref-type="bibr" rid="ref-56">[53]</xref> studied transportation network in 37 cities of Iran and provided the collected data in the form of IAD. These two data sets do not provide the reliability rate of the routes. Therefore, the reliability of data was adopted from Kim and O&apos;kelly <xref ref-type="bibr" rid="ref-18">[17]</xref> and An et al. <xref ref-type="bibr" rid="ref-5">[4]</xref>. Also, the reciprocating success chance of each return route was assumed equal and, by were placed at a distance of (0,1) by normalizing the reliability data results. The reliability and travel time in the ground mode are reduced by 50% compared to air mode through calculations, considering the capability and ability of air mode to ground mode transportation. Tehran (the capital city of Iran) was selected as the central hub in the IAD dataset. Placing the only international airport in this city and possessing the largest number of population were the reasons for selecting this city (as the research Alumur et al. <xref ref-type="bibr" rid="ref-11">[10]</xref>). We selected the node 17 with the largest volume of communications (1447732) as the central hub for CAB data in a heuristic attempt regarding the dataset. The β value is obtained from the average of the problem feasible modes for its various values in the rigorous mode, which is similar to the decision-making process used by Yaman <xref ref-type="bibr" rid="ref-19">[18]</xref>, Alumur et al. <xref ref-type="bibr" rid="ref-15">[14]</xref> and Korani Sahraeian <xref ref-type="bibr" rid="ref-14">[13]</xref> to determine β. Therefore, this amount was obtained 2640 and 2880, for the MHHLP structure for CAB and IAD data, respectively.</p>
<p>Three Objective Factor (ObFu), Response Improvement Rate (ReIm) and hub facilities (Hub) were considered to evaluate the performance of the Lagrangian approach. ReIm is obtained from the difference between the pure relaxed response and the lower bound of Lagrangian relaxation on the pure relaxation response.</p>
<p>The numerical initial value is considered constant considering the dimensions of the problem. For the subsets 5, 10, 15 and 20, this value was 9, and for the subsets of 25, 30, and 37 nodes, it was considered 90. The results of the Lagrangian relaxation method for IAD and CAB data are presented in <xref ref-type="table" rid="tab3">Table 3</xref> and <xref ref-type="table" rid="tab4">Table 4</xref>, respectively.</p>
<table-wrap id="tab3"><label>Table 3</label><caption><p>IAD data with β = 2880.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:11:66,238.9,537.1,756.2"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<table-wrap id="tab4"><label>Table 4</label><caption><p>CAB data with β = 2640.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:12:66,370.9,537.1,756.2"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p>To demonstrate the impressionability of the ObFu and step size changes process from , <xref ref-type="fig" rid="fig5">Fig. 5</xref> is plotted for the 30-node set of IAD data, so that PH = 7, = 0.8 and = 0.8 α, by GAMS software outputs. <xref ref-type="fig" rid="fig5">Fig. 5</xref> shows that the accuracy of the calculation is greater by increasing the discount factor in large data and the changes curve is more concave, and vice versa, the change slope of step size changes shifted from line shape to stairs, which guarantees achieving the better response.</p>
<fig id="fig5"><label>Figure 5</label><caption><p>Trends of ObFu; a) and step size, b) for IAD dataset with PH=7, , α=0.8 and ɤ =0.8.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:13:66,530.4,537.1,778.6"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<p><xref ref-type="table" rid="tab5">Table 5</xref> and <xref ref-type="table" rid="tab6">Table 6</xref> show the obtained results for the proposed ANN model for IAD and CAB datasets, respectively. So that, the Eqs. (24)-(26) are used to calculating the mean relative error percentage (MRE %), the Root Means Square Error (RMSE) and the mean absolute error percentage (MAE %) of the network, respectively.</p>
<p>(24)</p>
<p>(25)</p>
<p>(26)</p>
<table-wrap id="tab5"><label>Table 5</label><caption><p>The training and testing errors results of the proposed ANN model for IAD data.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:13:66,217.7,537.1,284.3"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<table-wrap id="tab6"><label>Table 6</label><caption><p>The training and testing errors results of the proposed ANN model for CAB data.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:13:66,106.1,537.1,173.7"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p>All of the symbols and indexes are used in the Eqs. (24)-(26), define in <xref ref-type="table" rid="tab7">Table 7</xref>.</p>
<table-wrap id="tab7"><label>Table 7</label><caption><p>The symbols in the Eqs. (24)-(26).</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:14:66,684.6,537.1,756.2"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p>Several numbers of neurons have been applied for the proposed ANN architectures, which best structure is selected. The results of the applied networks with different number of neurons in the hidden layer are illustrated in <xref ref-type="fig" rid="fig6">Fig. 6</xref>. This figure shows the MAE errors of the networks versus different number of neurons in the hidden layer. Each point in these figure represent the network with best MAE results during 200 times. These MAE errors are reported according to the normalized data.</p>
<fig id="fig6"><label>Figure 6</label><caption><p>MAE errors of the networks versus different number of neurons in the hidden layer.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:14:66,405.9,537.1,604.3"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<p>According to <xref ref-type="fig" rid="fig6">Fig. 6</xref>, the numbers of 3 and 4 neurons, which have the best MAE error values, are considered for the hidden layers of IAD and CAB models, respectively. In the proposed networks, 80 percent of data set is used for training, while 20 percent of the data set is used for testing process of the presented model. So, we suggested ANN model for both datasets then train and test for everyone. Objective function actual and predicted values comparison for the IAD data, using the proposed MLP model for IAD is illustrated in <xref ref-type="fig" rid="fig7">Fig. 7</xref> and <xref ref-type="fig" rid="fig8">Fig. 8</xref>. The objective function actual and predicted data for training and testing process for IAD data are listed in <xref ref-type="table" rid="tab8">Table 8</xref> and <xref ref-type="table" rid="tab9">Table 9</xref>, respectively. Also, the conformity actual and predicted values for the IAD data using the proposed MLP model for IAD are illustrated in <xref ref-type="fig" rid="fig8">Fig. 8</xref>.</p>
<p>As can be seen from <xref ref-type="fig" rid="fig7">Fig. 7</xref> and <xref ref-type="fig" rid="fig8">Fig. 8</xref> and <xref ref-type="table" rid="tab8">Table 8</xref> and <xref ref-type="table" rid="tab9">Table 9</xref>, the test and train data are predicted precisely and the predicted values of output MHHLP reliability by ANN model is the instances of near to the Objective function actual results, undoubtedly.</p>
<p>The outcomes endorse the accuracy and applicability of estimation of ANN as a reliable model to predict the proposed MLPs output MHHLP reliability from the number of nodes, the number of hubs, hubbing factor of time and hubbing factor of reliability validate by results.</p>
<table-wrap id="tab8"><label>Table 8</label><caption><p>Model results for IAD train data with β = 2880.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:15:66,389.1,537.1,756.2"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<table-wrap id="tab9"><label>Table 9</label><caption><p>Model results for IAD test data with β = 2880.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:15:66,42.4,537.1,375"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<fig id="fig7"><label>Figure 7</label><caption><p>Actual and predicted values comparison of; a) test and, b) train data, using the proposed MLP model for IAD.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:16:66,555,537.1,778.2"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<fig id="fig8"><label>Figure 8</label><caption><p>Conformity actual and predicted values of; a) test and, b) train data, using the proposed MLP model for IAD.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:16:66,105.3,537.1,527.6"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<p>Another model is propped for the CAB data. Actual and predicted values comparison for the CAB data, using the proposed MLP model for CAB is illustrated in <xref ref-type="fig" rid="fig9">Fig. 9</xref> and <xref ref-type="fig" rid="fig10">Fig. 10</xref>. The objective function actual and predicted data for training and testing process for CAB data are listed in <xref ref-type="table" rid="tab10">Table 10</xref> and <xref ref-type="table" rid="tab11">Table 11</xref>, respectively. As can be seen, the test and train data are predicted precisely.</p>
<p>Also, the conformity actual and predicted values for the CAB data using the proposed MLP model for CAB are illustrated in <xref ref-type="fig" rid="fig10">Fig. 10</xref>.</p>
<table-wrap id="tab10"><label>Table 10</label><caption><p>Model results for CAB train data with β = 2640.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:17:66,384.9,537.1,658.9"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<table-wrap id="tab11"><label>Table 11</label><caption><p>Model results for CAB test data with β = 2640.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:17:66,54.3,537.1,363.8"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<fig id="fig9"><label>Figure 9</label><caption><p>Actual and predicted values comparison of; a) test and, b) train data, using the proposed CAB-MLP model.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:18:66,555.3,537.1,778.2"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<fig id="fig10"><label>Figure 10</label><caption><p>Conformity actual and predicted values of; a) test and, b) train data, using the proposed MLP model for CAB data.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:18:66,100.9,537.1,528"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<p>The most important benefits of the proposed ANN model are the ease of use, present output at the best time and the quality of the solution. Accordingly, the MHHLP reliability for the IAD with N=37 and CAB with N=25 was predicted that the different values of the three inputs PH, 1- ɤ and α. Hence, the following data are predicted by the proposed IAD and CAB MLP models which are listed in <xref ref-type="table" rid="tab12">Table 12</xref> and <xref ref-type="table" rid="tab13">Table 13</xref>, respectively. These results have been calculated in best time vs solution time other methods.</p>
<table-wrap id="tab12"><label>Table 12</label><caption><p>Predicted results of MLP model for IAD data.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:19:66,404.4,537.1,678.2"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<table-wrap id="tab13"><label>Table 13</label><caption><p>Predicted results of MLP model for CAB data.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:19:66,186.9,537.1,379.2"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
</sec>
<sec id="sec-9"><label>6</label><title>Conclusions</title>
<p>The gap is determined in this paper through examining the literature on HLPs and a new model called MHHLP was introduced, which included three multimodal transport, hierarchical structure and reliability characteristics, simultaneously. The contribution of the proposed model is in terms of its constraints and problem variables design and that, the different routes of network are identified and formulated based on the demand flow in the network in defining its equations. Considering the problem placement in the range of NP-Hard problems, the Lagrangian Relaxation Algorithm was developed for it and the results were obtained, accordingly. Finally, the data gathered by the Multilayer Perceptron (MLP) neural network were transformed into a model.</p>
<p>Therefore, this paper has been presented a new feedforward method for estimating the reliability of MHHLP. For validation, the output reliability was predicted using proposed ANN model for the MHHLP. This proposed method is easily estimated the reliability of the MHHLP and has been validated by ANN model. Hence, the presented ANN model can be applied instead of the MHHLP model, for other implementations.</p>
</sec>
<sec id="sec-10"><title>Acknowledgments</title>
<p>The author would like to express sincere gratitude to all those who contributed to this research, including colleagues and mentors for their valuable insights and constructive feedback.</p>
</sec>
<sec id="sec-11"><title>Funding</title>
<p>This research received no specific grant from any funding agency in the public, commercial, or not-for-profit sectors.</p>
</sec>
<sec id="sec-12"><title>Data Availability</title>
<p>The data used in this study, including the CAB and IAD datasets, are publicly available and have been obtained from previously published sources. Any additional data or computational models generated during this research can be made available upon reasonable request to the corresponding author.</p>
</sec>
<sec id="sec-figures"><title>Figures</title>
<fig><label>Figure</label><caption><p>Image from the PDF file; its caption could not be matched.</p></caption><graphic xlink:href="https://raise.reapress.com/public/journals/1/jats-figures/37/fig-3-92d3b385404f.png"/></fig>
</sec>
</body>
<back><ref-list><title>References</title>
<ref id="ref-1"><label>1</label><mixed-citation>Farahani, R. Z., Hekmatfar, M., Arabani, A. B., &amp; Nikbakhsh, E. (2013). Hub location problems: A review of models, classification, solution techniques, and applications. Computers and industrial engineering, 64(4), 1096–1109. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.cie.2013.01.012">https://doi.org/10.1016/j.cie.2013.01.012</ext-link></mixed-citation></ref>
<ref id="ref-2"><label>2</label><mixed-citation>Teo, C. P., &amp; Shu, J. (2004). Warehouse-retailer network design problem. Operations research, 52(3), 396–</mixed-citation></ref>
<ref id="ref-3"><label>408</label><mixed-citation><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1287/opre.1030.0096">https://doi.org/10.1287/opre.1030.0096</ext-link></mixed-citation></ref>
<ref id="ref-4"><label>3</label><mixed-citation>Jia, H., Ordóñez, F., &amp; Dessouky, M. (2007). A modeling framework for facility location of medical services for large-scale emergencies. IIE transactions, 39(1), 41–55. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1080/07408170500539113">https://doi.org/10.1080/07408170500539113</ext-link></mixed-citation></ref>
<ref id="ref-5"><label>4</label><mixed-citation>An, Y., Zhang, Y., &amp; Zeng, B. (2015). The reliable hub-and-spoke design problem: models and algorithms. Transportation research part b: methodological, 77, 103–122. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.trb.2015.02.006">https://doi.org/10.1016/j.trb.2015.02.006</ext-link></mixed-citation></ref>
<ref id="ref-6"><label>5</label><mixed-citation>Neamatian Monemi, R., Gelareh, S., Hanafi, S., &amp; Maculan, N. (2017). A co-opetitive framework for the hub location problems in transportation networks. Optimization, 66(12), 2089–2106. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1080/02331934.2017.1295045">https://doi.org/10.1080/02331934.2017.1295045</ext-link></mixed-citation></ref>
<ref id="ref-7"><label>6</label><mixed-citation>Correia, I., Nickel, S., &amp; Saldanha-da-Gama, F. (2018). A stochastic multi-period capacitated multiple allocation hub location problem: formulation and inequalities. Omega, 74, 122–134. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.omega.2017.01.011">https://doi.org/10.1016/j.omega.2017.01.011</ext-link></mixed-citation></ref>
<ref id="ref-8"><label>7</label><mixed-citation>Martins de Sá, E., Morabito, R., &amp; de Camargo, R. S. (2018). Benders decomposition applied to a robust multiple allocation incomplete hub location problem. Computers and operations research, 89, 31–50. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.cor.2017.08.001">https://doi.org/10.1016/j.cor.2017.08.001</ext-link></mixed-citation></ref>
<ref id="ref-9"><label>8</label><mixed-citation>Revelle, C. S., Eiselt, H. A., &amp; Daskin, M. S. (2008). A bibliography for some fundamental problem categories in discrete location science. European journal of operational research, 184(3), 817–848. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.ejor.2006.12.044">https://doi.org/10.1016/j.ejor.2006.12.044</ext-link></mixed-citation></ref>
<ref id="ref-10"><label>9</label><mixed-citation>Melo, M. T., Nickel, S., &amp; Saldanha-Da-Gama, F. (2009). Facility location and supply chain management- -A review. European journal of operational research, 196(2), 401–412. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.ejor.2008.05.007">https://doi.org/10.1016/j.ejor.2008.05.007</ext-link></mixed-citation></ref>
<ref id="ref-11"><label>10</label><mixed-citation>Gelareh, S., Nickel, S., &amp; Pisinger, D. (2010). Liner shipping hub network design in a competitive environment. Transportation research part e: logistics and transportation review, 46(6), 991–1004. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.tre.2010.05.005">https://doi.org/10.1016/j.tre.2010.05.005</ext-link></mixed-citation></ref>
<ref id="ref-12"><label>11</label><mixed-citation>Gelareh, S., &amp; Nickel, S. (2011). Hub location problems in transportation networks. Transportation research part e: logistics and transportation review, 47(6), 1092–1111. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.tre.2011.04.009">https://doi.org/10.1016/j.tre.2011.04.009</ext-link></mixed-citation></ref>
<ref id="ref-13"><label>12</label><mixed-citation>Yaman, H., &amp; Elloumi, S. (2012). Star p-hub center problem and star p-hub median problem with bounded path lengths. Computers and operations research, 39(11), 2725–2732. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.cor.2012.02.005">https://doi.org/10.1016/j.cor.2012.02.005</ext-link></mixed-citation></ref>
<ref id="ref-14"><label>13</label><mixed-citation>Korani, E., &amp; Sahraeian, R. (2013). The hierarchical hub covering problem with an innovative allocation procedure covering radiuses. Scientia Iranica, 20(6), 2138–2160. <ext-link ext-link-type="uri" xlink:href="https://scientiairanica.sharif.edu/article_3452.html">https://scientiairanica.sharif.edu/article_3452.html</ext-link></mixed-citation></ref>
<ref id="ref-15"><label>14</label><mixed-citation>Alumur, S. A., Yaman, H., &amp; Kara, B. Y. (2012). Hierarchical multimodal hub location problem with time-definite deliveries. Transportation research part e: logistics and transportation review, 48(6), 1107–1120. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.tre.2012.04.001">https://doi.org/10.1016/j.tre.2012.04.001</ext-link></mixed-citation></ref>
<ref id="ref-16"><label>15</label><mixed-citation>Karimi, H., &amp; Setak, M. (2014). Proprietor and customer costs in the incomplete hub location-routing network topology. Applied mathematical modelling, 38(3), 1011–1023. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.apm.2013.07.033">https://doi.org/10.1016/j.apm.2013.07.033</ext-link></mixed-citation></ref>
<ref id="ref-17"><label>16</label><mixed-citation>Snyder, L. V., Atan, Z., Peng, P., Rong, Y., Schmitt, A. J., &amp; Sinsoysal, B. (2016). OR/MS models for supply chain disruptions: A review. IIE transactions (institute of industrial engineers), 48(2), 89–109. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1080/0740817X.2015.1067735">https://doi.org/10.1080/0740817X.2015.1067735</ext-link></mixed-citation></ref>
<ref id="ref-18"><label>17</label><mixed-citation>Kim, H., &amp; O’Kelly, M. E. (2009). Reliable p-hub location problems in telecommunication networks. Geographical analysis, 41(3), 283–306. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1111/j.1538-4632.2009.00755.x">https://doi.org/10.1111/j.1538-4632.2009.00755.x</ext-link></mixed-citation></ref>
<ref id="ref-19"><label>18</label><mixed-citation>Yaman, H. (2009). The hierarchical hub median problem with single assignment. Transportation research part b: methodological, 43(6), 643–658. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.trb.2009.01.005">https://doi.org/10.1016/j.trb.2009.01.005</ext-link></mixed-citation></ref>
<ref id="ref-20"><label>19</label><mixed-citation>Chopra, S., &amp; Meindl, P. (2007). Supply chain management. Strategy, planning &amp; operation. In Das summa summarum des management. Gabler. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-3-8349-9320-5_22">https://doi.org/10.1007/978-3-8349-9320-5_22</ext-link></mixed-citation></ref>
<ref id="ref-21"><label>20</label><mixed-citation>Chen, S., Yan, Y., &amp; Song, H. (2010). Optimal logistics hubs locations on the multimodal transportation network. In ICLEM 2010: logistics for sustained economic development: infrastructure, information, integratio (Vol. 387, pp. 2853–2858). <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1061/41139(387)399">https://doi.org/10.1061/41139(387)399</ext-link></mixed-citation></ref>
<ref id="ref-22"><label>21</label><mixed-citation>Onyemechi, C. (2010). Regional hubs and multimodal logistics efficiency in the 21st century. Journal of maritime research, 7(2), 63–72.</mixed-citation></ref>
<ref id="ref-23"><label>22</label><mixed-citation>SteadieSeifi, M., Dellaert, N., &amp; Woensel, T. Van. (2014). A multimodal network flow problem with product quality preservation, transshipment, and asset management. Industrial engineering and innovation sciences, 442(January). <ext-link ext-link-type="uri" xlink:href="http://cms.ieis.tue.nl/Beta/Files/WorkingPapers/wp_442.pdf">http://cms.ieis.tue.nl/Beta/Files/WorkingPapers/wp_442.pdf</ext-link></mixed-citation></ref>
<ref id="ref-24"><label>23</label><mixed-citation>Hanasusanto, G. A., Kuhn, D., Wallace, S. W., &amp; Zymler, S. (2015). Distributionally robust multi-item newsvendor problems with multimodal demand distributions. Mathematical programming, 152(1–2), 1–32. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s10107-014-0776-y">https://doi.org/10.1007/s10107-014-0776-y</ext-link></mixed-citation></ref>
<ref id="ref-25"><label>24</label><mixed-citation>Ambrosino, D., &amp; Sciomachen, A. (2016). A capacitated hub location problem in freight logistics multimodal networks. Optimization letters, 10(5), 875–901. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s11590-016-1022-8">https://doi.org/10.1007/s11590-016-1022-8</ext-link></mixed-citation></ref>
<ref id="ref-26"><label>25</label><mixed-citation>Fazayeli, S., Eydi, A., &amp; Kamalabadi, I. N. (2018). A model for distribution centers location-routing problem on a multimodal transportation network with a meta-heuristic solving approach. Journal of industrial engineering international, 14(2), 327–342. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s40092-017-0218-6">https://doi.org/10.1007/s40092-017-0218-6</ext-link></mixed-citation></ref>
<ref id="ref-27"><label>26</label><mixed-citation>Huang, D., Liu, Z., Fu, X., &amp; Blythe, P. T. (2018). Multimodal transit network design in a hub-and-spoke network framework. Transportmetrica a: transport science, 14(8), 706–735. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1080/23249935.2018.1428234">https://doi.org/10.1080/23249935.2018.1428234</ext-link></mixed-citation></ref>
<ref id="ref-28"><label>27</label><mixed-citation>Yuan, X. H., &amp; Feng, Q. Y. (2012). Behavioral modeling of RF power amplifiers with memory effects using orthonormal hermite polynomial basis neural network. Progress in electromagnetics research c, 34, 239–251. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.2528/pierc12091903">https://doi.org/10.2528/pierc12091903</ext-link></mixed-citation></ref>
<ref id="ref-29"><label>28</label><mixed-citation>Hayati, M., Shama, F., Roshani, S., &amp; Abdipour, A. (2014). Linearization design method in class-F power amplifier using artificial neural network. Journal of computational electronics, 13(4), 943–949. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s10825-014-0612-x">https://doi.org/10.1007/s10825-014-0612-x</ext-link></mixed-citation></ref>
<ref id="ref-30"><label>29</label><mixed-citation>Leśniak, A., &amp; Juszczyk, M. (2018). Prediction of site overhead costs with the use of artificial neural network based model. Archives of civil and mechanical engineering, 18(3), 973–982. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.acme.2018.01.014">https://doi.org/10.1016/j.acme.2018.01.014</ext-link></mixed-citation></ref>
<ref id="ref-31"><label>30</label><mixed-citation>Strąkowski, R., Pacholski, K., Więcek, B., Olbrycht, R., Wittchen, W., &amp; Borecki, M. (2018). Estimation of FeO content in the steel slag using infrared imaging and artificial neural network. Measurement, 117, 380–</mixed-citation></ref>
<ref id="ref-32"><label>389</label><mixed-citation><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.measurement.2017.12.031">https://doi.org/10.1016/j.measurement.2017.12.031</ext-link></mixed-citation></ref>
<ref id="ref-33"><label>31</label><mixed-citation>Cooper, S. B., &amp; DiMaio, D. (2018). Static load estimation using artificial neural network: application on a wing rib. Advances in engineering software, 125, 113–125. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.advengsoft.2018.01.007">https://doi.org/10.1016/j.advengsoft.2018.01.007</ext-link></mixed-citation></ref>
<ref id="ref-34"><label>32</label><mixed-citation>Park, S., Kim, M., Kim, M., Namgung, H. G., Kim, K. T., Cho, K. H., &amp; Kwon, S. B. (2018). Predicting PM10 concentration in Seoul metropolitan subway stations using artificial neural network (ANN). Journal of hazardous materials, 341, 75–82. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.jhazmat.2017.07.050">https://doi.org/10.1016/j.jhazmat.2017.07.050</ext-link></mixed-citation></ref>
<ref id="ref-35"><label>33</label><mixed-citation>Sebaaly, H., Varma, S., &amp; Maina, J. W. (2018). Optimizing asphalt mix design process using artificial neural network and genetic algorithm. Construction and building materials, 168, 660–670. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.conbuildmat.2018.02.118">https://doi.org/10.1016/j.conbuildmat.2018.02.118</ext-link></mixed-citation></ref>
<ref id="ref-36"><label>34</label><mixed-citation>Romański, L., Bieniek, J., Komarnicki, P., Dębowski, M., &amp; Detyna, J. (2017). Estimation of operational parameters of the counter-rotating wind turbine with artificial neural networks. Archives of civil and mechanical engineering, 17(4), 1019–1028. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.acme.2017.04.010">https://doi.org/10.1016/j.acme.2017.04.010</ext-link></mixed-citation></ref>
<ref id="ref-37"><label>35</label><mixed-citation>Zavrtanik, N., Prosen, J., Tušar, M., &amp; Turk, G. (2016). The use of artificial neural networks for modeling air void content in aggregate mixture. Automation in construction, 63, 155–161. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.autcon.2015.12.009">https://doi.org/10.1016/j.autcon.2015.12.009</ext-link></mixed-citation></ref>
<ref id="ref-38"><label>36</label><mixed-citation>Kristjanpoller, W., &amp; Minutolo, M. C. (2015). Gold price volatility: A forecasting approach using the Artificial Neural Network--GARCH model. Expert systems with applications, 42(20), 7245–7251. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.eswa.2015.04.058">https://doi.org/10.1016/j.eswa.2015.04.058</ext-link></mixed-citation></ref>
<ref id="ref-39"><label>37</label><mixed-citation>Emamgholizadeh, S., Parsaeian, M., &amp; Baradaran, M. (2015). Seed yield prediction of sesame using artificial neural network. European journal of agronomy, 68, 89–96. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.eja.2015.04.010">https://doi.org/10.1016/j.eja.2015.04.010</ext-link></mixed-citation></ref>
<ref id="ref-40"><label>38</label><mixed-citation>Skorin-Kapov, D., Skorin-Kapov, J., &amp; O’Kelly, M. (1996). Tight linear programming relaxations of uncapacitated p-hub median problems. European journal of operational research, 94(3), 582–593. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/0377-2217(95)00100-X">https://doi.org/10.1016/0377-2217(95)00100-X</ext-link></mixed-citation></ref>
<ref id="ref-41"><label>39</label><mixed-citation>Correia, I., Nickel, S., &amp; Saldanha-da-Gama, F. (2010). The capacitated single-allocation hub location problem revisited: A note on a classical formulation. European journal of operational research, 207(1), 92–96. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.ejor.2010.04.015">https://doi.org/10.1016/j.ejor.2010.04.015</ext-link></mixed-citation></ref>
<ref id="ref-42"><label>40</label><mixed-citation>Ernst, A. T., &amp; Krishnamoorthy, M. (1999). Solution algorithms for the capacitated single allocation hub location problem. Annals of operations research, 86(0), 141–159. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1023/a:1018994432663">https://doi.org/10.1023/a:1018994432663</ext-link></mixed-citation></ref>
<ref id="ref-43"><label>41</label><mixed-citation>Ebery, J. (2001). Solving large single allocation p-hub problems with two or three hubs. European journal of operational research, 128(2), 447–458. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/S0377-2217(99)00370-7">https://doi.org/10.1016/S0377-2217(99)00370-7</ext-link></mixed-citation></ref>
<ref id="ref-44"><label>42</label><mixed-citation>Ernst, A. T., Jiang, H., Krishnamoorthy, M., Baatar, D., Judge, C., &amp; others. (2005). Reformulations and computational results for uncapacitated single and multiple allocation hub covering problems. Unpublished report, csiro mathematical and information sciences, australia. B2n.ir/n97617</mixed-citation></ref>
<ref id="ref-45"><label>43</label><mixed-citation>Aykin, T. (1994). Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem. European journal of operational research, 79(3), 501–523. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/0377-2217(94)90062-0">https://doi.org/10.1016/0377-2217(94)90062-0</ext-link></mixed-citation></ref>
<ref id="ref-46"><label>44</label><mixed-citation>Lee, Y., Lim, B. H., &amp; Park, J. S. (1996). A hub location problem in designing digital data service networks: lagrangian relaxation approach. Location science, 4(3), 185–194. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/S0966-8349(96)00009-5">https://doi.org/10.1016/S0966-8349(96)00009-5</ext-link></mixed-citation></ref>
<ref id="ref-47"><label>45</label><mixed-citation>Marín, A. (2005). Uncapacitated euclidean hub location: Strengthened formulation, new facets and a relax-and-cut algorithm. Journal of global optimization, 33(3), 393–422. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s10898-004-6099-4">https://doi.org/10.1007/s10898-004-6099-4</ext-link></mixed-citation></ref>
<ref id="ref-48"><label>46</label><mixed-citation>Contreras, I., Díaz, J. A., &amp; Fernández, E. (2009). Lagrangean relaxation for the capacitated hub location problem with single assignment. OR spectrum, 31(3), 483–505. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s00291-008-0159-y">https://doi.org/10.1007/s00291-008-0159-y</ext-link></mixed-citation></ref>
<ref id="ref-49"><label>47</label><mixed-citation>Ishfaq, R., &amp; Sox, C. R. (2011). Hub location-allocation in intermodal logistic networks. European journal of operational research, 210(2), 213–230. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.ejor.2010.09.017">https://doi.org/10.1016/j.ejor.2010.09.017</ext-link></mixed-citation></ref>
<ref id="ref-50"><label>48</label><mixed-citation>Mohammadi, M., Torabi, S. A., &amp; Tavakkoli-Moghaddam, R. (2014). Sustainable hub location under mixed uncertainty. Transportation research part e: logistics and transportation review, 62, 89–115. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.tre.2013.12.005">https://doi.org/10.1016/j.tre.2013.12.005</ext-link></mixed-citation></ref>
<ref id="ref-51"><label>49</label><mixed-citation>He, Y., Wu, T., Zhang, C., &amp; Liang, Z. (2015). An improved MIP heuristic for the intermodal hub location problem. Omega (united kingdom), 57, 203–211. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.omega.2015.04.016">https://doi.org/10.1016/j.omega.2015.04.016</ext-link></mixed-citation></ref>
<ref id="ref-52"><label>50</label><mixed-citation>Haykin, S. (1994). Neural Networks: A Comprehensive Foundation. Prentice Hall PTR. <ext-link ext-link-type="uri" xlink:href="https://dl.acm.org/doi/abs/10.5555/541500">https://dl.acm.org/doi/abs/10.5555/541500</ext-link></mixed-citation></ref>
<ref id="ref-53"><label>51</label><mixed-citation>Khoshroo, A., Emrouznejad, A., Ghaffarizadeh, A., Kasraei, M., &amp; Omid, M. (2018). Sensitivity analysis of energy inputs in crop production using artificial neural networks. Journal of cleaner production, 197, 992–</mixed-citation></ref>
<ref id="ref-54"><label>998</label><mixed-citation><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.jclepro.2018.05.249">https://doi.org/10.1016/j.jclepro.2018.05.249</ext-link></mixed-citation></ref>
<ref id="ref-55"><label>52</label><mixed-citation>O’kelly, M. E. (1987). A quadratic integer program for the location of interacting hub facilities. European journal of operational research, 32(3), 393–404. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/S0377-2217(87)80007-3">https://doi.org/10.1016/S0377-2217(87)80007-3</ext-link></mixed-citation></ref>
<ref id="ref-56"><label>53</label><mixed-citation>Karimi, H., &amp; Bashiri, M. (2011). Hub covering location problems with different coverage types. Scientia iranica, 18(6), 1571–1578. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.scient.2011.09.018">https://doi.org/10.1016/j.scient.2011.09.018</ext-link></mixed-citation></ref>
</ref-list></back>
</article>