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

2019 ◽  
Vol 16 (16) ◽  
pp. 2982 ◽  
Author(s):  
Shen ◽  
Tao ◽  
Shi ◽  
Qin
Keyword(s):  
Carbon Emissions ◽  
Optimal Solution ◽  
Low Carbon ◽  
Location Routing Problem ◽  
Logistics System ◽  
Routing Problem ◽  
Location Routing ◽  
Fuzzy Function ◽  
Emergency Logistics ◽  
The Government

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.

scholarly journals A Novel Hyper-Heuristic for the Biobjective Regional Low-Carbon Location-Routing Problem with Multiple Constraints

2019 ◽  
Vol 11 (6) ◽  
pp. 1596 ◽  
Author(s):  
Longlong Leng ◽  
Yanwei Zhao ◽  
Zheng Wang ◽  
Jingling Zhang ◽  
Wanliang Wang ◽  
...  
Keyword(s):  
Fuel Consumption ◽  
Carbon Emissions ◽  
Time Windows ◽  
Selection Strategy ◽  
Low Carbon ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Hard Time ◽  
Environmental Selection ◽  
Location Routing

With the aim of reducing cost, carbon emissions, and service periods and improving clients’ satisfaction with the logistics network, this paper investigates the optimization of a variant of the location-routing problem (LRP), namely the regional low-carbon LRP (RLCLRP), considering simultaneous pickup and delivery, hard time windows, and a heterogeneous fleet. In order to solve this problem, we construct a biobjective model for the RLCLRP with minimum total cost consisting of depot, vehicle rental, fuel consumption, carbon emission costs, and vehicle waiting time. This paper further proposes a novel hyper-heuristic (HH) method to tackle the biobjective model. The presented method applies a quantum-based approach as a high-level selection strategy and the great deluge, late acceptance, and environmental selection as the acceptance criteria. We examine the superior efficiency of the proposed approach and model by conducting numerical experiments using different instances. Additionally, several managerial insights are provided for logistics enterprises to plan and design a distribution network by extensively analyzing the effects of various domain parameters such as depot cost and location, client distribution, and fleet composition on key performance indicators including fuel consumption, carbon emissions, logistics costs, and travel distance and time.

scholarly journals A Hyper Heuristic Algorithm to Solve the Low-Carbon Location Routing Problem

Algorithms ◽  
2019 ◽  
Vol 12 (7) ◽  
pp. 129 ◽  
Author(s):  
Chunmiao Zhang ◽  
Yanwei Zhao ◽  
Longlong Leng
Keyword(s):  
Customer Satisfaction ◽  
Heuristic Algorithm ◽  
Carbon Emissions ◽  
Time Windows ◽  
Low Carbon ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing ◽  
Proposed Model ◽  
The Impact

This paper proposes a low-carbon location routing problem (LCLRP) model with simultaneous delivery and pick up, time windows, and heterogeneous fleets to reduce the logistics cost and carbon emissions and improve customer satisfaction. The correctness of the model is tested by a simple example of CPLEX (optimization software for mathematical programming). To solve this problem, a hyper-heuristic algorithm is designed based on a secondary exponential smoothing strategy and adaptive receiving mechanism. The algorithm can achieve fast convergence and is highly robust. This case study analyzes the impact of depot distribution and cost, heterogeneous fleets (HF), and customer distribution and time windows on logistics costs, carbon emissions, and customer satisfaction. The experimental results show that the proposed model can reduce logistics costs by 1.72%, carbon emissions by 11.23%, and vehicle travel distance by 9.69%, and show that the proposed model has guiding significance for reducing logistics costs.

scholarly journals Location Routing Problem with Consideration of CO2 Emissions Cost: A Case Study

2020 ◽  
Vol 21 (2) ◽  
pp. 225-234
Author(s):  
Ananda Noor Sholichah ◽  
Y Yuniaristanto ◽  
I Wayan Suletra
Keyword(s):  
Co2 Emissions ◽  
Time Windows ◽  
Optimal Solution ◽  
Mixed Integer ◽  
Distribution Centers ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing ◽  
Study Results

Location and routing are the main critical problems investigated in a logistic. Location-Routing Problem (LRP) involves determining the location of facilities and vehicle routes to supply customer's demands. Determination of depots as distribution centers is one of the problems in LRP.  In LRP, carbon emissions need to be considered because these problems cause global warming and climate change. In this paper, a new mathematical model for LRP considering CO2 emissions minimization is proposed. This study developed a new  Mixed Integer Linear Programming (MILP)  model for LRP with time windows and considered the environmental impacts.  Finally, a case study was conducted in the province of Central Java, Indonesia. In this case study, there are three depot candidates. The study results indicated that using this method in existing conditions and constraints provides a more optimal solution than the company's actual route. A sensitivity analysis was also carried out in this case study.

scholarly journals Shared Mechanism-Based Self-Adaptive Hyperheuristic for Regional Low-Carbon Location-Routing Problem with Time Windows

2018 ◽  
Vol 2018 ◽  
pp. 1-21 ◽  
Author(s):  
Longlong Leng ◽  
Yanwei Zhao ◽  
Zheng Wang ◽  
Hongwei Wang ◽  
Jingling Zhang
Keyword(s):  
Fuel Consumption ◽  
Carbon Emission ◽  
Time Windows ◽  
Travel Distance ◽  
Low Carbon ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Total Cost ◽  
Location Routing ◽  
Self Adaptive

In this paper, we consider a variant of the location-routing problem (LRP), namely, the regional low-carbon LRP with reality constraint conditions (RLCLRPRCC), which is characterized by clients and depots that located in nested zones with different speed limits. The RLCLRPRCC aims at reducing the logistics total cost and carbon emission and improving clients satisfactory by replacing the travel distance/time with fuel consumption and carbon emission costs under considering heterogeneous fleet, simultaneous pickup and delivery, and hard time windows. Aiming at this project, a novel approach is proposed: hyperheuristic (HH), which manipulates the space, consisted of a fixed pool of simple operators such as “shift” and “swap” for directly modifying the space of solutions. In proposed framework of HH, a kind of shared mechanism-based self-adaptive selection strategy and self-adaptive acceptance criterion are developed to improve its performance, accelerate convergence, and improve algorithm accuracy. The results show that the proposed HH effectively solves LRP/LRPSPD/RLCLRPRCC within reasonable computing time and the proposed mathematical model can reduce 2.6% logistics total cost, 27.6% carbon emission/fuel consumption, and 13.6% travel distance. Additionally, several managerial insights are presented for logistics enterprises to plan and design the distribution network by extensively analyzing the effects of various problem parameters such as depot cost and location, clients’ distribution, heterogeneous vehicles, and time windows allowance, on the key performance indicators, including fuel consumption, carbon emissions, operational costs, travel distance, and time.

scholarly journals A Bi-Level Programming Approach to the Location-Routing Problem with Cargo Splitting under Low-Carbon Policies

Mathematics ◽  
2021 ◽  
Vol 9 (18) ◽  
pp. 2325
Author(s):  
Cong Wang ◽  
Zhongxiu Peng ◽  
Xijun Xu
Keyword(s):  
Decision Making ◽  
Decision Maker ◽  
Programming Model ◽  
Programming Approach ◽  
Low Carbon ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing ◽  
Level Model ◽  
The Impact

To identify the impact of low-carbon policies on the location-routing problem (LRP) with cargo splitting (LRPCS), this paper first constructs the bi-level programming model of LRPCS. On this basis, the bi-level programming models of LRPCS under four low-carbon policies are constructed, respectively. The upper-level model takes the engineering construction department as the decision-maker to decide on the distribution center’s location. The lower-level model takes the logistics and distribution department as the decision-maker to make decisions on the vehicle distribution route’s scheme. Secondly, the hybrid algorithm of Ant Colony Optimization and Tabu Search (ACO-TS) is designed, and an example is introduced to verify the model’s and algorithm’s effectiveness. Finally, multiple sets of experiments are designed to explore the impact of various low-carbon policies on the decision-making of the LRPCS. The experimental results show that the influence of the carbon tax policy is the greatest, the carbon trading and carbon offset policy have a certain impact on the decision-making of the LRPCS, and the influence of the emission cap policy is the least. Based on this, we provide the relevant low-carbon policies advice and management implications.

scholarly journals Research on the Model and Algorithm for Multimodal Distribution of Emergency Supplies after Earthquake in the Perspective of Fairness

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Xiaowen Xiong ◽  
Fan Zhao ◽  
Yundou Wang ◽  
Yapeng Wang
Keyword(s):  
High Efficiency ◽  
Time Window ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Logistics Network ◽  
Emergency Rescue ◽  
Location Routing ◽  
Driving Time ◽  
Emergency Logistics ◽  
Time Window Constraints

After the earthquake, it is important to ensure the emergency supplies are provided in time. However, not only the timeliness, but also the fairness from different perspectives should be considered. Therefore, we use a multilevel location-routing problem (LPR) to study the fairness of distribution for emergency supplies after earthquake. By comprehensively considering the time window constraints, the partial road damage and dynamic recovery in emergency logistics network, the stochastic driving time of the vehicle, and the mixed load of a variety of emergency materials, we have developed a multiobjective model for the LRP in postearthquake multimodal and fair delivery of multivariety emergency supplies with a limited period. The goal of this model is to minimize the total time in delivering emergency supplies and to minimize the maximum waiting time for emergency supplies to reach demand points. A hybrid heuristic algorithm is designed to solve the model. The example shows that this algorithm has a high efficiency and can effectively realize the supply of emergency supplies after the earthquake within the specified period. This method might be particularly suitable for the emergency rescue scenarios where the victims of the earthquake are vulnerable to mood swings and the emergency supplies need to be fairly distributed.

scholarly journals The HSABA for Emergency Location-Routing Problem

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Siliang Luan ◽  
Qingfang Yang ◽  
Huxing Zhou ◽  
Zhongtai Jiang ◽  
Wei Wang ◽  
...  
Keyword(s):  
Bat Algorithm ◽  
Single Stage ◽  
Adaptation Mechanism ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Local Optima ◽  
Location Routing ◽  
Emergency Logistics ◽  
Nature Inspired Algorithm ◽  
Delivery Routes

This article presents a Location-Routing Problem (LRP) model to assist decision makers in emergency logistics. The model attempts to consider the relationship between the location of warehouses and the delivery routes in order to maximize the rescue efficiency. The objective function of the minimization of time and cost is established in the single-stage LRP model considering different scenarios. The hybrid self-adaptive bat algorithm (HSABA) is an improved nature-inspired algorithm for solving this LRP model, hard optimization problem. The HSABA with self-adaptation mechanism and hybridization mechanism effectively improves the defect of the original BA, that is, trapping into the local optima easily. An example is provided to prove the effectiveness of our model. The studied example shows that the single-stage LRP model can effectively select supply locations and plan rescue routes faced with different disasters and the HSABA outperforms the basic BA.

scholarly journals A Location-Inventory-Routing Problem in Forward and Reverse Logistics Network Design

2016 ◽  
Vol 2016 ◽  
pp. 1-18 ◽  
Author(s):  
Qunli Yuchi ◽  
Zhengwen He ◽  
Zhen Yang ◽  
Nengmin Wang
Keyword(s):  
Network Design ◽  
Programming Model ◽  
Optimal Solution ◽  
Nonlinear Integer Programming ◽  
Inventory Routing ◽  
Distribution Centers ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing ◽  
Reverse Logistic

We study a new problem of location-inventory-routing in forward and reverse logistic (LIRP-FRL) network design, which simultaneously integrates the location decisions of distribution centers (DCs), the inventory policies of opened DCs, and the vehicle routing decision in serving customers, in which new goods are produced and damaged goods are repaired by a manufacturer and then returned to the market to satisfy customers’ demands as new ones. Our objective is to minimize the total costs of manufacturing and remanufacturing goods, building DCs, shipping goods (new or recovered) between the manufacturer and opened DCs, and distributing new or recovered goods to customers and ordering and storage costs of goods. A nonlinear integer programming model is proposed to formulate the LIRP-FRL. A new tabu search (NTS) algorithm is developed to achieve near optimal solution of the problem. Numerical experiments on the benchmark instances of a simplified version of the LIRP-FRL, the capacitated location routing problem, and the randomly generated LIRP-FRL instances demonstrate the effectiveness and efficiency of the proposed NTS algorithm in problem resolution.

Sign in / Sign up

Export Citation Format

Share Document