考虑回路因素的电动汽车最短路问题研究

电动汽车保有量迅速增长，但仍存在里程焦虑、充电设施缺乏等问题，导致驾驶员有时必须绕路才能给电动汽车充电. 基于电动汽车在长途出行过程中绕路充电产生的回路现象，对电动汽车最短路径问题进行深入探索. 对路网进行重构，考虑驾驶员在不同充电速度和排队情况下的充电站选择行为，构造寻求电动汽车最短路径的混合整数规划模型，使用成熟的商业规划软件求解. 为提高大型路网下的模型求解速度，基于动态规划的思想提出一种改进的标签设置算法，高效求解路网中存在回路时的电动汽车最短路径问题. 通过算例验证所提模型和算法的合理性及高效性.

Finding Shortest Path for Battery Electric Vehicles Considering Loops

Battery electric vehicles enjoy fast- growing adoption in recent years. However, there are still some problems including limited driving range, insufficient charging infrastructure and long battery charging time that cannot be ignored and result in electric vehicle drivers detouring to recharge. In this situation, there exist loops on the traveling paths between an OD pair. To address this problem, the road network was reconstructed. Then considering the driver's queuing and choice behaviors with different level of charging stations, a mixed integer programming model for finding the shortest path of EV was put forward, which can be solved by mature programming software. In order to improve the solving efficiency under large- scale road network, an improved label-setting algorithm based on dynamic programming was proposed, which can be employed to efficiently solve the shortest path problem of electric vehicles with loops. Finally, a numerical example was illustrated to verify the rationality and effectiveness of the proposed model and algorithm.