Large Neighborhood Search for Periodic Electric Vehicle Routing Problem

摘要

In this paper, we address the Periodic Electric Vehicle Routing Problem, named PEVRP. This problem is motivated by a real-life industrial application and it is defined by a planning horizon of several periods typically "days", in which each customer has a set of allowed visit days and must be served once in the time horizon. The whole demand of each customer must be fulfilled all together. A limited fleet of electric vehicles is available at the depot. The EVs could be charged during their trips at the depot and in the available external charging stations. The objective of the PEVRP is to minimize the total cost of routing and charging over the time horizon. We propose a Large Neighborhood Search (LNS) framework for solving the PEVRP. Different implementation schemes of the proposed method including customer and station insertion strategies, three destroy operators and three insertion operators are tested on generalized benchmark instances. The computational results show that LNS produces competitive results compared to results obtained in previous studies. An analysis of the performance of the proposed operators is also presented.