期刊文献+

基于动态中介中心性的城市道路网实时分层方法 被引量:9

Time-dependent Road Network Hierarchy Based on Dynamic Betweenness Centrality
原文传递
导出
摘要 城市道路网中各路段的出行效率直接决定了公众实时出行过程中对道路的选择差异。本文提出一种动态道路网分层方法,通过引入城市道路实时交通状态信息,结合图论中的中介中心性评价方法,得到与时间相关的城市路网动态中介中心性层级结构。该方法考虑了不同时间段城市交通状态的差异,实现了城市路网层次的动态合理划分,在一定程度上缓解了由于数据空间范围限制引起的路网层级静态划分方法的局限性。本文所提出的方法可作为城市路网动态分层的有效方法,为多用户并发环境下的实时出行路径搜索提供更合理的数据基础,同时也可应用于更多的城市路网研究中。 Efficiency and reasonability of path querying are the key aspects for public travel information services.Although the well-known hierarchical spatial reasoning based on road class has been accepted as an efficient heuristic approach for solving the shortest path problem,in practice,it is difficult to get reasonable results without considering the influence of real-time traffic situation.City road network is strongly characteristic of time-dependence,which determines the selection of roads to a great extent in public travel.In this paper,we proposed an approach to real-timely building the hierarchy of city road networks,based on the dynamic betweenness centrality(BC) and path searching algorithms considering real-time traffic information.The city road network is modeled with the time-dependent dynamic BC hierarchical structure,and the real-time optimum path finding is conducted under the natively formed hierarchical network dataset.The presented approach considers ever-changing traffic situation,coordinates the time-dependent division of road network hierarchy and calculation efficiency under multi-user environment,and to some extent mitigates the boundary effect caused by the spatial limit under the static hierarchical structure of road network.It is argued that the presented approach provides an effective way to generate hierarchy of city road network in dynamic traffic environment,and forms a reasonable dataset basis for real-time optimum path searching under multi-user environment.We should note that our focus is the dynamic hierarchy approach,not the algorithm.Meanwhile,the approach is not only used for hierarchical spatial reasoning algorithm.It is available in any research related to the traffic information of city network,such as city hotspot research,city network structure analysis and so on.
出处 《地球信息科学学报》 CSCD 北大核心 2012年第3期292-298,共7页 Journal of Geo-information Science
基金 国家"863"计划项目(2012AA12A211) 国家自然科学基金项目(41101149) 资源与环境信息系统国家重点实验室自主创新基金(O8R8B630KA)
关键词 中介中心性 道路网络 动态分层 betweenness centrality road network dynamic hierarchy
  • 相关文献

参考文献5

二级参考文献42

  • 1翁妙凤,潘峻.面向对象的自主车越野路径规划的设计和实现[J].计算机研究与发展,1996,33(7):533-540. 被引量:6
  • 2张国强,张国清.基于回溯机制的互联网AS拓扑的Betweenness算法[J].计算机研究与发展,2006,43(10):1790-1796. 被引量:7
  • 3李清泉,徐敬海,郑年波,曾喆.基于功能的导航数据模型[J].武汉大学学报(信息科学版),2007,32(3):266-270. 被引量:15
  • 4李清泉,郑年波,徐敬海,宋莺.一种基于道路网络层次拓扑结构的分层路径规划算法[J].中国图象图形学报,2007,12(7):1280-1285. 被引量:24
  • 5Freeman L C. Set of Measures of Centrality Based on Betweenness[J]. Sociometry, 1977, 40(1): 35- 41.
  • 6Tomko M, Winter S, Claramunt C. Experiential Hierarchies of Streets[J]. Computers Environment and Urban Systems, 2008, 32(1): 41-52.
  • 7Jiang B, Claramunt C. A Structural Approach to the Model Generalization of an Urban Street Network[C]. The 6th Joint Meeting of the Lawson- Wilkins- Pediat ric-Endocrine-Societ y/European-Society-for Pediatri c-Endocrinology, Montreal, Canada, 2001.
  • 8Jiang B, Claramunt C. Topological Analysis of Urban Street Networks[J]. Environment and Planning B-Planning & Design, 2004, 31(1): 151-162.
  • 9Crueitti P, Latora V, Porta S. Centrality Measures in Spatial Networks of Urban Streets[J]. Physical Review E, 2006, 73(3):361-366.
  • 10Crucitti P, Eatora V, Porta S. Centrality in Networks of Urban Streets[J]. Chaos, 2006, 16(1): 15 113-15 122.

共引文献127

同被引文献262

引证文献9

二级引证文献58

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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