A Novel Large Neighborhood Search for Solving Green Vehicle Routing Problem

In this paper the Green Vehicle Routing Problem (GVRP) is introduced and formalized. This problem is an extension of the classical VRP in which vehicles work with electrical. The electric battery of vehicle has a limited capacity and could be recharged at a recharging station. The limited number of recharging stations are provided here. The vehicle must return to the depot within the specified time. In this paper, a Mixed Integer Linear Programming formulation and a Large Neighborhood Search is presented. This algorithm allows to completely explore a large neighborhood within very short computational time. The computational results show the desired performances of the algorithm are proposed.