scholarly journals The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm

2016 ◽  
Vol 248 (1) ◽  
pp. 33-51 ◽  
Author(s):  
Çağrı Koç ◽  
Tolga Bektaş ◽  
Ola Jabali ◽  
Gilbert Laporte
Keyword(s):  
Heuristic Algorithm ◽  
Time Windows ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Fleet Size ◽  
Location Routing ◽  
Fleet Size And Mix

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.

Sign in / Sign up

Export Citation Format

Share Document