首页> 外文会议>2011 International Conference on Electric Information and Control Engineering >Theories and algorithms of time-dependent shortest path in GIS
【24h】

Theories and algorithms of time-dependent shortest path in GIS

机译:GIS中与时间有关的最短路径的理论和算法

获取原文
获取外文期刊封面目录资料

摘要

Time-dependent shortest path problem arise in a variety applications, e.g., traffic navigation, dynamic traffic assignment, network control. Based on the road network, which the travel time of each link dependents on the time interval, we suggest a new time-dependent network model, analyse the mathematics features of first-in-first-out (FIFO) link and conclude FIFO character of the road network, study and prove the theories of shortest time path algorithm in FIFO network systematically. The “forward” and “backward” shortest time path algorithms are designed and realized also in this paper.
机译:在各种应用中出现时间相关的最短路径问题,例如交通导航,动态流量分配,网络控制。基于道路网络,每个链接的旅行时间在时间​​间隔内完成,我们建议一个新的时间依赖网络模型,分析了先进先出(FIFO)链接的数学特征,并结束了FIFO性格道路网络,研究并在系统上系统地证明了FIFO网络的最短时间路径算法理论。在本文中,“向前”和“向后”最短时间路径算法也设计和实现。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号