An adaptive large neighborhood search approach for solving the electric vehicle routing problem

The Electric Vehicle Routing Problem with Time Windows is a new variant of the classical Vehicle Routing Problem with Time Windows where the vehicles are routed to service a set of customers under recharging constraints. In this study, we propose an Adaptive Large Neighborhood Search method to solve this problem. Our initial results show the proposed method is effective in finding good solutions.