Battery Swapping Assignment for Electric Vehicles: A Bipartite Matching Approach

Abstract

This paper formulates an optimal station assignment problem for electric vehicle (EV) battery swapping that takes into account both temporal and spatial couplings. The goal is to reduce the total EV cost and station congestion due to temporary shortage in supply of available batteries. We show that the problem is reducible to the minimum weight perfect bipartite matching problem. This leads to an efficient solution based on the Hungarian algorithm. Numerical results suggest that the proposed solution provides a significant improvement over a greedy heuristic that assigns nearest stations to EVs.

Additional details