Optimizing the charging stations allocation for efficient electric vehicles routing

In this paper, we present a charging station allocation model for electric vehicles. The goal is to assign each electric vehicle to the closest charging station with respect to capacity and charging time constraints. We assume that each vehicle's arrival time is provided by a GPS device and each charging station capacity as well as the required charging time are known in advance. We propose an integer programming model solved with CPLEX to efficiently deal with this combinatorial problem. The objective of Electric Vehicles Charging Stations Allocation (EVCSA) is to minimize the total required time from a start point to a destination going through a Charging Station (CS). To evaluate the performance of the proposed approach, computational experiments are conducted on large scale randomly generated instances simulating a real world scenario.