掉期(金融)
汽车工业
电动汽车
计算机科学
电池(电)
练习场
汽车工程
布谷鸟搜索
电动汽车
航程(航空)
数学优化
工程类
算法
粒子群优化
功率(物理)
物理
财务
量子力学
航空航天工程
数学
经济
标识
DOI:10.1080/0951192x.2018.1493229
摘要
As 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.
科研通智能强力驱动
Strongly Powered by AbleSci AI