A Survey on Environmentally Friendly Vehicle Routing Problem and a Proposal of Its Classification

The growth of environmental awareness and more robust enforcement of numerous regulations to reduce greenhouse gas (GHG) emissions have directed efforts towards addressing current environmental challenges. Considering the Vehicle Routing Problem (VRP), one of the effective strategies to control greenhouse gas emissions is to convert the fossil fuel-powered fleet into Environmentally Friendly Vehicles (EFVs). Given the multitude of constraints and assumptions defined for different types of VRPs, as well as assumptions and operational constraints specific to each type of EFV, many variants of environmentally friendly VRPs (EF-VRP) have been introduced. In this paper, studies conducted on the subject of EF-VRP are reviewed, considering all the road transport EFV types and problem variants, and classifying and discussing with a single holistic vision. The aim of this paper is twofold. First, it determines a classification of EF-VRP studies based on different types of EFVs, i.e., Alternative-Fuel Vehicles (AFVs), Electric Vehicles (EVs) and Hybrid Vehicles (HVs). Second, it presents a comprehensive survey by considering each variant of the classification, technical constraints and solution methods arising in the literature. The results of this paper show that studies on EF-VRP are relatively novel and there is still room for large improvements in several areas. So, to determine future insights, for each classification of EF-VRP studies, the paper provides the literature gaps and future research needs.

Download Full-text

Electric Vehicle Routing Problem with Industry Constraints: Trends and Insights for Future Research

Transportation Research Procedia ◽

10.1016/j.trpro.2014.10.026 ◽

2014 ◽

Vol 3 ◽

pp. 452-459 ◽

Cited By ~ 39

Author(s):

Anagnostopoulou Afroditi ◽

Maria Boile ◽

Sotirios Theofanis ◽

Eleftherios Sdoukopoulos ◽

Dimitrios Margaritis

Keyword(s):

Vehicle Routing ◽

Electric Vehicle ◽

Vehicle Routing Problem ◽

Future Research ◽

Routing Problem

Download Full-text

Energy-Efficient Green Vehicle Routing Problem

International Journal of Information Systems and Supply Chain Management ◽

10.4018/ijisscm.2019100102 ◽

2019 ◽

Vol 12 (4) ◽

pp. 27-41

Author(s):

A. Sruthi ◽

S.P. Anbuudayasankar ◽

G. Jeyakumar

Keyword(s):

Vehicle Routing ◽

Vehicle Routing Problem ◽

Carbon Tax ◽

Ghg Emissions ◽

Routing Problem ◽

Energy Emission ◽

Transportation Sector ◽

Reduce Emissions ◽

Conventional Models ◽

Distance Minimization

The greenhouse gas emissions from the transportation sector are one of the major contributors to global warming today. Freight share to GHG emissions is likely to increase 2-fold by 2050. This makes it critical for CO2 emissions to be reduced through an optimized transportation strategy. Vehicle routing, when done efficiently, can reduce these emissions across countries. In this attempt, the traditional distance minimization objective of the vehicle routing problem has been replaced with an energy-emission-centric objective. A model is formulated taking energy and emissions into simultaneous consideration and a typical VRP problem has been evaluated using a genetic algorithm. The application of the proposed model is observed to reduce emissions significantly compared to conventional models. Considering the possibility of increase in carbon tax in future, energy-emission minimized routing would not only aid “green logistics,” but also reduce the environmental costs incurred.

Download Full-text

Waste Collection Vehicle Routing Problem: Literature Review

PROMET - Traffic&Transportation ◽

10.7307/ptt.v27i4.1616 ◽

2015 ◽

Vol 27 (4) ◽

pp. 345-358 ◽

Cited By ~ 22

Author(s):

Hui Han ◽

Eva Ponce Cueto

Keyword(s):

Vehicle Routing ◽

Vehicle Routing Problem ◽

Research Literature ◽

Arc Routing ◽

Waste Collection ◽

Logistics System ◽

Routing Problems ◽

Routing Problem ◽

Node Routing

Waste generation is an issue which has caused wide public concern in modern societies, not only for the quantitative rise of the amount of waste generated, but also for the increasing complexity of some products and components. Waste collection is a highly relevant activity in the reverse logistics system and how to collect waste in an efficient way is an area that needs to be improved. This paper analyzes the major contribution about Waste Collection Vehicle Routing Problem (WCVRP) in literature. Based on a classification of waste collection (residential, commercial and industrial), firstly the key findings for these three types of waste collection are presented. Therefore, according to the model (Node Routing Problems and Arc Routing problems) used to represent WCVRP, different methods and techniques are analyzed in this paper to solve WCVRP. This paper attempts to serve as a roadmap of research literature produced in the field of WCVRP.

Download Full-text

A New Plant Intelligent Behaviour Optimisation Algorithm for Solving Vehicle Routing Problem

Mathematical Problems in Engineering ◽

10.1155/2018/9874356 ◽

2018 ◽

Vol 2018 ◽

pp. 1-10 ◽

Cited By ~ 1

Author(s):

Godfrey Chagwiza

Keyword(s):

Vehicle Routing ◽

Vehicle Routing Problem ◽

Future Research ◽

Vehicle Routing Problems ◽

Routing Problems ◽

Routing Problem ◽

Optimisation Algorithm ◽

Input Parameters ◽

Problem Instances

A new plant intelligent behaviour optimisation algorithm is developed. The algorithm is motivated by intelligent behaviour of plants and is implemented to solve benchmark vehicle routing problems of all sizes, and results were compared to those in literature. The results show that the new algorithm outperforms most of algorithms it was compared to for very large and large vehicle routing problem instances. This is attributed to the ability of the plant to use previously stored memory to respond to new problems. Future research may focus on improving input parameters so as to achieve better results.

Download Full-text

Stochastic Vehicle Routing Problem: A Literature Survey

Journal of Information & Knowledge Management ◽

10.1142/s0219649214500221 ◽

2014 ◽

Vol 13 (03) ◽

pp. 1450022 ◽

Cited By ~ 19

Author(s):

Eshetie Berhan ◽

Birhanu Beshah ◽

Daniel Kitaw ◽

Ajith Abraham

Keyword(s):

Objective Function ◽

Vehicle Routing ◽

Vehicle Routing Problem ◽

Cost Minimization ◽

Meta Analysis ◽

Future Research ◽

Routing Problem ◽

Applied Model ◽

Stochastic Vehicle Routing ◽

Comprehensive Survey

The purpose of this paper is to develop structural classification of Stochastic Vehicle Routing Problem (SVRP) by different domains and attributes. This research used a systematic review and meta-analysis on SVRP literatures. This includes browsing relevant researches and publications, screening related articles, identifying domains, attributes and categorising the articles based on the identified domains and attributes. The findings of the study show clear differences on the number of studies under each domain and attribute. Most studied attributes are stochastic customer demand, capacitated vehicle, synthesis data and objective function with cost minimization. Whereas the least studied are maximisation objective function, stochastic service time, and an applied model using stochastic with recurs. The research helps to summarise and map a comprehensive survey on SVRP literatures so that various contributions in the field are organised in a manner that provide a clear view for the readers and identify future research directions. This paper is the first of its kind in the field of SVRP that develop a classification scheme for articles published since 1993 to enhances the development of this newly emerging discipline.

Download Full-text

Vehicle Routing with Compartments Under Product Incompatibility Constraints

PROMET - Traffic&Transportation ◽

10.7307/ptt.v31i1.2670 ◽

2019 ◽

Vol 31 (1) ◽

pp. 25-36

Author(s):

Bahar Tasar ◽

Deniz Türsel Eliiyi ◽

Levent Kandiller

Keyword(s):

Vehicle Routing ◽

Vehicle Routing Problem ◽

Heuristic Algorithms ◽

Extensive Literature ◽

Research Papers ◽

Routing Problem ◽

Split Delivery ◽

Lower Bounding ◽

Different Types ◽

Taxonomic Framework

This study focuses on a distribution problem involving incompatible products which cannot be stored in a compartment of a vehicle. To satisfy different types of customer demand at minimum logistics cost, the products are stored in different compartments of fleet vehicles, which requires the problem to be modeled as a multiple-compartment vehicle routing problem (MCVRP). While there is an extensive literature on the vehicle routing problem (VRP) and its numerous variants, there are fewer research papers on the MCVRP. Firstly, a novel taxonomic framework for the VRP literature is proposed in this study. Secondly, new mathematical models are proposed for the basic MCVRP, together with its multiple-trip and split-delivery extensions, for obtaining exact solutions for small-size instances. Finally, heuristic algorithms are developed for larger instances of the three problem variants. To test the performance of our heuristics against optimum solutions for larger instances, a lower bounding scheme is also proposed. The results of the computational experiments are reported, indicating validity and a promising performance of an approach.

Download Full-text

Scatter Search Applied to the Vehicle Routing Problem with Simultaneous Delivery and Pickup

International Journal of Applied Metaheuristic Computing ◽

10.4018/jamc.2011040101 ◽

2011 ◽

Vol 2 (2) ◽

pp. 1-20 ◽

Cited By ~ 8

Author(s):

Gladys Maquera ◽

Manuel Laguna ◽

Dan Abensur Gandelman ◽

Annibal Parracho Sant’Anna

Keyword(s):

Vehicle Routing ◽

Vehicle Routing Problem ◽

Scatter Search ◽

Environmentally Friendly ◽

Research Interest ◽

Business Practices ◽

Evolutionary Search ◽

Computational Results ◽

Routing Problem ◽

Simultaneous Delivery

Though its origins can be traced back to 1977, the development and application of the metaheuristic Scatter Search (SS) has stayed dormant for 20 years. However, in the last 10 years, research interest has positioned SS as one of the recognizable methodologies within the umbrella of evolutionary search. This paper presents an application of SS to the problem of routing vehicles that are required both to deliver and pickup goods (VRPSDP). This specialized version of the vehicle routing problem is particularly relevant to organizations that are concerned with sustainable and environmentally-friendly business practices. In this work, the efficiency of SS is evaluated when applied to this problem. Computational results of the application to instances in the literature are presented.

Download Full-text

Scatter Search Applied to the Vehicle Routing Problem with Simultaneous Delivery and Pickup

Trends in Developing Metaheuristics, Algorithms, and Optimization Approaches ◽

10.4018/978-1-4666-2145-9.ch010 ◽

2012 ◽

pp. 149-168 ◽

Cited By ~ 1

Author(s):

Gladys Maquera ◽

Manuel Laguna ◽

Dan Abensur Gandelman ◽

Annibal Parracho Sant’Anna

Keyword(s):

Vehicle Routing ◽

Vehicle Routing Problem ◽

Scatter Search ◽

Environmentally Friendly ◽

Research Interest ◽

Business Practices ◽

Evolutionary Search ◽

Computational Results ◽

Routing Problem ◽

Simultaneous Delivery

Download Full-text

A Review on the Bin Packing Capacitated Vehicle Routing Problem

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.853.668 ◽

2013 ◽

Vol 853 ◽

pp. 668-673 ◽

Cited By ~ 1

Author(s):

Qun Zhang ◽

Li Rong Wei ◽

Rui Hu ◽

Rui Yan ◽

Li Hua Li ◽

...

Keyword(s):

Vehicle Routing ◽

Vehicle Routing Problem ◽

Bin Packing ◽

Three Dimensional ◽

Future Research ◽

Two Dimensional ◽

Routing Problem ◽

Capacitated Vehicle Routing Problem ◽

Research Orientations ◽

Capacitated Vehicle

This paper introduced the Bin Packing Capacitated Vehicle Routing Problem. It introduced the constraints and differences between algorithms of two-dimensional and three-dimensional loading capacitated vehicle routing problem. It gave a review of models and algorithms for Bin Packing Capacitated VRP. Finally, it prospected future research orientations and possible improvement in this area.

Download Full-text

A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches

Journal of Advanced Transportation ◽

10.1155/2019/5075671 ◽

2019 ◽

Vol 2019 ◽

pp. 1-48 ◽

Cited By ~ 18

Author(s):

Tomislav Erdelić ◽

Tonči Carić

Keyword(s):

Greenhouse Gas ◽

Vehicle Routing ◽

Electric Vehicle ◽

Electric Vehicles ◽

Vehicle Routing Problem ◽

Greenhouse Gas Emission ◽

Transport Sector ◽

Logistic Distribution ◽

Routing Problem ◽

New Policies

In order to ensure high-quality and on-time delivery in logistic distribution processes, it is necessary to efficiently manage the delivery fleet. Nowadays, due to the new policies and regulations related to greenhouse gas emission in the transport sector, logistic companies are paying higher penalties for each emission gram of CO2/km. With electric vehicle market penetration, many companies are evaluating the integration of electric vehicles in their fleet, as they do not have local greenhouse gas emissions, produce minimal noise, and are independent of the fluctuating oil price. The well-researched vehicle routing problem (VRP) is extended to the electric vehicle routing problem (E-VRP), which takes into account specific characteristics of electric vehicles. In this paper, a literature review on recent developments regarding the E-VRP is presented. The challenges that emerged with the integration of electric vehicles in the delivery processes are described, together with electric vehicle characteristics and recent energy consumption models. Several variants of the E-VRP and related problems are observed. To cope with the new routing challenges in E-VRP, efficient VRP heuristics and metaheuristics had to be adapted. An overview of the state-of-the-art procedures for solving the E-VRP and related problems is presented.

Download Full-text