ABSTRACT
In this paper, we address an Electric Vehicle Routing Problem, in which customers may have simultaneous pickup and delivery requests. The Electric Vehicles (EVs) are transported from the main distribution center, serve all requests in challenging timelines, and return to the depot. The objective of this paper is to find optimal routes, such that first, the number of EVs used, and second, the total working time, including travel time, charging time, waiting time, and service time, of all EVs is minimized. We formulate the problem as a Mixed Integer Linear Program (MILP), which can be solved directly by CPLEX. Furthermore, we develop an Adaptive Large Neighborhood Search (ALNS) heuristic method and show its efficacy over the direct solution of MILP. According to our computational investigation on bigger problems, the ALNS heuristic method provides optimal solutions within a few seconds of CPU time.
