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 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.

scholarly journals An Effective Approach for the Multiobjective Regional Low-Carbon Location-Routing Problem

2019 ◽  
Vol 16 (11) ◽  
pp. 2064 ◽  
Author(s):  
Longlong Leng ◽  
Yanwei Zhao ◽  
Jingling Zhang ◽  
Chunmiao Zhang
Keyword(s):  
Time Windows ◽  
Mixed Integer ◽  
Low Carbon ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Domain Specific ◽  
Hard Time ◽  
Selection Strategies ◽  
Location Routing ◽  
High Level

In this paper, we consider a variant of the location-routing problem (LRP), namely the the multiobjective regional low-carbon LRP (MORLCLRP). The MORLCLRP seeks to minimize service duration, client waiting time, and total costs, which includes carbon emission costs and total depot, vehicle, and travelling costs with respect to fuel consumption, and considers three practical constraints: simultaneous pickup and delivery, heterogeneous fleet, and hard time windows. We formulated a multiobjective mixed integer programming formulations for the problem under study. Due to the complexity of the proposed problem, a general framework, named the multiobjective hyper-heuristic approach (MOHH), was applied for obtaining Pareto-optimal solutions. Aiming at improving the performance of the proposed approach, four selection strategies and three acceptance criteria were developed as the high-level heuristic (HLH), and three multiobjective evolutionary algorithms (MOEAs) were designed as the low-level heuristics (LLHs). The performance of the proposed approach was tested for a set of different instances and comparative analyses were also conducted against eight domain-tailored MOEAs. The results showed that the proposed algorithm produced a high-quality Pareto set for most instances. Additionally, extensive analyses were also carried out to empirically assess the effects of domain-specific parameters (i.e., fleet composition, client and depot distribution, and zones area) on key performance indicators (i.e., hypervolume, inverted generated distance, and ratio of nondominated individuals). Several management insights are provided by analyzing the Pareto solutions.

scholarly journals Multiple Types of Plug-In Charging Facilities’ Location-Routing Problem with Time Windows for Mobile Charging Vehicles

2018 ◽  
Vol 10 (8) ◽  
pp. 2855 ◽  
Author(s):  
Shaohua Cui ◽  
Hui Zhao ◽  
Cuiping Zhang
Keyword(s):  
Time Windows ◽  
Alternative Methods ◽  
Sensitivity Analyses ◽  
Mixed Integer ◽  
Mixed Integer Linear Program ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing ◽  
Battery Capacity ◽  
Facilities Location

Increasing attention is being paid to the technology of battery electric vehicles (BEVs) because of their environmental friendliness. However, their short range, extended recharging times, and insufficient charging facilities hinder the improvement in the market share of BEVs. As a remedy, this paper presents a novel approach to providing a service for the battery charge replenishment of BEVs. Instead of using traditional alternative methods by only providing a charging service in a fixed location, such as battery-swapping and charging lanes, the novel charge replenishment is provided by mobile charging vehicles (MCVs), which could offer a charging service at any time and at location requested. To consider the limited running range and the opportunity to recharge from MCVs, as well as to determine the location strategy of multiple types of plug-in charging facility locations and the routing plan of the MCVs simultaneously, the location routing problem (LRP) that can integrate two decision levels, with a strategic level (location) and tactical level (routing), is applied. Then, we present the multiple types of plug-in charging facilities’ location-routing problem with time windows for mobile charging vehicles (MTPCF-LRPwTW-MCVs), and formulate the MTPCF-LRPwTW-MCVs as a mixed integer linear program for the convenience of solving. To demonstrate the model, test instances are designed and computational results are presented. Furthermore, sensitivity analyses on battery capacity, recharging rate, and so on, are also examined. The results show that with the increase of the battery capacity or the improvement of the charging rate of the charging facilities, the service efficiency of the MCVs can reasonably be improved. Therefore, the proposed method could be used in real world problems.

scholarly journals Energy-Efficient Location-Routing Problem with Time Windows with Dynamic Demand

2015 ◽  
Vol 3 (1) ◽  
pp. 17-36
Author(s):  
Shokoufeh Mirzaei ◽  
Krishna Krishnan ◽  
Bayram Yildrim
Keyword(s):  
Objective Function ◽  
Energy Efficient ◽  
Energy Savings ◽  
Time Window ◽  
Aerodynamic Drag ◽  
Time Windows ◽  
Mixed Integer ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing

Sustainability and energy savings have attracted considerable attention in recent years. However, in the traditional location-routing problem (LRP), the objective function has yet to minimize the distance traveled regardless of the amount of energy consumed. Although, distance is one of the major factors determining the energy consumption of a distribution network, it is not the only factor. Therefore, this paper explains the development of a novel formulation of the LRP that considers energy minimization, which is called the energy-efficient location-routing problem (EELRP). The energy consumed by a vehicle to travel between two nodes in a system depends on many forces. Among those, rolling resistance (RR) and aerodynamic drag are considered in this paper to be the major contributing forces. The presented mixed-integer non-linear program (MINLP) finds the best location-allocation routing plan with the objective function of minimizing total costs, including energy, emissions, and depot establishment. The proposed model can also handle the vehicle-selection problem with respect to a vehicles’ capacity, source of energy, and aerodynamic characteristics. The formulation proposed can also solve the problems with hard and soft time window constraints. Also, the model is enhanced to handle the EELRP with dynamic customers’ demands. Some examples are presented to illustrate the formulations presented in this paper.

scholarly journals A memetic algorithm for location-routing problem with time windows for the attention of seismic disasters: a case study from Bucaramanga, Colombia

Inge CUC ◽  
2018 ◽  
Vol 14 (1) ◽  
pp. 75-86 ◽  
Author(s):  
Henry Lamos Díaz ◽  
Karin Aguilar Imitola ◽  
Melissa Barreto Robles ◽  
Paula Niño Niño ◽  
Daniel Martínez Quezada
Keyword(s):  
Memetic Algorithm ◽  
Time Windows ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing

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.

Sign in / Sign up

Export Citation Format

Share Document