A Review of Heuristics and Hybrid Methods for Green Vehicle Routing Problems considering Emissions

Abstract

Road freight transport is one of the sectors with the highest greenhouse gas emissions and fuel consumption in the logistics industry. In recent years, due to the increase in carbon dioxide emissions, several companies have considered reducing them in their daily logistics operations by means of better routing management. Green vehicle routing problems (GVRPs) constitute a growing problem direction within the interplay of vehicle routing problems and environmental sustainability that aims to provide effective routes while considering environmental concerns. These NP-hard problems are one of the most studied ones in green logistics, and due to their difficulty, there are many different heuristic and hybrid techniques to solve them under the need of having high-quality solutions within reasonable computational time. Given the role and importance of these methods, this review aims at providing a comprehensive overview of them while reviewing their defining strategies and components. In addition, we analyze characteristics and problem components related to how emissions are being considered. Lastly, we map and analyze the benchmarks proposed so far for the different GVRP variants considering emissions.

Implementation of Green Freight Transport approach in Egypt: A case study of Port Said ports

“…• Emissions consideration: A crucial aspect of environmentally friendly freight transportation is green vehicle routing problems. These issues seek to offer solutions while taking environmental concerns into account, such as lowering greenhouse gas emissions [10].…”

The cumulative vehicle routing problem with time windows: models and algorithm

“…Green routing promotes sustainable mobility, safety, and reduce negative effects on the environment (Eglese & Black, 2015;Fernández et al, 2022;Moghdani et al, 2021). In this regard, the CumVRP belongs to the problems within the green routing area as their consider vehicles load gradually getting lighter when the delivery process is performed, causing less CO 2 emissions as the vehicle is moving through a route (Demir et al, 2014).…”

Enhanced Global Path Planning Efficiency by Bidirectional A*, Gradient Descent, and Orientation Interpolation Algorithms

“…Despite the strides made in augmenting the A* algorithm's performance, like the utilization of varied heuristic functions [13], expanding the search neighborhood [14], and refining the cost function [15], most of these advancements tend to optimize either efficiency or robustness but seldom both [16]. This introduces a challenge as an effective path-planning algorithm ought to concurrently maintain a balance between efficiency and robustness [17]. Some notable attempts at enhancement include Zhang et al's implementation of a regular hexagonal grid [18], the breaking of the single-step grid shape restriction by the Theta* algorithm [19], and Ju et al's Weighted JPS algorithm.…”