基于改进行程时间估计模型的最优路径选择  

Optimal Path Selection Based on Improved Travel Time Estimation Model

作　　者：陈诗意 潘义勇[1] 魏双秋 Chen Shiyi;Pan Yiyong;Wei Shuangqiu(College of Automobile and Traffic Engineering,Nanjing Forestry University,Nanjing 210037,China)

机构地区：[1]南京林业大学汽车与交通工程学院,江苏南京210037

出　　处：《华东交通大学学报》2023年第1期60-66,共7页Journal of East China Jiaotong University

基　　金：国家自然科学基金项目(51508280);南京林业大学高学历人才基金项目(GXL2014031)。

摘　　要：为解决交通网络最优路径问题,提出改进的行程时间估计模型,并设计基于该模型的最优路径算法。行程时间估计模型在分段截断二次速度轨迹模型的基础上进行改进,用路段节点的到达速度代替同一出发时刻下测得的速度,通过构造在时间和空间上连续的速度轨迹来估计行程时间。首先,基于Yen′s KSP算法以路段距离为阻抗求解K条最短路径;其次,分别用改进的行程时间估计模型估计K条最短路径的行程时间;最后,以行程时间为成本选择最优的路径。通过Sioux Falls网络的数值试验验证模型和算法的有效性和优越性。试验结果表明:改进的分段截断二次速度轨迹模型相比于原始模型精度平均提高了65%;算法的最优路径结果能减少路径经过的交叉口数和缩短最优路径的总长度,而且最优路径的行程时间估计结果与真实值的MAPE保持在3%内。To solve the optimal path problem of the traffic network,an improved travel time estimation model was proposed,and an optimal path algorithm based on this model was designed.The travel time estimation model was improved on the basis of the segment truncated quadratic velocity trajectory model by replacing the velocity measured at the same departure moment with the arrival velocity of the road segment nodes,and the travel time was estimated by constructing a velocity trajectory that is continuous in time and space.The optimal path algorithm based on travel time estimation firstly solved K shortest paths based on Yen′s KSP algorithm with road section distance as impedance,then estimated the travel time of K shortest paths by the improved travel time estimation model respectively,and finally selected the optimal path with travel time as cost.The validity and superiority of the model and algorithm were verified by numerical experiments of Sioux falls network.The experimental results show that the improved segmented truncated quadratic speed trajectory model improves the accuracy by an average of 65%compared with the original model and the optimal path results based on the proposed algorithm can reduce the number of intersections the path passes through and shorten the total length of the optimal path.Moreover,the estimated results of the optimal path's travel time stay within 3%of the real value of MAPE.The results of this study may provide a theoretical basis for the optimal path method for traffic networks.

关 键 词：智能交通 行程时间 最优路径选择 KSP 

分 类 号：U491.13[交通运输工程—交通运输规划与管理]