Maximizing the Number of Satisfied Charging Demands in Electric Vehicle Charging Scheduling Problem.

This paper addresses the electric vehicle charging problem in a charging station with a limited overall power capacity and a fixed number of chargers. Electric vehicle drivers submit their charging demands. Given the limited resources, these charging demands are either accepted or rejected, and an accepted demand must be satisfied. The objective of the scheduler is to maximize the number of satisfied demands. We prove that the problem is NP-hard. Then, we propose a linear programming model, heuristic, and a metaheuristic combining a simulated annealing algorithm with an iterated local search procedure to solve it. We provide computational results to show the efficiency of the proposed methods.