A Green Vehicle Routing Problem (original) (raw)
Related papers
An Exact Solution for a Class of Green Vehicle Routing Problem
A mathematical model for presenting an exact solution for the Green Vehicle Routing Problem (G-VRP) is developed in this paper. G-VRP is concerned with minimizing the travel distance while maintaining less emission of carbon dioxide by using alternative sources of fuel. The solution aims to aid organizations that operate a fleet of alternative fuel-powered vehicles to overcome challenges that occur due to limitation of refueling infrastructure and vehicle driving range and to help them to plan for refueling and incorporate stops at Alternative Fuel Stations (AFS) so as to eliminate the risk of running out of fuel while sustaining low cost routes. The solution of the model shows that the problem could be extended for further adoptions and techniques as discussed.
Optimizing Green Vehicle Routing Problem-A Real Case Study
European J. of Industrial Engineering
The optimisation of distribution activities in the logistics scheme of various companies, long time based on economic objectives, is widening today to integrate environmental concerns. This paper addresses the fuel consumption minimisation problem for one variant of the green VRP which is the VRP with fuel consumption rate (FCVRP) and considers load and distance as two main factors affecting fuel consumption. The problem is classified as NP-hard, hence, we propose to solve it by an iterated local search meta-heuristic (ILSFC-SP) starting with a heuristic approach that is based on mathematical programming and generates solutions by CPLEX. In order to test its performance, ILSFC-SP was first applied on benchmark instances to minimise fuel consumption as well as travelled distance and compared with the literature where it proved its efficacy, then, it was applied to a real-world application in Tunisia where it suggested operational solutions reducing considerably the fuel costs. [
Optimising green vehicle routing problem - a real case study
European J. of Industrial Engineering
The optimisation of distribution activities in the logistics scheme of various companies, long time based on economic objectives, is widening today to integrate environmental concerns. This paper addresses the fuel consumption minimisation problem for one variant of the green VRP which is the VRP with fuel consumption rate (FCVRP) and considers load and distance as two main factors affecting fuel consumption. The problem is classified as NP-hard, hence, we propose to solve it by an iterated local search meta-heuristic (ILSFC-SP) starting with a heuristic approach that is based on mathematical programming and generates solutions by CPLEX. In order to test its performance, ILSFC-SP was first applied on benchmark instances to minimise fuel consumption as well as travelled distance and compared with the literature where it proved its efficacy, then, it was applied to a real-world application in Tunisia where it suggested operational solutions reducing considerably the fuel costs. [
A new Mathematical Programming Model for the Green Vehicle Routing Problem
Electronic Notes in Discrete Mathematics, 2016
A new MILP formulation for the Green Vehicle Routing Problem is introduced where the visits to the Alternative Fuel Stations (AFSs) are only implicitly considered. The number of variables is also reduced by pre-computing for each couple of customers an efficient set of AFSs, only given by those that may be actually used in an optimal solution. Numerical experiments on benchmark instances show that our model outperforms the previous ones proposed in the literature.
2020
This paper formulates a mathematical model for the Green Vehicle Routing Problem (GVRP), incorporating bi-fuel (natural gas and gasoline) pickup trucks in a mixed vehicle fleet. The objective is to minimize overall costs relating to service (earliness and tardiness), transportation (fixed, variable and fuel), and carbon emissions. To reflect a real-world situation, the study considers: (1) a comprehensive fuel consumption function with a soft time window, and (2) an en-route fuel refueling option to eliminate the constraint of driving range. A linear set of valid inequalities for computing fuel consumption were introduced. In order to validate the presented model, first, the model is solved for an illustrative example. Then each component of cost objective function is considered separately so as to investigate the effects of each part on the obtained solutions and the importance of vehicles speed on transportation strategies. Computational analysis shows that, despite the limitation...
The Green Vehicle Routing Problem with Capacitated Alternative Fuel Stations
Computers & Operations Research
In this paper, we propose a metaheuristic approach for efficiently solving the Green Vehicle Routing Problem with Capacitated Alternative Fuel Stations (G-VRP-CAFS). The G-VRP-CAFS, a variant of the traditional G-VRP, aims at routing a fleet of Alternative Fuel Vehicles (AFVs), based at a common depot, in order to serve a set of customers, minimizing the total travel distance. Due to the limited autonomy of the AFVs, some stops at Alternative Fuel Stations (AFSs) may be necessary during each trip. Unlike the G-VRP, in the G-VRP-CAFS, the AFS capacity, in terms of fueling pumps that are simultaneously available, is realistically assumed limited. For such a problem, we design an Iterated Local Search algorithm, in order to obtain good quality solutions in reasonable amount of time also on real-life alike case studies. Preliminary results, carried out on a set of benchmark instances taken from the literature, are promising.
Modelling and Analysis of a Green Vehicle Routing Problem
2014
The classical vehicle routing problems are designed for distance or cost reduction. The routes generated by the model will be insensitive towards the environmental impact. In this work, a green vehicle routing problem is addressed. A metaheuristic algorithm combining an Ant Colony Optimization algorithm with a Variable Neighbourhood Search algorithm is developed to solve the problem. The hybrid heuristic will search the solution space for the routing strategy, that minimizes the total supply chain cost which comprises of economic as well as emission cost. For consistency of solutions and solution convergence, the algorithm is tested on randomly generated problem instances.
A path-based solution approach for the Green Vehicle Routing Problem
Computers & Operations Research, 2018
The Green Vehicle Routing Problem aims routing Alternative Fuel Vehicles, based at a depot, minimizing the total travel distance. Each vehicle handles a subset of customers, leaving from and returning to the depot, respecting a maximum duration and a distance traveled without refuels. We propose a two phases exact approach, composing each route through two/more paths. Each path serves a subset of customers without intermediate refuels. Dominance rules limit the number of feasible paths. Our approach, tested on benchmark instances, strongly outperforms the existing exact methods and it can be generalized to solve other VRP with Intermediate Stops.
The green vehicle routing problem: A systematic literature review
Journal of Cleaner Production, 2021
Recent decades have seen increasing utilization of optimization packages, based on Operations Research 4 and Mathematical Programming techniques, for effective management of the provision of goods and services in distribution systems. Large numbers of real-world applications, both in North America and Europe, have widely shown that the use of computerized procedures for distribution process planning produces substantial savings (generally from 5% to 20%) in global transportation costs. It is easy to see that the impact of these savings on the global economic system is significant. The transportation process involves all stages of production and distribution systems and represents a relevant component (generally 10 from 10% to 20%) of the final cost of goods. The green vehicle routing problem (GVRP) is an emerging research field that attracts many researchers. This survey paper aims to classify and review the literature on GVRPs from various perspectives. This paper covers publications between 2006 and 2019 including 309 13 papers. To this end, a systematic literature review has been implemented in order to respond to corresponding questions related to this area and proposed an extensive structure compromising various aspects including variants of GVRPs, objective functions, uncertainty, and solutions approach to analyze GVRPs studies in different perspectives. Some new research areas have been drawn based on problem classification, uncertainties, solution methodologies, and finally, the objective function approaches for 18 future research directions and the results of this study show that researches on GVRPs are relatively fresh 19 and there is still a room for large improvements in several areas. 20
A Comparison of Homogeneous and Heterogeneous Vehicle Fleet Size in Green Vehicle Routing Problem
Lecture Notes in Computer Science, 2014
To balance a fragmented logistics organization, Small and Medium Enterprises have to find collective solutions to decrease their environmental impact. Especially when the demand at each producer takes the form of small packages and low quantities this paper examines the effect of the introduction of a consolidation center on the environmental issue. Therefore, the Fleet Size and Mix Vehicle Routing Problem (FSMVRP) was adapted in order to minimize CO2 emission. An exact mathematical formulation of the extended problem was developed to investigate the difference between homogeneous and heterogeneous fleet size on the environmental issue. Computational experiments for the problem formulation are performed using CPLEX and give a solution of a small instance to illustrate the problem. A case study focuses on optimal parcel picking up, from many producers to a common depot in the agrifood sector.