Green vehicle routing problem with queues

The green vehicle routing problem (GVRP) is a relatively new topic, which aims to minimize greenhouse gasses (GHG) emissions produced by a fleet of vehicles. Both internal combustion vehicles (ICV) and alternative fuel vehicles (AFV) are considered, dividing GVRP into two separate subclasses: ICV-based GVRP and AFV-based GVRP. In the ICV-based subclass, the environmental aspect comes from the objective function which aims to minimize GHG emissions or fuel usage of ICVs. On the other hand, the environmental aspect of AFV-based GVRP is implicit and comes from using AFVs in transport. Since GVRP is NP-hard, finding the exact solution in a reasonable amount of time is often impossible for larger instances, which is why metaheuristic approaches are predominantly used. The purpose of this study is to detect gaps in the literature and present suggestions for future research in the field. For that purpose, we review recent papers in which GVRP was tackled by some metaheuristic methods and describe algorithm specifics, VRP attributes, and objectives used in them.

The Vehicle Routing Problem (VRP) is a complex and high-level set of routing problems. Two of its important variants are the Dynamic Vehicle Routing Problem (DVRP) and the Green Vehicle Routing Problem (GVRP). The first one has become a challenging research topic in the last two decades, in which not all informations are known in advance, but are revealed as the system progresses. The second one is seen as a new application and solution in new logistics patterns, more specifically, for finding routes of vehicles to serve a set of customers while minimizing the total amount of CO 2 emissions, by increasing the loading rate and reducing the number of empty trips could reduce from 10% to 40% km traveled and therefore CO 2 emissions [1]. In this paper, we combine these two variants (DVRP and GVRP), where we try to minimize, in the dynamic environment, the greenhouse gas especially the carbon dioxide CO 2 , which is the immediate consequence of the depletion of the ozone layer and time duration. We will call this combination the Dynamic Green Vehicle Routing Problem (DGVRP). To study this new problem, we present the technique employed to estimate the amount of CO 2 emissions, the emission matrix and integrate them into the DGVRP model, then we propose the hybridization based on Ant Colony Optimization (ACO) algorithm with a Large Neighborhood Search (LNS) algorithm to solve our problem. The effectiveness of this approach is tested on a set of the dynamic green problems instances, which are adopted in this work from the static GVRP benchmark datasets.

Today, serious environmental problems arise with overconsumption. The most effective way of protecting the environment is recycling. To obtain maximum benefit from the recycling activities depends on the effective and robust design of the disassembly lines. In addition, the distribution plan of products to be recycled is as important as the disassembly process. Therefore, this study includes the integrated optimization of the partial disassembly line balancing problem and the multi-objective green vehicle routing problem for the first time. The integrated problem is formulated as a Multi-Objective Mixed Integer Linear Programming. The model’s objectives consist of minimization of total CO2 emission and cost. The Pareto optimal solution set is found by solving this problem with the Augmented ℇ-Constraint Method. The model respectively determines (i) the total number of opened workstations in the disassembly center, (ii) optimal task assignments to workstations in disassembly centers and non-disassembled tasks, (iii) total workstation times and idle times of each workstation, (iv) optimal distribution routes for all vehicles. This study examines a case study in Turkey. To determine the best Pareto optimal solution for homogeneous and heterogeneous fleets, the integrated multi-criteria decision-making method consisting of EWM (Entropy Weight Method) and COPRAS (Complex Proportional Assessment) is used.

Over the two last decades, distribution companies have been aware of the importance of paying attention to the all aspects of a distribution system simultaneously to be successful in the global market. These aspects are the economic, the environmental, the social and the safety aspects. In the Vehicle Routing Problem (VRP) literature, the economic issue has often been used, while the environmental, the safety and the social concerns have been less proportion of studies. The Green vehicle routing problem (GVRP) is one of the recent variants of the VRP, dealing with environmental aspects of distribution systems. In this paper, two developed mixed integer programming models are presented for the GVRP with social and safety concerns. Moreover, a Genetic Algorithm (GA) is developed to deal efficiently with the problem in large size. Different numerical analyses have performed to validate the presented algorithm in comparison to exact solutions and investigate the influence of several key factors like the effect of increasing the cost of safety aspect on route balancing, and customer waiting time. The results confirm that the proposed algorithm performs well and has more social and safety benefits (such as more balanced tours and fewer customers waiting time than the classic GVRP.

This paper provides a green vehicle routing problem with simultaneous pickup and delivery with time windows. The objective of this study is to minimize total costs including fuel cost and carbon emission cost while satisfying customer pickup and delivery demands simultaneously with time windows and capacity constraints. In this paper, fuel consumption is computed considering vehicle load and distance. Firstly, a mathematical model is developed to describe the VRPSPDTW problem. This study proposes a genetic algorithm to optimize cost. The computational experiments are conducted under three crossover (one point, two point and cyclic crossover) and two mutation (swap and inverse) operator. The computation between swap and inverse mutation under three crossover are compared and the results show that swap mutation perform better than inverse mutation under every crossover operator.

GVRP considered oil-gas recovery in refined oil distribution: From an environmental perspective

The green vehicle routing problem: A heuristic based exact solution approach

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.

One of the important problems of sustainable logistics is routing vehicles in a sustainable manner, the green vehicle routing problem, or vehicle routing problems which aim to reduce CO2 emissions. In the literature research, it was seen that these problems were solved with heuristic, metaheuristic, or hyper-heuristic methods and hybrid approaches since they are in the NP-hard class. This work presents a parallel multi-process genetic algorithm that incorporates problem-specific genetic operators to minimize CO2 emissions in the capacity-constrained vehicle routing problem. Unlike previous research, the algorithm combines parallel computing with tailored genetic operators in order to enhance the diversity of solutions and speed up convergence. Genetic algorithm models were developed to minimize total distance, CO2 emissions, and both objectives simultaneously. Two genetic algorithm models were developed to minimize total distance and CO2 emissions. Experimental results using the reference CVRP examples such as A-n32-k5 and B-n44-k7 show that the proposed approach reduces CO2 emissions by 1.2% more than hybrid artificial bee colony optimization, 1.3% more than ant colony optimization, and 4% more than the traditional genetic algorithm. Experimental results using benchmark CVRP instances demonstrate that the proposed approach outperforms hybrid artificial bee colony optimization, ant colony optimization, and traditional genetic algorithms for most of the test cases. This is done by exploiting multi-core processors, and the parallel architecture has improved computational efficiency; the modules compare and update solutions against the global optimum. Results obtained show that prioritizing CO2 emissions as the only objective yields better results compared to multi-objective models. This study makes two significant contributions to the literature: (1) it introduces a novel parallel genetic algorithm framework optimized for CO2 emission reduction, and (2) it provides empirical evidence underscoring the advantages of emission-focused optimization in CVRP.

The effects of greenhouse gas (GHG) on the weather has caused ever-increasing disasters around the world. Many countries are making significant efforts to reduce GHG emissions in all industrial sectors. In this study, a green vehicle routing problem (GVRP) has been formulated as a nonlinear integer programming problem to minimize GHG emissions, considering various realistic factors that include three-dimensional customer locations, gravity, vehicle speed, vehicle operating time, vehicle capacity, rolling resistance, air density, road grade and inertia. Lagrangian relaxation has been introduced to propose a simple solution method. In contrast to traditional vehicle routing problems, the vehicle speed, vehicle weight, and road grade between two customer locations are also determined along with vehicle routes. The computational results demonstrate the effectiveness and efficiency of the proposed solution method.

In most classic vehicle routing problems, the main goal is to minimise the total travel time or distance while, the green vehicle routing problem, in addition to the stated objectives, also focuses on minimising fuel costs and greenhouse gas emissions, including carbon dioxide emissions. In this research, a new approach in Pollution Routing Problem (PRP) is proposed to minimise the CO2 emission by investigating vehicle weight fill level in length of each route. The PRP with a homogeneous fleet of vehicles, time windows, considering the possibility of split delivery and constraint of minimum shipment weight that must be on the vehicle in each route is investigated simultaneously. The mathematical model is developed and implemented using a simulated annealing algorithm which is programmed in MATLAB software. The generated results from all experiments demonstrated that the application of the proposed mathematical model led to the reduction in CO2 emission.

The growing rate of population and technological advancement have led to an increase in natural resource consumption, which has caused irreparable damage to the environment. The implementation of green supply chain management is one of the most effective ways to deal with environmental degradation. Therefore, in this paper, a bi-objective mixed integer linear programming model is developed to design a green supply chain network. In the proposed model, the possibility of customer storage, being faced with shortage, locating of distribution centres, green vehicle routing problem, split delivery, multi-depot vehicle routing problem (VRP), capacitated VRP, and uncertainty in demands will be considered. The aim of the proposed model is to minimise the total cost and total shortages simultaneously and, therefore, a fuzzy solution approach is applied for this purpose. The results of implementing this model in a production chain of automotive parts in Iran indicate the exact and efficient performance of the proposed model.

In this paper, we introduce a new emissions factor referred to as the Environmental Externalities score (EES) as a measure of transportation network factors (e.g., gradient, rolling resistance, air resistance etc.) having an impact on fuel consumption of a vehicle. We express the EES by vehicle class (i.e. light-duty and heavy-duty) as a function of each one of these factors. We base our results on extensive bibliographic research and we provide comparisons between different routing scenarios. This novel emission factor is developed to define the objective function of the green vehicle routing problem.

A hyper heuristic for the green vehicle routing problem with simultaneous pickup and delivery

Suffering from environmental distress like carbon emissions, traffic restrictions have been enforced extensively in distribution logistics. Reasonable arrangement of urban freight transportation can effectively improve distribution efficiency, reduce distribution costs, and alleviate the impact of traffic restrictions in distribution logistics. In response to increasingly stringent traffic restrictions, we establish a multi-objective optimization model, including the minimum distributions and the minimum carbon emissions. Given that the limits of battery capacity and cargo capacity, we build a green vehicle routing problem with soft time windows (GVRPTW) model with heterogenous fleets. In this study, three different factors, that is restricted area, travel time of vehicles, and carbon tax prices, are discussed in details. In order to solve the NP-hard model, we propose an improved ant colony optimization algorithm (IACO) by optimizing the state transition probability, and verifies the worth of the algorithm. The experimental results can explore the impacts of traffic restriction policies on the formulation of distribution scheme and offer reference opinions for the government to formulate reasonable restriction policies and better guide logistics enterprises to reduce carbon emissions.