检索结果-内蒙古大学图书馆

A dynamic shortest path algorithm using multi-step ahead link travel time prediction

JOURNAL OF ADVANCED TRANSPORTATION 2005年第1期39卷 5-18页

作者： Lee, YA Lee, S Lee, S Chon, J Seoul Natl Univ Grad Sch Environm Studies Seoul South Korea Univ Seoul Dept Transport Engn Seoul South Korea

In this paper, a multi-step ahead prediction algorithm of link travel speeds has been developed using a Kalman filtering technique in order to calculate a dynamic shortest path. The one-step and the multi-step ahead link travel time prediction models for the calculation of the dynamic shortest path have been applied to the directed test network that is composed of 16 nodes: 3 entrance nodes, 2 exit nodes and 11 internal nodes. Time-varying traffic conditions such as flows and travel time data for the test network have been generated using the CORSIM model. The results show that the multi-step ahead algorithm is compared more favorably for searching the dynamic shortest time path than the other algorithm.

关键词： dynamic shortest path algorithm multi-step ahead short-term prediction

来源：评论

学校读者我要写书评

暂无评论

A dynamic shortest path algorithm based on real-time traffic information in the urban public transit network

A dynamic shortest path algorithm based on real-time traffic...

引用

IEEE International Conference on Service Operations and Logistics and Informatics

作者： Zang, Zihui Cai, Wenxue S China Univ Technol Sch Econ & Commerce Guangzhou Guangdong Peoples R China

ISBN: (纸本)9781424420124

In this paper, a new improved dynamic algorithm is proposed to find the optimal path in transit network, which uses the shortest travel time as primary object and least transfer times as second object. And the impacts of the real-time traffic information to the roads' smooth, the passenger' s transfer times and changing price of public transportation line to the travel time are also taken into consideration in the new dynamic algorithm. A simple numerical example is given to show the new algorithm's efficiency.

关键词： dynamic shortest path algorithm real-time traffic information GIS transit network

来源：评论

学校读者我要写书评

暂无评论

A dynamic shortest path algorithm based on real-time traffic information in the urban public transit network

A dynamic shortest path algorithm based on real-time traffic...

引用

2008 IEEE International Conference on Service Operations and Logistics, and Informatics(IEEE/SOLI’2008)(IEEE服务运作、物流与信息年会)

作者： Zihui Zang Wenxue Cai School of Economics and CommerceSouth China University of TechnologyGuangzhou China School of Economics and Commerce South China University of Technology Guangzhou China

In this paper,a new improved dynamic algorithm is proposed to find the optimal path in transit network,which uses the shortest travel time as primary object and least transfer times as second *** the impacts of the real-time traffic information to the roads' smooth,the passenger's transfer times and changing price of public transportation line to the travel time are also taken into consideration in the new dynamic algorithm.A simple numerical example is given to show the new algorithm's efficiency.

关键词： dynamic shortest path algorithm real-time traffic information GIS transit network

来源：评论

学校读者我要写书评

暂无评论

Experimental Study of dynamic Single-Source shortest path algorithm

引用

International Conference on Information Technology for Manufacturing Systems (ITMS 2011)

作者： Xiao Qiancai Li Mingqi Guo Wenqiang Univ Elect Sci & Technol China Sch Math Sci Chengdu 611731 Peoples R China Xinjiang Univ Finance & Econom Sch Comp Sci Engn Urumqi Peoples R China

ISBN: (纸本)9783037851494

In this paper, software met 3.0 is applied to generate topology, which randomly generates dynamic topology nodes. Based on dynamic shortest path algorithms put forward by ***, Xiaobin et al, we analyzed the time efficiency of dynamic and static shortest path algorithms, the different time efficiency inner dynamic shortest path algorithms, and the relationship of time efficiency between topology and dynamic shortest path algorithms. The result shows that Xiaobin algorithm is statistically better than Narvaez algorithm about 20-30 percent. dynamic algorithms are not always better than static algorithms considering the amount of changed topology. dynamic and static algorithms are roughly same when the amount of changed topology holds 10 percent. dynamic algorithms perform better when less than 10 percent, otherwise static algorithms will be better. The time efficiency of dynamic algorithms is related to special topology.

关键词： shortest path algorithm SPT dynamic shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：