Scheduling and Routing of Mobile Charging Stations With Stochastic Travel Times to Service Heterogeneous Spatiotemporal Electric Vehicle Charging Requests With Time Windows

Abstract

This article presents an alternative service of mobile charging stations for the large-scale charging of electric vehicles, which consider the spatiotemporal heterogeneity of charging requests. As charging infrastructure is the key determinant for the large-scale adoption of electric vehicles, state-of-the-art scheduling and control strategies need to be explored. The charging of electric vehicles in a conventional charging station even with the fast dc–dc chargers takes around 30 min, which results in congestion and large waiting queues at public charging stations. To account for this issue, a novel strategy of routing and scheduling mobile charging stations to charge electric vehicles without the constraints of time and space is discussed in detail. Furthermore, the traveling times of mobile charging stations in reality are stochastic in nature. We formulate the optimization problem to minimize the cost of charging and show that the problem formulated is a combination of a bin packing problem and a multicity traveling salesman problem; hence, it is NP-hard and cannot be solved in reasonable CPU time, unless P = NP. We, thus, present modified saving’s heuristic and modified genetic algorithm metaheuristic to solve the optimization problem. Furthermore, numerical simulations show that the proposed scheduling and routing algorithm requires less number of mobile charging stations and can appreciably reduce the cost of charging.