The Green Vehicle Routing Problem with Capacitated Alternative Fuel Stations (original) (raw)
Related papers
Optimization Letters
The Green Vehicle Routing Problem with Capacitated Alternative Fuel Stations assumes that, at each station, the number of vehicles simultaneously refueling cannot exceed the number of available pumps. The state-of-the-art solution method, based on the generation of all feasible non-dominated paths, performs well only with up to 2 pumps. In fact, it needs cloning the paths between every pair of pumps. To overcome this issue, in this paper, we propose new path-based MILP models without cloning paths, for both the scenario with private stations (i.e., owned by the fleet manager) and that with public stations. Then, a more efficient cutting plane approach is designed for addressing both the scenarios. Numerical results, obtained considering a set of benchmark instances ad hoc generated for this work, show both the efficiency and the effectiveness of this new cutting plane approach proposed. Finally, a sensitivity analysis, carried out by varying the number of customers to be served and ...
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. [
Sustainable vehicle routing: Strategies for congestion management and refueling scheduling
Nowadays there is a huge social and environmental pressure to limit the emissions of greenhouse gases (GHG), especially in transportation sector. In the traditional transportation literature, the objective was to minimize a number of vehicles and traveled distance. However, in new transportation (e.g., sustainable vehicle routing (VRP)), the economic profit is not a primary objective. This paper mainly concerns with introducing vehicle transportation and routing model for alternative fuel vehicles (AFV) (e.g., hybrid, electric and fuel cell vehicles) minimizing the energy and fuel consumption, in which GHG emissions are primary objectives. An alternative fuel station (AFS) infrastructure is analyzed and the limitations of refueling for AFVs are considered in the model. Furthermore, some strategies are carried out and modeled to avoid congestion during traffic peak hours. Two most remarkable Metaheuristic algorithms along with a partial heuristic method and an exact algorithm for solving small-scale problems are proposed. Finally, a sensitivity analysis is presented to obtain the reliable results in a short time period.
A Simulated Annealing Heuristic for the Capacitated Green Vehicle Routing Problem
Mathematical Problems in Engineering, 2019
This research studies the capacitated green vehicle routing problem (CGVRP), which is an extension of the green vehicle routing problem (GVRP), characterized by the purpose of harmonizing environmental and economic costs by implementing effective routes to meet any environmental concerns while fulfilling customer demand. We formulate the mathematical model of the CGVRP and propose a simulated annealing (SA) heuristic for its solution in which the CGVRP is set up as a mixed integer linear program (MILP). The objective of the CGVRP is to minimize the total distance traveled by an alternative fuel vehicle (AFV). This research conducts a numerical experiment and sensitivity analysis. The results of the numerical experiment show that the SA algorithm is capable of obtaining good CGVRP solutions within a reasonable amount of time, and the sensitivity analysis demonstrates that the total distance is dependent on the number of customers and the vehicle driving range.
A Green Vehicle Routing Problem
Transportation Research Part E: Logistics and Transportation Review, 2012
A Green Vehicle Routing Problem (G-VRP) is formulated and solution techniques are developed to aid organizations with alternative fuel-powered vehicle fleets in overcoming difficulties that exist as a result of limited vehicle driving range in conjunction with limited refueling infrastructure. The G-VRP is formulated as a mixed integer linear program. Two construction heuristics, the Modified Clarke and Wright Savings heuristic and the Density-Based Clustering Algorithm, and a customized improvement technique, are developed. Results of numerical experiments show that the heuristics perform well. Moreover, problem feasibility depends on customer and station location configurations. Implications of technology adoption on operations are discussed.
Variable neighborhood search algorithm for the green vehicle routing problem
International Journal of Industrial Engineering Computations, 2018
This article discusses the ecological vehicle routing problem with a stop at a refueling station titled Green-Vehicle Routing Problem. In this problem, the refueling stations and the limit of fuel tank capacity are considered for the construction of a tour. We propose a variable neighborhood search to solve the problem. We tested and compared the performance of our algorithm intensively on datasets existing in the literature.
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.
Solving the green capacitated vehicle routing problem using a tabu search algorithm
This paper analyses how the tabu search can be successfully applied to solve the Green Capacitated Vehicle Routing Problems-GCVRP. This kind of problems has been described as the classical Capacitated VRP with a criterion of environmental emissions minimisation. This criterion is based on the calculation of carbon dioxide emissions from mobile sources, which is highly dependent on several factors such as speed, weather conditions, load and distance. A case study is given to show how green routes can be obtained and to analyze whether those routes also meet the efficiency objectives or not. The results show that a tabu search approach adapts the environmental criterion better than other procedures and also produces routes which are distance effective and environmental-friendly.