scholarly journals A Model for Sustainable Courier Services: Vehicle Routing with Exclusive Lanes

2020 ◽  
Vol 12 (3) ◽  
pp. 1077
Author(s):  
Keyju Lee ◽  
Junjae Chae ◽  
Bomi Song ◽  
Donghyun Choi
Keyword(s):  
Vehicle Routing ◽  
Carbon Emissions ◽  
Vehicle Routing Problem ◽  
Traffic Congestion ◽  
Urban Areas ◽  
Southeast Asian ◽  
Routing Problem ◽  
Heterogeneous Fleet ◽  
Proposed Model ◽  
Asian Cities

In Southeast Asian cities, it is common for logistic companies to operate a heterogeneous fleet of delivery vehicles with motorcycles being the preferred vehicle to handle the final phase of delivery. In such scenarios, heterogeneous fleet vehicle routing problem (HFVRP) is generally applied to plan an optimal delivery. However, in many downtown cores of large and rapidly developing Southeast Asian cities, HFVRP is neither viable nor reliable because of road usage restrictions. The purpose of this article is to develop and test a different approach that accurately takes these restrictions into account and provides viable and more sustainable results. Restrictions in this paper refer to situations of urban areas in Vietnam where (i) certain vehicle types are prohibited in specified areas or where narrow alleyways limit the utilization of vehicles that exceed the road capacity and (ii) certain roads are exclusive to certain vehicle types. In networks, limited access and exclusive lanes are represented as links, or arcs, exclusive to one or another. Taking these limitations into consideration, we have developed a unique model, which we have termed Vehicle Routing Problem with Exclusive Links (VRP-EL). The model was validated and tested for its performance on scenarios with varying ratios of exclusive links. Scenarios up to 500 customers were tested on a meta-heuristic algorithm, simulated annealing. VRP-EL produces realistic outcomes. Limiting certain links to be selected according to vehicle types increases overall travel distance. However, this increase outweighs the cost of re-planning and rerouting had they not been constrained initially. The reduction in traveling distance leads to fossil fuel reduction for the overall system. The estimation of reduced carbon emissions through applying the proposed model is presented. Considering the severe traffic congestion and carbon emissions caused by motorcycles in Vietnam, the proposed model leads to a sustainable road environment.

scholarly journals Optimization of a Low-Carbon Two-Echelon Heterogeneous-Fleet Vehicle Routing for Cold Chain Logistics under Mixed Time Window

2020 ◽  
Vol 12 (5) ◽  
pp. 1967 ◽  
Author(s):  
Ziqi Wang ◽  
Peihan Wen
Keyword(s):  
Customer Satisfaction ◽  
Vehicle Routing ◽  
Carbon Emissions ◽  
Vehicle Routing Problem ◽  
Time Window ◽  
Cold Chain ◽  
Carbon Trading ◽  
Low Carbon ◽  
Routing Problem ◽  
Heterogeneous Fleet

Due to the rise of social and environmental concerns on global climate change, developing the low-carbon economy is a necessary strategic step to respond to greenhouse effect and incorporate sustainability. As such, there is a new trend for the cold chain industry to establish the low-carbon vehicle routing optimization model which takes costs and carbon emissions as the measurements of performance. This paper studies a low-carbon vehicle routing problem (LC-VRP) derived from a real cold chain logistics network with several practical constraints, which also takes customer satisfaction into account. A low-carbon two-echelon heterogeneous-fleet vehicle routing problem (LC-2EHVRP) model for cold chain third-party logistics servers (3PL) with mixed time window under a carbon trading policy is constructed in this paper and aims at minimizing costs, carbon emissions and maximizing total customer satisfaction simultaneously. To find the optimal solution of such a nondeterministic polynomial (NP) hard problem, we proposed an adaptive genetic algorithm (AGA) approach validated by a numerical benchmark test. Furthermore, a real cold chain case study is presented to demonstrate the influence of the mixed time window’s changing which affect customers’ final satisfaction and the carbon trading settings on LC-2EHVRP model. Experiment of LC-2EHVRP model without customer satisfaction consideration is also designed as a control group. Results show that customer satisfaction is a critical influencer for companies to plan multi-echelon vehicle routing strategy, and current modest carbon price and trading quota settings in China have only a minimal effect on emissions’ control. Several managerial suggestions are given to cold chain logistics enterprises, governments, and even consumers to help improve the development of cold chain logistics.

The characteristics of multicriteria vehicle routing problem with soft time windows

2018 ◽  
Vol 120 ◽  
pp. 219-229
Author(s):  
Daniel Kubek
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Urban Areas ◽  
Road Network ◽  
Time Windows ◽  
Routing Problem ◽  
Soft Time Windows ◽  
Proposed Model ◽  
Basic Characteristics ◽  
The City

The article aims to define a model for a popular and important issue of vehicle routes planning in urban areas. The proposed model has been formulated in a multi-criteria form, which additionally takes into account reverse of good flows and soft time windows. The basic characteristics and usability of the model were analysed by numerous computational experiments. The data for experiments were based on the actual road network of the city of Krakow.

A Multi-Period Evacuation Vehicle Routing Problem Model

2014 ◽  
Vol 931-932 ◽  
pp. 578-582
Author(s):  
Sunarin Chanta ◽  
Ornurai Sangsawang
Keyword(s):  
Vehicle Routing ◽  
Public Transportation ◽  
Vehicle Routing Problem ◽  
Programming Model ◽  
High Water ◽  
Mixed Integer ◽  
Routing Problem ◽  
Problem Model ◽  
Proposed Model ◽  
Evacuation Routing

In this paper, we proposed an optimization model that addresses the evacuation routing problem for flood disaster when evacuees trying to move from affected areas to safe places using public transportation. A focus is on the situation of evacuating during high water level when special high vehicles are needed. The objective is to minimize the total traveled distance through evacuation periods where a limited number of vehicles is given. We formulated the problem as a mixed integer programming model based on the capacitated vehicle routing problem with multiple evcuation periods where demand changing by the time. The proposed model has been tested on a real-world case study affected by the severe flooding in Thailand, 2011.

scholarly journals On the Selective Vehicle Routing Problem

Mathematics ◽  
2020 ◽  
Vol 8 (5) ◽  
pp. 771 ◽  
Author(s):  
Cosmin Sabo ◽  
Petrică C. Pop ◽  
Andrei Horvat-Marc
Keyword(s):  
Mathematical Model ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Mixed Integer ◽  
The Novel ◽  
Routing Problem ◽  
Proposed Model ◽  
Benchmark Instances ◽  
Number Of Customers ◽  
Optimal Set

The Generalized Vehicle Routing Problem (GVRP) is an extension of the classical Vehicle Routing Problem (VRP), in which we are looking for an optimal set of delivery or collection routes from a given depot to a number of customers divided into predefined, mutually exclusive, and exhaustive clusters, visiting exactly one customer from each cluster and fulfilling the capacity restrictions. This paper deals with a more generic version of the GVRP, introduced recently and called Selective Vehicle Routing Problem (SVRP). This problem generalizes the GVRP in the sense that the customers are divided into clusters, but they may belong to one or more clusters. The aim of this work is to describe a novel mixed integer programming based mathematical model of the SVRP. To validate the consistency of the novel mathematical model, a comparison between the proposed model and the existing models from literature is performed, on the existing benchmark instances for SVRP and on a set of additional benchmark instances used in the case of GVRP and adapted for SVRP. The proposed model showed better results against the existing models.

scholarly journals Electric Vehicle Routing Problem with Battery Swapping Considering Energy Consumption and Carbon Emissions

2020 ◽  
Vol 12 (24) ◽  
pp. 10537
Author(s):  
Jin Li ◽  
Feng Wang ◽  
Yu He
Keyword(s):  
Energy Consumption ◽  
Vehicle Routing ◽  
Electric Vehicle ◽  
Carbon Emissions ◽  
Vehicle Routing Problem ◽  
Hill Climbing ◽  
Neighborhood Search ◽  
Battery Life ◽  
Routing Problem ◽  
Crossover And Mutation

In this paper, we study an electric vehicle routing problem while considering the constraints on battery life and battery swapping stations. We first introduce a comprehensive model consisting of speed, load and distance to measure the energy consumption and carbon emissions of electric vehicles. Second, we propose a mixed integer programming model to minimize the total costs related to electric vehicle energy consumption and travel time. To solve this model efficiently, we develop an adaptive genetic algorithm based on hill climbing optimization and neighborhood search. The crossover and mutation probabilities are designed to adaptively adjust with the change of population fitness. The hill climbing search is used to enhance the local search ability of the algorithm. In order to satisfy the constraints of battery life and battery swapping stations, the neighborhood search strategy is applied to obtain the final optimal feasible solution. Finally, we conduct numerical experiments to test the performance of the algorithm. Computational results illustrate that a routing arrangement that accounts for power consumption and travel time can reduce carbon emissions and total logistics delivery costs. Moreover, we demonstrate the effect of adaptive crossover and mutation probabilities on the optimal solution.

scholarly journals Dynamic Optimization Model and Algorithm Design for Emergency Materials Dispatch

2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Bingbing Dan ◽  
Wanhong Zhu ◽  
Huabing Li ◽  
Yangyang Sang ◽  
Yan Liu
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Algorithm Design ◽  
Time Axis ◽  
Ant Colony Optimization Algorithm ◽  
Dynamic Vehicle Routing ◽  
Routing Problem ◽  
Proposed Model ◽  
Dynamic Optimization Model ◽  
Process Strategy

Emergency materials dispatch (EMD) is a typical dynamic vehicle routing problem (DVRP) and it concentrates on process strategy solving, which is different from the traditional static vehicle routing problem. Based on the characteristics of emergency materials dispatch, DVRP changed the EMD into a series of static problems in time axis. A mathematical multiobjective model is established, and the corresponding improved ant colony optimization algorithm is designed to solve the problem. Finally, a numeric example is provided to demonstrate the validity and feasibility of this proposed model and algorithm.

Sign in / Sign up

Export Citation Format

Share Document