最短路径问题
计算机科学
布线(电子设计自动化)
全球定位系统
路径(计算)
方案(数学)
实时计算
利用
计算机网络
数学
计算机安全
电信
理论计算机科学
图形
数学分析
作者
U. Mahir Yildirim,Bülent Çatay
出处
期刊:IEEE Transactions on Intelligent Transportation Systems
[Institute of Electrical and Electronics Engineers]
日期:2020-08-27
卷期号:23 (2): 873-884
被引量:1
标识
DOI:10.1109/tits.2020.3016387
摘要
The time-dependent shortest path and vehicle routing literature depends on realistic and reasonable test data for demonstration and performance evaluation. Despite the advancements in GPS and tracking technologies there is still lack and inaccessibility of publicly available real-world road networks with time-dependent arc costs and speeds. Since most of the time-dependent travel time layer generation models proposed for vehicle routing problems (VRPs) are mainly developed for synthetic networks, they cannot capture some realistic features of the real road networks and cannot be used in time-dependent shortest path problems (TDSPPs). In this paper, we first exploit spatial and temporal behavior of travel times using real life road network and speed data, and discuss the cases where the existing methods in the literature are not applicable. Then, we propose an enhanced method that is best fitted for TDSPP and time-dependent VRP (TDVRP). The proposed method can be implemented on both synthetic and real road networks. Finally, we apply our method to generate realistic speed data on Istanbul road network and demonstrate the applicability in TDSPP and TDVRP.
科研通智能强力驱动
Strongly Powered by AbleSci AI