The Periodic Green Vehicle Routing Problem with Considering of Time-Dependent Urban Traffic and Time Windows (original) (raw)
Related papers
Green Vehicle Routing Problem with Time-Varying Tra ffic Congestion
Operations Research and Computing: Algorithms and Software for Analytics, 2015
We present a linear mixed integer programming model for the time-dependent heterogeneous green vehicle routing and scheduling problem (GVRSP) with the objective of minimizing total carbon dioxide emissions and weighted tardiness. Instead of discrete time intervals, the proposed model takes the traveled distances of arcs in different time periods as decision variables to determine the travel schedules of vehicles. We propose an exact dynamic programming method to calculate the optimal discrete departure/arriving time for the GVRSP. The dynamic programming method significantly reduces the computational complexity of the GVRSP when applying existing heuristic algorithms to solve large-sized problems. A genetic algorithm with dynamic programming (GA-DP) is developed to solve the formulated problem. Computational experiments are carried out to study the efficiency of the proposed hybrid solution approach with promising results.
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...
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.
2021
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.
Applied Soft Computing, 2015
We present a green vehicle routing and scheduling problem (GVRSP) considering general time-dependent traffic conditions with the primary objective of minimizing CO 2 emissions and weighted tardiness. A new mathematical formulation is proposed to describe the GVRSP with hierarchical objectives and weighted tardiness. The proposed formulation is an alternative formulation of the GVRSP in the way that a vehicle is allowed to travel an arc in multiple time periods. The schedule of a vehicle is determined based on the actual distance that the vehicle travels each arc in each time period instead of the time point when the vehicle departs from each node. Thereby, more general time dependent traffic patterns can be considered in the model. The proposed formulation is studied using various objectives functions, such as minimizing the total CO 2 emissions, the total travel distance, and the total travel time. Computational results show that up to 50% reduction in CO 2 emissions can be achieved with average reductions of 12% and 28% compared to distance-oriented solutions and travel-time-oriented solutions, respectively. In addition, a simulated annealing (SA) algorithm is introduced to solve large-sized problem instances. To reduce the search space, the SA algorithm searches only for vehicle routes and rough schedules, and a straightforward heuristic procedure is used to determine near-optimal detailed schedules for a given set of routes. The performance of the SA algorithm is tested on large-sized problems with up to 100 nodes and 10 time periods.
The Relationship between Vehicle Routing & Scheduling and Green Logistics-A Literature Survey
2007
The basic Vehicle Routing and Scheduling Problem (VRSP) is described followed by an outline of solution approaches. Different variations of the basic VRSP are examined that involve the consideration of additional constraints or other changes in the structure of the appropriate model. An introduction is provided to Green Logistics issues that are relevant to vehicle routing and scheduling including discussion of the environmental objectives that should be considered. Particular consideration is given to VRSP models that relate to environmental issues including the timedependent VRSP, the transportation of hazardous materials and dynamic VRSP models. Finally some conclusions are drawn about further research needs in this area and the relation to road pricing.
This paper is focused on the growing need of integrating environmentally sound choices into supply-chain management. The concept of green economic practices driven by the environmental sustainability challenges posed the concept of green logistics, to evolve in the last few decades.To establish the field further, the purpose of this paper is twofold. First, it offers anextensive systematic review of literature on GL with a critical review of the studies that have been considered in the paper.Second, it offers a conceptual analytical model where the canonical capacitated vehicle routing problem is extended to add the measures of Carbon Dioxide (CO 2) emissions. The proposed, multi objective optimization model tackles the conflicting objectives of CO 2 emission reduction and cost minimization. The developed generic model integrates the traffic information in providing the user with opportunity to have more realistic solution. The model also enables strategic decision making to improve the GL operations while allowing greatercompetitive advantage.
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.
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.
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. [