期刊文献+

基于交通网络数据集的动态路径诱导系统规划与实现探讨 被引量:2

Dynamic Route Guidance System Planning and Realization Based on Traffic Network Data Sets
下载PDF
导出
摘要 智能交通是当前公认的有效解决交通拥堵、能源消耗及交通污染等突出问题的根本途径,而动态的交通诱导系统则是智能交通的核心研究领域之一,并一直被学术界和企业界所关注。当前已有诸多成果,但能广泛应用于实际交通环境的不多,通过着重探讨基于交通网络数据集下的动态路径诱导系统的规划设计与实现方式,有利于交通动态路径诱导系统的开发应用。 Intelligent transportation is currently accepted as the fundamental way to solve the traffic jam,energy consumption and traffic pollution problems effectively.The dynamic traffic intelligent trans-portation system is one of the key research areas in ITS,and has got the concerns of academic and corporate.Currently a great many of fruits,a few of which are applied in practical traffic environm-ent,have been achieved.Given this,the planning and design as well as realization of dynamic route guidance based on traffic network data sets are discussed,which is beneficial to the development and application of traffic dynamic route guidance system.
作者 朱弘戈
出处 《交通标准化》 2011年第7期196-203,共8页 Communications Standardization
关键词 智能交通 动态路径诱导 交通地理信息系统 交通网络数据集 ITS dynamic route guidance traffic geological information system traffic network data set
  • 相关文献

参考文献3

二级参考文献47

  • 1宋春跃,李平.递阶变时域滚动优化生产控制策略[J].浙江大学学报(工学版),2004,38(12):1623-1628. 被引量:4
  • 2赵亦林 谭国真译.车辆定位与导航系统[M].北京:电子工业出版社,1999..
  • 3FU L P. An adaptive routing algorithm for in-vehicle route guidance systems with real-time information[J]. Transportation Research B, 2001, 35(8): 749-765.
  • 4SEN S, PILLAI R, JOSHI S, et al. A mean-variance model for route guidance in advanced traveler information systems[J]. Transportation Science, 2001, 35(1): 37-49.
  • 5ZILIASKOPOULOS A. A Massively parallel time-dependent least-time-path algorithm for intelligent transportation systems applications[J]. Computer-Aided Civil and Infrastructure Engineering, 2001, 16: 337-346.
  • 6WEN Huimin, YANG Zhaosheng. Study on the shortest path algorithm based on fluid neural network of in-vehicle traffic flow guidance system[A]. Proceedings of the IEEE International Conference on Vehicle Electronics[C]. Changchung:IEEE,1999, 1: 110-113.
  • 7HE Guo-guang, MA Shou-feng. AI-based dynamic route guidance strategy and its simulation[A]. Proceedings of IEEE Intelligent Transportation Systems Conference[C]. Oakland: IEEE,2001: 28-32.
  • 8Hounsell N B, MCDONALD M, LAMBERT R A. The integration of SCOOT and dynamic route guidance[A]. Road Traffic Monitoring [C]. Lonton:IEEE, 1992: 168-172.
  • 9MA Shou-feng, HE Guo-guang, WANG Shi-tong. A hierarchical coordination model for control-guidance integrated systems in ITS[A]. Proceedings of IEEE International Conference on Intelligent Transportation Systems[C]. Singapore:IEEE, 2002: 522-527.
  • 10JIA Lei, OZGUNER Umit. Integration of Dynamic routing and intersection control in intelligent transportation system[A]. Proceedings of 2000 IEEE Intelligent Transportation Systems Conference[C]. Dearborn: IEEE, 2000: 137-142.

共引文献75

同被引文献24

  • 1邹亮,徐建闽.空间数据挖掘在基于GIS的交通诱导系统中的应用[J].华南理工大学学报(自然科学版),2004,32(z1):129-132. 被引量:5
  • 2周劲,刘洋,蔺永政.一种基于Web Service的分布式应用系统的设计[J].计算机应用研究,2007,24(2):238-239. 被引量:26
  • 3郑烟武.基于分层分区的动态路径规划算法研究[D].广州:华南理工大学,2011.
  • 4HART P E, NILSSON N J, RAPHAEL B. A formal basis for the heuristic determination of minimum cost paths I J]. IEEE Transactions on System Science and Cybernetics, 1968, 4(2): 100-107.
  • 5LO W, ZWICKER M. Bidirectional search for interactive motion synthesis[ J]. Computer Graphics Forum, 2010, 29(2): 563-573.
  • 6GOLDBERG A V, HARRELSON C. Computing the shortest path: A' meets graph theory[R]. Technical Report MSR- TR-2004-24, Microsoft Research, 2004.
  • 7GOLDBERG A V, HARRELSON C. Computing the shortest path: A" meets graph theory[C]//l6th ACM- SIAM Symposium on Discrete Algorithms. Vancouver: [ s. n. ], 2005 : 156-165.
  • 8GOLDBERG A V, WERNECK R F. Computing point- to-point shortest paths from external memory[C]//// Workshop on Algorithm Engineering and Experiments (ALENEX). Vancouver: [ s. n. ], 2005 : 26-40.
  • 9SCHULZ F, WAGNER D, ZAROLIAGIS C D. Using multi-level graphs for timetable information in railway systems[ C] ////Workshop on Algorithm Engineering and Experiments ( ALENEX ). [ S. 1. ] : Springer BerlinHeidelberg, 2002 : 43-59.
  • 10MULLER K. Design and implementation of an efficient hierarchical speed-up technique for computation of exact shortest paths in graphs[ D]. Karlsruhe : Universit~it Karlsruhe ( TH), 2006.

引证文献2

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部