Abstract
ABSTRACTAs electric vehicles (EVs) have been more and more widely used recently, in this paper, an electric vehicle handling routing and battery swap station location problem (EV–HR–BSSL) is presented to extend their range of application, which aims to determine the handling routing plan of a fleet of EVs and the location decisions of battery swap stations (BSSs) simultaneously under limited battery driving range. A mathematical problem is developed to illustrate the identified problem, where a fleet of identical EVs are assumed to fulfil the demand of stations for automotive assembly lines based on in-plant milk run handling strategy. Subsequently, several definitions and properties are proposed to solve this model more efficiently. A two-phase dynamic programming method is adopted to obtain the global optimum for small scale problems. For medium and large scale problems, an improved discrete cuckoo search algorithm is developed. The performances are evaluated in simulation and the results indicate that the proposed algorithm is valid and feasible.
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 callMore From: International Journal of Computer Integrated Manufacturing
Disclaimer: 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.
