Next Article in Journal
The Impact of Particulate Matter on Outdoor Activity and Mental Health: A Matching Approach
Previous Article in Journal
Colonization of Dental Unit Waterlines by Helicobacter pylori: Risk of Exposure in Dental Practices
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Optimization of Location-Routing Problem in Emergency Logistics Considering Carbon Emissions

1
College of Mechanical Engineering, Chongqing University, Chongqing 400044, China
2
School of Management Science and Real Estate, Chongqing University, Chongqing 400044, China
3
School of Transportation and Logistics, Southwest Jiaotong University, Chengdu 610031, China
4
School of Aeronautic Science and Engineering, Beihang University, Beijing 100191, China
*
Author to whom correspondence should be addressed.
Int. J. Environ. Res. Public Health 2019, 16(16), 2982; https://doi.org/10.3390/ijerph16162982
Submission received: 30 June 2019 / Revised: 2 August 2019 / Accepted: 13 August 2019 / Published: 19 August 2019

Abstract

:
In order to solve the optimization problem of emergency logistics system, this paper provides an environmental protection point of view and combines with the overall optimization idea of emergency logistics system, where a fuzzy low-carbon open location-routing problem (FLCOLRP) model in emergency logistics is constructed with the multi-objective function, which includes the minimum delivery time, total costs and carbon emissions. Taking into account the uncertainty of the needs of the disaster area, this article illustrates a triangular fuzzy function to gain fuzzy requirements. This model is tackled by a hybrid two-stage algorithm: Particle swarm optimization is adopted to obtain the initial optimal solution, which is further optimized by tabu search, due to its global optimization capability. The effectiveness of the proposed algorithm is verified by the classic database in LRP. What’s more, an example of a post-earthquake rescue is used in the model for acquiring reliable conclusions, and the application of the model is tested by setting different target weight values. According to these results, some constructive proposals are propounded for the government to manage emergency logistics and for the public to aware and measure environmental emergency after disasters.

1. Introduction

Since the 1950s, the number and scale of major natural disasters (such as earthquakes, tsunamis, cyclones, floods, volcanoes and etc.) have grown exponentially [1]. These have resulted in catastrophic consequences, which are closely related to resource waste and environmental degradation. In 1991, the Mumbai heating belt storm left nearly 140,000 casualties. In 2004, the Indian Ocean tsunami caused 230,000 deaths. In 2008, the Wenchuan earthquake in China killed 69,227 people and injured 374,643 people. Moreover, in August 2017, Hurricane Harvey produced $180 billion in damage and impacted 13 million people. Nevertheless, the occurrence of natural disasters is inevitable [2]. In the face of frequent natural disasters, taking active measures has become a major problem that all countries in the world must face in solving sudden natural disasters [3].
In order to reduce severity and fatality in a disaster, emergency logistics has been an efficient and effective relief means [4,5], which contents a series of actions performed before, during and after a natural disaster. Compared with traditional commercial logistics, emergency logistics is more challenging and unpredictable [6]. The two cores of the relief material dispatching decision are the location of emergency distribution centers (DCs) before disasters and the route arrangement of vehicles after disasters, which are called location allocation problems (LAP) and vehicle routing problems (VRP) respectively. On the one hand, it is necessary to establish a certain number and scale of emergency DCs in suitable locations to store and allocate relief materials from all over the country; on the other hand, it is necessary to dispatch appropriate vehicles to select reasonable routes to distribute relief materials from the DCs to the demand points. In actual life, LAP and VRP are highly correlated, of which the combination is called location routing problems (LRP). However, when distributing relief supplies, the vehicles emit a certain amount of carbon dioxide, which will exacerbate climate change [7]. The deterioration of the environment is one of the considerable causes of frequent natural disasters. Thus, it is essential to take carbon emissions into account, while optimizing location routing problem in emergency logistics, for realizing a relative balance between rescue activities and environmental protection in the long run.
The remainder of this paper is organized as follows. In the next section, the previous literature on LRP is introduced. Section 3 builds a multi-objective FLCOLRP model. A two-phase algorithm is proposed to solve the built model in Section 4. Section 5 performs a series of experiments and analyzes the results. Finally, the conclusions of this article and the outlook for future research are presented in Section 6.

2. Literature Review

Since the core of this research is to gain an overall optimal solution for LRP in emergency logistics considering carbon emissions. Thus, we will review the related literature from the following two aspects: The algorithm of LRP in emergency logistics and sustainability issues in LRP, including carbon emissions.

2.1. Algorithm for LRP in Emergency Logistics

Due to the high complexity and difficulty of LAP and VRP [8,9,10], they were presented separately in previous studies. Actually, the interaction between LAP and VRP was put forward in the 1970s [11]. In later research, LAP and VRP started to be integrated as a complex combinatorial optimization problem called LRP. There are various exact methods, approximation algorithms and heuristic algorithms proposed to solve LRP [12], such as the branch-and-price method [13], the Lagrangian Relaxation-Granular Tabu Search (LRGTS) algorithm [14], the Multiple Ant Colony Optimization (MACO) algorithm [15], the Non-dominated Sorting Genetic Algorithm II (NSGA-II) [16], the Particle Swarm Optimization (PSO) algorithm [17], the integrated Non-dominated Sorting Genetic Algorithm II (NSGA-II) and Multi-Objective Particle Swarm Optimization (MOPSO) [18] and etc.
LRP has plenty of real-life applications [19] involving newspaper distribution, energy enterprise material distribution, e-commerce distribution, garbage recycling, military application and etc. Over the last decade, some scholars paid attention to LRP in emergency logistics owing to the active occurrence and the devastating aftermaths of natural disasters. Yi and Özdamar [20] discussed the coordination of material distribution and wounded migration in disaster response activities and built a mixed-integer multi-commodity network flow model which considered the location of temporary medical points, the assignment of medical personnel, the allocation of relief material and the decision of vehicle transportation path. In this study, a simple routing algorithm and a linear solution were proposed to solve the model. Zheng et al. [21], from the perspective of integration and optimization of emergency logistics system, established a multi-objective LRP optimization model with fuzzy demand for relief materials. In order to deal with the model, they introduced a new multi-objective genetic algorithm which averted the boundedness of traditional multi-objective optimization ways. Based on the research [21], Ma et al. [22] built a fuzzy multi-objective open LRP model which added the deadlines, the different types of delivery vehicles, as well as the open vehicle paths. A hybrid genetic algorithm combining heuristic rules was designed in this study. Rath and Gutjahr [23] presented the modified warehouse location-routing problem in disaster relief and established a multi-objective mixed-integer linear programming model which included strategic costs, operative costs and uncovered demand. An exact method was introduced to tackled small instances; A constraint pool heuristic was more suitable for larger examples. Both of them adopt the adaptive epsilon-constraint algorithm as the basic method. Alem et al. [24] addressed a novel two-phase stochastic network flow model which involved the preposition of disaster relief points and the decision for transportation. A simple two-phase heuristic was presented to solve this model and tested by real cases.

2.2. Sustainability Issues in LRP

With the increasing emphasis on the environment, a large number of articles on low-carbon transportation have emerged. In recent years, some studies have begun to concern about the reduction of carbon emissions in LRP. In 2014, Govindan et al. [25] designed a sustainable supply chain network (SCN) of perishable food and addressed a multi-objective optimization model to solve LRP with time windows. The economic objective of the model was to minimize the fixed costs, transportation costs, inventory costs, variable costs, penalty costs. The environmental objective of the model was to calculate greenhouse gas emissions throughout the network. In the same year, Ramos et al. [26] presented a sustainable reverse logistics system and proposed the three concerns: Economic aspects, environmental aspects and social aspects. This paper debated the balance between the objectives and employed a real recyclable waste collection case to gain an approximate value of the Pareto frontier. Tang et al. [27] established a location-routing-inventory integration problem optimization model, which introduced the carbon-capped difference. The objective of the model was to decline the total costs and carbon emissions. In this study, carbon trading prices were proposed to convert carbon emissions into carbon emissions costs in the objective function. Based on the research [27], Tang et al. [28] considered the customer’s limited “carbon behavior” preferences and introduced an environmental factor as a feature vector for carbon emissions in 2016. A multi-objective function with the lowest cost and the lowest carbon emissions was constructed. This paper proved that the customer’s limited “carbon behavior” preferences and the product environmental degree had an impact on the company’s operational plans and revenue levels. In 2017, a green capacitated location-routing problem was firstly addressed by Toro et al. [29]. They proposed the location of multi-depots and the routing of multi-vehicles, and developed a novel mathematical model which considered the greenhouse gas emissions. The target of this model was to minimize operating costs and minimize fuel consumption. In 2018, Ebrahimi [30] raised a sustainable loop-locked SCN and formulated a location-allocation-routing optimization model with the goals of minimizing the total costs and the environmental impact. In order to test the availability of the model, he adopted a real Iranian case. Meanwhile, Wang et al. [31] studied the low-carbon LRP for cold chain logistics and designed the mathematical model with the lowest total costs, including carbon emissions costs. In this study, it was proved that a certain range of carbon taxes could affect the carbon emissions of the cold chain logistics industry. Recently, Zhang et al. [32] introduced the sustainable LRP in emergency logistics and established a multi-objective model which included the targets of minimum travel time, relief costs, carbon emissions. They regarded travel time as their main goal and regard relief costs and carbon emissions as restrictions, converting multi-objective into single-objective.
To sum up, according to the analysis of the above two parts, there are numerous pieces of literature on the algorithm of LRP in emergency logistics. Simultaneously, the studies about sustainability issues in LRP have appeared extensively in the last five years. The objectives of the current studies are mainly to minimize the total costs and the environment effect. Taking into account the time urgency of emergency logistics, the study of LRP in emergency logistic should put travel time into model. Nonetheless, there are relatively few studies in which the LRP in emergency logistics and the development of sustainability are combined. This only related literature [32] studied the multi-depot emergency LRP with uncertainty theory tackled by a hybrid genetic algorithm and focused on verifying the effectiveness and robustness of the algorithm. Although the research considered travel time, distribution costs and environmental impacts into the model, further research on the low-carbon LRP in emergency logistics is necessary. In view of this, in this paper, we establish a fuzzy low-carbon open location-routing problem (FLCOLRP) model of emergency logistics and discuss the interconnection between the objective function of time, economic, as well as environment. A hybrid PSO-TS algorithm is designed to deal with the model in this study. What’s more, this paper employs the triangular fuzzy function tackling the unpredictability of demand in disaster areas.

3. Mathematical Model

3.1. Problem Description

The FLCOLRP model of emergency logistics studied in this paper can be stated as follows. There are some candidate distribution centers dispatching relief materials to the demand points by several different types of vehicles. The construction cost of each candidate distribution center and the operation cost of each vehicle are known, and the demand can be expressed by a triangular fuzzy function. After completing each delivery task, the vehicle may go to different distribution centers to continue the delivery task according to the need and finally return to the nearest distribution center. Under the constraints of time, space and resources, the multi-objective FLCOLRP model is established with the objectives of the lowest delivery time, total costs and carbon emissions, thus obtaining a fast, economical and environmentally friendly location-routing scheme and ensuring the distribution of relief materials simultaneously. Figure 1 shows a simplified diagram of the problem studied in this article.

3.2. Notations

Based on the needs to establish the model, Table 1 presents the corresponding notations applied in this paper.

3.3. Model Construction

The FLCOLRP model of relief materials distribution in this paper takes the delivery time minimum, the total costs minimum, as well as the carbon emissions minimum as the objective functions. Above all, we analyze the components of three objective functions separately, and then the specific formulation of the FLCOLRP model is determined by these components.

3.3.1. Analysis of Objectives Function

1. Delivery Time
In emergency logistics, it is critical to delivering relief supplies from the distribution centers to the demand points as quickly as possible for reducing post-disaster loses. Thus, the minimization of delivery time is significant. In this paper, the delivery time T in the FLCOLRP model can be expressed as:
T = h V h i D c N d j D c N d t i j x i j h .
2. Total Costs
(1) Fixed Costs
In the FLCOLRP model, the fixed costs are actually the construction costs of the distribution centers. However, due to some factors, such as land price levels and natural conditions, candidate distribution centers have different construction costs. The total fixed costs C f in the FLCOLRP model can be calculated as:
C f = i D c ( C i y i + h V h m P m i D c N d H h z m h i c ) .
(2) Transportation Costs
When the vehicle transports relief supplies from the distribution center to the demand point, it may encounter many situations, such as road damage, broken vehicles, extreme weather, etc. In this study, we only study research under normal conditions. The transportation costs C t in the FLCOLRP model can be expressed as:
C t = S 1 h V h i D c N d j D c N d d i j x i j h .
(3) Penalty Costs
It is nearly impossible to gain the precise demand for relief supplies before the disaster, because the demand in the disaster area is fuzzy and uncertain. Hence, this paper utilizes the triangular fuzzy number and proposes the most optimistic demand, the most likely demand and the most pessimistic demand to describe the estimated demand E D i ˜ . The relationship of them is shown in the formulas below:
E D i ˜ = [ E D i ] o , [ E D i ] l , [ E D i ] p ,
[ E D i ] o [ E D i ] l [ E D i ] p .
In addition, the weighted method can be adopted to convert the triangular fuzzy number into a certain value. Thus, the estimated demand E D i ˜ can be calculated with the equation:
E D i ˜ = ω 1 [ E D i ] o + ω 2 [ E D i ] l + ω 3 [ E D i ] p .
However, the number of relief materials transported by the vehicle to the demand point may be less than the estimated demand because of the limitation of the capacity of the vehicle and the distribution center. Therefore, when the demand for the demand point is not met, it will be given a certain penalty. The penalty costs of the FLCOLRP model can be expressed as:
C q = S 2 c D c h V h m P m ( i N d E D i ˜ z m h i c M h ) .
3. Carbon emissions
According to statistics from the Environmental Protection Agency, the transportation sector produces the largest share of greenhouse gas emissions in the world [33]. The carbon emissions of transportation are linearly related to fuel consumption. But, the fuel consumption is affected by many factors, such as vehicle speed, vehicle load, road gradient, driving distance, etc. This paper refers to the literature [34] to calculate the fuel consumption U c   , which can be shown in the formulas below:
U c = c D c h V h m P m i D c N d j D c N d ( μ μ 0 μ M h M i j h ) d i j x i j h z m h i c .
Therefore, the carbon emissions E c o 2 of the FLCOLRP model can be expressed as:
E c o 2 = τ U c .

3.2.2. FLCOLRP Model Setting

Based on the detailed analysis of the three objectives, the established multi-objective FLCOLRP model is shown as follows:
M i n F = h V h i D c N d j D c N d t i j x i j h
M i n C = i D h ( C i y i + h V h m P m i D c N d H h z m h i c ) + S 1 h V h i D c N d j D c N d d i j x i j h + S 2 c D c h V h m P m ( i N d E D i ˜ z m h i c M h )
M i n E c o 2 = τ c D c h V h m P m i D c N d j D c N d ( μ μ 0 μ M h M i j h ) d i j x i j h z m h i c
Subject to:
h V h i D c N d j D c N d x i j h y c 0 ,   c D o  
i D c N d j D c N d x i j h y c 0 ,   h V h , c D c ( C U D o )
h V h i D c N d x i j h = 1 , j N d
h V h m P m i N d E D i ˜ z m h i c W c , c D c
i D c N d j D c N d d i j x i j h z m h i c O h , h V h , m S P m , c D c
i D c N d j D c N d x i j h = 1 , h V h
i N d j D c N d x i j h = 1 , h V h .
This model has three objective functions: The first objective (10) is to minimize the delivery time of relief supplies; the second objective (11) is to minimize the total costs of fixed costs, transportation costs and penalty costs for emergency logistics system; the third objective (12) is to minimize the carbon emissions. At least one vehicle is assigned for each open distribution center, and no vehicles can be assigned for unopened distribution centers, which are imposed by constraint (13) and constraint (14). Each demand point is only served once by one vehicle presented by Constraint (15). Constraint (16) addresses the amount delivered from each distribution center does not exceed the capacity of the distribution center. The distance traveled by each vehicle does not outstrip the limit, which is shown by constraint (17). Constraint (18) and constraint (19) illustrate vehicles must depart from the distribution center and can return to any distribution center.

4. Design of PSO-TS Algorithm

LRP is an NP-hard problem [7,35], and a PSO algorithm combining Tabu Search (TS) is introduced to solve the model in this paper on account of the simplicity and flexibility of PSO algorithm and the ability of TS to obtain global optimal solutions. In the first stage, PSO algorithm is applied to obtain the partial optimization solution. In the second stage, TS is adopted to acquire the global optimization solution. The basic process of the hybrid algorithm is described in Figure 2.
Step 1: Particle coding. All particles are composed of three parts: Part 1 has D particles (D is the number of demand points), the value of each particle represents the sub-path number to which each demand point belongs and is randomly selected from the natural number of 1 to A ( A = i N d E D i ˜ / min ( M h ) ); Part 2 has P particles, the value of each particle represents the initial DC corresponding to each sub-path and is randomly selected from the natural number of 1 to C (C is the number of DCs); Part 3 has D particles, the value of each particle represents the order of the various demand points in each sub-path and is randomly selected from the natural number of C to C + D. Hence, the total length of coding is 2D + A. What’s more, the particles in the parts 1 and 3 correspond one-to-one, and the demand points in part 3 corresponding to the particles having the same value in part 1 are on the same path.
For example, there are 4 DCs (number 1 to 4) and 8 demand points (number 5 to 12), A = 5 (number 1 to 5). For the following particles:
As displayed in Table 2, part 1 includes 2, 3 and 4, indicating that there are three sub-paths. The positions corresponding to 2nd, 3rd and 4th in Part 2 are 2, 3 and 3 respectively, so DCs of 2 and 3 are established. It should be explained that the 1st and 5th of part 2 are numbered 1 and 4 respectively, but the DCs of 1 and 4 are not actually built. The 3rd and 7th of part 1 are numbered 2, and the corresponding positions in part 3 are the demand points 5 and 6, which show that these demand points are in the sub-path 1 and the driving order in sub-path 1 is 5-6. The 2nd in part 2 is numbered 2, representing that the starting point of sub-path 1 is distribution center 2—thus, the sub-path 1 is 2-5-6. In a similar way, the sub-path 2 is 10-8-9, and sub-path 3 is 7-12-11.
Step 2: Initializing parameters of PSO and generating the initialization position and velocity of the particle randomly.
Step 3: Determining the optimal solution by PSO. The built FLCOLRP model of this paper is a multi-objective optimization problem, which usually is solved by weighting methods, constraint methods, goal planning methods, and minimax methods [18]. Since the objective functions and constraints of the FLCOLRP model are linear functions, this paper utilizes the weighting method to deal with the multi-objective model. Thus, the fitness function of this paper is expressed as: Fitness ( i ) = w 1 F ( i ) / F ( i ) m i n + w 2 C ( i ) / C ( i ) m i n + w 3 E c o 2 ( i ) / E c o 2 ( i ) m i n , and 0 < w 1 ,   w 2 ,   w 3 < 1 ,   w 1 +   w 2 +   w 3 = 1 , where w 1 ,   w 2 and w 3 are the weight of the objective function 1 , 2 and 3 respectively. In order to obtain the optimal solution, the position and velocity of particles need to be updated. Then, the optimal solution can be determined according to the value of the fitness function.
Step 4: Setting termination conditions of the PSO algorithm. The number of the population is N p . When the number of the iteration is greater than N p , the PSO algorithm ends, and the current optimal solution is regarded as the partial optimization solution.
Step 5: Initializing tabu list, determining tabu length and putting the partial optimization solution of PSO as the initial solution of TS.
Step 6: Determining the optimal solution by TS. First, according to the feature of the particle coding, this paper randomly selects the neighborhood search algorithm from the three routes (swap, reversion and insertion). Next, based on the special rules, tabu objects are defined, and tabu tables are renewed. Through a series of rules, the final selected solution is taken as the optimal solution.
Step 7: Setting termination conditions of TS. The maximum number of the iteration is M p . When the number of the iteration is greater than M p , the TS ends, and the current optimal solution is regarded as the final global optimization solution.

5. Experimental Design and Results Analysis

The example validation includes two parts: in Section 5.1, the designed algorithm PSO-TS in this paper is tested utilizing the well-known data sets proposed by Barreto [35]; in Section 5.2, the effectiveness of the FLCOLRP model is proved by an example of a location-routing problem in post-earthquake relief deliveries. MATLAB R2017a is used to implement the PSO-TS algorithm, and all the experiments are evaluated on a PC with an Intel 2.3 GHz processor and 8DB RAM (Apple Inc., Cupertino, CA, USA).

5.1. Algorithm Experiment

In this section, we choose 10 cases (Gaspelle1-2, Christ50, Christ75, Christ100, Min27, Min134, Das88, Das150, Or170) from the typical database in LRP to test the applicability of the designed PSO-TS algorithm. Based on the previous literature [16,36], the parameters of PSO-TS are set as follows: The number of the population N p is 20, and the maximum number of the iteration M p is 500. In this study, the traditional PSO algorithm is compared with the proposed PSO-TS algorithm. Each of the following experiments is executed 20 times. The best value is recorded as the optimal result. Table 3 shows the number of candidate distribution centers (DCs), the number of demand points (DPs), as well as the detailed computational results of PSO and PSO-TS which include the number of open DCs and the total distance of dispatch.
We can easily see from Table 2 that, compared with the PSO algorithm, the number of open distribution centers, and the total dispatch distance of the PSO-TS algorithm, is 100% better excepting the total dispatch distance of Gaspelle2. Overall, they have a great improvement in the quality of the solution. Thus, the proposed PSO-TS algorithm in this paper is effective and competitive in tackling LRP.

5.2. Model Experiment

5.2.1. Experimental Design

In this paper, the distribution data of a location-routing problem about emergency logistics, which are referred from the literature [22], is used to verify the FLCOLRP model. There are three candidate distribution centers and 20 demand points. Three types of vehicles are three each. The distance is the Euclidean distance in the test example. We suppose that between two nodes, the travel time of the vehicle is equal to the Euclidean distance. Table 4 illustrates the position, maximum capacity and construction costs of the candidate distribution centers. Table 5 shows the details about the demand points. Based on this information, the estimated demand can be calculated. The maximal weight, operation costs and longest distance of vehicles are displayed in Table 6. In order to be fair, the weights of the multi-objective function ( w 1 ,   w 2 ,   w 3 ) are initially set to 1/3. And we set the other parameters of the FLCOLRP model according to the former studies [22,31,37], which are shown in Table 7.

5.2.2. Experimental Results

Urgent time, limited costs and environmental protection are all important in emergency logistics. From the overall emergency logistics’ point of view, the delivery time of relief supplies, the total costs for emergency logistics system and the carbon emissions need to be considered at the same time. Thus, we do the following experiments to achieve overall system optimization. Each experiment is implemented 20 times, and the numerical value with the best result is recorded.
First of all, we do the initial experiment when the w 1 ,   w 2 and w 3 have the same value 1/3. The experimental results show that the minimum delivery time is 1035.36, the minimum total cost is 508,982.92, and the minimum carbon dioxide emission is 488.79.
Next, in order to compare the results of the initial experiment, we calculate the minimum values of the delivery time F , the total costs C , and the carbon emissions E c o 2 respectively by setting different values of w 1 ,   w 2 and w 3 (0,1). Table 8 shows the contrast experimental results, including the specific values of w 1 ,   w 2 and w 3 . The difference between the results of the initial experiment and the results of the contrast experiment, shown in Figure 3, can be described by parameter Gap (Gap = (the results of the initial experiment- the results of the contrast experiment)/the results of the contrast experiment).
From the results in Figure 3, we can observe that the highest percentage of the difference belongs to the carbon emissions reaching 33.64%. The percentages of the difference between the delivery time and the difference between the total time are 20.01% and 10.89%, respectively. Obviously, there is still a certain gap between the minimum values of the initial experiment and the minimum values of the contrast experiment. For the best of the entire system, it is necessary to reduce this gap. It can be guessed that the minimum of the multi-objective function is related to the values of w 1 ,   w 2 and w 3 .
Then, in order to study the relationship between the minimum of the multi-objective function ( Min F , Min C and Min E c o 2 ) and the weight of w 1 ,   w 2 and w 3 , we do following tests thought setting series values of w 1 ,   w 2 and w 3 around the initial value 1/3. These tests consist of three types of trials ( w 1 = 1 / 3 , w 2 = 1 / 3 , w 3 = 1 / 3 ). The other weights for each type of trial are chosen from the five given values ( 1 / 12 ,   1 / 6 ,   5 / 12 ,   1 / 2 ,   7 / 12 ). The results of all experiments, including the values of w 1 ,   w 2 and w 3 , the minimum of multi-objective function ( Min F , Min C and Min E c o 2 ) and the optimal value of the total emergency logistics system (Optimal) are shown in Table 9. In this study, the fitness function represents the optimal value of the total emergency logistics system. Figure 4 is composed of three-line charts ( w 1 = 1 / 3 , w 2 = 1 / 3 , w 3 = 1 / 3 ) describing the changing trends of the minimum of the delivery time, the total costs and the carbon emissions. The changing trends of the total optimal results of the emergency logistics system are shown in Figure 5.
From the results in Table 9, Figure 4 and Figure 5, we can observe the following findings:
  • The minimum delivery time is better when the weight of total costs becomes smaller, and the weight of the carbon emissions becomes bigger. When the weight of delivery time w 1 = 1 / 3 the minimum delivery time goes up gradually with the increase of the weight of total costs w 2 ; when the weight of total costs w 2 = 1 / 3 , the minimum rises initially, then goes up as the weight of delivery time w 1 go up; when the weight of carbon emissions w 3 = 1 / 3 , this figure goes up, then declines to the lowest value 851.21, finally rises slightly with the increase of w 1 . The range of the minimum delivery time is from 851.21 to 1139.40.
  • The minimum of total costs is better when the weight of delivery time and the weight of carbon emissions become smaller. When the weight of delivery time w 1 = 1 / 3 , the minimum of total costs levels out initially and declines afterwards with the increase of the weight of total cost w 2 ; when the weight of total costs w 2 = 1 / 3 , the minimum rises slightly, then drops dramatically, after that remains unchanged as the weight of delivery time w 1 goes up; when the weight of carbon emissions w 3 = 1 / 3 , this figure remains stable, then declines slowly, finally rises to the highest value 757,801.72 with the increase of w 1 . In brief, the minimum of total costs is between 757,801.72 and 458,997.82.
  • The minimum of carbon emissions is better when the weight of delivery time becomes bigger, and the weight of total costs becomes smaller. When the weight of delivery time w 1 = 1 / 3 , the minimum delivery time drops a little, then rises steadily with the increase of the weight of total costs w 2 ; when the weight of total costs w 2 = 1 / 3 , the minimum gradually increases reaching the highest value 504.65 as the weight of delivery time w 1 goes up; when the weight of carbon emissions w 3 = 1 / 3 , this figure rises and falls, finally decreases to the lowest value 504.65 with the increase of w 1 .
  • The changing of the weight of w 1 ,   w 2 and w 3 has an influence on the optimal result of the total emergency logistics system. From Table 9 and Figure 4, we can see that the optimal result rises, then declines when w 1 = 1 / 3 , and w 2 = 1 / 3 ; while this result remains stable, then drops when w 3 = 1 / 3 . Although all of them have a downward trend, the result of w 3 = 1 / 3 decreases more quickly than others. What’s more, the optimal result of the total emergency logistics system reaches the highest value 1.23 when w 2 = 1 / 3 , w 1 = 5 / 12 , w 3 = 1 / 4 . It reaches the lowest value, 1.06, when w 3 = 1 / 3 , w 1 = 7 / 12 , w 2 = 1 / 12 .
According to the above results, in order to optimize the entire emergency logistics system, we had to set w 1 ,   w 2 ,     w 3 as 7 / 12 ,   1 / 12 ,   1 / 3 , respectively, which means that delivery time is the most important, followed by environmental protection, and finally operation costs. It just coincides with the main characteristics of emergency logistics and low-carbon transportation. When w 1 = 7 / 12 , w 2 = 1 / 12 ,   w 3 = 1 / 3 , the results of the experiment show that three distribution centers are opened and seven vehicles are chosen in the test example. The specific selection of distribution centers and arrangement of vehicle routing can be seen in Table 10.
Finally, for the reason that the candidate distribution centers are all open in the example above, we add two new candidate distribution centers into the case for the sake of the application of the FLCOLRP model. The position of the two new candidate distribution centers is randomly chosen from the array 100 × 100 . The maximum capacity and construction costs of the candidate distribution centers are set based on the value of example. Table 11 displays the parameters of the new candidate distribution centers in detail. The experimental results about the service order of vehicle are demonstrated in Table 12.
As shown in Table 12, when the number of candidate distribution centers is five, the number of used vehicles is six (2,4,5,6,7,8) and the open distribution centers is four (DC1, DC2, DC3, DC4). Even though the number of candidate distribution centers is more, the results of the experiment are better. Besides, we still can obtain a good scheme of distribution. It indicates that the applicability of the FLCOLRP model in this study is good.

5.3. Analysis of Results

For the location-routing problem in emergency logistics, the multi-objective FLCOLRP model is built in this paper aiming at the optimization of the total emergency logistics system. By taking the minimum delivery time, total costs and carbon emissions as the objective functions, the routing plan that considers time, economic and environmental benefits can be obtained, thereby achieving “rapid and green” allocation scheme. Considering carbon emissions into the objective function is necessary for this environment with frequent natural disasters and bad climate. However, it is difficult to achieve the minimization of the three objective functions at the same time.
In this paper, by assigning weights to the three objective functions, we transform them into single objective function achieving the overall optimality of the emergency logistics system. The main summings-up are listed as follows:
  • The minimum of the multi-objective function is closely related to the value of weight ( w 1 , w 2 , w 3 . When w 2 = 1 / 3 , w 1 = 5 / 12 , w 3 = 1 / 4 , the emergency logistics system obtains the overall optimality.
  • Though setting the different weight of objective functions and adding several candidate distribution centers, it is proved that the built FLCOLRP model in this study is applicable for LRP in emergency logistic.
Based on the above research, some constructive suggestions are put forward. From the perspective of the government emergency departments, firstly, they must strengthen people’s awareness of environmental protection, and improve education on how to take action after the disaster. Secondly, before the disaster, rescue measures have been planned, such as the construction of the rescue center, planning of the vehicle path, etc. As we all know, time is very urgent during the rescue, the cost of rescue is limited, and vehicles release carbon dioxide while delivering supplies. The government emergency departments can refer the results of this study to weigh the importance of the three to obtain the overall optimization of the emergency logistics system. Thirdly, carbon emissions during transportation should be emphasized. As a proverb says, a small leak will sink a great ship. The frequent occurrence of natural disasters is inseparable from climate change. From the perspective of the public, in order to minimize losses, it is important to learn to save the energy, which can extend the time as much as possible waiting for rescue. In addition, they must be educated that the greenhouse effect is one of the causes of frequent natural disasters, and take measures to protect the environment. For example, people can go out on foot or by public transportation, instead of private cars for the reduction of carbon emissions.

6. Conclusions

With the frequent occurrence of natural disasters, the lives and property of the people have already been caused by serious damage. However, natural disasters are closely related to environmental changes caused by human activities. The importance of environmental issues should be taken seriously. Thus, in the distribution of materials for emergency logistics, it is necessary to put carbon emissions into the overall optimal of emergency logistics for environmental protection and sustainable development. In this paper, aiming at the location–routing problem in the distribution process of relief supplies, the FLCOLRP model is established and solved by the hybrid PSO-TS algorithm. An example of a post-earthquake rescue is used to validate the established model. The minimum delivery time, total costs and carbon emissions are calculated respectively as the reference for subsequent experiments. Finally, the weight of the multi-objective function is ensured by a series of experiments to obtain the overall optimization. Based on the results, some suggestions are provided for the management department of emergency logistics and the citizen.
In this study, we obtain the overall optimization of emergency logistics through different settings for weight parameter values. However, we conduct comparative experiments around the weight value 1/3, due to experimental limitations. In future research, extensive and comprehensive comparative experiments are supposed to apply to the FLCOLRP model to get better overall optimization results. Besides, in a real emergency distribution environment, that emergency supplies are of various types can be considered into emergency logistics. What’s more, “embodied pollution” which can be considered into the emergency logistics system, is a new field about sustainable research.

Author Contributions

L.S. put forward the initial idea of the paper, established the models with the guidance of Y.S. and R.Q., and then wrote the paper with the revisions of F.T.

Funding

This research received no external funding.

Acknowledgments

The funding supports from the National Natural Science Foundation of China (No. 71571023), and the Natural Science Foundation Project of Chongqing (cstc2019jcyj-msxmX0100) are greatly appreciated.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Hu, S.; Dong, Z.S. Supplier selection and pre-positioning strategy in humanitarian relief. Omega Int. J. Manag. Sci. 2019, 83, 287–298. [Google Scholar] [CrossRef]
  2. Mohamadi, A.; Yaghoubi, S.; Pishvaee, M.S. Fuzzy multi-objective stochastic programming model for disaster relief logistics considering telecommunication infrastructures: A case study. Oper. Res. 2019, 19, 59–99. [Google Scholar] [CrossRef]
  3. Zhang, Y.; Fan, J.; Liang, B.; Zhang, L. Evaluation of sustainable livelihoods in the context of disaster vulnerability: A case study of Shenzha county in Tibet, China. Sustainability 2019, 11, 2874. [Google Scholar]
  4. Hakim, R.T.; Kusumastuti, R.D. A model to determine relief warehouse location in east jakarta using the analytic hierarchy process. Int. J. Technol. 2018, 9, 1405–1414. [Google Scholar] [CrossRef]
  5. Wang, W.; Huang, L.; Liang, X. On the simulation-based reliability of complex emergency logistics networks in post-accident rescues. Int. J. Environ. Res. Public Health 2018, 15, 79. [Google Scholar] [CrossRef] [PubMed]
  6. Sheu, J.-B. Challenges of emergency logistics management. Transp. Res. Part E-Logist. Transp. Rev. 2007, 43, 655–659. [Google Scholar] [CrossRef]
  7. Theeraviriya, C.; Pitakaso, R.; Sillapasa, K.; Kaewman, S. Location decision making and transportation route planning considering fuel consumption. J. Open Innov. Technol. Mark. Complex. 2019, 5, 27. [Google Scholar] [CrossRef]
  8. Ghodratnama, A.; Tavakkoli-Moghaddam, R.; Azaron, A. Robust and fuzzy goal programming optimization approaches for a novel multi-objective hub location-allocation problem: A supply chain overview. Appl. Soft. Comput. 2015, 37, 255–276. [Google Scholar] [CrossRef]
  9. Wang, S.; Tao, F.; Shi, Y.; Wen, H. Optimization of vehicle routing problem with time windows for cold chain logistics based on carbon tax. Sustainability 2017, 9, 694. [Google Scholar] [CrossRef]
  10. Qin, G.; Tao, F.; Li, L. A vehicle routing optimization problem for cold chain logistics considering customer satisfaction and carbon emissions. Int. J. Environ. Res. Public Health 2019, 16, 576. [Google Scholar] [CrossRef]
  11. Cooper, L. The transportation-location problem. Oper. Res. 1972, 20, 94–108. [Google Scholar] [CrossRef]
  12. Prodhon, C.; Prins, C. A survey of recent research on location-routing problems. Eur. J. Oper. Res. 2014, 238, 1–17. [Google Scholar] [CrossRef]
  13. Ponboon, S.; Qureshi, A.G.; Taniguchi, E. Branch-and-price algorithm for the location-routing problem with time windows. Transp. Res. Part E-Logist. Transp. Rev. 2016, 86, 1–19. [Google Scholar] [CrossRef]
  14. Prins, C.; Prodhon, C.; Ruiz, A.; Soriano, P.; Calvo, R.W. Solving the capacitated location-routing problem by a cooperative lagrangean relaxation-granular tabu search heuristic. Transp. Sci. 2007, 41, 470–483. [Google Scholar] [CrossRef]
  15. Ting, C.-J.; Chen, C.-H. A multiple ant colony optimization algorithm for the capacitated location routing problem. Int. J. Prod. Econ. 2013, 141, 34–44. [Google Scholar] [CrossRef]
  16. Liu, C.; Kou, G.; Peng, Y.; Alsaadi, F. Location-routing problem for relief distribution in the early post-earthquake stage from the perspective of fairness. Sustainability 2019, 11, 3420. [Google Scholar] [CrossRef]
  17. Marinakis, Y. An improved particle swarm optimization algorithm for the capacitated location routing problem and for the location routing problem with stochastic demands. Appl. Soft. Comput. 2015, 37, 680–701. [Google Scholar] [CrossRef]
  18. Rabbani, M.; Heidari, R.; Farrokhi-Asl, H.; Rahimi, N. Using metaheuristic algorithms to solve a multi-objective industrial hazardous waste loation-routing problem considering incompatible waste types. J. Clean. Prod. 2018, 170, 227–241. [Google Scholar] [CrossRef]
  19. Drexl, M.; Schneider, M. A survey of variants and extensions of the location-routing problem. Eur. J. Oper. Res. 2014, 241, 283–308. [Google Scholar] [CrossRef]
  20. Yi, W.; Özdamar, L. A dynamic logistics coordination model for evacuation and support in disaster response activities. Eur. J. Oper. Res. 2007, 179, 1177–1193. [Google Scholar] [CrossRef]
  21. Zheng, B.; Ma, Z.; Fang, t. Fuzzy multi-objective location-routing problem in emergency logistics systems. Syst. Eng. 2009, 27, 21–25. [Google Scholar]
  22. Ma, Z.; Dai, Y.; Li, S. Fuzzy multi-objective open location-routing problem with deadlines in post-earthquake relief deliveries. J. Syst. Manag. 2014, 23, 658–667. [Google Scholar]
  23. Rath, S.; Gutjahr, W.J. A math-heuristic for the warehouse location-routing problem in disaster relief. Comput. Oper. Res. 2014, 42, 25–39. [Google Scholar] [CrossRef]
  24. Alem, D.; Clark, A.; Moreno, A. Stochastic network models for logistics planning in disaster relief. Eur. J. Oper. Res. 2016, 255, 187–206. [Google Scholar] [CrossRef]
  25. Govindan, K.; Jafarian, A.; Khodaverdi, R.; Devika, K. Two-echelon multiple-vehicle location–routing problem with time windows for optimization of sustainable supply chain network of perishable food. Int. J. Prod. Econ. 2014, 152, 9–28. [Google Scholar] [CrossRef]
  26. Ramos, T.R.P.; Gomes, M.I.; Barbosa-Póvoa, A.P. Planning a sustainable reverse logistics system: Balancing costs with environmental and social concerns. Omega-Int. J. Manag. Sci. 2014, 48, 60–74. [Google Scholar] [CrossRef] [Green Version]
  27. Tang, J.; Ji, S.; Zhu, b. Optimization model and algorithm considers carbon-capped difference in the collaboration of location-routing-inventory problem. Chin. J. Manag. Sci. 2014, 22, 114–122. [Google Scholar]
  28. Tang, J.; Ji, S.; Jiang, L.; Zhu, b. The effect of consumers bounded “carbon behavior” preference on location-routing-inventory optimization. Chin. J. Manag. Sci. 2016, 24, 110–119. [Google Scholar]
  29. Toro, E.; Franco, J.F.; Granada-Echeverri, M.; Guimarães, F.G. A Multi-Objective Model for the Green Capacitated Location-Routing Problem Considering Environmental Impact. Comput. Ind. Eng. 2017, 110, 114–125. [Google Scholar] [CrossRef]
  30. Ebrahimi, S.B. A stochastic multi-objective location-allocation-routing problem for tire supply chain considering sustainability aspects and quantity discounts. J. Clean. Prod. 2018, 198, 704–720. [Google Scholar] [CrossRef]
  31. Wang, S.; Tao, F.; Shi, Y. Optimization of Location-Routing Problem for Cold Chain Logistics Considering Carbon Footprint. Int. J. Environ. Res. Public Health 2018, 15, 86. [Google Scholar] [CrossRef]
  32. Zhang, B.; Li, H.; Li, S.; Peng, J. Sustainable multi-depot emergency facilities location-routing problem with uncertain information. Appl. Math. Comput. 2018, 333, 506–520. [Google Scholar] [CrossRef]
  33. Saharidis, G.K.D.; Konstantzos, G.E. Critical overview of emission calculation models in order to evaluate their potential use in estimation of Greenhouse Gas emissions from in port truck operations. J. Clean. Prod. 2018, 185, 1024–1031. [Google Scholar] [CrossRef]
  34. Xiao, Y.; Zhao, Q.; Kaku, I.; Xu, Y. Development of a fuel consumption optimization model for the capacitated vehicle routing problem. Comput. Oper. Res. 2012, 39, 1419–1431. [Google Scholar] [CrossRef]
  35. Hamidi, M.; Farahmand, K.; Sajjadi, S.R. Modeling a four-layer location-routing problem. Int. J. Ind. Eng. Comput. 2012, 3, 43–52. [Google Scholar] [CrossRef]
  36. Barreto, S.; Ferreira, C.; Paixao, J.; Sousa Santos, B. Using clustering analysis location-routing in a capacitated problem. Eur. J. Oper. Res. 2007, 179, 968–977. [Google Scholar] [CrossRef]
  37. Shen, L.; Tao, F.; Wang, S. Multi-Depot Open Vehicle Routing Problem with Time Windows Based on Carbon Trading. Int. J. Environ. Res. Public Health 2018, 15, 2025. [Google Scholar] [CrossRef]
Figure 1. A simplified routing diagram of LRP.
Figure 1. A simplified routing diagram of LRP.
Ijerph 16 02982 g001
Figure 2. Basic process of PSO-TS.
Figure 2. Basic process of PSO-TS.
Ijerph 16 02982 g002
Figure 3. The difference between the initial experiment and the contrast experiment.
Figure 3. The difference between the initial experiment and the contrast experiment.
Ijerph 16 02982 g003
Figure 4. (a) The changing trends of the minimum of the delivery time, the total costs and the carbon emissions, when w1 = 1/3. (b) The changing trends of the minimum of the delivery time, the total costs and the carbon emissions, when w2 = 1/3. (c) The changing trends of the minimum of the delivery time, the total costs and the carbon emissions, when w3 = 1/3.
Figure 4. (a) The changing trends of the minimum of the delivery time, the total costs and the carbon emissions, when w1 = 1/3. (b) The changing trends of the minimum of the delivery time, the total costs and the carbon emissions, when w2 = 1/3. (c) The changing trends of the minimum of the delivery time, the total costs and the carbon emissions, when w3 = 1/3.
Ijerph 16 02982 g004
Figure 5. The changing trends of the optimal results of the total emergency logistics system.
Figure 5. The changing trends of the optimal results of the total emergency logistics system.
Ijerph 16 02982 g005
Table 1. Explanation of corresponding notations.
Table 1. Explanation of corresponding notations.
NotationsExplanation
D c Set of candidate distribution centers { i | i = 1 ,   ,   C } .
D o Set of open distribution centers D o D c .
N d Set of demand points { i | i = C + 1 ,   C + 2 ,   ,   C + D } .
V h Set of vehicles { h | h = 1 ,   2 ,   ,   H } .
P m Set of sub-paths { m | m = 1 ,   2 ,   ,   M } .
t i j Transportation time from node I to node j.
C i Construction and operation costs of the distribution center i.
H h Operation costs of the vehicle h.
S 1 Transportation costs of per unit distance.
S 2 Penalty costs of per unit unmet need.
[ E D i ] o Represents the most optimistic demand for demand point i.
[ E D i ] l Represents the most likely demand for demand point i.
[ E D i ] p Represents the most pessimistic demand for demand point i.
ω 1 Weight coefficient of the most optimistic demand.
ω 2 Weight coefficient of the most likely demand.
ω 3 Weight coefficient of the most pessimistic demand.
Q i Demand for relief supplies of demand point i.
μ Fuel consumption rate when the vehicle is full-load. Consumption Rate
u 0 Fuel consumption rate when the vehicle is no-load.
M h Maximal weight the vehicle h could carry.
M i j h Carried load of vehicle h from node i to node j.
τ Conversion factor for carbon dioxide and fuel consumption.
W i Maximum capacity of candidate distribution center i.
O h Longest travel distance of the vehicle h.
y i y i = 1 represents the candidate distribution center i are employed.
Otherwise, y i = 0 .
x i j h x i j h = 1 represents the vehicle h visit the node j from the node i.
Otherwise,   x i j h = 0 .
z m h i c z m h i c = 1 represents the sub-path m of candidate distribution center c.
includes node i served by the vehicle h. Otherwise, z m h i c = 0 .
Table 2. Illustration of coding example.
Table 2. Illustration of coding example.
Part 134234324
Part 212334
Part 310758129611
Table 3. Computational results of PSO and PSO-TS.
Table 3. Computational results of PSO and PSO-TS.
CaseNumber of DCsNumber of DPsPSOPSO-TS
Number of DCsTotal DistanceNumber of DCsTotal Distance
Gaspelle15213544.571545.01
Gaspelle25222892.691898.07
Christ5055031462.0131401.17
Christ75107572448.5762316.46
Christ1001010063027.1262895.13
Min2752735744.5515206.01
Min1348134631,933.38630,361.27
Das8888832411.8432341.46
Das150101508166,473.806161,141.65
Or11714117560,203.40456,399.91
Table 4. Parameters of candidate distribution centers.
Table 4. Parameters of candidate distribution centers.
Distribution   Centers   D i X CoordinateY Coordinate Maximum   Capacity   W i Construction   Cos ts   C i   ( CNY )
14051500200,000
270602000250,000
320501800300,000
Table 5. Parameters of demand points.
Table 5. Parameters of demand points.
Demand   Points   N i X CoordinateY Coordinate Optimistic   Demand   [ E D i ] o Likely   Demand     [ E D i ] l Pessimistic   Demand   [ E D i ] p
42585129135150
5545369375387
64215667584
7385141153165
89535128135150
98525697582
106280180195212
115875129135150
125050647582
131880269275280
142530636972
151510129135143
164565606978
176520245251257
183152165177186
19260394552
2055105111117
215729119123138
22418159165171
232635296305308
Table 6. Information about three types of vehicles.
Table 6. Information about three types of vehicles.
Number   of   Vehicles   V h Maximal   Weight   M h Operation   Cos ts   H h   ( CNY ) Longest   Distance   O h   ( km )
1–3100500350
4–6150700360
7–9200900370
Table 7. Parameters related to the objective function.
Table 7. Parameters related to the objective function.
ParametersValue
S 1 8 CNY/km
S 2 150 CNY/kg
μ 0.165 L/km
u 0 0.377 L/km
τ 2.63 kg/L
Table 8. The results of the contrast experiment.
Table 8. The results of the contrast experiment.
Value M i n F   ( min ) M i n C   ( NCY ) M i n E c o 2 (kg)
w 1 = 1 ,   w 2 = w 3 = 0 851.21 --
w 2 = 1 ,   w 1 = w 3 = 0 -458,997.82 -
w 3 = 1 ,   w 1 = w 2 = 0 --365.76
Table 9. The results of the three types of experiments ( w 1 = 1 / 3 , w 2 = 1 / 3 , w 3 = 1 / 3 ).
Table 9. The results of the three types of experiments ( w 1 = 1 / 3 , w 2 = 1 / 3 , w 3 = 1 / 3 ).
Value M i n F   ( min ) M i n C   ( NCY ) M i n E c o 2   ( kg ) Optimal
w 1 = 1 / 3 w 2 = 1 / 12 , w 3 = 7 / 12 1851.21757,509.68378.391.07
w 2 = 1 / 6 , w 3 = 1 / 2 2913.09757,804.73368.251.14
w 2 = 5 / 12 , w 3 = 1 / 4 31088.24509,605.92451.421.19
w 2 = 1 / 2 , w 3 = 1 / 6 41088.24509,605.92451.421.18
w 2 = 7 / 12 , w 3 = 1 / 12 51120.93486,267.49453.731.15
w 2 = 1 / 3 w 1 = 1 / 12 , w 3 = 7 / 12 11097.92574,483.42435.061.20
w 1 = 1 / 6 , w 3 = 1 / 2 21129.94509,939.58461.621.22
w 1 = 5 / 12 , w 3 = 1 / 4 31094.38509,655.09484.961.23
w 1 = 1 / 2 , w 3 = 1 / 6 41058.95508,971.64504.651.21
w 1 = 7 / 12 , w 3 = 1 / 12 51058.95508,971.64504.651.20
w 3 = 1 / 3 w 1 = 1 / 12 , w 2 = 7 / 12 11129.57509,536.58458.941.17
w 1 = 1 / 6 , w 2 = 1 / 2 21139.40509,615.18431.381.17
w 1 = 5 / 12 , w 2 = 1 / 4 31037.23458,997.82457.411.17
w 1 = 1 / 2 , w 2 = 1 / 6 4851.21757,509.68378.391.11
w 1 = 7 / 12 , w 2 = 1 / 12 5862.71757,801.72365.761.06
Table 10. The service order of vehicles ( w 1 = 7 / 12 , w 2 = 1 / 12 , w 3 = 1 / 3 ).
Table 10. The service order of vehicles ( w 1 = 7 / 12 , w 2 = 1 / 12 , w 3 = 1 / 3 ).
Number of Vehicle Service OrderNumber of VehicleService Order
2DC3-11-DC27DC3-18-23-DC3-DC1-6-DC1
3DC3-4-5-19-DC3-DC2-10-DC28DC3-20-DC1-DC2-8-16-13-DC3-DC2-9-DC2
4DC3-14-DC39DC1-15-DC1-DC3-12-DC2
6DC1-7-22-17-21-DC1
Table 11. Parameters of two new candidate distribution centers.
Table 11. Parameters of two new candidate distribution centers.
Distribution   Centers   D i X CoordinateY Coordinate Maximum   Capacity   W i Construction   Cos ts   C i   ( CNY )
45201900240,000
590801500300,000
Table 12. The service order of vehicles ( w 1 = 7 / 12 , w 2 = 1 / 12 , w 3 = 1 / 3 ).
Table 12. The service order of vehicles ( w 1 = 7 / 12 , w 2 = 1 / 12 , w 3 = 1 / 3 ).
Number of Vehicle Service OrderNumber of VehicleService Order
2DC4-22-DC46DC1-9-DC1
4DC3-6-DC47DC3-7-13-16-DC3-DC2-10-19-12-14-DC2
5DC4-25-DC3-DC1-8-11-20-DC3-DC1-17-23-DC18DC3-21-24-DC4-DC3-15-18-DC2

Share and Cite

MDPI and ACS Style

Shen, L.; Tao, F.; Shi, Y.; Qin, R. Optimization of Location-Routing Problem in Emergency Logistics Considering Carbon Emissions. Int. J. Environ. Res. Public Health 2019, 16, 2982. https://doi.org/10.3390/ijerph16162982

AMA Style

Shen L, Tao F, Shi Y, Qin R. Optimization of Location-Routing Problem in Emergency Logistics Considering Carbon Emissions. International Journal of Environmental Research and Public Health. 2019; 16(16):2982. https://doi.org/10.3390/ijerph16162982

Chicago/Turabian Style

Shen, Ling, Fengming Tao, Yuhe Shi, and Ruiru Qin. 2019. "Optimization of Location-Routing Problem in Emergency Logistics Considering Carbon Emissions" International Journal of Environmental Research and Public Health 16, no. 16: 2982. https://doi.org/10.3390/ijerph16162982

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop