Optimal Station Placement and Assignment for Electric Vehicle Battery Swapping

Considering the long charging time and limitation of available charging stations in the traditional battery recharging facilities, the construction of battery swapping station (BSS) has become a new paradigm to satisfy the energy demand timely and sufficiently. Previous solutions lack a joint consideration of battery swapping station establishment and request assignment with the long distance subsidy. In this paper, we study the Station Placement and Assignment (SPA) problem to minimize the overall operation cost. Unfortunately, it shows great difficulty due to the infinite candidate locations and the complex coupling relation for request assignments. To address these challenges, we first devise the bundle generation strategy to reduce the infinite candidate location to finite, then propose an efficient algorithm based on the greedy strategy to assign the battery swapping requests. Extensive evaluations are carried out to show the outstanding performance of our proposed algorithms.