Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
