摘要
为了实现总配送成本最低,车辆行驶距离最短,车辆数目最小等目标,综合考虑电动车耗电情况及充电桩地理分布情况,提出了一种带时间窗和充电站的电动车路径问题。建立电动汽车运输路径优化模型,并使用邻域搜索与禁忌搜索算法来求解该模型。为防止模型求解陷入局部最优,提出了模拟退火算法调整局部最优解,使其达到全局最优。与工业界普遍采用的CPLEX算法相比较,虽准确性略有下降,但求解速度得到了较大提升。
In order to achieve the lowest cost of total distribution, shortest trip distance and least vehicle number, a kind of electric vehicle routing problem with time windows and charging station is put forward, considering the geographical distribution of the electric power consumption and charging piles. An electric vehicle transport path optimization model is established, and the neighborhood search and tabu search algorithm are used to solve the model. To prevent a local optimum of model, innovation in simulated annealing algorithm is proposed to adjust the local optimal solution to the global optimal one. To prove the effectiveness of the algorithm, the results of the algorithm are compared with those of CPLEX, and the results show that the algorithm is more effective and reliable.
作者
孙屹飞
蒋洪伟
张轶兰
SUN Yifei;JIANG Hongwei;ZHANG Yilan(School of Information Management,Beijing Information Science&Technology University,Beijing 100192,China)
出处
《北京信息科技大学学报（自然科学版）》
2019年第1期94-98,共5页
Journal of Beijing Information Science and Technology University
关键词
邻域搜索算法
电动汽车
带时间窗的车辆路径问题
neighborhood search
electric vehicles
routing problem of vehicle with time windows
