Battery Swap Station Location Routing Problem with Capacitated Electric Vehicles and Time Windows

This paper analyzes a location routing problem based on battery swap station in which electric vehicles routing and battery swap station siting decisions are considered simultaneously. We present a newly-designed model based on vehicle steps without dummy node which is normally used in such problems. Five different objective functions including minimize the total traveled distance, the number of vehicles used, the number of battery swap station used, the number of batteries needed and total cost are considered. Results for computational experiments on varying instances are reported, evaluating the performance of the proposed model and analyzing the distinctive elements of the problem.