首页 | 本学科首页   官方微博 | 高级检索  
     

基于道路和公交超级网络的公交路径查询系统
引用本文:杨忠振,于滨,王琦. 基于道路和公交超级网络的公交路径查询系统[J]. 大连理工大学学报, 2008, 48(2): 225-228
作者姓名:杨忠振  于滨  王琦
作者单位:大连海事大学,交通工程与物流学院,辽宁,大连,116026;大连海事大学,交通工程与物流学院,辽宁,大连,116026;大连理工大学,土木水利学院,辽宁,大连,116024
摘    要:为了实现GIS数据库中道路网和公交线网的无缝连接以及方便快速寻找两点之间的公交路径,开发了基于道路和公交超级网络的公交路径查询系统.该系统通过在GIS数据库中使用虚拟链接代替路由表,将公交系统的信息存储在公交网和虚拟链接的属性中,简化了数据结构.由于该系统采用的拓扑结构具有一致性,常规的最短路径算法可以不需要做调整和改造直接在系统中使用.另外,系统还可以通过对交通阻抗设置不同权重来实现用户对路径的个性化选择.最后通过一个基于MapInfo的实例对该系统进行了检验,结果显示该系统可以提高查询效率.

关 键 词:超级网络  公交网络  优化路径  最短路径算法è
文章编号:1000-8608(2008)02-0225-04
修稿时间:2006-01-15

A best path enquiry system based on road and transit combined network
YANG Zhongzhen YU Bin,WANG Qi. A best path enquiry system based on road and transit combined network[J]. Journal of Dalian University of Technology, 2008, 48(2): 225-228
Authors:YANG Zhongzhen YU Bin  WANG Qi
Abstract:A new GIS-based searching system is developed to seamlessly integrate transit networks into road networks in GIS and calculate the optimal path in the combined network between the origin and the destination. In the system, virtual links instead of connectivity matrix play a vital role in connecting two networks, and all factors that affect the travel plan are stored in the attributes table of the integrated network so that data structure can be simplified. Because of the uniformity of its network topology, the standard shortest path searching algorithm can be embedded and utilized without any modification. In addition, different weights of travel impedance in the system can be set to satisfy the individual choices of travelers. Finally, a case based on MapInfo indicates that the system is able to improve the efficiency of searching.
Keywords:combined network   transit network   optimal path   shortest path searching algorithm
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《大连理工大学学报》浏览原始摘要信息
点击此处可从《大连理工大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号