An Improved Tabu Search Algorithm for the Green Vehicle Routing Problem

This paper addresses the Green Vehicle Routing Problem (GVRP) which is a variant of the VRP that uses alternative fuel vehicles (AFVs) to perform routes. Since AFVs have limited fuel tank capacity, refueling among the routes at alternative fuel stations (AFSs) is considered. To solve the problem, we propose an improved version of the tabu search metaheuristic. The proposed algorithm relies on two main components: a local search component and a perturbation component. Computational results show that our approach is highly effective in terms of solution quality and CPU time.