Research Article  Open Access
Application of Hierarchical Facility LocationRouting Problem with Optimization of an Underground Logistic System: A Case Study in China
Abstract
Facility location problem (FLP) and vehicle routing problem (VRP) are two of the most challenging issues in logistics. This paper presents an exploration of the multinode facility locationrouting problem with realistic conditions. The disposal centers, transfer stations, connected collection sites, and unconnected collection sites are built into a new hierarchical model which is solved by Generate Algorithm (GA). Model costs include node construction cost, pipeline construction cost, transport cost, and transfer cost. This paper considers that the transportation is a bidirectional flow not a single flow; each pairs node in the area needs transportation; the dynamic routing selection method is used to determine the routes of unconnected collection sites. FLP and VRP can be both solved in this model. To illustrate the applicability of the model, a case study is presented and the results are discussed. The model in this paper can reduce the cost of the traditional underground logistics system by 6%~8% in experiments.
1. Introduction
The convenience of online consumption has significantly prompted the development of the logistics industry, but the accompanying cost and time concerns had attracted great attention due to the traffic congestion in cities. Accordingly, the future logistics system will gradually shift to the underground, forming an underground logistics system (ULS) [1]. Developed countries such as the Netherlands, the United States, Japan, the United Kingdom, and Germany have initially built ULS. Figure 1 shows the Cargo Cap in Germany.
Logistic companies wish to reduce the overall cost of locating facilities and delivering goods. Instead of solving problems independently and combining their solutions, it is naturally better for such companies to consider problems in an integrated way because decisions can be taken simultaneously benefiting the overall cost minimization. In this sense, the locationrouting problem (LRP) can be perfectly suitable for the ULS.
LRP is a combination of two NPhard optimization problems [2, 3] which are facility location problem (FLP) [4] and vehicle routing problem (VRP) [5]. It is necessary to define, at a minimum cost, where to open facilities (depots, factories, warehouses, etc.) for serving customers’ demands in the FLP, while it is necessary to determine routes of an overall minimum cost, which depart from a single facility for serving customers’ demands in the VRP. Both objectives must be met, resulting in the overall minimum cost related to locating facilities and determining vehicle routes departing from these facilities to meet customers’ demands in the LRP.
FLP has been widely researched. Aikens [6] proposed nine basic location models, including a simple location model, a capacitylimited location model, a demandchanging location model, and a dynamic location model, which were solved by using the DantzigWolfe decomposition algorithm. The subgradient optimization method was used to accelerate the convergence of the above algorithms. Holmberg K [7] considered the location problem of nonlinear transportation costs and solves it by the branch and bound method. Steven J.E. and Russell D.M. [8] also established a location model that considered inventory factors and used heuristic algorithms to solve them. Basti and Sevkli [9] studied pmedian FLP aiming to minimize the maximum distance between nodes and facilities. Wang F [10] has considered the robust FLP with penalties, aiming to serve only a specified fraction of the clients. Tran T H [11] introduced a largescale neighborhood search procedure for solving the singlesource capacitance FLP (SSCFLP).
Many methods have also been proposed to solve VRP. Clarke and Wright [12] proposed the saving method by listing the savings between points and constructing the path of large to small according to the saving amount. It has the advantage of fast calculation speed, but there are uncombined points and the edge points are difficult to combine. The problem with the scanning method proposed by Gillett and Miller [13] has a good effect, but this is nonprogressive optimization. Vidal T [14] proposed unified hybrid genetic search metaheuristic relied on problemindependent unified local searches, genetic operators, and advanced diversity management methods. Extensive computational experiments demonstrated the remarkable performance of the method which matched or outperformed the current stateoftheart problemtailored algorithms. Lai M [15] presented a novel twostage hybrid metaheuristic method of VRP. The first stage adopts improved ant colony optimization (IACO) to determine the minimum number of used vehicles. The second stage employs improved Tabu search to optimize the total travel cost, in which the initial solutions are obtained by IACO in the first stage.
The studies mentioned above all address either FLP or VRP but not both. For an effective response to an emergency, the planning for these two disaster phases (location and routing) must be coordinated, thus producing an LRP that aims to determine the locations of the depots while simultaneously determining dispatch routes. Locationrouting models have been studied by many researchers since the late 1980s. Early LRP was considered in deterministic environments [16–18]. Stochastic locationrouting models were subsequently studied by scholars. ToroDíaz [19] developed a mathematical model for the LRP of emergency medical services with the objective of minimizing the response time and maximizing coverage. Caunhye [20] proposed a twostage locationrouting model with random demands. They solved the model by converting it into a singlestage counterpart. Gao [21] introduced an ant colony algorithm to solve the LRP of dynamic environments consisting of random and cyclic traffic factors. In past years, several other studies on LRP at random environments have been developed, such as Chan [22], Zhu [23], and Marinakis [24].
In this paper, we presented a fourlevel model (disposal center, transfer station, connected collection sites, and unconnected collection sites) to minimize the cost of the underground logistics system instead of the traditional threelevel model (disposal center, transfer station, and collection sites). Meanwhile, the model we proposed can solve FLP and VRP both unlike the currently related research which can only solve them separately.
The paper is further organized as follows. Section 2 presents a brief review of some basic concepts, assumptions, and routing selection method. In Section 3, we formulate a multiobjective optimization model for the determinate phenomenon. Section 4 presented a compared model and the parameter of Generate Algorithm (GA). Section 5 provides experiments and results analysis. Finally, a brief conclusion and outlook for potentially future research are given in Section 6.
2. Preliminaries
This section introduces some fundamental concepts, basic assumptions, and routing selection method.
Based on the existing research, the traditional underground logistics system first divided nodes into three parts which are logistics park nodes (disposal centers), primary nodes (transfer stations), and secondary nodes (collection sites). The logistics park (disposal center) first accepts the goods from the other areas and then transports the goods to the primary nodes (transfer stations) through the underground logistics pipeline after simple selection. The goods are transported through the underground logistics pipeline from primary nodes to secondary nodes (collection sites) after selection and transported to the customer by the secondary nodes. After solving the FLP, some methods are used to calculate the routes [12–15].
In this paper, we first divided nodes into four parts which are logistics park nodes (disposal centers), primary nodes (transfer stations), secondary nodes (connected collection sites), and tertiary nodes (unconnected collection sites). The first two nodes are the same as the traditional underground logistics system, but when goods are transported to secondary nodes (connected collection sites) through underground pipe, they will be transported to tertiary nodes (unconnected collection sites) through ground transport system. After that, the routing will be decided by dynamic path selection method in Section 2.2.
2.1. Assumptions
The model assumptions in this paper:
Each basic node can be transformed into a primary node, secondary node, or a tertiary node, and the amount of freight and distance between each node (the distance considered in this paper is a straightline distance) are all known.
Different primary or secondary nodes have different cargo throughput capacity limits, and those limits are known.
There are no hierarchies of the transport pipelines and the capacity of the pipeline restrictions is known.
The construction costs of the primary and secondary nodes are known. the construction cost of pipeline is related to the length of pipeline regardless of the influence of the terrain or the like.
Transport price of the goods are different from the underground and ground.
The freight volume of two nodes are only allocated to the same transportation pipeline.
The primary nodes and secondary nodes can only serve tertiary nodes within a radius.
Goods within the region can be transported through all nodes.
Price of processing and transshipment of goods for nodes are the same and known.
2.2. Dynamic Routing Selection Method
In the traditional ULS, all nodes are connected to underground pipe which is not necessary. In this paper, we divided secondary nodes into two parts based on whether being connected to underground pipe or not. In this way, we can use the ground transport system and reduce the construction cost of the underground pipelines and nodes; even the ground transportation cost is higher than underground transportation cost because of the waiting cost etc. The logistics underground network in this paper is shown in Figure 2.
In this paper, the route of a tertiary node is not certain because it can use ground transport system with no limit. Therefore, we are using a dynamic routing selection method to decide the route. The reference sample is shown in Figure 3.
As shown in Figure 3, the logistics park node has cargo to be transported to the tertiary node . There are two routes selection options:
Cargo can be transported from the logistics park through the underground pipeline to the primary node , then from underground logistics pipeline to the secondary node , and finally by ground to the tertiary node .
Cargo can be transported from the logistics park through the underground pipeline to the primary node and then transported by ground to the tertiary node .
Now, we set the tertiary node as a secondary node and the underground pipes and actually exist. Therefore, we can use algorithm to determine the shortest way of ; let us call it ; and then we can calculate the transport cost of underground routing and ground routing separately. The determined formula is shown in Section 3.
3. Problem Description
In this paper, the goals of our problem are to determine the subset of nodes and to plan the routes from logistics park to other nodes.
3.1. Notations and Definitions
Let us first introduce the notations and decision variables that will be used to model the problem.
Indices : Logistics park : Basic nodes.
Parameters : Daily depreciation cost for a single primary node : Daily depreciation cost for a single secondary node : Daily depreciation cost per kilometer pipeline : Underground transport cost per ton per kilometer : Ground transport cost per ton per kilometer : Cost of transit services per ton of cargo transshipment : The serving range : The capacity limits of the pipe : The throughput capacity limits of the primary node : The throughput capacity limits of the secondary node.
Decision Variables and Decision Vectors : All nodes set : Nodes set of primary nodes : Nodes set of secondary nodes : Nodes set of primary and secondary nodes : Nodes set of secondary and tertiary nodes : Nodes set of tertiary nodes : Path existence matrix : 1 if the pipe between and exists, 0 otherwise, : Distance matrix : Freight volume matrix : Available distance existence matrix : The shortest path from to through : Node construction cost : Pipeline construction cost : Transportation cost : Transfer cost.
3.2. Multiobjective LocationRouting Model
The objective function of this model is the total cost function which includes the node construction cost, the pipeline construction cost, the transport cost of the region, and transfer cost.
3.2.1. Objective 1: Node Construction Cost
According to the path existence matrix , if a certain node is connected to a logistics park , that is, , , we can get and .It can be known that a tertiary node is not connected to any other nodes; that is, if , , then the node is a tertiary node, so we can get and . After the numbers of , , and are all known, we can calculate the node construction cost using which means the number of elements of set ; that is,
3.2.2. Objective 2: Pipeline Construction Cost
According to the available distance existence matrix whose element represents the straightline distance from to , we can calculate the pipeline construction cost; that is,
3.2.3. Objective 3: Transport Cost
The transport cost consists of two parts: one is the transport cost of the node connected to the underground pipeline, and the other is the transport cost of the tertiary nodes.
According to the node distance matrix , we can determine the shortest distance and the transport order for nodes except through algorithm. We can calculate the first part of the transportation cost as ; that is, According to Section 2.2, for each node of , we set the routes whose distance between and other nodes from is less than the existing serving range. That is, for each from , we have node distance matrix .
According to the node distance matrix , we can determine the shortest distance and transport order for the node which is from through algorithm. We set that order as , so the underground transport distance is and the ground transport distance is , so we can calculate the second part ; that is,
The routing may not be the same because the freight volumes and are not the same. The method we proposed is a dynamic routing selection method, so it is necessary to calculate the transport cost of nodes from to nodes of . That means that we have another order , and we can calculate the third part ; that is,
We have calculated the transport cost of nodes from to , to , to , and then we need to calculate the transport cost of nodes from to .
For the node from transport to another node which is from , using the dynamic routing selection method; the order should be , and we can calculate the last part; that is, so the total transport cost can be calculated as
3.2.4. Objective 4: Transfer Cost
According to Section 3.2.3, we have determined all the routing order, so we can get the number of nodes of each routing as , so the transfer cost can be calculated; that is, so the objective function of this model is
3.3. Constraints
The tertiary nodes must be within the service scope of a primary or secondary node; that is,
The tertiary nodes are not connected to the underground pipelines; that is,
All secondary nodes belong to a primary node and form a set with the primary node. The secondary nodes in the set can only be connected to nodes in the set and are not connected to other similar sets of nodes; that is, The cargo flow should be smaller than the pipe capacity limit ; that is, The total amount of goods of a secondary node’s own goods and the tertiary nodes served shall not exceed the node’s throughput capacity limit ,
4. Layout Optimization Based on GA
The model established in this paper belongs to the complex space search problem with multiobjective and multiconstraint conditions. The conventional solution method has poor timeliness and large calculation volume. This paper adopts with migration operation in the heuristic algorithm [25] to solve this kind problem.
4.1. Comparison Model
To verify the validity of this model, we use the model in the literature of YI Mei [26] to conduct a controlled trial. YI Mei uses a traditional optimization model to classify all nodes into primary nodes and secondary nodes. When building the objective function, it not only considers the amount of freight between the logistics park and all nodes, but also considers the amount of freight between nodes.
Since YI Mei’s model assumes that the position of primary and secondary nodes are known, we modified YI Mei’s model. First, we used to generate the location of the primary nodes and secondary nodes, and each solution can get an optimal network and the minimum cost through the YI Mei model; then we use the minimum cost as a fitness function to choose the best network and the lowest cost of the issue. The modified model is referred to as a comparison model. For convenience, we call the model of this paper “model ” and the comparison model “model ”.
4.2. Selecting the Number of Solution Variables
A binary encoding GA is applied for the specific problem of this paper. The solution to the genetic algorithm is a row vector form. The value of each component indicates whether there is an underground pipe connection between corresponding nodes or not. Assume that there are basic nodes and logistics parks. Because the logistics parks are not connected with each other and the nodes are not connected by themselves, the pipeline connection corresponding to all components in the solution vector can be converted into an upper triangular matrix with all diagonal elements 0; the solution vector length is , and the presence matrix is a square matrix. Assuming there are 2 logistics parks and 3 basic nodes, the solution vector length is 9 and the ordering is represented as . A 55 presence matrix can be generated from the above variables, as shown in Figure 4.
The first three solutions are converted to , which represent the relationship between the path from the 1st logistics park to those three nodes; the solutions are converted to , representing the relationship between the path from the 2nd logistics park to those three nodes; and the solutions are converted to , representing the path existence between the 3rd basic node and the other two basic nodes. The solution is converted to , which represents the existence of a path from the basic node 4 to the basic node 5.
According to the above conversion relationships, the path existence relationship between nodes can be pushed out from the final solution.
4.3. Parameters Setting of GA
The parameters of the GA are shown in Table 1.

5. Experiment and Result Analysis
The experimental data used in this paper are the data on the 2017 China Graduate Mathematical Contest Modeling Problem F [27]. The logistics data are from Jiangsu Province, China. The competition titles require the construction of an underground logistics network with the lowest total cost.
For better comparing the merits of the models, we randomly select two sets of data from the original data. The first set of data has 2 logistics parks and 20 sets of basic nodes, and the second set of data has 2 logistics parks and 30 sets of basic nodes. The relevant costs of nodes and pipeline construction and other parameters are shown in Table 2.

According to the parameters and experimental data, this paper obtains the iterative result graphs and the best individuals for the two models under the corresponding data, as shown in Figure 5.
From Figure 5, we can see that, whether it is a group of 20 basic nodes or 30 basic nodes, the GA can show stable convergence of two different models. Moreover, the total cost of pipe network construction obtained by Model is less than the total cost of the Model . With the increase in basic data points, the cost reduction rate is greater. For example, with the 20 basic nodes, the total cost of the Model is approximately 2.56424 (million RMB/day), while the total cost of the Model is about 2.73251 (million RMB/day), which is a decrease of 6.16%. Compared to the basic nodes reaching 30 groups, the total cost of Model is about 3.38837 (million RMB/day), while the total cost of Model is approximately 3.7159 (million RMB/day), which is a decrease of 8.81%.
Table 3 compares the numbers of the primary, secondary, and tertiary nodes that need to be constructed under the two models. It can be seen that under the Model , it can be found through the comparison of the number of nodes that, whether in 20 data points or 30 data points, the results obtained by the Model can greatly reduce the number of nodes to be built in practical applications.

Qualitative Analysis. In the first case, the Model needs to build 14 nodes in total, and the Model needs to build 20. In the second case, the Model needs to build a total of 20 nodes, and the Model needs to build 30 Nodes which greatly reduce the node’s construction costs. Table 4 is a detailed comparison of the total construction cost and the cost of each part of different algorithms. The pipeline construction cost and transport cost of Model are less than the pipeline construction cost and transport cost of Model .

Quantitative Analysis. According to the best individual obtained by the GA, specific costs can be obtained as shown in Table 4. From the table, when the node data are 20, the cost of Model is less than the cost of Model . This shows that Model is obviously better than Model and is implemented.
The best individuals of GA are shown in Figure 6. According to Figure 6, the final underground logistics networks pipeline diagram can be obtained.
Figure 6 indicates all the best individuals corresponding to the solution obtained under two different models of optimization results. According to Section 4.2, these best individuals stand for the corresponding two nodes that need to be connected to an underground pipe. The optimal solution obtained by the genetic algorithm can be converted into a path existence matrix. According to this model, the data on the entire underground logistics network can be obtained. All the best network pipeline diagrams obtained under different models are shown in Figure 7. Model needs underground pipelines to connect all nodes, but under the Model , some nodes do not need to connect to underground pipelines under the premise of meeting the distribution scope and can only meet the distribution requirements through the traditional ground logistics transportation.
In Figure 7, the color of the connection between the nodes is given randomly and has no special meaning.
6. Conclusion
In this paper, we studied the multidepot facilities locationrouting problem with realistic conditions to build an underground logistics system. This paper considered that the transportation is a bidirectional flow not a single flow, each pairs node in the area needs transport, using the dynamic routing selection method to determine the routing of unconnected collection sites. Due to the computational complexity of the model, a genetic algorithm was designed to solve the proposed model. The efficiency of the proposed model was illustrated with experiments. Compared with previous work, the main contribution of our paper is to propose a new fourlevel hierarchical model which simultaneously considered the FLP and VRP both.
Data Availability
The total data we use in the paper is owned by a third party. It can be checked from the following link: http://gmcm.seu.edu.cn/01/49/c12a329/page.htm This data is used to support the China Postgraduate Mathematical Contest in Modeling. We did not use all the data. To better compare the advantages and disadvantages of our established models and traditional models, we randomly selected two sets of data of different sizes from all the data used to conduct experiments. If you need these data sets, we can submit them to you. They are also available from the corresponding author upon request.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
References
 M. A. ZuJun, Urban Underground Logistics System and its Design, Logistics Technology, 2004.
 M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness, W. H. Freeman, San Francisco, Calif, USA, 1979. View at: MathSciNet
 G. Laporte and Y. Nobert, “An exact algorithm for minimizing routing and operating costs in depot location,” European Journal of Operational Research, vol. 6, no. 2, pp. 224–226, 1981. View at: Publisher Site  Google Scholar
 K. Holmberg, “Exact solution methods for uncapacitated location problems with convex transportation costs,” European Journal of Operational Research, vol. 114, no. 1, pp. 127–140, 1999. View at: Publisher Site  Google Scholar
 T. Wu, C. Low, and J. Bai, “Heuristic solutions to multidepot locationrouting problems,” Computers & Operations Research, vol. 29, no. 10, pp. 1393–1415, 2002. View at: Publisher Site  Google Scholar
 C. H. Aikens, “Facility location models for distribution planning,” European Journal of Operational Research, vol. 22, no. 3, pp. 263–279, 1985. View at: Publisher Site  Google Scholar  MathSciNet
 S. H. Owen and M. S. Daskin, “Strategic facility location: a review,” European Journal of Operational Research, vol. 111, no. 3, pp. 423–447, 1998. View at: Publisher Site  Google Scholar
 S. J. Erlebacher and R. D. Meller, “The interaction of location and inventory in designing distribution systems,” IIE Transactions, vol. 32, no. 2, pp. 155–166, 2000. View at: Google Scholar
 M. Basti and M. Sevkli, An artificial bee colony algorithm for the pmedian facility location problem, vol. 4(4 1), 2015.
 F. Wang, D. Xu, and C. Wu, “Approximation algorithms for the robust facility location problem with penalties,” in Advances in global optimization, vol. 95 of Springer Proc. Math. Stat., pp. 129–135, Springer, Cham, 2015. View at: Publisher Site  Google Scholar  MathSciNet
 T. H. Tran, M. P. Scaparra, and J. . O'Hanley, “A hypergraph multiexchange heuristic for the singlesource capacitated facility location problem,” European Journal of Operational Research, vol. 263, no. 1, pp. 173–187, 2017. View at: Publisher Site  Google Scholar  MathSciNet
 G. Clarke and J. W. Wright, “Scheduling of vehicles from a central depot to a number of delivery points,” Operations Research, vol. 12, no. 4, pp. 568–581, 1964. View at: Publisher Site  Google Scholar
 B. Gillett and L. Miller, “A heuristic algorithm for the vehicle dispatch problem,” Operations Research, vol. 22, no. 2, pp. 340–350, 1974. View at: Publisher Site  Google Scholar
 T. Vidal, T. G. Crainic, M. Gendreau, and C. Prins, “A unified solution framework for multiattribute vehicle routing problems,” European Journal of Operational Research, vol. 234, no. 3, pp. 658–673, 2014. View at: Publisher Site  Google Scholar  MathSciNet
 M. Lai and X. Tong, “A metaheuristic method for vehicle routing problem based on improved ant colony optimization and tabu search,” Journal of Industrial and Management Optimization, vol. 8, no. 2, pp. 469–484, 2012. View at: Publisher Site  Google Scholar  MathSciNet
 “Vehicle routing: methods and studies,” Studies in Management Science and Systems, vol. 16, 1988. View at: Google Scholar  MathSciNet
 D. Tuzun and L. I. Burke, “Twophase tabu search approach to the location routing problem,” European Journal of Operational Research, vol. 116, no. 1, pp. 87–99, 1999. View at: Publisher Site  Google Scholar
 G. Laporte, “Fifty years of vehicle routing,” Transportation Science, vol. 43, no. 4, pp. 408–416, 2009. View at: Publisher Site  Google Scholar
 H. ToroDíaz, “Joint location and dispatching decisions for Emergency Medical Services,” Computers & Industrial Engineering, vol. 64, no. 4, pp. 917–928, 2013. View at: Publisher Site  Google Scholar
 S. Gao, Y. Wang, J. Cheng, Y. Inazumi, and Z. Tang, “Ant colony optimization with clustering for solving the dynamic location routing problem,” Applied Mathematics and Computation, vol. 285, pp. 149–173, 2016. View at: Publisher Site  Google Scholar  MathSciNet
 A. M. Caunhye, Y. Zhang, M. Li, and X. Nie, “A locationrouting model for prepositioning and distributing emergency supplies,” Transportation Research Part E: Logistics and Transportation Review, vol. 90, pp. 161–176, 2016. View at: Publisher Site  Google Scholar
 Y. Chan, W. B. Carter, and M. D. Burnes, “A multipledepot, multiplevehicle, locationrouting problem with stochastically processed demands,” Computers & Operations Research, vol. 28, no. 8, pp. 803–826, 2001. View at: Publisher Site  Google Scholar
 Y. Zhu, J. Zhang, and K. Partel, “Locationaided routing with uncertainty in mobile ad hoc networks: A stochastic semidefinite programming approach,” Mathematical and Computer Modelling, vol. 53, no. 1112, pp. 2192–2203, 2011. View at: Publisher Site  Google Scholar
 Y. Marinakis, “An improved particle swarm optimization algorithm for the capacitated location routing problem and for the location routing problem with stochastic demands,” Applied Soft Computing, vol. 37, pp. 680–701, 2015. View at: Publisher Site  Google Scholar
 J. C. Potts, T. D. Giddens, and S. B. Yadav, “The Development and Evaluation of an Improved Genetic Algorithm Based on Migration and Artificial Selection,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 24, no. 1, pp. 73–86, 1994. View at: Publisher Site  Google Scholar
 Y. I. Mei and A. L. Zhou, “Research on a logistics network planning model of the urban underground,” Journal of Transport Science Engineering, 2016. View at: Google Scholar
 Data source: http://gmcm.seu.edu.cn/01/49/c12a329/page.htm.
Copyright
Copyright © 2018 Yingpeng Hu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.