Abstract

In recent years, electric vehicle (EV) battery-swapping technology has rapidly evolved and is expected to become widely prevalent shortly. Therefore, it is crucial to develop efficient battery-swapping scheduling algorithms to optimize the operations of battery-swapping systems. This paper proposes a non-cooperative game approach for the battery-swapping scheduling of EVs. To reduce the waiting time for battery swapping and improve the scheduling efficiency of EVs, a swapping process model inspired by the job-shop scheduling problem is proposed, and the cost function of each EV comprehensively considers the travel time, waiting time, and battery swapping price. To capture the competitive relationship among EVs, a non-cooperative game model for battery swapping scheduling is established considering the finite quantities of batteries and swapping grippers. To find the pure strategy Nash equilibrium, an iterative best response algorithm is developed, satisfying constraints including those couple decisions of different EVs. Case studies demonstrate the fairness and scheduling efficiency of the proposed approach.