Solving Charging Scheduling Problem in Electric Vehicles Using Optimization Algorithms

Abstract

This research addresses the problem of scheduling electric vehicle charging times, with the primary objective of minimising total tardiness, defined as the waiting time beyond the specified charging duration. The complexity arises from multiple interacting constraints, making it difficult to produce a feasible schedule that also minimises tardiness. As this problem is NP-hard, this study proposes a metaheuristic approach integrating a cellular processing algorithm with a Greedy Randomised Adaptive Search Procedure (GRASP). This paper provides a detailed implementation and description of the methods, along with a comprehensive calculation of the objective function, addressing areas that require further exploration in the existing literature. Keywords: minimize, total tardiness, electric vehicles, NP-hard, metaheuristic, cellular processing algorithm, GRASP.